fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r025-smll-171620166400353
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for AutonomousCar-PT-09b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
13683.331 1353403.00 3350910.00 2427.00 ?FFFTFFT??FFFFFF 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.r025-smll-171620166400353.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 greatspnxred
Input is AutonomousCar-PT-09b, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r025-smll-171620166400353
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:53 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 18:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 136K Apr 12 18:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 12 18:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 18:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 865K 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 AutonomousCar-PT-09b-CTLCardinality-2024-00
FORMULA_NAME AutonomousCar-PT-09b-CTLCardinality-2024-01
FORMULA_NAME AutonomousCar-PT-09b-CTLCardinality-2024-02
FORMULA_NAME AutonomousCar-PT-09b-CTLCardinality-2024-03
FORMULA_NAME AutonomousCar-PT-09b-CTLCardinality-2024-04
FORMULA_NAME AutonomousCar-PT-09b-CTLCardinality-2024-05
FORMULA_NAME AutonomousCar-PT-09b-CTLCardinality-2024-06
FORMULA_NAME AutonomousCar-PT-09b-CTLCardinality-2024-07
FORMULA_NAME AutonomousCar-PT-09b-CTLCardinality-2024-08
FORMULA_NAME AutonomousCar-PT-09b-CTLCardinality-2024-09
FORMULA_NAME AutonomousCar-PT-09b-CTLCardinality-2024-10
FORMULA_NAME AutonomousCar-PT-09b-CTLCardinality-2024-11
FORMULA_NAME AutonomousCar-PT-09b-CTLCardinality-2023-12
FORMULA_NAME AutonomousCar-PT-09b-CTLCardinality-2023-13
FORMULA_NAME AutonomousCar-PT-09b-CTLCardinality-2023-14
FORMULA_NAME AutonomousCar-PT-09b-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716356951368

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=AutonomousCar-PT-09b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 05:49:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 05:49:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 05:49:14] [INFO ] Load time of PNML (sax parser for PT used): 498 ms
[2024-05-22 05:49:14] [INFO ] Transformed 391 places.
[2024-05-22 05:49:14] [INFO ] Transformed 1554 transitions.
[2024-05-22 05:49:14] [INFO ] Found NUPN structural information;
[2024-05-22 05:49:14] [INFO ] Parsed PT model containing 391 places and 1554 transitions and 16243 arcs in 892 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 36 ms.
Support contains 113 out of 391 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 391/391 places, 1554/1554 transitions.
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 38 place count 353 transition count 1516
Iterating global reduction 0 with 38 rules applied. Total rules applied 76 place count 353 transition count 1516
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 79 place count 350 transition count 1513
Iterating global reduction 0 with 3 rules applied. Total rules applied 82 place count 350 transition count 1513
Applied a total of 82 rules in 152 ms. Remains 350 /391 variables (removed 41) and now considering 1513/1554 (removed 41) transitions.
// Phase 1: matrix 1513 rows 350 cols
[2024-05-22 05:49:15] [INFO ] Computed 14 invariants in 45 ms
[2024-05-22 05:49:16] [INFO ] Implicit Places using invariants in 750 ms returned []
[2024-05-22 05:49:16] [INFO ] Invariant cache hit.
[2024-05-22 05:49:17] [INFO ] Implicit Places using invariants and state equation in 1348 ms returned []
Implicit Place search using SMT with State Equation took 2147 ms to find 0 implicit places.
Running 1512 sub problems to find dead transitions.
[2024-05-22 05:49:17] [INFO ] Invariant cache hit.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/349 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1512 unsolved
SMT process timed out in 49450ms, After SMT, problems are : Problem set: 0 solved, 1512 unsolved
Search for dead transitions found 0 dead transitions in 49544ms
Starting structural reductions in LTL mode, iteration 1 : 350/391 places, 1513/1554 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51911 ms. Remains : 350/391 places, 1513/1554 transitions.
Support contains 113 out of 350 places after structural reductions.
[2024-05-22 05:50:07] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2024-05-22 05:50:07] [INFO ] Flatten gal took : 396 ms
[2024-05-22 05:50:07] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA AutonomousCar-PT-09b-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA AutonomousCar-PT-09b-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 05:50:07] [INFO ] Flatten gal took : 177 ms
[2024-05-22 05:50:08] [INFO ] Input system was already deterministic with 1513 transitions.
Support contains 65 out of 350 places (down from 113) after GAL structural reductions.
RANDOM walk for 40000 steps (329 resets) in 2149 ms. (18 steps per ms) remains 6/42 properties
BEST_FIRST walk for 40002 steps (49 resets) in 180 ms. (221 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (48 resets) in 112 ms. (354 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (47 resets) in 103 ms. (384 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (49 resets) in 134 ms. (296 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (47 resets) in 173 ms. (229 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (49 resets) in 132 ms. (300 steps per ms) remains 5/5 properties
[2024-05-22 05:50:09] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 229/240 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 110/350 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/350 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 1513/1863 variables, 350/364 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1863 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/1863 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1863/1863 variables, and 364 constraints, problems are : Problem set: 0 solved, 5 unsolved in 908 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 350/350 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 229/240 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 05:50:11] [INFO ] Deduced a trap composed of 15 places in 728 ms of which 82 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/240 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/240 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 110/350 variables, 5/15 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 05:50:12] [INFO ] Deduced a trap composed of 18 places in 990 ms of which 4 ms to minimize.
[2024-05-22 05:50:13] [INFO ] Deduced a trap composed of 32 places in 628 ms of which 3 ms to minimize.
[2024-05-22 05:50:14] [INFO ] Deduced a trap composed of 9 places in 1072 ms of which 5 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/350 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1513/1863 variables, 350/368 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1863 variables, 5/373 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 05:50:16] [INFO ] Deduced a trap composed of 33 places in 778 ms of which 4 ms to minimize.
SMT process timed out in 6711ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 11 out of 350 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 350/350 places, 1513/1513 transitions.
Graph (trivial) has 317 edges and 350 vertex of which 4 / 350 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1658 edges and 348 vertex of which 343 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.29 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 0 with 128 rules applied. Total rules applied 130 place count 343 transition count 1378
Reduce places removed 126 places and 0 transitions.
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 1 with 171 rules applied. Total rules applied 301 place count 217 transition count 1333
Reduce places removed 26 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 30 rules applied. Total rules applied 331 place count 191 transition count 1329
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 6 rules applied. Total rules applied 337 place count 187 transition count 1327
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 338 place count 186 transition count 1327
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 10 Pre rules applied. Total rules applied 338 place count 186 transition count 1317
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 358 place count 176 transition count 1317
Discarding 15 places :
Symmetric choice reduction at 5 with 15 rule applications. Total rules 373 place count 161 transition count 1302
Iterating global reduction 5 with 15 rules applied. Total rules applied 388 place count 161 transition count 1302
Ensure Unique test removed 324 transitions
Reduce isomorphic transitions removed 324 transitions.
Iterating post reduction 5 with 324 rules applied. Total rules applied 712 place count 161 transition count 978
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 712 place count 161 transition count 977
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 714 place count 160 transition count 977
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 718 place count 156 transition count 941
Iterating global reduction 6 with 4 rules applied. Total rules applied 722 place count 156 transition count 941
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 6 with 5 rules applied. Total rules applied 727 place count 156 transition count 936
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 729 place count 154 transition count 936
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 58
Deduced a syphon composed of 58 places in 1 ms
Reduce places removed 58 places and 0 transitions.
Iterating global reduction 8 with 116 rules applied. Total rules applied 845 place count 96 transition count 878
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 846 place count 96 transition count 877
Discarding 13 places :
Symmetric choice reduction at 9 with 13 rule applications. Total rules 859 place count 83 transition count 759
Iterating global reduction 9 with 13 rules applied. Total rules applied 872 place count 83 transition count 759
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 9 with 3 rules applied. Total rules applied 875 place count 83 transition count 756
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 877 place count 82 transition count 755
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 10 with 1 rules applied. Total rules applied 878 place count 82 transition count 754
Free-agglomeration rule applied 10 times.
Iterating global reduction 10 with 10 rules applied. Total rules applied 888 place count 82 transition count 744
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 10 with 10 rules applied. Total rules applied 898 place count 72 transition count 744
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 11 with 2 rules applied. Total rules applied 900 place count 72 transition count 742
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 11 with 1 rules applied. Total rules applied 901 place count 72 transition count 742
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 902 place count 71 transition count 741
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 11 with 1 rules applied. Total rules applied 903 place count 70 transition count 741
Applied a total of 903 rules in 991 ms. Remains 70 /350 variables (removed 280) and now considering 741/1513 (removed 772) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 992 ms. Remains : 70/350 places, 741/1513 transitions.
RANDOM walk for 40000 steps (1350 resets) in 1619 ms. (24 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (204 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
// Phase 1: matrix 741 rows 70 cols
[2024-05-22 05:50:17] [INFO ] Computed 13 invariants in 7 ms
[2024-05-22 05:50:17] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 710/731 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/731 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 70/801 variables, 42/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/801 variables, 5/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/801 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 05:50:18] [INFO ] Deduced a trap composed of 5 places in 443 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/801 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/801 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 7/808 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/808 variables, 1/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/808 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/811 variables, 6/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/811 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/811 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 811/811 variables, and 85 constraints, problems are : Problem set: 0 solved, 1 unsolved in 858 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 70/70 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 710/731 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/731 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 70/801 variables, 42/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/801 variables, 5/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/801 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/801 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/801 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/801 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 7/808 variables, 4/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/808 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/808 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 3/811 variables, 6/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/811 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/811 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 811/811 variables, and 86 constraints, problems are : Problem set: 0 solved, 1 unsolved in 495 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 70/70 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 1375ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 144 ms.
Support contains 4 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 741/741 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 70 transition count 736
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 65 transition count 736
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 10 place count 65 transition count 735
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 64 transition count 735
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 63 transition count 734
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 63 transition count 732
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 27 place count 61 transition count 723
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 28 place count 60 transition count 722
Applied a total of 28 rules in 308 ms. Remains 60 /70 variables (removed 10) and now considering 722/741 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 308 ms. Remains : 60/70 places, 722/741 transitions.
RANDOM walk for 40000 steps (733 resets) in 972 ms. (41 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (219 resets) in 126 ms. (314 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 966150 steps, run timeout after 3001 ms. (steps per millisecond=321 ) properties seen :0 out of 1
Probabilistic random walk after 966150 steps, saw 138733 distinct states, run finished after 3006 ms. (steps per millisecond=321 ) properties seen :0
// Phase 1: matrix 722 rows 60 cols
[2024-05-22 05:50:22] [INFO ] Computed 13 invariants in 6 ms
[2024-05-22 05:50:22] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 701/722 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/722 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 60/782 variables, 39/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/782 variables, 9/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/782 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/782 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/782 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 782/782 variables, and 74 constraints, problems are : Problem set: 0 solved, 1 unsolved in 379 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 60/60 constraints, ReadFeed: 1/1 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 701/722 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/722 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 60/782 variables, 39/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/782 variables, 9/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/782 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/782 variables, 1/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/782 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/782 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 782/782 variables, and 75 constraints, problems are : Problem set: 0 solved, 1 unsolved in 465 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, State Equation: 60/60 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 865ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 60 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 722/722 transitions.
Applied a total of 0 rules in 67 ms. Remains 60 /60 variables (removed 0) and now considering 722/722 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 60/60 places, 722/722 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 60/60 places, 722/722 transitions.
Applied a total of 0 rules in 67 ms. Remains 60 /60 variables (removed 0) and now considering 722/722 (removed 0) transitions.
[2024-05-22 05:50:23] [INFO ] Invariant cache hit.
[2024-05-22 05:50:24] [INFO ] Implicit Places using invariants in 511 ms returned []
[2024-05-22 05:50:24] [INFO ] Invariant cache hit.
[2024-05-22 05:50:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 05:50:25] [INFO ] Implicit Places using invariants and state equation in 620 ms returned [55, 59]
Discarding 2 places :
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Implicit Place search using SMT with State Equation took 1137 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 58/60 places, 721/722 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 58 transition count 720
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 57 transition count 720
Applied a total of 2 rules in 103 ms. Remains 57 /58 variables (removed 1) and now considering 720/721 (removed 1) transitions.
// Phase 1: matrix 720 rows 57 cols
[2024-05-22 05:50:25] [INFO ] Computed 11 invariants in 11 ms
[2024-05-22 05:50:25] [INFO ] Implicit Places using invariants in 500 ms returned []
[2024-05-22 05:50:25] [INFO ] Invariant cache hit.
[2024-05-22 05:50:26] [INFO ] Implicit Places using invariants and state equation in 542 ms returned []
Implicit Place search using SMT with State Equation took 1048 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 57/60 places, 720/722 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2356 ms. Remains : 57/60 places, 720/722 transitions.
RANDOM walk for 40000 steps (91 resets) in 1355 ms. (29 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (225 resets) in 77 ms. (512 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1052010 steps, run timeout after 3001 ms. (steps per millisecond=350 ) properties seen :0 out of 1
Probabilistic random walk after 1052010 steps, saw 150898 distinct states, run finished after 3001 ms. (steps per millisecond=350 ) properties seen :0
[2024-05-22 05:50:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 702/723 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/723 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 54/777 variables, 36/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/777 variables, 7/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/777 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/777 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 777/777 variables, and 68 constraints, problems are : Problem set: 0 solved, 1 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 57/57 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 702/723 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/723 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 54/777 variables, 36/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/777 variables, 7/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/777 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/777 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/777 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 777/777 variables, and 69 constraints, problems are : Problem set: 0 solved, 1 unsolved in 363 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 675ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 720/720 transitions.
Applied a total of 0 rules in 69 ms. Remains 57 /57 variables (removed 0) and now considering 720/720 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 57/57 places, 720/720 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 57/57 places, 720/720 transitions.
Applied a total of 0 rules in 69 ms. Remains 57 /57 variables (removed 0) and now considering 720/720 (removed 0) transitions.
[2024-05-22 05:50:30] [INFO ] Invariant cache hit.
[2024-05-22 05:50:30] [INFO ] Implicit Places using invariants in 519 ms returned []
[2024-05-22 05:50:30] [INFO ] Invariant cache hit.
[2024-05-22 05:50:31] [INFO ] Implicit Places using invariants and state equation in 571 ms returned []
Implicit Place search using SMT with State Equation took 1096 ms to find 0 implicit places.
[2024-05-22 05:50:31] [INFO ] Redundant transitions in 61 ms returned []
Running 719 sub problems to find dead transitions.
[2024-05-22 05:50:31] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 719 unsolved
[2024-05-22 05:50:49] [INFO ] Deduced a trap composed of 3 places in 716 ms of which 3 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 719 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 719 unsolved
Problem TDEAD719 is UNSAT
At refinement iteration 3 (OVERLAPS) 720/777 variables, 57/69 constraints. Problems are: Problem set: 1 solved, 718 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 777/777 variables, and 69 constraints, problems are : Problem set: 1 solved, 718 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 719/719 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 718 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 11/11 constraints. Problems are: Problem set: 1 solved, 718 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 1/12 constraints. Problems are: Problem set: 1 solved, 718 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 0/12 constraints. Problems are: Problem set: 1 solved, 718 unsolved
At refinement iteration 3 (OVERLAPS) 720/777 variables, 57/69 constraints. Problems are: Problem set: 1 solved, 718 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 777/777 variables, and 787 constraints, problems are : Problem set: 1 solved, 718 unsolved in 31724 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 57/57 constraints, PredecessorRefiner: 718/719 constraints, Known Traps: 1/1 constraints]
After SMT, in 75598ms problems are : Problem set: 1 solved, 718 unsolved
Search for dead transitions found 1 dead transitions in 75616ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 57/57 places, 719/720 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 56 transition count 718
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 56 transition count 718
Applied a total of 2 rules in 41 ms. Remains 56 /57 variables (removed 1) and now considering 718/719 (removed 1) transitions.
// Phase 1: matrix 718 rows 56 cols
[2024-05-22 05:51:47] [INFO ] Computed 12 invariants in 7 ms
[2024-05-22 05:51:47] [INFO ] Implicit Places using invariants in 296 ms returned [55]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 299 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 55/57 places, 718/720 transitions.
Applied a total of 0 rules in 39 ms. Remains 55 /55 variables (removed 0) and now considering 718/718 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 77237 ms. Remains : 55/57 places, 718/720 transitions.
RANDOM walk for 40000 steps (60 resets) in 710 ms. (56 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (218 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1159930 steps, run timeout after 3001 ms. (steps per millisecond=386 ) properties seen :0 out of 1
Probabilistic random walk after 1159930 steps, saw 161062 distinct states, run finished after 3001 ms. (steps per millisecond=386 ) properties seen :0
// Phase 1: matrix 718 rows 55 cols
[2024-05-22 05:51:50] [INFO ] Computed 11 invariants in 5 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 700/721 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/721 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 52/773 variables, 34/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/773 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/773 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/773 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 773/773 variables, and 66 constraints, problems are : Problem set: 0 solved, 1 unsolved in 294 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 55/55 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/21 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 700/721 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/721 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 52/773 variables, 34/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/773 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/773 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/773 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/773 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 773/773 variables, and 67 constraints, problems are : Problem set: 0 solved, 1 unsolved in 370 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 682ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 55 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 718/718 transitions.
Applied a total of 0 rules in 45 ms. Remains 55 /55 variables (removed 0) and now considering 718/718 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 55/55 places, 718/718 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 55/55 places, 718/718 transitions.
Applied a total of 0 rules in 45 ms. Remains 55 /55 variables (removed 0) and now considering 718/718 (removed 0) transitions.
[2024-05-22 05:51:51] [INFO ] Invariant cache hit.
[2024-05-22 05:51:52] [INFO ] Implicit Places using invariants in 477 ms returned []
[2024-05-22 05:51:52] [INFO ] Invariant cache hit.
[2024-05-22 05:51:52] [INFO ] Implicit Places using invariants and state equation in 825 ms returned []
Implicit Place search using SMT with State Equation took 1313 ms to find 0 implicit places.
[2024-05-22 05:51:53] [INFO ] Redundant transitions in 196 ms returned []
Running 717 sub problems to find dead transitions.
[2024-05-22 05:51:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 717 unsolved
[2024-05-22 05:52:09] [INFO ] Deduced a trap composed of 3 places in 530 ms of which 2 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 717 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 717 unsolved
At refinement iteration 3 (OVERLAPS) 718/773 variables, 55/67 constraints. Problems are: Problem set: 0 solved, 717 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/773 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 717 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 773/773 variables, and 67 constraints, problems are : Problem set: 0 solved, 717 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 717/717 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 717 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 717 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 717 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 717 unsolved
At refinement iteration 3 (OVERLAPS) 718/773 variables, 55/67 constraints. Problems are: Problem set: 0 solved, 717 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 773/773 variables, and 784 constraints, problems are : Problem set: 0 solved, 717 unsolved in 31643 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 717/717 constraints, Known Traps: 1/1 constraints]
After SMT, in 74968ms problems are : Problem set: 0 solved, 717 unsolved
Search for dead transitions found 0 dead transitions in 74984ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76550 ms. Remains : 55/55 places, 718/718 transitions.
[2024-05-22 05:53:08] [INFO ] Flatten gal took : 173 ms
[2024-05-22 05:53:08] [INFO ] Flatten gal took : 188 ms
[2024-05-22 05:53:08] [INFO ] Input system was already deterministic with 1513 transitions.
Computed a total of 60 stabilizing places and 61 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 350/350 places, 1513/1513 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 331 transition count 1494
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 331 transition count 1494
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 328 transition count 1491
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 328 transition count 1491
Applied a total of 44 rules in 29 ms. Remains 328 /350 variables (removed 22) and now considering 1491/1513 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 328/350 places, 1491/1513 transitions.
[2024-05-22 05:53:09] [INFO ] Flatten gal took : 105 ms
[2024-05-22 05:53:09] [INFO ] Flatten gal took : 110 ms
[2024-05-22 05:53:09] [INFO ] Input system was already deterministic with 1491 transitions.
Starting structural reductions in LTL mode, iteration 0 : 350/350 places, 1513/1513 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 328 transition count 1491
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 328 transition count 1491
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 50 place count 322 transition count 1485
Iterating global reduction 0 with 6 rules applied. Total rules applied 56 place count 322 transition count 1485
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 321 transition count 1484
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 321 transition count 1484
Applied a total of 58 rules in 36 ms. Remains 321 /350 variables (removed 29) and now considering 1484/1513 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 321/350 places, 1484/1513 transitions.
[2024-05-22 05:53:09] [INFO ] Flatten gal took : 107 ms
[2024-05-22 05:53:09] [INFO ] Flatten gal took : 106 ms
[2024-05-22 05:53:09] [INFO ] Input system was already deterministic with 1484 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 350/350 places, 1513/1513 transitions.
Graph (trivial) has 333 edges and 350 vertex of which 4 / 350 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 140 rules applied. Total rules applied 141 place count 347 transition count 1370
Reduce places removed 140 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 1 with 191 rules applied. Total rules applied 332 place count 207 transition count 1319
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 362 place count 177 transition count 1319
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 362 place count 177 transition count 1310
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 380 place count 168 transition count 1310
Discarding 17 places :
Symmetric choice reduction at 3 with 17 rule applications. Total rules 397 place count 151 transition count 1293
Iterating global reduction 3 with 17 rules applied. Total rules applied 414 place count 151 transition count 1293
Ensure Unique test removed 324 transitions
Reduce isomorphic transitions removed 324 transitions.
Iterating post reduction 3 with 324 rules applied. Total rules applied 738 place count 151 transition count 969
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 738 place count 151 transition count 968
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 740 place count 150 transition count 968
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 744 place count 146 transition count 932
Iterating global reduction 4 with 4 rules applied. Total rules applied 748 place count 146 transition count 932
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 8 rules applied. Total rules applied 756 place count 146 transition count 924
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 760 place count 142 transition count 924
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 1 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 6 with 100 rules applied. Total rules applied 860 place count 92 transition count 874
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 861 place count 92 transition count 873
Discarding 13 places :
Symmetric choice reduction at 7 with 13 rule applications. Total rules 874 place count 79 transition count 755
Iterating global reduction 7 with 13 rules applied. Total rules applied 887 place count 79 transition count 755
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 7 with 6 rules applied. Total rules applied 893 place count 79 transition count 749
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 8 with 3 rules applied. Total rules applied 896 place count 76 transition count 749
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 898 place count 75 transition count 748
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 899 place count 75 transition count 747
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 900 place count 75 transition count 747
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 902 place count 73 transition count 745
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 903 place count 72 transition count 745
Applied a total of 903 rules in 790 ms. Remains 72 /350 variables (removed 278) and now considering 745/1513 (removed 768) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 791 ms. Remains : 72/350 places, 745/1513 transitions.
[2024-05-22 05:53:10] [INFO ] Flatten gal took : 99 ms
[2024-05-22 05:53:10] [INFO ] Flatten gal took : 98 ms
[2024-05-22 05:53:11] [INFO ] Input system was already deterministic with 745 transitions.
Starting structural reductions in LTL mode, iteration 0 : 350/350 places, 1513/1513 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 326 transition count 1489
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 326 transition count 1489
Ensure Unique test removed 324 transitions
Reduce isomorphic transitions removed 324 transitions.
Iterating post reduction 0 with 324 rules applied. Total rules applied 372 place count 326 transition count 1165
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 378 place count 320 transition count 1159
Iterating global reduction 1 with 6 rules applied. Total rules applied 384 place count 320 transition count 1159
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 385 place count 319 transition count 1158
Iterating global reduction 1 with 1 rules applied. Total rules applied 386 place count 319 transition count 1158
Applied a total of 386 rules in 37 ms. Remains 319 /350 variables (removed 31) and now considering 1158/1513 (removed 355) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 319/350 places, 1158/1513 transitions.
[2024-05-22 05:53:11] [INFO ] Flatten gal took : 73 ms
[2024-05-22 05:53:11] [INFO ] Flatten gal took : 81 ms
[2024-05-22 05:53:11] [INFO ] Input system was already deterministic with 1158 transitions.
Starting structural reductions in LTL mode, iteration 0 : 350/350 places, 1513/1513 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 327 transition count 1490
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 327 transition count 1490
Ensure Unique test removed 324 transitions
Reduce isomorphic transitions removed 324 transitions.
Iterating post reduction 0 with 324 rules applied. Total rules applied 370 place count 327 transition count 1166
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 375 place count 322 transition count 1161
Iterating global reduction 1 with 5 rules applied. Total rules applied 380 place count 322 transition count 1161
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 381 place count 321 transition count 1160
Iterating global reduction 1 with 1 rules applied. Total rules applied 382 place count 321 transition count 1160
Applied a total of 382 rules in 36 ms. Remains 321 /350 variables (removed 29) and now considering 1160/1513 (removed 353) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 321/350 places, 1160/1513 transitions.
[2024-05-22 05:53:11] [INFO ] Flatten gal took : 73 ms
[2024-05-22 05:53:11] [INFO ] Flatten gal took : 78 ms
[2024-05-22 05:53:11] [INFO ] Input system was already deterministic with 1160 transitions.
Starting structural reductions in LTL mode, iteration 0 : 350/350 places, 1513/1513 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 327 transition count 1490
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 327 transition count 1490
Ensure Unique test removed 324 transitions
Reduce isomorphic transitions removed 324 transitions.
Iterating post reduction 0 with 324 rules applied. Total rules applied 370 place count 327 transition count 1166
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 376 place count 321 transition count 1160
Iterating global reduction 1 with 6 rules applied. Total rules applied 382 place count 321 transition count 1160
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 383 place count 320 transition count 1159
Iterating global reduction 1 with 1 rules applied. Total rules applied 384 place count 320 transition count 1159
Applied a total of 384 rules in 31 ms. Remains 320 /350 variables (removed 30) and now considering 1159/1513 (removed 354) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 320/350 places, 1159/1513 transitions.
[2024-05-22 05:53:11] [INFO ] Flatten gal took : 72 ms
[2024-05-22 05:53:12] [INFO ] Flatten gal took : 77 ms
[2024-05-22 05:53:12] [INFO ] Input system was already deterministic with 1159 transitions.
Starting structural reductions in LTL mode, iteration 0 : 350/350 places, 1513/1513 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 329 transition count 1492
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 329 transition count 1492
Ensure Unique test removed 324 transitions
Reduce isomorphic transitions removed 324 transitions.
Iterating post reduction 0 with 324 rules applied. Total rules applied 366 place count 329 transition count 1168
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 371 place count 324 transition count 1163
Iterating global reduction 1 with 5 rules applied. Total rules applied 376 place count 324 transition count 1163
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 377 place count 323 transition count 1162
Iterating global reduction 1 with 1 rules applied. Total rules applied 378 place count 323 transition count 1162
Applied a total of 378 rules in 32 ms. Remains 323 /350 variables (removed 27) and now considering 1162/1513 (removed 351) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 323/350 places, 1162/1513 transitions.
[2024-05-22 05:53:12] [INFO ] Flatten gal took : 71 ms
[2024-05-22 05:53:12] [INFO ] Flatten gal took : 83 ms
[2024-05-22 05:53:12] [INFO ] Input system was already deterministic with 1162 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 350/350 places, 1513/1513 transitions.
Graph (trivial) has 331 edges and 350 vertex of which 4 / 350 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 139 transitions
Trivial Post-agglo rules discarded 139 transitions
Performed 139 trivial Post agglomeration. Transition count delta: 139
Iterating post reduction 0 with 139 rules applied. Total rules applied 140 place count 347 transition count 1371
Reduce places removed 139 places and 0 transitions.
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 1 with 190 rules applied. Total rules applied 330 place count 208 transition count 1320
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 360 place count 178 transition count 1320
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 360 place count 178 transition count 1312
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 376 place count 170 transition count 1312
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 392 place count 154 transition count 1296
Iterating global reduction 3 with 16 rules applied. Total rules applied 408 place count 154 transition count 1296
Ensure Unique test removed 324 transitions
Reduce isomorphic transitions removed 324 transitions.
Iterating post reduction 3 with 324 rules applied. Total rules applied 732 place count 154 transition count 972
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 732 place count 154 transition count 971
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 734 place count 153 transition count 971
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 738 place count 149 transition count 935
Iterating global reduction 4 with 4 rules applied. Total rules applied 742 place count 149 transition count 935
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 4 with 8 rules applied. Total rules applied 750 place count 149 transition count 927
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 754 place count 145 transition count 927
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 0 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 6 with 102 rules applied. Total rules applied 856 place count 94 transition count 876
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 857 place count 94 transition count 875
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 871 place count 80 transition count 749
Iterating global reduction 7 with 14 rules applied. Total rules applied 885 place count 80 transition count 749
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 7 with 10 rules applied. Total rules applied 895 place count 80 transition count 739
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 8 with 5 rules applied. Total rules applied 900 place count 75 transition count 739
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 902 place count 74 transition count 738
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 903 place count 74 transition count 737
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 905 place count 72 transition count 735
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 906 place count 71 transition count 735
Applied a total of 906 rules in 247 ms. Remains 71 /350 variables (removed 279) and now considering 735/1513 (removed 778) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 247 ms. Remains : 71/350 places, 735/1513 transitions.
[2024-05-22 05:53:12] [INFO ] Flatten gal took : 81 ms
[2024-05-22 05:53:12] [INFO ] Flatten gal took : 84 ms
[2024-05-22 05:53:13] [INFO ] Input system was already deterministic with 735 transitions.
Starting structural reductions in LTL mode, iteration 0 : 350/350 places, 1513/1513 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 327 transition count 1490
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 327 transition count 1490
Ensure Unique test removed 324 transitions
Reduce isomorphic transitions removed 324 transitions.
Iterating post reduction 0 with 324 rules applied. Total rules applied 370 place count 327 transition count 1166
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 376 place count 321 transition count 1160
Iterating global reduction 1 with 6 rules applied. Total rules applied 382 place count 321 transition count 1160
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 383 place count 320 transition count 1159
Iterating global reduction 1 with 1 rules applied. Total rules applied 384 place count 320 transition count 1159
Applied a total of 384 rules in 33 ms. Remains 320 /350 variables (removed 30) and now considering 1159/1513 (removed 354) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 320/350 places, 1159/1513 transitions.
[2024-05-22 05:53:13] [INFO ] Flatten gal took : 67 ms
[2024-05-22 05:53:13] [INFO ] Flatten gal took : 73 ms
[2024-05-22 05:53:13] [INFO ] Input system was already deterministic with 1159 transitions.
Starting structural reductions in LTL mode, iteration 0 : 350/350 places, 1513/1513 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 326 transition count 1489
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 326 transition count 1489
Ensure Unique test removed 324 transitions
Reduce isomorphic transitions removed 324 transitions.
Iterating post reduction 0 with 324 rules applied. Total rules applied 372 place count 326 transition count 1165
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 378 place count 320 transition count 1159
Iterating global reduction 1 with 6 rules applied. Total rules applied 384 place count 320 transition count 1159
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 385 place count 319 transition count 1158
Iterating global reduction 1 with 1 rules applied. Total rules applied 386 place count 319 transition count 1158
Applied a total of 386 rules in 36 ms. Remains 319 /350 variables (removed 31) and now considering 1158/1513 (removed 355) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 319/350 places, 1158/1513 transitions.
[2024-05-22 05:53:13] [INFO ] Flatten gal took : 68 ms
[2024-05-22 05:53:13] [INFO ] Flatten gal took : 73 ms
[2024-05-22 05:53:13] [INFO ] Input system was already deterministic with 1158 transitions.
Starting structural reductions in LTL mode, iteration 0 : 350/350 places, 1513/1513 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 327 transition count 1490
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 327 transition count 1490
Ensure Unique test removed 324 transitions
Reduce isomorphic transitions removed 324 transitions.
Iterating post reduction 0 with 324 rules applied. Total rules applied 370 place count 327 transition count 1166
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 376 place count 321 transition count 1160
Iterating global reduction 1 with 6 rules applied. Total rules applied 382 place count 321 transition count 1160
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 383 place count 320 transition count 1159
Iterating global reduction 1 with 1 rules applied. Total rules applied 384 place count 320 transition count 1159
Applied a total of 384 rules in 30 ms. Remains 320 /350 variables (removed 30) and now considering 1159/1513 (removed 354) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 320/350 places, 1159/1513 transitions.
[2024-05-22 05:53:13] [INFO ] Flatten gal took : 66 ms
[2024-05-22 05:53:13] [INFO ] Flatten gal took : 71 ms
[2024-05-22 05:53:14] [INFO ] Input system was already deterministic with 1159 transitions.
Starting structural reductions in LTL mode, iteration 0 : 350/350 places, 1513/1513 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 326 transition count 1489
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 326 transition count 1489
Ensure Unique test removed 324 transitions
Reduce isomorphic transitions removed 324 transitions.
Iterating post reduction 0 with 324 rules applied. Total rules applied 372 place count 326 transition count 1165
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 378 place count 320 transition count 1159
Iterating global reduction 1 with 6 rules applied. Total rules applied 384 place count 320 transition count 1159
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 385 place count 319 transition count 1158
Iterating global reduction 1 with 1 rules applied. Total rules applied 386 place count 319 transition count 1158
Applied a total of 386 rules in 30 ms. Remains 319 /350 variables (removed 31) and now considering 1158/1513 (removed 355) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 319/350 places, 1158/1513 transitions.
[2024-05-22 05:53:14] [INFO ] Flatten gal took : 65 ms
[2024-05-22 05:53:14] [INFO ] Flatten gal took : 70 ms
[2024-05-22 05:53:14] [INFO ] Input system was already deterministic with 1158 transitions.
[2024-05-22 05:53:14] [INFO ] Flatten gal took : 83 ms
[2024-05-22 05:53:14] [INFO ] Flatten gal took : 87 ms
[2024-05-22 05:53:14] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 4 ms.
[2024-05-22 05:53:14] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 350 places, 1513 transitions and 16161 arcs took 23 ms.
Total runtime 240779 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running AutonomousCar-PT-09b

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/413/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 350
TRANSITIONS: 1513
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.090s, Sys 0.014s]


SAVING FILE /home/mcc/execution/413/model (.net / .def) ...
EXPORT TIME: [User 0.010s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 678
MODEL NAME: /home/mcc/execution/413/model
350 places, 1513 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA AutonomousCar-PT-09b-CTLCardinality-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-09b-CTLCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-09b-CTLCardinality-2023-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-09b-CTLCardinality-2024-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-09b-CTLCardinality-2023-14 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-09b-CTLCardinality-2023-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-09b-CTLCardinality-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-09b-CTLCardinality-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-09b-CTLCardinality-2023-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA AutonomousCar-PT-09b-CTLCardinality-2024-00 CANNOT_COMPUTE
FORMULA AutonomousCar-PT-09b-CTLCardinality-2024-08 CANNOT_COMPUTE
FORMULA AutonomousCar-PT-09b-CTLCardinality-2024-09 CANNOT_COMPUTE
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716358304771

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="AutonomousCar-PT-09b"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is AutonomousCar-PT-09b, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r025-smll-171620166400353"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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