Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r528-tall-171683761200506.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is ShieldPPPs-PT-050B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r528-tall-171683761200506
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 4.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 2.8K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 18K May 19 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:32 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 19:11 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Apr 13 11:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 13 11:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 13 11:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 13 11:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 888K 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 ShieldPPPs-PT-050B-CTLFireability-2024-00
FORMULA_NAME ShieldPPPs-PT-050B-CTLFireability-2024-01
FORMULA_NAME ShieldPPPs-PT-050B-CTLFireability-2024-02
FORMULA_NAME ShieldPPPs-PT-050B-CTLFireability-2024-03
FORMULA_NAME ShieldPPPs-PT-050B-CTLFireability-2024-04
FORMULA_NAME ShieldPPPs-PT-050B-CTLFireability-2024-05
FORMULA_NAME ShieldPPPs-PT-050B-CTLFireability-2024-06
FORMULA_NAME ShieldPPPs-PT-050B-CTLFireability-2024-07
FORMULA_NAME ShieldPPPs-PT-050B-CTLFireability-2024-08
FORMULA_NAME ShieldPPPs-PT-050B-CTLFireability-2024-09
FORMULA_NAME ShieldPPPs-PT-050B-CTLFireability-2024-10
FORMULA_NAME ShieldPPPs-PT-050B-CTLFireability-2024-11
FORMULA_NAME ShieldPPPs-PT-050B-CTLFireability-2023-12
FORMULA_NAME ShieldPPPs-PT-050B-CTLFireability-2023-13
FORMULA_NAME ShieldPPPs-PT-050B-CTLFireability-2023-14
FORMULA_NAME ShieldPPPs-PT-050B-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717251021193

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-050B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:10:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 14:10:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:10:22] [INFO ] Load time of PNML (sax parser for PT used): 209 ms
[2024-06-01 14:10:22] [INFO ] Transformed 3403 places.
[2024-06-01 14:10:22] [INFO ] Transformed 3153 transitions.
[2024-06-01 14:10:22] [INFO ] Found NUPN structural information;
[2024-06-01 14:10:22] [INFO ] Parsed PT model containing 3403 places and 3153 transitions and 8706 arcs in 460 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 15 ms.
Support contains 210 out of 3403 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 3403/3403 places, 3153/3153 transitions.
Discarding 321 places :
Symmetric choice reduction at 0 with 321 rule applications. Total rules 321 place count 3082 transition count 2832
Iterating global reduction 0 with 321 rules applied. Total rules applied 642 place count 3082 transition count 2832
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 643 place count 3081 transition count 2831
Iterating global reduction 0 with 1 rules applied. Total rules applied 644 place count 3081 transition count 2831
Applied a total of 644 rules in 913 ms. Remains 3081 /3403 variables (removed 322) and now considering 2831/3153 (removed 322) transitions.
// Phase 1: matrix 2831 rows 3081 cols
[2024-06-01 14:10:24] [INFO ] Computed 551 invariants in 93 ms
[2024-06-01 14:10:25] [INFO ] Implicit Places using invariants in 1784 ms returned []
[2024-06-01 14:10:25] [INFO ] Invariant cache hit.
[2024-06-01 14:10:28] [INFO ] Implicit Places using invariants and state equation in 2897 ms returned []
Implicit Place search using SMT with State Equation took 4714 ms to find 0 implicit places.
Running 2830 sub problems to find dead transitions.
[2024-06-01 14:10:28] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 3080/5912 variables, and 0 constraints, problems are : Problem set: 0 solved, 2830 unsolved in 30081 ms.
Refiners :[Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/3081 constraints, PredecessorRefiner: 2830/2830 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2830 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3080/5912 variables, and 0 constraints, problems are : Problem set: 0 solved, 2830 unsolved in 30048 ms.
Refiners :[Positive P Invariants (semi-flows): 0/551 constraints, State Equation: 0/3081 constraints, PredecessorRefiner: 0/2830 constraints, Known Traps: 0/0 constraints]
After SMT, in 61123ms problems are : Problem set: 0 solved, 2830 unsolved
Search for dead transitions found 0 dead transitions in 61173ms
Starting structural reductions in LTL mode, iteration 1 : 3081/3403 places, 2831/3153 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 66839 ms. Remains : 3081/3403 places, 2831/3153 transitions.
Support contains 210 out of 3081 places after structural reductions.
[2024-06-01 14:11:30] [INFO ] Flatten gal took : 200 ms
[2024-06-01 14:11:30] [INFO ] Flatten gal took : 128 ms
[2024-06-01 14:11:30] [INFO ] Input system was already deterministic with 2831 transitions.
Support contains 201 out of 3081 places (down from 210) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 3104 ms. (12 steps per ms) remains 44/116 properties
BEST_FIRST walk for 4003 steps (8 resets) in 33 ms. (117 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 10 ms. (363 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4002 steps (8 resets) in 10 ms. (363 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 9 ms. (400 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 44/44 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 44/44 properties
[2024-06-01 14:11:31] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 1239/1324 variables, 213/213 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1324 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 1757/3081 variables, 338/551 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3081 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 2831/5912 variables, 3081/3632 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 5912/5912 variables, and 3632 constraints, problems are : Problem set: 0 solved, 44 unsolved in 5020 ms.
Refiners :[Positive P Invariants (semi-flows): 551/551 constraints, State Equation: 3081/3081 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (OVERLAPS) 1239/1324 variables, 213/213 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-06-01 14:11:37] [INFO ] Deduced a trap composed of 54 places in 221 ms of which 33 ms to minimize.
[2024-06-01 14:11:37] [INFO ] Deduced a trap composed of 58 places in 239 ms of which 6 ms to minimize.
[2024-06-01 14:11:38] [INFO ] Deduced a trap composed of 54 places in 178 ms of which 4 ms to minimize.
[2024-06-01 14:11:38] [INFO ] Deduced a trap composed of 58 places in 166 ms of which 4 ms to minimize.
[2024-06-01 14:11:38] [INFO ] Deduced a trap composed of 68 places in 161 ms of which 4 ms to minimize.
[2024-06-01 14:11:38] [INFO ] Deduced a trap composed of 57 places in 153 ms of which 3 ms to minimize.
[2024-06-01 14:11:38] [INFO ] Deduced a trap composed of 64 places in 141 ms of which 4 ms to minimize.
[2024-06-01 14:11:38] [INFO ] Deduced a trap composed of 68 places in 137 ms of which 4 ms to minimize.
[2024-06-01 14:11:39] [INFO ] Deduced a trap composed of 64 places in 133 ms of which 3 ms to minimize.
[2024-06-01 14:11:39] [INFO ] Deduced a trap composed of 66 places in 126 ms of which 3 ms to minimize.
[2024-06-01 14:11:39] [INFO ] Deduced a trap composed of 61 places in 135 ms of which 2 ms to minimize.
[2024-06-01 14:11:39] [INFO ] Deduced a trap composed of 63 places in 126 ms of which 3 ms to minimize.
[2024-06-01 14:11:39] [INFO ] Deduced a trap composed of 63 places in 124 ms of which 3 ms to minimize.
[2024-06-01 14:11:39] [INFO ] Deduced a trap composed of 64 places in 125 ms of which 3 ms to minimize.
[2024-06-01 14:11:39] [INFO ] Deduced a trap composed of 65 places in 127 ms of which 2 ms to minimize.
[2024-06-01 14:11:41] [INFO ] Deduced a trap composed of 59 places in 122 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/1324 variables, 16/229 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1324/5912 variables, and 229 constraints, problems are : Problem set: 0 solved, 44 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 213/551 constraints, State Equation: 0/3081 constraints, PredecessorRefiner: 0/44 constraints, Known Traps: 16/16 constraints]
After SMT, in 10076ms problems are : Problem set: 0 solved, 44 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 85 out of 3081 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3081/3081 places, 2831/2831 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 333 transitions
Trivial Post-agglo rules discarded 333 transitions
Performed 333 trivial Post agglomeration. Transition count delta: 333
Iterating post reduction 0 with 333 rules applied. Total rules applied 333 place count 3081 transition count 2498
Reduce places removed 333 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 338 rules applied. Total rules applied 671 place count 2748 transition count 2493
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 676 place count 2743 transition count 2493
Performed 243 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 243 Pre rules applied. Total rules applied 676 place count 2743 transition count 2250
Deduced a syphon composed of 243 places in 5 ms
Reduce places removed 243 places and 0 transitions.
Iterating global reduction 3 with 486 rules applied. Total rules applied 1162 place count 2500 transition count 2250
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 1177 place count 2485 transition count 2235
Iterating global reduction 3 with 15 rules applied. Total rules applied 1192 place count 2485 transition count 2235
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 1192 place count 2485 transition count 2228
Deduced a syphon composed of 7 places in 6 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 1206 place count 2478 transition count 2228
Performed 860 Post agglomeration using F-continuation condition.Transition count delta: 860
Deduced a syphon composed of 860 places in 6 ms
Reduce places removed 860 places and 0 transitions.
Iterating global reduction 3 with 1720 rules applied. Total rules applied 2926 place count 1618 transition count 1368
Partial Free-agglomeration rule applied 420 times.
Drop transitions (Partial Free agglomeration) removed 420 transitions
Iterating global reduction 3 with 420 rules applied. Total rules applied 3346 place count 1618 transition count 1368
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 3347 place count 1617 transition count 1367
Applied a total of 3347 rules in 1023 ms. Remains 1617 /3081 variables (removed 1464) and now considering 1367/2831 (removed 1464) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1023 ms. Remains : 1617/3081 places, 1367/2831 transitions.
RANDOM walk for 40000 steps (8 resets) in 1047 ms. (38 steps per ms) remains 14/44 properties
BEST_FIRST walk for 40004 steps (8 resets) in 240 ms. (165 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 274 ms. (145 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 222 ms. (179 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 243 ms. (163 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 220 ms. (181 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 239 ms. (166 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 254 ms. (156 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 14/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 14/14 properties
// Phase 1: matrix 1367 rows 1617 cols
[2024-06-01 14:11:44] [INFO ] Computed 551 invariants in 51 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 178/208 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 1149/1357 variables, 395/453 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 14:11:44] [INFO ] Deduced a trap composed of 5 places in 93 ms of which 2 ms to minimize.
[2024-06-01 14:11:45] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 1 ms to minimize.
[2024-06-01 14:11:45] [INFO ] Deduced a trap composed of 9 places in 84 ms of which 2 ms to minimize.
[2024-06-01 14:11:45] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 2 ms to minimize.
[2024-06-01 14:11:45] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 2 ms to minimize.
[2024-06-01 14:11:45] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 2 ms to minimize.
[2024-06-01 14:11:45] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:11:45] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 2 ms to minimize.
[2024-06-01 14:11:45] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 1 ms to minimize.
[2024-06-01 14:11:45] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 2 ms to minimize.
[2024-06-01 14:11:45] [INFO ] Deduced a trap composed of 8 places in 70 ms of which 2 ms to minimize.
[2024-06-01 14:11:45] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:11:46] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
[2024-06-01 14:11:46] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:11:46] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 2 ms to minimize.
[2024-06-01 14:11:46] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:11:46] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:11:46] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 2 ms to minimize.
[2024-06-01 14:11:46] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1357 variables, 19/472 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1357 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 39/1396 variables, 20/492 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 14:11:47] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1396 variables, 1/493 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1396 variables, 0/493 constraints. Problems are: Problem set: 0 solved, 14 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1200/2596 variables, 1396/1889 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2596 variables, 0/1889 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 73/2669 variables, 41/1930 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2669 variables, 12/1942 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2669 variables, 1/1943 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2669 variables, 0/1943 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 15 (OVERLAPS) 109/2778 variables, 45/1988 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2778 variables, 8/1996 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2778 variables, 0/1996 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 18 (OVERLAPS) 6/2784 variables, 6/2002 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2784 variables, 6/2008 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2784 variables, 0/2008 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 21 (OVERLAPS) 10/2794 variables, 5/2013 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2794 variables, 8/2021 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2794 variables, 0/2021 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 24 (OVERLAPS) 6/2800 variables, 3/2024 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2800 variables, 4/2028 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2800 variables, 0/2028 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 27 (OVERLAPS) 2/2802 variables, 2/2030 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2802 variables, 2/2032 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2802 variables, 0/2032 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 30 (OVERLAPS) 102/2904 variables, 62/2094 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2904 variables, 17/2111 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/2904 variables, 3/2114 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2904 variables, 0/2114 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 34 (OVERLAPS) 58/2962 variables, 34/2148 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2962 variables, 8/2156 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2962 variables, 0/2156 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 37 (OVERLAPS) 2/2964 variables, 4/2160 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2964 variables, 2/2162 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/2964 variables, 0/2162 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 40 (OVERLAPS) 2/2966 variables, 1/2163 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/2966 variables, 2/2165 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/2966 variables, 0/2165 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 43 (OVERLAPS) 1/2967 variables, 1/2166 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/2967 variables, 1/2167 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/2967 variables, 0/2167 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 46 (OVERLAPS) 17/2984 variables, 14/2181 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/2984 variables, 7/2188 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/2984 variables, 0/2188 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 49 (OVERLAPS) 0/2984 variables, 0/2188 constraints. Problems are: Problem set: 0 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2984/2984 variables, and 2188 constraints, problems are : Problem set: 0 solved, 14 unsolved in 12310 ms.
Refiners :[Positive P Invariants (semi-flows): 523/523 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 1617/1617 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 20/20 constraints]
Escalating to Integer solving :Problem set: 0 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/30 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 178/208 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/208 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 1149/1357 variables, 395/453 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1357 variables, 19/472 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 14:11:56] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 2 ms to minimize.
[2024-06-01 14:11:57] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 1 ms to minimize.
[2024-06-01 14:11:57] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2024-06-01 14:11:57] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 2 ms to minimize.
[2024-06-01 14:11:57] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 2 ms to minimize.
[2024-06-01 14:11:57] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:11:57] [INFO ] Deduced a trap composed of 6 places in 70 ms of which 3 ms to minimize.
[2024-06-01 14:11:57] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 2 ms to minimize.
[2024-06-01 14:11:57] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:11:57] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 1 ms to minimize.
[2024-06-01 14:11:57] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1357 variables, 11/483 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1357 variables, 0/483 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 7 (OVERLAPS) 39/1396 variables, 20/503 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1396 variables, 1/504 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 14:11:58] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1396 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1396 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 11 (OVERLAPS) 1200/2596 variables, 1396/1901 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2596 variables, 13/1914 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 14:12:00] [INFO ] Deduced a trap composed of 8 places in 172 ms of which 4 ms to minimize.
[2024-06-01 14:12:00] [INFO ] Deduced a trap composed of 8 places in 173 ms of which 4 ms to minimize.
[2024-06-01 14:12:00] [INFO ] Deduced a trap composed of 8 places in 166 ms of which 3 ms to minimize.
[2024-06-01 14:12:00] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 3 ms to minimize.
[2024-06-01 14:12:01] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 3 ms to minimize.
[2024-06-01 14:12:01] [INFO ] Deduced a trap composed of 6 places in 191 ms of which 4 ms to minimize.
[2024-06-01 14:12:01] [INFO ] Deduced a trap composed of 8 places in 183 ms of which 3 ms to minimize.
[2024-06-01 14:12:01] [INFO ] Deduced a trap composed of 7 places in 213 ms of which 3 ms to minimize.
[2024-06-01 14:12:02] [INFO ] Deduced a trap composed of 7 places in 194 ms of which 4 ms to minimize.
[2024-06-01 14:12:02] [INFO ] Deduced a trap composed of 6 places in 192 ms of which 3 ms to minimize.
[2024-06-01 14:12:02] [INFO ] Deduced a trap composed of 8 places in 181 ms of which 3 ms to minimize.
[2024-06-01 14:12:02] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 3 ms to minimize.
[2024-06-01 14:12:02] [INFO ] Deduced a trap composed of 8 places in 176 ms of which 3 ms to minimize.
[2024-06-01 14:12:03] [INFO ] Deduced a trap composed of 7 places in 179 ms of which 4 ms to minimize.
[2024-06-01 14:12:03] [INFO ] Deduced a trap composed of 5 places in 179 ms of which 3 ms to minimize.
[2024-06-01 14:12:03] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 5 ms to minimize.
[2024-06-01 14:12:03] [INFO ] Deduced a trap composed of 7 places in 178 ms of which 3 ms to minimize.
[2024-06-01 14:12:04] [INFO ] Deduced a trap composed of 7 places in 174 ms of which 4 ms to minimize.
[2024-06-01 14:12:04] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 3 ms to minimize.
[2024-06-01 14:12:04] [INFO ] Deduced a trap composed of 9 places in 182 ms of which 3 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2596 variables, 20/1934 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 14:12:05] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 3 ms to minimize.
[2024-06-01 14:12:05] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 2 ms to minimize.
[2024-06-01 14:12:05] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 2 ms to minimize.
[2024-06-01 14:12:06] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 2 ms to minimize.
[2024-06-01 14:12:06] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 2 ms to minimize.
[2024-06-01 14:12:06] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 2 ms to minimize.
[2024-06-01 14:12:06] [INFO ] Deduced a trap composed of 9 places in 105 ms of which 2 ms to minimize.
[2024-06-01 14:12:06] [INFO ] Deduced a trap composed of 10 places in 119 ms of which 2 ms to minimize.
[2024-06-01 14:12:06] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 2 ms to minimize.
[2024-06-01 14:12:07] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 2 ms to minimize.
[2024-06-01 14:12:07] [INFO ] Deduced a trap composed of 9 places in 110 ms of which 2 ms to minimize.
[2024-06-01 14:12:07] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 3 ms to minimize.
[2024-06-01 14:12:07] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 2 ms to minimize.
[2024-06-01 14:12:07] [INFO ] Deduced a trap composed of 12 places in 107 ms of which 2 ms to minimize.
[2024-06-01 14:12:07] [INFO ] Deduced a trap composed of 10 places in 111 ms of which 2 ms to minimize.
[2024-06-01 14:12:08] [INFO ] Deduced a trap composed of 9 places in 108 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2596 variables, 16/1950 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 14:12:09] [INFO ] Deduced a trap composed of 8 places in 109 ms of which 2 ms to minimize.
[2024-06-01 14:12:09] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/2596 variables, 2/1952 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2596 variables, 0/1952 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 17 (OVERLAPS) 73/2669 variables, 41/1993 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2669 variables, 12/2005 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2669 variables, 1/2006 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2669 variables, 1/2007 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 14:12:12] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 2 ms to minimize.
[2024-06-01 14:12:12] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 2 ms to minimize.
[2024-06-01 14:12:13] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 2 ms to minimize.
[2024-06-01 14:12:13] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:12:13] [INFO ] Deduced a trap composed of 13 places in 64 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/2669 variables, 5/2012 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 14:12:14] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 1 ms to minimize.
[2024-06-01 14:12:15] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2024-06-01 14:12:15] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 2 ms to minimize.
[2024-06-01 14:12:15] [INFO ] Deduced a trap composed of 5 places in 76 ms of which 2 ms to minimize.
[2024-06-01 14:12:16] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/2669 variables, 5/2017 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 14:12:17] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/2669 variables, 1/2018 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 14:12:19] [INFO ] Deduced a trap composed of 7 places in 74 ms of which 1 ms to minimize.
[2024-06-01 14:12:19] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2024-06-01 14:12:19] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 2 ms to minimize.
[2024-06-01 14:12:19] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/2669 variables, 4/2022 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2669 variables, 0/2022 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 26 (OVERLAPS) 109/2778 variables, 45/2067 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2778 variables, 8/2075 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 14:12:21] [INFO ] Deduced a trap composed of 5 places in 85 ms of which 1 ms to minimize.
[2024-06-01 14:12:22] [INFO ] Deduced a trap composed of 14 places in 84 ms of which 2 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/2778 variables, 2/2077 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 14:12:23] [INFO ] Deduced a trap composed of 8 places in 79 ms of which 2 ms to minimize.
At refinement iteration 29 (INCLUDED_ONLY) 0/2778 variables, 1/2078 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 14:12:25] [INFO ] Deduced a trap composed of 11 places in 88 ms of which 2 ms to minimize.
At refinement iteration 30 (INCLUDED_ONLY) 0/2778 variables, 1/2079 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2778 variables, 0/2079 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 32 (OVERLAPS) 6/2784 variables, 6/2085 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2784 variables, 6/2091 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2784 variables, 0/2091 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 35 (OVERLAPS) 10/2794 variables, 5/2096 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2794 variables, 8/2104 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2794 variables, 0/2104 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 38 (OVERLAPS) 6/2800 variables, 3/2107 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/2800 variables, 4/2111 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2800 variables, 0/2111 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 41 (OVERLAPS) 2/2802 variables, 2/2113 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/2802 variables, 2/2115 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 14:12:33] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
At refinement iteration 43 (INCLUDED_ONLY) 0/2802 variables, 1/2116 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 14:12:34] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 1 ms to minimize.
At refinement iteration 44 (INCLUDED_ONLY) 0/2802 variables, 1/2117 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/2802 variables, 0/2117 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 46 (OVERLAPS) 102/2904 variables, 62/2179 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/2904 variables, 17/2196 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/2904 variables, 3/2199 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 14:12:38] [INFO ] Deduced a trap composed of 4 places in 83 ms of which 1 ms to minimize.
[2024-06-01 14:12:39] [INFO ] Deduced a trap composed of 5 places in 79 ms of which 1 ms to minimize.
At refinement iteration 49 (INCLUDED_ONLY) 0/2904 variables, 2/2201 constraints. Problems are: Problem set: 0 solved, 14 unsolved
[2024-06-01 14:12:40] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 2 ms to minimize.
[2024-06-01 14:12:40] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 1 ms to minimize.
At refinement iteration 50 (INCLUDED_ONLY) 0/2904 variables, 2/2203 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2904/2984 variables, and 2203 constraints, problems are : Problem set: 0 solved, 14 unsolved in 45012 ms.
Refiners :[Positive P Invariants (semi-flows): 503/523 constraints, Generalized P Invariants (flows): 27/28 constraints, State Equation: 1564/1617 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 95/95 constraints]
After SMT, in 57388ms problems are : Problem set: 0 solved, 14 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 30 out of 1617 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1617/1617 places, 1367/1367 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 1617 transition count 1364
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 1614 transition count 1364
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 6 place count 1614 transition count 1355
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 24 place count 1605 transition count 1355
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 2 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 74 place count 1580 transition count 1330
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 10 times.
Drop transitions (Partial Free agglomeration) removed 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 84 place count 1580 transition count 1330
Applied a total of 84 rules in 197 ms. Remains 1580 /1617 variables (removed 37) and now considering 1330/1367 (removed 37) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 197 ms. Remains : 1580/1617 places, 1330/1367 transitions.
RANDOM walk for 40000 steps (8 resets) in 972 ms. (41 steps per ms) remains 9/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 373 ms. (106 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 313 ms. (127 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 290 ms. (137 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 228 ms. (174 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 227 ms. (175 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 219 ms. (181 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 218 ms. (182 steps per ms) remains 9/9 properties
// Phase 1: matrix 1330 rows 1580 cols
[2024-06-01 14:12:42] [INFO ] Computed 551 invariants in 37 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 146/168 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1127/1295 variables, 393/441 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 14:12:43] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 2 ms to minimize.
[2024-06-01 14:12:43] [INFO ] Deduced a trap composed of 8 places in 88 ms of which 2 ms to minimize.
[2024-06-01 14:12:43] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 2 ms to minimize.
[2024-06-01 14:12:43] [INFO ] Deduced a trap composed of 10 places in 85 ms of which 1 ms to minimize.
[2024-06-01 14:12:43] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 1 ms to minimize.
[2024-06-01 14:12:43] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 1 ms to minimize.
[2024-06-01 14:12:43] [INFO ] Deduced a trap composed of 11 places in 84 ms of which 2 ms to minimize.
[2024-06-01 14:12:44] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 2 ms to minimize.
[2024-06-01 14:12:44] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 1 ms to minimize.
[2024-06-01 14:12:44] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 2 ms to minimize.
[2024-06-01 14:12:44] [INFO ] Deduced a trap composed of 13 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:12:44] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 2 ms to minimize.
[2024-06-01 14:12:44] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 2 ms to minimize.
[2024-06-01 14:12:44] [INFO ] Deduced a trap composed of 7 places in 67 ms of which 1 ms to minimize.
[2024-06-01 14:12:44] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 2 ms to minimize.
[2024-06-01 14:12:44] [INFO ] Deduced a trap composed of 10 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:12:44] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:12:44] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 1 ms to minimize.
[2024-06-01 14:12:45] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:12:45] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/1295 variables, 20/461 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1295 variables, 0/461 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 64/1359 variables, 32/493 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 14:12:45] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 1 ms to minimize.
[2024-06-01 14:12:45] [INFO ] Deduced a trap composed of 8 places in 72 ms of which 2 ms to minimize.
[2024-06-01 14:12:45] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 2 ms to minimize.
[2024-06-01 14:12:45] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 1 ms to minimize.
[2024-06-01 14:12:45] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 2 ms to minimize.
[2024-06-01 14:12:46] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:12:46] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/1359 variables, 7/500 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1359 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 1163/2522 variables, 1359/1859 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 14:12:47] [INFO ] Deduced a trap composed of 6 places in 239 ms of which 4 ms to minimize.
[2024-06-01 14:12:47] [INFO ] Deduced a trap composed of 5 places in 218 ms of which 4 ms to minimize.
[2024-06-01 14:12:47] [INFO ] Deduced a trap composed of 8 places in 214 ms of which 3 ms to minimize.
[2024-06-01 14:12:48] [INFO ] Deduced a trap composed of 7 places in 212 ms of which 4 ms to minimize.
[2024-06-01 14:12:48] [INFO ] Deduced a trap composed of 8 places in 221 ms of which 4 ms to minimize.
[2024-06-01 14:12:48] [INFO ] Deduced a trap composed of 8 places in 225 ms of which 5 ms to minimize.
[2024-06-01 14:12:48] [INFO ] Deduced a trap composed of 10 places in 227 ms of which 4 ms to minimize.
[2024-06-01 14:12:49] [INFO ] Deduced a trap composed of 6 places in 226 ms of which 4 ms to minimize.
[2024-06-01 14:12:49] [INFO ] Deduced a trap composed of 6 places in 213 ms of which 4 ms to minimize.
[2024-06-01 14:12:49] [INFO ] Deduced a trap composed of 7 places in 210 ms of which 3 ms to minimize.
[2024-06-01 14:12:49] [INFO ] Deduced a trap composed of 10 places in 198 ms of which 4 ms to minimize.
[2024-06-01 14:12:50] [INFO ] Deduced a trap composed of 8 places in 193 ms of which 4 ms to minimize.
[2024-06-01 14:12:50] [INFO ] Deduced a trap composed of 8 places in 209 ms of which 4 ms to minimize.
[2024-06-01 14:12:50] [INFO ] Deduced a trap composed of 8 places in 184 ms of which 3 ms to minimize.
[2024-06-01 14:12:50] [INFO ] Deduced a trap composed of 7 places in 178 ms of which 4 ms to minimize.
[2024-06-01 14:12:51] [INFO ] Deduced a trap composed of 8 places in 180 ms of which 3 ms to minimize.
[2024-06-01 14:12:51] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 3 ms to minimize.
[2024-06-01 14:12:51] [INFO ] Deduced a trap composed of 9 places in 178 ms of which 3 ms to minimize.
[2024-06-01 14:12:51] [INFO ] Deduced a trap composed of 7 places in 175 ms of which 3 ms to minimize.
[2024-06-01 14:12:51] [INFO ] Deduced a trap composed of 10 places in 181 ms of which 3 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2522 variables, 20/1879 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 14:12:52] [INFO ] Deduced a trap composed of 10 places in 199 ms of which 4 ms to minimize.
[2024-06-01 14:12:52] [INFO ] Deduced a trap composed of 5 places in 203 ms of which 3 ms to minimize.
[2024-06-01 14:12:52] [INFO ] Deduced a trap composed of 7 places in 194 ms of which 3 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/2522 variables, 3/1882 constraints. Problems are: Problem set: 0 solved, 9 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/2522 variables, 0/1882 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (OVERLAPS) 73/2595 variables, 41/1923 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2595 variables, 11/1934 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2595 variables, 2/1936 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2595 variables, 0/1936 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (OVERLAPS) 109/2704 variables, 45/1981 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2704 variables, 8/1989 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2704 variables, 0/1989 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 7/2711 variables, 7/1996 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2711 variables, 7/2003 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2711 variables, 0/2003 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (OVERLAPS) 12/2723 variables, 6/2009 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2723 variables, 10/2019 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2723 variables, 0/2019 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (OVERLAPS) 4/2727 variables, 2/2021 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2727 variables, 2/2023 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2727 variables, 0/2023 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 29 (OVERLAPS) 1/2728 variables, 1/2024 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2728 variables, 1/2025 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2728 variables, 0/2025 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 32 (OVERLAPS) 102/2830 variables, 62/2087 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2830 variables, 17/2104 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/2830 variables, 3/2107 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2830 variables, 0/2107 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 36 (OVERLAPS) 58/2888 variables, 34/2141 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/2888 variables, 8/2149 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2888 variables, 0/2149 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 39 (OVERLAPS) 2/2890 variables, 4/2153 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2890 variables, 2/2155 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/2890 variables, 0/2155 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 42 (OVERLAPS) 2/2892 variables, 1/2156 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/2892 variables, 2/2158 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 44 (INCLUDED_ONLY) 0/2892 variables, 0/2158 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 45 (OVERLAPS) 1/2893 variables, 1/2159 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/2893 variables, 1/2160 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 47 (INCLUDED_ONLY) 0/2893 variables, 0/2160 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 48 (OVERLAPS) 17/2910 variables, 14/2174 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 49 (INCLUDED_ONLY) 0/2910 variables, 7/2181 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/2910 variables, 0/2181 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 51 (OVERLAPS) 0/2910 variables, 0/2181 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2910/2910 variables, and 2181 constraints, problems are : Problem set: 0 solved, 9 unsolved in 14646 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 1580/1580 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 50/50 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 146/168 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/168 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1127/1295 variables, 393/441 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1295 variables, 40/481 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 14:12:57] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 2 ms to minimize.
[2024-06-01 14:12:57] [INFO ] Deduced a trap composed of 7 places in 77 ms of which 2 ms to minimize.
[2024-06-01 14:12:58] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 2 ms to minimize.
[2024-06-01 14:12:58] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 2 ms to minimize.
[2024-06-01 14:12:58] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 2 ms to minimize.
[2024-06-01 14:12:58] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2024-06-01 14:12:58] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 2 ms to minimize.
[2024-06-01 14:12:58] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 2 ms to minimize.
[2024-06-01 14:12:58] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:12:58] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 1 ms to minimize.
[2024-06-01 14:12:58] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-06-01 14:12:58] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:12:58] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
[2024-06-01 14:12:59] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2024-06-01 14:12:59] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/1295 variables, 15/496 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1295 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 64/1359 variables, 32/528 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1359 variables, 10/538 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 14:12:59] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 2 ms to minimize.
[2024-06-01 14:12:59] [INFO ] Deduced a trap composed of 6 places in 81 ms of which 1 ms to minimize.
[2024-06-01 14:12:59] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:12:59] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:12:59] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/1359 variables, 5/543 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1359 variables, 0/543 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 1163/2522 variables, 1359/1902 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2522 variables, 8/1910 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 14:13:01] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 2 ms to minimize.
[2024-06-01 14:13:01] [INFO ] Deduced a trap composed of 7 places in 102 ms of which 2 ms to minimize.
[2024-06-01 14:13:01] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 2 ms to minimize.
[2024-06-01 14:13:02] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 2 ms to minimize.
[2024-06-01 14:13:02] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 2 ms to minimize.
[2024-06-01 14:13:02] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 2 ms to minimize.
[2024-06-01 14:13:02] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 2 ms to minimize.
[2024-06-01 14:13:02] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 2 ms to minimize.
[2024-06-01 14:13:02] [INFO ] Deduced a trap composed of 7 places in 89 ms of which 2 ms to minimize.
[2024-06-01 14:13:02] [INFO ] Deduced a trap composed of 9 places in 82 ms of which 2 ms to minimize.
[2024-06-01 14:13:03] [INFO ] Deduced a trap composed of 8 places in 101 ms of which 2 ms to minimize.
[2024-06-01 14:13:03] [INFO ] Deduced a trap composed of 7 places in 91 ms of which 1 ms to minimize.
[2024-06-01 14:13:03] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 2 ms to minimize.
[2024-06-01 14:13:03] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 1 ms to minimize.
[2024-06-01 14:13:03] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 1 ms to minimize.
[2024-06-01 14:13:03] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 1 ms to minimize.
[2024-06-01 14:13:03] [INFO ] Deduced a trap composed of 8 places in 89 ms of which 2 ms to minimize.
[2024-06-01 14:13:04] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2024-06-01 14:13:04] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 1 ms to minimize.
[2024-06-01 14:13:04] [INFO ] Deduced a trap composed of 18 places in 85 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/2522 variables, 20/1930 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 14:13:05] [INFO ] Deduced a trap composed of 7 places in 97 ms of which 2 ms to minimize.
[2024-06-01 14:13:05] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 2 ms to minimize.
[2024-06-01 14:13:05] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 1 ms to minimize.
[2024-06-01 14:13:05] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2522 variables, 4/1934 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 14:13:06] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 1 ms to minimize.
[2024-06-01 14:13:06] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/2522 variables, 2/1936 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 14:13:07] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
[2024-06-01 14:13:07] [INFO ] Deduced a trap composed of 6 places in 95 ms of which 2 ms to minimize.
[2024-06-01 14:13:07] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 2 ms to minimize.
[2024-06-01 14:13:07] [INFO ] Deduced a trap composed of 8 places in 86 ms of which 2 ms to minimize.
[2024-06-01 14:13:07] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/2522 variables, 5/1941 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2522 variables, 0/1941 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 73/2595 variables, 41/1982 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2595 variables, 11/1993 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2595 variables, 2/1995 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2595 variables, 1/1996 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 14:13:10] [INFO ] Deduced a trap composed of 6 places in 82 ms of which 1 ms to minimize.
[2024-06-01 14:13:10] [INFO ] Deduced a trap composed of 5 places in 84 ms of which 2 ms to minimize.
[2024-06-01 14:13:10] [INFO ] Deduced a trap composed of 6 places in 76 ms of which 1 ms to minimize.
[2024-06-01 14:13:10] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 2 ms to minimize.
[2024-06-01 14:13:11] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 1 ms to minimize.
[2024-06-01 14:13:11] [INFO ] Deduced a trap composed of 7 places in 78 ms of which 1 ms to minimize.
[2024-06-01 14:13:11] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 1 ms to minimize.
[2024-06-01 14:13:11] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 2 ms to minimize.
[2024-06-01 14:13:11] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
[2024-06-01 14:13:12] [INFO ] Deduced a trap composed of 7 places in 64 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/2595 variables, 10/2006 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 14:13:12] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/2595 variables, 1/2007 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 14:13:15] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 1 ms to minimize.
[2024-06-01 14:13:15] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:13:15] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 1 ms to minimize.
[2024-06-01 14:13:15] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/2595 variables, 4/2011 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2595 variables, 0/2011 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 26 (OVERLAPS) 109/2704 variables, 45/2056 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/2704 variables, 8/2064 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 14:13:16] [INFO ] Deduced a trap composed of 4 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:13:17] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 1 ms to minimize.
[2024-06-01 14:13:17] [INFO ] Deduced a trap composed of 5 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:13:17] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
At refinement iteration 28 (INCLUDED_ONLY) 0/2704 variables, 4/2068 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/2704 variables, 0/2068 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 30 (OVERLAPS) 7/2711 variables, 7/2075 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/2711 variables, 7/2082 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 14:13:18] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 2 ms to minimize.
At refinement iteration 32 (INCLUDED_ONLY) 0/2711 variables, 1/2083 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/2711 variables, 0/2083 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 34 (OVERLAPS) 12/2723 variables, 6/2089 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/2723 variables, 10/2099 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/2723 variables, 0/2099 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 37 (OVERLAPS) 4/2727 variables, 2/2101 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/2727 variables, 2/2103 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 14:13:21] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 2 ms to minimize.
At refinement iteration 39 (INCLUDED_ONLY) 0/2727 variables, 1/2104 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/2727 variables, 0/2104 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 41 (OVERLAPS) 1/2728 variables, 1/2105 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/2728 variables, 1/2106 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 43 (INCLUDED_ONLY) 0/2728 variables, 0/2106 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 44 (OVERLAPS) 102/2830 variables, 62/2168 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 45 (INCLUDED_ONLY) 0/2830 variables, 17/2185 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 46 (INCLUDED_ONLY) 0/2830 variables, 3/2188 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 14:13:23] [INFO ] Deduced a trap composed of 5 places in 70 ms of which 1 ms to minimize.
[2024-06-01 14:13:23] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2024-06-01 14:13:23] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 2 ms to minimize.
[2024-06-01 14:13:23] [INFO ] Deduced a trap composed of 11 places in 68 ms of which 1 ms to minimize.
[2024-06-01 14:13:23] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
At refinement iteration 47 (INCLUDED_ONLY) 0/2830 variables, 5/2193 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 48 (INCLUDED_ONLY) 0/2830 variables, 0/2193 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 49 (OVERLAPS) 58/2888 variables, 34/2227 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 50 (INCLUDED_ONLY) 0/2888 variables, 8/2235 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 14:13:25] [INFO ] Deduced a trap composed of 8 places in 82 ms of which 1 ms to minimize.
[2024-06-01 14:13:25] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 2 ms to minimize.
[2024-06-01 14:13:25] [INFO ] Deduced a trap composed of 4 places in 77 ms of which 1 ms to minimize.
[2024-06-01 14:13:25] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 2 ms to minimize.
[2024-06-01 14:13:25] [INFO ] Deduced a trap composed of 4 places in 82 ms of which 2 ms to minimize.
[2024-06-01 14:13:25] [INFO ] Deduced a trap composed of 6 places in 78 ms of which 1 ms to minimize.
[2024-06-01 14:13:26] [INFO ] Deduced a trap composed of 6 places in 83 ms of which 2 ms to minimize.
[2024-06-01 14:13:26] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 1 ms to minimize.
[2024-06-01 14:13:26] [INFO ] Deduced a trap composed of 9 places in 79 ms of which 2 ms to minimize.
[2024-06-01 14:13:26] [INFO ] Deduced a trap composed of 4 places in 84 ms of which 1 ms to minimize.
At refinement iteration 51 (INCLUDED_ONLY) 0/2888 variables, 10/2245 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 14:13:27] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 2 ms to minimize.
At refinement iteration 52 (INCLUDED_ONLY) 0/2888 variables, 1/2246 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 14:13:28] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 2 ms to minimize.
[2024-06-01 14:13:28] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
At refinement iteration 53 (INCLUDED_ONLY) 0/2888 variables, 2/2248 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 14:13:29] [INFO ] Deduced a trap composed of 6 places in 87 ms of which 1 ms to minimize.
[2024-06-01 14:13:29] [INFO ] Deduced a trap composed of 8 places in 78 ms of which 1 ms to minimize.
At refinement iteration 54 (INCLUDED_ONLY) 0/2888 variables, 2/2250 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 55 (INCLUDED_ONLY) 0/2888 variables, 0/2250 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 56 (OVERLAPS) 2/2890 variables, 4/2254 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 57 (INCLUDED_ONLY) 0/2890 variables, 2/2256 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 14:13:30] [INFO ] Deduced a trap composed of 12 places in 70 ms of which 2 ms to minimize.
At refinement iteration 58 (INCLUDED_ONLY) 0/2890 variables, 1/2257 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 14:13:31] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 1 ms to minimize.
[2024-06-01 14:13:31] [INFO ] Deduced a trap composed of 4 places in 76 ms of which 2 ms to minimize.
[2024-06-01 14:13:31] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 2 ms to minimize.
At refinement iteration 59 (INCLUDED_ONLY) 0/2890 variables, 3/2260 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 60 (INCLUDED_ONLY) 0/2890 variables, 0/2260 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 61 (OVERLAPS) 2/2892 variables, 1/2261 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 62 (INCLUDED_ONLY) 0/2892 variables, 2/2263 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 63 (INCLUDED_ONLY) 0/2892 variables, 0/2263 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 64 (OVERLAPS) 1/2893 variables, 1/2264 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 65 (INCLUDED_ONLY) 0/2893 variables, 1/2265 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 14:13:34] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 2 ms to minimize.
[2024-06-01 14:13:34] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 1 ms to minimize.
At refinement iteration 66 (INCLUDED_ONLY) 0/2893 variables, 2/2267 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 67 (INCLUDED_ONLY) 0/2893 variables, 0/2267 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 68 (OVERLAPS) 17/2910 variables, 14/2281 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 69 (INCLUDED_ONLY) 0/2910 variables, 7/2288 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 70 (INCLUDED_ONLY) 0/2910 variables, 0/2288 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 71 (OVERLAPS) 0/2910 variables, 0/2288 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2910/2910 variables, and 2288 constraints, problems are : Problem set: 0 solved, 9 unsolved in 39507 ms.
Refiners :[Positive P Invariants (semi-flows): 511/511 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 1580/1580 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 148/148 constraints]
After SMT, in 54211ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 5 different solutions.
Parikh walk visited 6 properties in 18948 ms.
Support contains 11 out of 1580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1580/1580 places, 1330/1330 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 1580 transition count 1329
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 1579 transition count 1329
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 1579 transition count 1327
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 1577 transition count 1327
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 2 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 34 place count 1563 transition count 1313
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 38 place count 1563 transition count 1313
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 1562 transition count 1312
Applied a total of 39 rules in 224 ms. Remains 1562 /1580 variables (removed 18) and now considering 1312/1330 (removed 18) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 224 ms. Remains : 1562/1580 places, 1312/1330 transitions.
[2024-06-01 14:13:56] [INFO ] Flatten gal took : 81 ms
[2024-06-01 14:13:56] [INFO ] Flatten gal took : 83 ms
[2024-06-01 14:13:56] [INFO ] Input system was already deterministic with 2831 transitions.
Computed a total of 617 stabilizing places and 617 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 3081/3081 places, 2831/2831 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 3054 transition count 2804
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 3054 transition count 2804
Applied a total of 54 rules in 334 ms. Remains 3054 /3081 variables (removed 27) and now considering 2804/2831 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 335 ms. Remains : 3054/3081 places, 2804/2831 transitions.
[2024-06-01 14:13:57] [INFO ] Flatten gal took : 70 ms
[2024-06-01 14:13:57] [INFO ] Flatten gal took : 68 ms
[2024-06-01 14:13:57] [INFO ] Input system was already deterministic with 2804 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3081/3081 places, 2831/2831 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 3053 transition count 2803
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 3053 transition count 2803
Applied a total of 56 rules in 338 ms. Remains 3053 /3081 variables (removed 28) and now considering 2803/2831 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 338 ms. Remains : 3053/3081 places, 2803/2831 transitions.
[2024-06-01 14:13:57] [INFO ] Flatten gal took : 63 ms
[2024-06-01 14:13:57] [INFO ] Flatten gal took : 66 ms
[2024-06-01 14:13:57] [INFO ] Input system was already deterministic with 2803 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3081/3081 places, 2831/2831 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 3056 transition count 2806
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 3056 transition count 2806
Applied a total of 50 rules in 321 ms. Remains 3056 /3081 variables (removed 25) and now considering 2806/2831 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 321 ms. Remains : 3056/3081 places, 2806/2831 transitions.
[2024-06-01 14:13:58] [INFO ] Flatten gal took : 62 ms
[2024-06-01 14:13:58] [INFO ] Flatten gal took : 65 ms
[2024-06-01 14:13:58] [INFO ] Input system was already deterministic with 2806 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3081/3081 places, 2831/2831 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 3052 transition count 2802
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 3052 transition count 2802
Applied a total of 58 rules in 373 ms. Remains 3052 /3081 variables (removed 29) and now considering 2802/2831 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 373 ms. Remains : 3052/3081 places, 2802/2831 transitions.
[2024-06-01 14:13:58] [INFO ] Flatten gal took : 61 ms
[2024-06-01 14:13:58] [INFO ] Flatten gal took : 68 ms
[2024-06-01 14:13:59] [INFO ] Input system was already deterministic with 2802 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3081/3081 places, 2831/2831 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 3054 transition count 2804
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 3054 transition count 2804
Applied a total of 54 rules in 343 ms. Remains 3054 /3081 variables (removed 27) and now considering 2804/2831 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 343 ms. Remains : 3054/3081 places, 2804/2831 transitions.
[2024-06-01 14:13:59] [INFO ] Flatten gal took : 56 ms
[2024-06-01 14:13:59] [INFO ] Flatten gal took : 60 ms
[2024-06-01 14:13:59] [INFO ] Input system was already deterministic with 2804 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3081/3081 places, 2831/2831 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 3052 transition count 2802
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 3052 transition count 2802
Applied a total of 58 rules in 352 ms. Remains 3052 /3081 variables (removed 29) and now considering 2802/2831 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 352 ms. Remains : 3052/3081 places, 2802/2831 transitions.
[2024-06-01 14:14:00] [INFO ] Flatten gal took : 54 ms
[2024-06-01 14:14:00] [INFO ] Flatten gal took : 57 ms
[2024-06-01 14:14:00] [INFO ] Input system was already deterministic with 2802 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3081/3081 places, 2831/2831 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 3057 transition count 2807
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 3057 transition count 2807
Applied a total of 48 rules in 321 ms. Remains 3057 /3081 variables (removed 24) and now considering 2807/2831 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 322 ms. Remains : 3057/3081 places, 2807/2831 transitions.
[2024-06-01 14:14:00] [INFO ] Flatten gal took : 53 ms
[2024-06-01 14:14:00] [INFO ] Flatten gal took : 56 ms
[2024-06-01 14:14:00] [INFO ] Input system was already deterministic with 2807 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3081/3081 places, 2831/2831 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 3080 transition count 2480
Reduce places removed 350 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 351 rules applied. Total rules applied 701 place count 2730 transition count 2479
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 702 place count 2729 transition count 2479
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 250 Pre rules applied. Total rules applied 702 place count 2729 transition count 2229
Deduced a syphon composed of 250 places in 7 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 3 with 500 rules applied. Total rules applied 1202 place count 2479 transition count 2229
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 1231 place count 2450 transition count 2200
Iterating global reduction 3 with 29 rules applied. Total rules applied 1260 place count 2450 transition count 2200
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 1260 place count 2450 transition count 2188
Deduced a syphon composed of 12 places in 4 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 1284 place count 2438 transition count 2188
Performed 882 Post agglomeration using F-continuation condition.Transition count delta: 882
Deduced a syphon composed of 882 places in 2 ms
Reduce places removed 882 places and 0 transitions.
Iterating global reduction 3 with 1764 rules applied. Total rules applied 3048 place count 1556 transition count 1306
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 3050 place count 1554 transition count 1304
Applied a total of 3050 rules in 555 ms. Remains 1554 /3081 variables (removed 1527) and now considering 1304/2831 (removed 1527) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 555 ms. Remains : 1554/3081 places, 1304/2831 transitions.
[2024-06-01 14:14:01] [INFO ] Flatten gal took : 31 ms
[2024-06-01 14:14:01] [INFO ] Flatten gal took : 33 ms
[2024-06-01 14:14:01] [INFO ] Input system was already deterministic with 1304 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3081/3081 places, 2831/2831 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 3054 transition count 2804
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 3054 transition count 2804
Applied a total of 54 rules in 342 ms. Remains 3054 /3081 variables (removed 27) and now considering 2804/2831 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 342 ms. Remains : 3054/3081 places, 2804/2831 transitions.
[2024-06-01 14:14:01] [INFO ] Flatten gal took : 52 ms
[2024-06-01 14:14:02] [INFO ] Flatten gal took : 56 ms
[2024-06-01 14:14:02] [INFO ] Input system was already deterministic with 2804 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3081/3081 places, 2831/2831 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 3053 transition count 2803
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 3053 transition count 2803
Applied a total of 56 rules in 345 ms. Remains 3053 /3081 variables (removed 28) and now considering 2803/2831 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 345 ms. Remains : 3053/3081 places, 2803/2831 transitions.
[2024-06-01 14:14:02] [INFO ] Flatten gal took : 51 ms
[2024-06-01 14:14:02] [INFO ] Flatten gal took : 55 ms
[2024-06-01 14:14:02] [INFO ] Input system was already deterministic with 2803 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3081/3081 places, 2831/2831 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 3055 transition count 2805
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 3055 transition count 2805
Applied a total of 52 rules in 355 ms. Remains 3055 /3081 variables (removed 26) and now considering 2805/2831 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 355 ms. Remains : 3055/3081 places, 2805/2831 transitions.
[2024-06-01 14:14:03] [INFO ] Flatten gal took : 51 ms
[2024-06-01 14:14:03] [INFO ] Flatten gal took : 54 ms
[2024-06-01 14:14:03] [INFO ] Input system was already deterministic with 2805 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3081/3081 places, 2831/2831 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 3052 transition count 2802
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 3052 transition count 2802
Applied a total of 58 rules in 386 ms. Remains 3052 /3081 variables (removed 29) and now considering 2802/2831 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 386 ms. Remains : 3052/3081 places, 2802/2831 transitions.
[2024-06-01 14:14:03] [INFO ] Flatten gal took : 54 ms
[2024-06-01 14:14:03] [INFO ] Flatten gal took : 58 ms
[2024-06-01 14:14:03] [INFO ] Input system was already deterministic with 2802 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3081/3081 places, 2831/2831 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 3080 transition count 2480
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 2730 transition count 2480
Performed 251 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 251 Pre rules applied. Total rules applied 700 place count 2730 transition count 2229
Deduced a syphon composed of 251 places in 4 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 2 with 502 rules applied. Total rules applied 1202 place count 2479 transition count 2229
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 1228 place count 2453 transition count 2203
Iterating global reduction 2 with 26 rules applied. Total rules applied 1254 place count 2453 transition count 2203
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 1254 place count 2453 transition count 2193
Deduced a syphon composed of 10 places in 5 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 1274 place count 2443 transition count 2193
Performed 877 Post agglomeration using F-continuation condition.Transition count delta: 877
Deduced a syphon composed of 877 places in 2 ms
Reduce places removed 877 places and 0 transitions.
Iterating global reduction 2 with 1754 rules applied. Total rules applied 3028 place count 1566 transition count 1316
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3030 place count 1564 transition count 1314
Applied a total of 3030 rules in 438 ms. Remains 1564 /3081 variables (removed 1517) and now considering 1314/2831 (removed 1517) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 438 ms. Remains : 1564/3081 places, 1314/2831 transitions.
[2024-06-01 14:14:04] [INFO ] Flatten gal took : 54 ms
[2024-06-01 14:14:04] [INFO ] Flatten gal took : 43 ms
[2024-06-01 14:14:04] [INFO ] Input system was already deterministic with 1314 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3081/3081 places, 2831/2831 transitions.
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 28 place count 3053 transition count 2803
Iterating global reduction 0 with 28 rules applied. Total rules applied 56 place count 3053 transition count 2803
Applied a total of 56 rules in 325 ms. Remains 3053 /3081 variables (removed 28) and now considering 2803/2831 (removed 28) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 325 ms. Remains : 3053/3081 places, 2803/2831 transitions.
[2024-06-01 14:14:04] [INFO ] Flatten gal took : 51 ms
[2024-06-01 14:14:04] [INFO ] Flatten gal took : 54 ms
[2024-06-01 14:14:05] [INFO ] Input system was already deterministic with 2803 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 3081/3081 places, 2831/2831 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 351 transitions
Trivial Post-agglo rules discarded 351 transitions
Performed 351 trivial Post agglomeration. Transition count delta: 351
Iterating post reduction 0 with 351 rules applied. Total rules applied 351 place count 3080 transition count 2479
Reduce places removed 351 places and 0 transitions.
Iterating post reduction 1 with 351 rules applied. Total rules applied 702 place count 2729 transition count 2479
Performed 250 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 250 Pre rules applied. Total rules applied 702 place count 2729 transition count 2229
Deduced a syphon composed of 250 places in 5 ms
Reduce places removed 250 places and 0 transitions.
Iterating global reduction 2 with 500 rules applied. Total rules applied 1202 place count 2479 transition count 2229
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 1231 place count 2450 transition count 2200
Iterating global reduction 2 with 29 rules applied. Total rules applied 1260 place count 2450 transition count 2200
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 1260 place count 2450 transition count 2188
Deduced a syphon composed of 12 places in 5 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 1284 place count 2438 transition count 2188
Performed 884 Post agglomeration using F-continuation condition.Transition count delta: 884
Deduced a syphon composed of 884 places in 1 ms
Reduce places removed 884 places and 0 transitions.
Iterating global reduction 2 with 1768 rules applied. Total rules applied 3052 place count 1554 transition count 1304
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 3054 place count 1552 transition count 1302
Applied a total of 3054 rules in 480 ms. Remains 1552 /3081 variables (removed 1529) and now considering 1302/2831 (removed 1529) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 480 ms. Remains : 1552/3081 places, 1302/2831 transitions.
[2024-06-01 14:14:05] [INFO ] Flatten gal took : 29 ms
[2024-06-01 14:14:05] [INFO ] Flatten gal took : 32 ms
[2024-06-01 14:14:05] [INFO ] Input system was already deterministic with 1302 transitions.
Starting structural reductions in LTL mode, iteration 0 : 3081/3081 places, 2831/2831 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 3057 transition count 2807
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 3057 transition count 2807
Applied a total of 48 rules in 317 ms. Remains 3057 /3081 variables (removed 24) and now considering 2807/2831 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 318 ms. Remains : 3057/3081 places, 2807/2831 transitions.
[2024-06-01 14:14:06] [INFO ] Flatten gal took : 50 ms
[2024-06-01 14:14:06] [INFO ] Flatten gal took : 54 ms
[2024-06-01 14:14:06] [INFO ] Input system was already deterministic with 2807 transitions.
[2024-06-01 14:14:06] [INFO ] Flatten gal took : 55 ms
[2024-06-01 14:14:06] [INFO ] Flatten gal took : 57 ms
[2024-06-01 14:14:06] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-06-01 14:14:06] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 3081 places, 2831 transitions and 8062 arcs took 14 ms.
Total runtime 224112 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 : ShieldPPPs-PT-050B-CTLFireability-2024-00
Could not compute solution for formula : ShieldPPPs-PT-050B-CTLFireability-2024-01
Could not compute solution for formula : ShieldPPPs-PT-050B-CTLFireability-2024-02
Could not compute solution for formula : ShieldPPPs-PT-050B-CTLFireability-2024-03
Could not compute solution for formula : ShieldPPPs-PT-050B-CTLFireability-2024-04
Could not compute solution for formula : ShieldPPPs-PT-050B-CTLFireability-2024-05
Could not compute solution for formula : ShieldPPPs-PT-050B-CTLFireability-2024-06
Could not compute solution for formula : ShieldPPPs-PT-050B-CTLFireability-2024-07
Could not compute solution for formula : ShieldPPPs-PT-050B-CTLFireability-2024-08
Could not compute solution for formula : ShieldPPPs-PT-050B-CTLFireability-2024-09
Could not compute solution for formula : ShieldPPPs-PT-050B-CTLFireability-2024-10
Could not compute solution for formula : ShieldPPPs-PT-050B-CTLFireability-2024-11
Could not compute solution for formula : ShieldPPPs-PT-050B-CTLFireability-2023-12
Could not compute solution for formula : ShieldPPPs-PT-050B-CTLFireability-2023-13
Could not compute solution for formula : ShieldPPPs-PT-050B-CTLFireability-2023-14
Could not compute solution for formula : ShieldPPPs-PT-050B-CTLFireability-2023-15

BK_STOP 1717251246785

--------------------
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 ShieldPPPs-PT-050B-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/1331/ctl_0_
ctl formula name ShieldPPPs-PT-050B-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/1331/ctl_1_
ctl formula name ShieldPPPs-PT-050B-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/1331/ctl_2_
ctl formula name ShieldPPPs-PT-050B-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/1331/ctl_3_
ctl formula name ShieldPPPs-PT-050B-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/1331/ctl_4_
ctl formula name ShieldPPPs-PT-050B-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/1331/ctl_5_
ctl formula name ShieldPPPs-PT-050B-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/1331/ctl_6_
ctl formula name ShieldPPPs-PT-050B-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/1331/ctl_7_
ctl formula name ShieldPPPs-PT-050B-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/1331/ctl_8_
ctl formula name ShieldPPPs-PT-050B-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/1331/ctl_9_
ctl formula name ShieldPPPs-PT-050B-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/1331/ctl_10_
ctl formula name ShieldPPPs-PT-050B-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/1331/ctl_11_
ctl formula name ShieldPPPs-PT-050B-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/1331/ctl_12_
ctl formula name ShieldPPPs-PT-050B-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/1331/ctl_13_
ctl formula name ShieldPPPs-PT-050B-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/1331/ctl_14_
ctl formula name ShieldPPPs-PT-050B-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/1331/ctl_15_
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="ShieldPPPs-PT-050B"
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 ShieldPPPs-PT-050B, 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 r528-tall-171683761200506"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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