fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r504-tall-171649612700402
Last Updated
July 7, 2024

About the Execution of LTSMin+red for LeafsetExtension-PT-S64C4

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3870.012 88261.00 138524.00 325.70 ???F?T???F?????? normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r504-tall-171649612700402.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 LeafsetExtension-PT-S64C4, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r504-tall-171649612700402
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.3K May 19 07:11 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 18:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 12 13:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 12 13:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 13:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 13:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 14M May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME LeafsetExtension-PT-S64C4-CTLFireability-2024-00
FORMULA_NAME LeafsetExtension-PT-S64C4-CTLFireability-2024-01
FORMULA_NAME LeafsetExtension-PT-S64C4-CTLFireability-2024-02
FORMULA_NAME LeafsetExtension-PT-S64C4-CTLFireability-2024-03
FORMULA_NAME LeafsetExtension-PT-S64C4-CTLFireability-2024-04
FORMULA_NAME LeafsetExtension-PT-S64C4-CTLFireability-2024-05
FORMULA_NAME LeafsetExtension-PT-S64C4-CTLFireability-2024-06
FORMULA_NAME LeafsetExtension-PT-S64C4-CTLFireability-2024-07
FORMULA_NAME LeafsetExtension-PT-S64C4-CTLFireability-2024-08
FORMULA_NAME LeafsetExtension-PT-S64C4-CTLFireability-2024-09
FORMULA_NAME LeafsetExtension-PT-S64C4-CTLFireability-2024-10
FORMULA_NAME LeafsetExtension-PT-S64C4-CTLFireability-2024-11
FORMULA_NAME LeafsetExtension-PT-S64C4-CTLFireability-2023-12
FORMULA_NAME LeafsetExtension-PT-S64C4-CTLFireability-2023-13
FORMULA_NAME LeafsetExtension-PT-S64C4-CTLFireability-2023-14
FORMULA_NAME LeafsetExtension-PT-S64C4-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717229268115

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S64C4
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:07:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 08:07:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:07:50] [INFO ] Load time of PNML (sax parser for PT used): 745 ms
[2024-06-01 08:07:50] [INFO ] Transformed 21462 places.
[2024-06-01 08:07:50] [INFO ] Transformed 21129 transitions.
[2024-06-01 08:07:50] [INFO ] Parsed PT model containing 21462 places and 21129 transitions and 67740 arcs in 954 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 41 ms.
Support contains 195 out of 21462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21462/21462 places, 21129/21129 transitions.
Reduce places removed 4229 places and 0 transitions.
Iterating post reduction 0 with 4229 rules applied. Total rules applied 4229 place count 17233 transition count 21129
Applied a total of 4229 rules in 295 ms. Remains 17233 /21462 variables (removed 4229) and now considering 21129/21129 (removed 0) transitions.
// Phase 1: matrix 21129 rows 17233 cols
[2024-06-01 08:07:52] [INFO ] Computed 198 invariants in 1836 ms
[2024-06-01 08:08:05] [INFO ] Implicit Places using invariants in 15095 ms returned [263, 1315, 1841, 2367, 2630, 3156, 3682, 4208, 4734, 4997, 5523, 5786, 6049, 6312, 6838, 7101, 7890, 8153, 8418, 8943, 9206, 9469, 9732, 9995, 10258, 10521, 10784, 11047, 11310, 11573, 11836, 12099, 12362, 12888, 13151, 13414, 13940, 14203, 14466, 14992, 15518, 15781, 17096]
Discarding 43 places :
Implicit Place search using SMT only with invariants took 15148 ms to find 43 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 17190/21462 places, 21129/21129 transitions.
Applied a total of 0 rules in 93 ms. Remains 17190 /17190 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 15559 ms. Remains : 17190/21462 places, 21129/21129 transitions.
Support contains 195 out of 17190 places after structural reductions.
[2024-06-01 08:08:07] [INFO ] Flatten gal took : 952 ms
[2024-06-01 08:08:07] [INFO ] Flatten gal took : 592 ms
[2024-06-01 08:08:09] [INFO ] Input system was already deterministic with 21129 transitions.
Support contains 193 out of 17190 places (down from 195) after GAL structural reductions.
RANDOM walk for 40000 steps (1205 resets) in 4324 ms. (9 steps per ms) remains 33/95 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 33/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 32/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 31/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 30/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 30/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 29/29 properties
// Phase 1: matrix 21129 rows 17190 cols
[2024-06-01 08:08:12] [INFO ] Computed 155 invariants in 1771 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 12791/12851 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 12851/38319 variables, and 21 constraints, problems are : Problem set: 0 solved, 29 unsolved in 5017 ms.
Refiners :[Generalized P Invariants (flows): 21/155 constraints, State Equation: 0/17190 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 29 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (OVERLAPS) 12791/12851 variables, 21/21 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 12851/38319 variables, and 21 constraints, problems are : Problem set: 0 solved, 29 unsolved in 5011 ms.
Refiners :[Generalized P Invariants (flows): 21/155 constraints, State Equation: 0/17190 constraints, PredecessorRefiner: 0/29 constraints, Known Traps: 0/0 constraints]
After SMT, in 12062ms problems are : Problem set: 0 solved, 29 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 60 out of 17190 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17190/17190 places, 21129/21129 transitions.
Graph (complete) has 35382 edges and 17190 vertex of which 2224 are kept as prefixes of interest. Removing 14966 places using SCC suffix rule.35 ms
Discarding 14966 places :
Also discarding 13501 output transitions
Drop transitions (Output transitions of discarded places.) removed 13501 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1355 transitions
Reduce isomorphic transitions removed 1355 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 614 transitions
Trivial Post-agglo rules discarded 614 transitions
Performed 614 trivial Post agglomeration. Transition count delta: 614
Iterating post reduction 0 with 1969 rules applied. Total rules applied 1970 place count 2224 transition count 5659
Reduce places removed 616 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 1 with 625 rules applied. Total rules applied 2595 place count 1608 transition count 5650
Reduce places removed 9 places and 0 transitions.
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Iterating post reduction 2 with 54 rules applied. Total rules applied 2649 place count 1599 transition count 5605
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 3 with 45 rules applied. Total rules applied 2694 place count 1554 transition count 5605
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 25 Pre rules applied. Total rules applied 2694 place count 1554 transition count 5580
Deduced a syphon composed of 25 places in 2 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 2744 place count 1529 transition count 5580
Discarding 775 places :
Symmetric choice reduction at 4 with 775 rule applications. Total rules 3519 place count 754 transition count 4805
Iterating global reduction 4 with 775 rules applied. Total rules applied 4294 place count 754 transition count 4805
Discarding 214 places :
Symmetric choice reduction at 4 with 214 rule applications. Total rules 4508 place count 540 transition count 4591
Iterating global reduction 4 with 214 rules applied. Total rules applied 4722 place count 540 transition count 4591
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 3 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 4780 place count 511 transition count 4562
Free-agglomeration rule (complex) applied 46 times.
Iterating global reduction 4 with 46 rules applied. Total rules applied 4826 place count 511 transition count 4516
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 4 with 46 rules applied. Total rules applied 4872 place count 465 transition count 4516
Partial Free-agglomeration rule applied 86 times.
Drop transitions (Partial Free agglomeration) removed 86 transitions
Iterating global reduction 5 with 86 rules applied. Total rules applied 4958 place count 465 transition count 4516
Applied a total of 4958 rules in 1103 ms. Remains 465 /17190 variables (removed 16725) and now considering 4516/21129 (removed 16613) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1104 ms. Remains : 465/17190 places, 4516/21129 transitions.
RANDOM walk for 40000 steps (4078 resets) in 3293 ms. (12 steps per ms) remains 10/29 properties
BEST_FIRST walk for 40004 steps (12 resets) in 118 ms. (336 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (19 resets) in 125 ms. (317 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (18 resets) in 111 ms. (357 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (20 resets) in 132 ms. (300 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (16 resets) in 116 ms. (341 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (16 resets) in 112 ms. (354 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (18 resets) in 117 ms. (339 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (12 resets) in 213 ms. (186 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (19 resets) in 87 ms. (454 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (16 resets) in 94 ms. (421 steps per ms) remains 8/8 properties
[2024-06-01 08:08:25] [INFO ] Flow matrix only has 1110 transitions (discarded 3406 similar events)
// Phase 1: matrix 1110 rows 465 cols
[2024-06-01 08:08:25] [INFO ] Computed 17 invariants in 6 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 105/127 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 662/789 variables, 127/133 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/789 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 574/1363 variables, 147/280 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1363 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 44/1407 variables, 11/291 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1407 variables, 28/319 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1407 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 166/1573 variables, 162/481 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1573 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 2/1575 variables, 1/482 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1575 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 0/1575 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1575/1575 variables, and 482 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1923 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 465/465 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 105/127 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 662/789 variables, 127/133 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/789 variables, 4/137 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/789 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 574/1363 variables, 147/284 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1363 variables, 4/288 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1363 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 44/1407 variables, 11/299 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1407 variables, 28/327 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1407 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 166/1573 variables, 162/489 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1573 variables, 0/489 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 2/1575 variables, 1/490 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1575 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 0/1575 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1575/1575 variables, and 490 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2119 ms.
Refiners :[Generalized P Invariants (flows): 17/17 constraints, State Equation: 465/465 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 4072ms problems are : Problem set: 0 solved, 8 unsolved
Finished Parikh walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Parikh walk visited 8 properties in 114 ms.
[2024-06-01 08:08:30] [INFO ] Flatten gal took : 496 ms
[2024-06-01 08:08:30] [INFO ] Flatten gal took : 518 ms
[2024-06-01 08:08:31] [INFO ] Input system was already deterministic with 21129 transitions.
Computed a total of 17190 stabilizing places and 21129 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17190 transition count 21129
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 2 formulas.
FORMULA LeafsetExtension-PT-S64C4-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in SI_CTL mode, iteration 0 : 17190/17190 places, 21129/21129 transitions.
Graph (complete) has 39739 edges and 17190 vertex of which 17188 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.55 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 8319 transitions
Trivial Post-agglo rules discarded 8319 transitions
Performed 8319 trivial Post agglomeration. Transition count delta: 8319
Iterating post reduction 0 with 8319 rules applied. Total rules applied 8320 place count 17188 transition count 12808
Reduce places removed 8319 places and 0 transitions.
Iterating post reduction 1 with 8319 rules applied. Total rules applied 16639 place count 8869 transition count 12808
Performed 130 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 130 Pre rules applied. Total rules applied 16639 place count 8869 transition count 12678
Deduced a syphon composed of 130 places in 9 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 260 rules applied. Total rules applied 16899 place count 8739 transition count 12678
Discarding 4029 places :
Symmetric choice reduction at 2 with 4029 rule applications. Total rules 20928 place count 4710 transition count 8649
Iterating global reduction 2 with 4029 rules applied. Total rules applied 24957 place count 4710 transition count 8649
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 24957 place count 4710 transition count 8648
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24959 place count 4709 transition count 8648
Discarding 2557 places :
Symmetric choice reduction at 2 with 2557 rule applications. Total rules 27516 place count 2152 transition count 6091
Iterating global reduction 2 with 2557 rules applied. Total rules applied 30073 place count 2152 transition count 6091
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 3 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 2 with 262 rules applied. Total rules applied 30335 place count 2021 transition count 5960
Applied a total of 30335 rules in 2727 ms. Remains 2021 /17190 variables (removed 15169) and now considering 5960/21129 (removed 15169) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2728 ms. Remains : 2021/17190 places, 5960/21129 transitions.
[2024-06-01 08:08:34] [INFO ] Flatten gal took : 117 ms
[2024-06-01 08:08:34] [INFO ] Flatten gal took : 135 ms
[2024-06-01 08:08:35] [INFO ] Input system was already deterministic with 5960 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 17190/17190 places, 21129/21129 transitions.
Graph (complete) has 39739 edges and 17190 vertex of which 17188 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.20 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 8286 transitions
Trivial Post-agglo rules discarded 8286 transitions
Performed 8286 trivial Post agglomeration. Transition count delta: 8286
Iterating post reduction 0 with 8286 rules applied. Total rules applied 8287 place count 17188 transition count 12841
Reduce places removed 8286 places and 0 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 1 with 8318 rules applied. Total rules applied 16605 place count 8902 transition count 12809
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 16637 place count 8870 transition count 12809
Performed 129 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 129 Pre rules applied. Total rules applied 16637 place count 8870 transition count 12680
Deduced a syphon composed of 129 places in 3 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 258 rules applied. Total rules applied 16895 place count 8741 transition count 12680
Discarding 4029 places :
Symmetric choice reduction at 3 with 4029 rule applications. Total rules 20924 place count 4712 transition count 8651
Iterating global reduction 3 with 4029 rules applied. Total rules applied 24953 place count 4712 transition count 8651
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 24953 place count 4712 transition count 8650
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24955 place count 4711 transition count 8650
Discarding 2557 places :
Symmetric choice reduction at 3 with 2557 rule applications. Total rules 27512 place count 2154 transition count 6093
Iterating global reduction 3 with 2557 rules applied. Total rules applied 30069 place count 2154 transition count 6093
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 130
Deduced a syphon composed of 130 places in 1 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 260 rules applied. Total rules applied 30329 place count 2024 transition count 5963
Applied a total of 30329 rules in 2509 ms. Remains 2024 /17190 variables (removed 15166) and now considering 5963/21129 (removed 15166) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2510 ms. Remains : 2024/17190 places, 5963/21129 transitions.
[2024-06-01 08:08:37] [INFO ] Flatten gal took : 113 ms
[2024-06-01 08:08:37] [INFO ] Flatten gal took : 132 ms
[2024-06-01 08:08:38] [INFO ] Input system was already deterministic with 5963 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17190/17190 places, 21129/21129 transitions.
Applied a total of 0 rules in 57 ms. Remains 17190 /17190 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59 ms. Remains : 17190/17190 places, 21129/21129 transitions.
[2024-06-01 08:08:38] [INFO ] Flatten gal took : 416 ms
[2024-06-01 08:08:39] [INFO ] Flatten gal took : 464 ms
[2024-06-01 08:08:40] [INFO ] Input system was already deterministic with 21129 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 17190/17190 places, 21129/21129 transitions.
Graph (complete) has 39739 edges and 17190 vertex of which 17188 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.24 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 8287 transitions
Trivial Post-agglo rules discarded 8287 transitions
Performed 8287 trivial Post agglomeration. Transition count delta: 8287
Iterating post reduction 0 with 8287 rules applied. Total rules applied 8288 place count 17188 transition count 12840
Reduce places removed 8287 places and 0 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 1 with 8319 rules applied. Total rules applied 16607 place count 8901 transition count 12808
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 16639 place count 8869 transition count 12808
Performed 129 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 129 Pre rules applied. Total rules applied 16639 place count 8869 transition count 12679
Deduced a syphon composed of 129 places in 7 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 258 rules applied. Total rules applied 16897 place count 8740 transition count 12679
Discarding 4029 places :
Symmetric choice reduction at 3 with 4029 rule applications. Total rules 20926 place count 4711 transition count 8650
Iterating global reduction 3 with 4029 rules applied. Total rules applied 24955 place count 4711 transition count 8650
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 24955 place count 4711 transition count 8649
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24957 place count 4710 transition count 8649
Discarding 2558 places :
Symmetric choice reduction at 3 with 2558 rule applications. Total rules 27515 place count 2152 transition count 6091
Iterating global reduction 3 with 2558 rules applied. Total rules applied 30073 place count 2152 transition count 6091
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 130
Deduced a syphon composed of 130 places in 1 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 260 rules applied. Total rules applied 30333 place count 2022 transition count 5961
Applied a total of 30333 rules in 2497 ms. Remains 2022 /17190 variables (removed 15168) and now considering 5961/21129 (removed 15168) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2497 ms. Remains : 2022/17190 places, 5961/21129 transitions.
[2024-06-01 08:08:42] [INFO ] Flatten gal took : 127 ms
[2024-06-01 08:08:43] [INFO ] Flatten gal took : 151 ms
[2024-06-01 08:08:43] [INFO ] Input system was already deterministic with 5961 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17190/17190 places, 21129/21129 transitions.
Applied a total of 0 rules in 61 ms. Remains 17190 /17190 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62 ms. Remains : 17190/17190 places, 21129/21129 transitions.
[2024-06-01 08:08:43] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 08:08:43] [INFO ] Flatten gal took : 454 ms
FORMULA LeafsetExtension-PT-S64C4-CTLFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 08:08:44] [INFO ] Flatten gal took : 495 ms
[2024-06-01 08:08:45] [INFO ] Input system was already deterministic with 21129 transitions.
Support contains 0 out of 17190 places (down from 24) after GAL structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17190/17190 places, 21129/21129 transitions.
Applied a total of 0 rules in 60 ms. Remains 17190 /17190 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61 ms. Remains : 17190/17190 places, 21129/21129 transitions.
[2024-06-01 08:08:45] [INFO ] Flatten gal took : 419 ms
[2024-06-01 08:08:46] [INFO ] Flatten gal took : 480 ms
[2024-06-01 08:08:47] [INFO ] Input system was already deterministic with 21129 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17190/17190 places, 21129/21129 transitions.
Applied a total of 0 rules in 56 ms. Remains 17190 /17190 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57 ms. Remains : 17190/17190 places, 21129/21129 transitions.
[2024-06-01 08:08:47] [INFO ] Flatten gal took : 429 ms
[2024-06-01 08:08:48] [INFO ] Flatten gal took : 478 ms
[2024-06-01 08:08:49] [INFO ] Input system was already deterministic with 21129 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17190/17190 places, 21129/21129 transitions.
Applied a total of 0 rules in 55 ms. Remains 17190 /17190 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 55 ms. Remains : 17190/17190 places, 21129/21129 transitions.
[2024-06-01 08:08:49] [INFO ] Flatten gal took : 419 ms
[2024-06-01 08:08:50] [INFO ] Flatten gal took : 460 ms
[2024-06-01 08:08:50] [INFO ] Input system was already deterministic with 21129 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 17190/17190 places, 21129/21129 transitions.
Graph (complete) has 39739 edges and 17190 vertex of which 17188 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.18 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 8287 transitions
Trivial Post-agglo rules discarded 8287 transitions
Performed 8287 trivial Post agglomeration. Transition count delta: 8287
Iterating post reduction 0 with 8287 rules applied. Total rules applied 8288 place count 17188 transition count 12840
Reduce places removed 8287 places and 0 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Iterating post reduction 1 with 8319 rules applied. Total rules applied 16607 place count 8901 transition count 12808
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 16639 place count 8869 transition count 12808
Performed 129 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 129 Pre rules applied. Total rules applied 16639 place count 8869 transition count 12679
Deduced a syphon composed of 129 places in 5 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 258 rules applied. Total rules applied 16897 place count 8740 transition count 12679
Discarding 4029 places :
Symmetric choice reduction at 3 with 4029 rule applications. Total rules 20926 place count 4711 transition count 8650
Iterating global reduction 3 with 4029 rules applied. Total rules applied 24955 place count 4711 transition count 8650
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 24955 place count 4711 transition count 8649
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24957 place count 4710 transition count 8649
Discarding 2558 places :
Symmetric choice reduction at 3 with 2558 rule applications. Total rules 27515 place count 2152 transition count 6091
Iterating global reduction 3 with 2558 rules applied. Total rules applied 30073 place count 2152 transition count 6091
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 130
Deduced a syphon composed of 130 places in 1 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 3 with 260 rules applied. Total rules applied 30333 place count 2022 transition count 5961
Applied a total of 30333 rules in 2511 ms. Remains 2022 /17190 variables (removed 15168) and now considering 5961/21129 (removed 15168) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2511 ms. Remains : 2022/17190 places, 5961/21129 transitions.
[2024-06-01 08:08:53] [INFO ] Flatten gal took : 128 ms
[2024-06-01 08:08:53] [INFO ] Flatten gal took : 156 ms
[2024-06-01 08:08:54] [INFO ] Input system was already deterministic with 5961 transitions.
RANDOM walk for 40000 steps (2341 resets) in 837 ms. (47 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (39 resets) in 143 ms. (277 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 24115 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :0 out of 1
Probabilistic random walk after 24115 steps, saw 12134 distinct states, run finished after 3008 ms. (steps per millisecond=8 ) properties seen :0
// Phase 1: matrix 5961 rows 2022 cols
[2024-06-01 08:08:57] [INFO ] Computed 155 invariants in 50 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 972/974 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/974 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1048/2022 variables, 152/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2022 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5961/7983 variables, 2022/2177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7983 variables, 0/2177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/7983 variables, 0/2177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7983/7983 variables, and 2177 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1923 ms.
Refiners :[Generalized P Invariants (flows): 155/155 constraints, State Equation: 2022/2022 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 972/974 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/974 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1048/2022 variables, 152/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2022 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5961/7983 variables, 2022/2177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7983 variables, 1/2178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/7983 variables, 0/2178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/7983 variables, 0/2178 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7983/7983 variables, and 2178 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1845 ms.
Refiners :[Generalized P Invariants (flows): 155/155 constraints, State Equation: 2022/2022 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 3857ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 15 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=15 )
FORMULA LeafsetExtension-PT-S64C4-CTLFireability-2024-09 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 2 ms.
Starting structural reductions in SI_CTL mode, iteration 0 : 17190/17190 places, 21129/21129 transitions.
Graph (complete) has 39739 edges and 17190 vertex of which 17188 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.23 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 8319 transitions
Trivial Post-agglo rules discarded 8319 transitions
Performed 8319 trivial Post agglomeration. Transition count delta: 8319
Iterating post reduction 0 with 8319 rules applied. Total rules applied 8320 place count 17188 transition count 12808
Reduce places removed 8319 places and 0 transitions.
Iterating post reduction 1 with 8319 rules applied. Total rules applied 16639 place count 8869 transition count 12808
Performed 130 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 130 Pre rules applied. Total rules applied 16639 place count 8869 transition count 12678
Deduced a syphon composed of 130 places in 4 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 260 rules applied. Total rules applied 16899 place count 8739 transition count 12678
Discarding 4030 places :
Symmetric choice reduction at 2 with 4030 rule applications. Total rules 20929 place count 4709 transition count 8648
Iterating global reduction 2 with 4030 rules applied. Total rules applied 24959 place count 4709 transition count 8648
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 24959 place count 4709 transition count 8646
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24963 place count 4707 transition count 8646
Discarding 2557 places :
Symmetric choice reduction at 2 with 2557 rule applications. Total rules 27520 place count 2150 transition count 6089
Iterating global reduction 2 with 2557 rules applied. Total rules applied 30077 place count 2150 transition count 6089
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 130
Deduced a syphon composed of 130 places in 1 ms
Reduce places removed 130 places and 0 transitions.
Iterating global reduction 2 with 260 rules applied. Total rules applied 30337 place count 2020 transition count 5959
Applied a total of 30337 rules in 2308 ms. Remains 2020 /17190 variables (removed 15170) and now considering 5959/21129 (removed 15170) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2309 ms. Remains : 2020/17190 places, 5959/21129 transitions.
[2024-06-01 08:09:03] [INFO ] Flatten gal took : 110 ms
[2024-06-01 08:09:03] [INFO ] Flatten gal took : 125 ms
[2024-06-01 08:09:04] [INFO ] Input system was already deterministic with 5959 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17190/17190 places, 21129/21129 transitions.
Applied a total of 0 rules in 57 ms. Remains 17190 /17190 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59 ms. Remains : 17190/17190 places, 21129/21129 transitions.
[2024-06-01 08:09:04] [INFO ] Flatten gal took : 432 ms
[2024-06-01 08:09:05] [INFO ] Flatten gal took : 483 ms
[2024-06-01 08:09:06] [INFO ] Input system was already deterministic with 21129 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17190/17190 places, 21129/21129 transitions.
Applied a total of 0 rules in 62 ms. Remains 17190 /17190 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62 ms. Remains : 17190/17190 places, 21129/21129 transitions.
[2024-06-01 08:09:06] [INFO ] Flatten gal took : 424 ms
[2024-06-01 08:09:07] [INFO ] Flatten gal took : 471 ms
[2024-06-01 08:09:08] [INFO ] Input system was already deterministic with 21129 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 17190/17190 places, 21129/21129 transitions.
Graph (complete) has 39739 edges and 17190 vertex of which 17188 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.18 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 8187 transitions
Trivial Post-agglo rules discarded 8187 transitions
Performed 8187 trivial Post agglomeration. Transition count delta: 8187
Iterating post reduction 0 with 8187 rules applied. Total rules applied 8188 place count 17188 transition count 12940
Reduce places removed 8187 places and 0 transitions.
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Iterating post reduction 1 with 8315 rules applied. Total rules applied 16503 place count 9001 transition count 12812
Reduce places removed 128 places and 0 transitions.
Iterating post reduction 2 with 128 rules applied. Total rules applied 16631 place count 8873 transition count 12812
Performed 129 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 129 Pre rules applied. Total rules applied 16631 place count 8873 transition count 12683
Deduced a syphon composed of 129 places in 3 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 258 rules applied. Total rules applied 16889 place count 8744 transition count 12683
Discarding 4028 places :
Symmetric choice reduction at 3 with 4028 rule applications. Total rules 20917 place count 4716 transition count 8655
Iterating global reduction 3 with 4028 rules applied. Total rules applied 24945 place count 4716 transition count 8655
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 24945 place count 4716 transition count 8654
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24947 place count 4715 transition count 8654
Discarding 2556 places :
Symmetric choice reduction at 3 with 2556 rule applications. Total rules 27503 place count 2159 transition count 6098
Iterating global reduction 3 with 2556 rules applied. Total rules applied 30059 place count 2159 transition count 6098
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 1 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 262 rules applied. Total rules applied 30321 place count 2028 transition count 5967
Applied a total of 30321 rules in 2503 ms. Remains 2028 /17190 variables (removed 15162) and now considering 5967/21129 (removed 15162) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2505 ms. Remains : 2028/17190 places, 5967/21129 transitions.
[2024-06-01 08:09:10] [INFO ] Flatten gal took : 111 ms
[2024-06-01 08:09:10] [INFO ] Flatten gal took : 121 ms
[2024-06-01 08:09:11] [INFO ] Input system was already deterministic with 5967 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17190/17190 places, 21129/21129 transitions.
Applied a total of 0 rules in 57 ms. Remains 17190 /17190 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57 ms. Remains : 17190/17190 places, 21129/21129 transitions.
[2024-06-01 08:09:11] [INFO ] Flatten gal took : 413 ms
[2024-06-01 08:09:12] [INFO ] Flatten gal took : 468 ms
[2024-06-01 08:09:12] [INFO ] Input system was already deterministic with 21129 transitions.
Starting structural reductions in LTL mode, iteration 0 : 17190/17190 places, 21129/21129 transitions.
Applied a total of 0 rules in 56 ms. Remains 17190 /17190 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58 ms. Remains : 17190/17190 places, 21129/21129 transitions.
[2024-06-01 08:09:13] [INFO ] Flatten gal took : 414 ms
[2024-06-01 08:09:13] [INFO ] Flatten gal took : 461 ms
[2024-06-01 08:09:14] [INFO ] Input system was already deterministic with 21129 transitions.
[2024-06-01 08:09:15] [INFO ] Flatten gal took : 510 ms
[2024-06-01 08:09:15] [INFO ] Flatten gal took : 482 ms
[2024-06-01 08:09:15] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2024-06-01 08:09:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 17190 places, 21129 transitions and 60778 arcs took 74 ms.
Total runtime 86747 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 : LeafsetExtension-PT-S64C4-CTLFireability-2024-00
Could not compute solution for formula : LeafsetExtension-PT-S64C4-CTLFireability-2024-01
Could not compute solution for formula : LeafsetExtension-PT-S64C4-CTLFireability-2024-02
Could not compute solution for formula : LeafsetExtension-PT-S64C4-CTLFireability-2024-04
Could not compute solution for formula : LeafsetExtension-PT-S64C4-CTLFireability-2024-06
Could not compute solution for formula : LeafsetExtension-PT-S64C4-CTLFireability-2024-07
Could not compute solution for formula : LeafsetExtension-PT-S64C4-CTLFireability-2024-08
Could not compute solution for formula : LeafsetExtension-PT-S64C4-CTLFireability-2024-10
Could not compute solution for formula : LeafsetExtension-PT-S64C4-CTLFireability-2024-11
Could not compute solution for formula : LeafsetExtension-PT-S64C4-CTLFireability-2023-12
Could not compute solution for formula : LeafsetExtension-PT-S64C4-CTLFireability-2023-13
Could not compute solution for formula : LeafsetExtension-PT-S64C4-CTLFireability-2023-14
Could not compute solution for formula : LeafsetExtension-PT-S64C4-CTLFireability-2023-15

BK_STOP 1717229356376

--------------------
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 LeafsetExtension-PT-S64C4-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/544/ctl_0_
ctl formula name LeafsetExtension-PT-S64C4-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/544/ctl_1_
ctl formula name LeafsetExtension-PT-S64C4-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/544/ctl_2_
ctl formula name LeafsetExtension-PT-S64C4-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/544/ctl_3_
ctl formula name LeafsetExtension-PT-S64C4-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/544/ctl_4_
ctl formula name LeafsetExtension-PT-S64C4-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/544/ctl_5_
ctl formula name LeafsetExtension-PT-S64C4-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/544/ctl_6_
ctl formula name LeafsetExtension-PT-S64C4-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/544/ctl_7_
ctl formula name LeafsetExtension-PT-S64C4-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/544/ctl_8_
ctl formula name LeafsetExtension-PT-S64C4-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/544/ctl_9_
ctl formula name LeafsetExtension-PT-S64C4-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/544/ctl_10_
ctl formula name LeafsetExtension-PT-S64C4-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/544/ctl_11_
ctl formula name LeafsetExtension-PT-S64C4-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/544/ctl_12_
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="LeafsetExtension-PT-S64C4"
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 LeafsetExtension-PT-S64C4, 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 r504-tall-171649612700402"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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