fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r289-tajo-171654446100497
Last Updated
July 7, 2024

About the Execution of GreatSPN+red for PolyORBNT-PT-S10J40

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
12695.752 3600000.00 12632126.00 219.50 ?FT?F?F?T?FTF??F normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 19M
-rw-r--r-- 1 mcc users 32K Apr 12 11:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 145K Apr 12 11:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 249K Apr 12 10:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 904K Apr 12 10:56 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 12K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 49K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 56K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 190K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 46K Apr 12 13:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 233K Apr 12 13:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 627K Apr 12 13:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.5M Apr 12 13:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 9.5K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 21K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 14M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716891807404

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S10J40
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 10:23:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 10:23:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 10:23:29] [INFO ] Load time of PNML (sax parser for PT used): 671 ms
[2024-05-28 10:23:29] [INFO ] Transformed 854 places.
[2024-05-28 10:23:29] [INFO ] Transformed 12340 transitions.
[2024-05-28 10:23:29] [INFO ] Parsed PT model containing 854 places and 12340 transitions and 113999 arcs in 900 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 23 ms.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Support contains 720 out of 854 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 854/854 places, 2230/2230 transitions.
Ensure Unique test removed 9 places
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 845 transition count 2230
Applied a total of 9 rules in 89 ms. Remains 845 /854 variables (removed 9) and now considering 2230/2230 (removed 0) transitions.
Running 2219 sub problems to find dead transitions.
[2024-05-28 10:23:30] [INFO ] Flow matrix only has 2221 transitions (discarded 9 similar events)
// Phase 1: matrix 2221 rows 845 cols
[2024-05-28 10:23:30] [INFO ] Computed 103 invariants in 137 ms
[2024-05-28 10:23:30] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
At refinement iteration 0 (INCLUDED_ONLY) 0/833 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2219 unsolved
SMT process timed out in 37370ms, After SMT, problems are : Problem set: 0 solved, 2219 unsolved
Search for dead transitions found 0 dead transitions in 37423ms
[2024-05-28 10:24:07] [INFO ] Flow matrix only has 2221 transitions (discarded 9 similar events)
[2024-05-28 10:24:07] [INFO ] Invariant cache hit.
[2024-05-28 10:24:07] [INFO ] Implicit Places using invariants in 522 ms returned []
[2024-05-28 10:24:07] [INFO ] Flow matrix only has 2221 transitions (discarded 9 similar events)
[2024-05-28 10:24:07] [INFO ] Invariant cache hit.
[2024-05-28 10:24:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 10:24:14] [INFO ] Implicit Places using invariants and state equation in 7037 ms returned []
Implicit Place search using SMT with State Equation took 7570 ms to find 0 implicit places.
Running 2219 sub problems to find dead transitions.
[2024-05-28 10:24:15] [INFO ] Flow matrix only has 2221 transitions (discarded 9 similar events)
[2024-05-28 10:24:15] [INFO ] Invariant cache hit.
[2024-05-28 10:24:15] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/833 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/833 variables, 10/91 constraints. Problems are: Problem set: 0 solved, 2219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 833/3066 variables, and 91 constraints, problems are : Problem set: 0 solved, 2219 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 10/22 constraints, State Equation: 0/845 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2219/1219 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/833 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/833 variables, 10/91 constraints. Problems are: Problem set: 0 solved, 2219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 833/3066 variables, and 91 constraints, problems are : Problem set: 0 solved, 2219 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 10/22 constraints, State Equation: 0/845 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1219 constraints, Known Traps: 0/0 constraints]
After SMT, in 79251ms problems are : Problem set: 0 solved, 2219 unsolved
Search for dead transitions found 0 dead transitions in 79288ms
Starting structural reductions in LTL mode, iteration 1 : 845/854 places, 2230/2230 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 124454 ms. Remains : 845/854 places, 2230/2230 transitions.
Support contains 720 out of 845 places after structural reductions.
[2024-05-28 10:25:34] [INFO ] Flatten gal took : 286 ms
[2024-05-28 10:25:35] [INFO ] Flatten gal took : 181 ms
[2024-05-28 10:25:35] [INFO ] Input system was already deterministic with 2230 transitions.
Support contains 718 out of 845 places (down from 720) after GAL structural reductions.
RANDOM walk for 40000 steps (2239 resets) in 4401 ms. (9 steps per ms) remains 60/61 properties
BEST_FIRST walk for 4004 steps (40 resets) in 68 ms. (58 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (39 resets) in 58 ms. (67 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (40 resets) in 68 ms. (58 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (40 resets) in 98 ms. (40 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (40 resets) in 129 ms. (30 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (48 resets) in 85 ms. (46 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (41 resets) in 46 ms. (85 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (40 resets) in 62 ms. (63 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (48 resets) in 50 ms. (78 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (40 resets) in 43 ms. (91 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (41 resets) in 37 ms. (105 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (40 resets) in 40 ms. (97 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (41 resets) in 41 ms. (95 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (40 resets) in 78 ms. (50 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (40 resets) in 51 ms. (77 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (40 resets) in 44 ms. (88 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (39 resets) in 47 ms. (83 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (41 resets) in 39 ms. (100 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (39 resets) in 53 ms. (74 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (39 resets) in 44 ms. (88 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (40 resets) in 44 ms. (88 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (40 resets) in 57 ms. (69 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4001 steps (41 resets) in 63 ms. (62 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (40 resets) in 42 ms. (93 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (40 resets) in 45 ms. (87 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (41 resets) in 45 ms. (87 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (39 resets) in 41 ms. (95 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (40 resets) in 39 ms. (100 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (40 resets) in 37 ms. (105 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4002 steps (39 resets) in 35 ms. (111 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (40 resets) in 40 ms. (97 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (40 resets) in 37 ms. (105 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (42 resets) in 37 ms. (105 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (40 resets) in 36 ms. (108 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (40 resets) in 47 ms. (83 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (39 resets) in 46 ms. (85 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (40 resets) in 40 ms. (97 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (40 resets) in 36 ms. (108 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (40 resets) in 36 ms. (108 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (40 resets) in 36 ms. (108 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (40 resets) in 36 ms. (108 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (40 resets) in 36 ms. (108 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (40 resets) in 36 ms. (108 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (40 resets) in 36 ms. (108 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (40 resets) in 36 ms. (108 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (40 resets) in 34 ms. (114 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (40 resets) in 34 ms. (114 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (39 resets) in 36 ms. (108 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4004 steps (40 resets) in 36 ms. (108 steps per ms) remains 60/60 properties
BEST_FIRST walk for 4003 steps (40 resets) in 36 ms. (108 steps per ms) remains 60/60 properties
Interrupted probabilistic random walk after 142429 steps, run timeout after 6001 ms. (steps per millisecond=23 ) properties seen :10 out of 60
Probabilistic random walk after 142429 steps, saw 42038 distinct states, run finished after 6010 ms. (steps per millisecond=23 ) properties seen :10
[2024-05-28 10:25:43] [INFO ] Flow matrix only has 2221 transitions (discarded 9 similar events)
[2024-05-28 10:25:43] [INFO ] Invariant cache hit.
[2024-05-28 10:25:43] [INFO ] State equation strengthened by 1 read => feed constraints.
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp43 is UNSAT
Problem AtomicPropp46 is UNSAT
Problem AtomicPropp50 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/674 variables, 3/3 constraints. Problems are: Problem set: 6 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/674 variables, 0/3 constraints. Problems are: Problem set: 6 solved, 44 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp39 is UNSAT
Problem AtomicPropp40 is UNSAT
Problem AtomicPropp41 is UNSAT
Problem AtomicPropp45 is UNSAT
Problem AtomicPropp52 is UNSAT
Problem AtomicPropp54 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp57 is UNSAT
Problem AtomicPropp58 is UNSAT
Problem AtomicPropp60 is UNSAT
At refinement iteration 2 (OVERLAPS) 156/830 variables, 77/80 constraints. Problems are: Problem set: 27 solved, 23 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp23 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/830 variables, 13/93 constraints. Problems are: Problem set: 31 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/830 variables, 0/93 constraints. Problems are: Problem set: 31 solved, 19 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp24 is UNSAT
At refinement iteration 5 (OVERLAPS) 13/843 variables, 9/102 constraints. Problems are: Problem set: 35 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/843 variables, 0/102 constraints. Problems are: Problem set: 35 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 1/844 variables, 1/103 constraints. Problems are: Problem set: 35 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/844 variables, 0/103 constraints. Problems are: Problem set: 35 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 2221/3065 variables, 844/947 constraints. Problems are: Problem set: 35 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3065 variables, 1/948 constraints. Problems are: Problem set: 35 solved, 15 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3065 variables, 0/948 constraints. Problems are: Problem set: 35 solved, 15 unsolved
At refinement iteration 12 (OVERLAPS) 1/3066 variables, 1/949 constraints. Problems are: Problem set: 35 solved, 15 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3066 variables, 0/949 constraints. Problems are: Problem set: 35 solved, 15 unsolved
At refinement iteration 14 (OVERLAPS) 0/3066 variables, 0/949 constraints. Problems are: Problem set: 35 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3066/3066 variables, and 949 constraints, problems are : Problem set: 35 solved, 15 unsolved in 4825 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 845/845 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 50/45 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 35 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/560 variables, 0/0 constraints. Problems are: Problem set: 35 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 237/797 variables, 80/80 constraints. Problems are: Problem set: 35 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/797 variables, 3/83 constraints. Problems are: Problem set: 35 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/797 variables, 0/83 constraints. Problems are: Problem set: 35 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 46/843 variables, 19/102 constraints. Problems are: Problem set: 35 solved, 15 unsolved
[2024-05-28 10:25:50] [INFO ] Deduced a trap composed of 24 places in 600 ms of which 49 ms to minimize.
[2024-05-28 10:25:51] [INFO ] Deduced a trap composed of 418 places in 526 ms of which 7 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/843 variables, 2/104 constraints. Problems are: Problem set: 35 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/843 variables, 0/104 constraints. Problems are: Problem set: 35 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 1/844 variables, 1/105 constraints. Problems are: Problem set: 35 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/844 variables, 0/105 constraints. Problems are: Problem set: 35 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3065/3066 variables, and 949 constraints, problems are : Problem set: 35 solved, 15 unsolved in 5013 ms.
Refiners :[Positive P Invariants (semi-flows): 81/81 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 844/845 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2/45 constraints, Known Traps: 2/2 constraints]
After SMT, in 10170ms problems are : Problem set: 35 solved, 15 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 560 out of 845 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 845/845 places, 2230/2230 transitions.
Ensure Unique test removed 1 places
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 0 with 3 rules applied. Total rules applied 3 place count 844 transition count 2228
Reduce places removed 2 places and 0 transitions.
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Iterating post reduction 1 with 41 rules applied. Total rules applied 44 place count 842 transition count 2189
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 83 place count 803 transition count 2189
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 83 place count 803 transition count 2186
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 89 place count 800 transition count 2186
Applied a total of 89 rules in 278 ms. Remains 800 /845 variables (removed 45) and now considering 2186/2230 (removed 44) transitions.
Running 2175 sub problems to find dead transitions.
[2024-05-28 10:25:54] [INFO ] Flow matrix only has 2177 transitions (discarded 9 similar events)
// Phase 1: matrix 2177 rows 800 cols
[2024-05-28 10:25:54] [INFO ] Computed 102 invariants in 92 ms
[2024-05-28 10:25:54] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/790 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 2175 unsolved
SMT process timed out in 37740ms, After SMT, problems are : Problem set: 0 solved, 2175 unsolved
Search for dead transitions found 0 dead transitions in 37763ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38049 ms. Remains : 800/845 places, 2186/2230 transitions.
RANDOM walk for 40000 steps (2531 resets) in 2416 ms. (16 steps per ms) remains 1/15 properties
BEST_FIRST walk for 40004 steps (319 resets) in 514 ms. (77 steps per ms) remains 1/1 properties
[2024-05-28 10:26:32] [INFO ] Flow matrix only has 2177 transitions (discarded 9 similar events)
[2024-05-28 10:26:32] [INFO ] Invariant cache hit.
[2024-05-28 10:26:32] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 270/725 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/725 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 73/798 variables, 22/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/798 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/799 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/799 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2177/2976 variables, 799/901 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2976 variables, 1/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2976 variables, 0/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/2977 variables, 1/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2977 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/2977 variables, 0/903 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2977/2977 variables, and 903 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1862 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 800/800 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 270/725 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/725 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 73/798 variables, 22/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/798 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/799 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/799 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 2177/2976 variables, 799/901 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2976 variables, 1/902 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-28 10:26:36] [INFO ] Deduced a trap composed of 416 places in 580 ms of which 6 ms to minimize.
[2024-05-28 10:26:37] [INFO ] Deduced a trap composed of 196 places in 501 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/2976 variables, 2/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2976 variables, 0/904 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2977/2977 variables, and 905 constraints, problems are : Problem set: 0 solved, 1 unsolved in 7469 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 800/800 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 2/2 constraints]
After SMT, in 9411ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 51 ms.
Support contains 455 out of 800 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 800/800 places, 2186/2186 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 800 transition count 2181
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 795 transition count 2181
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 42 Pre rules applied. Total rules applied 10 place count 795 transition count 2139
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 94 place count 753 transition count 2139
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 95 place count 752 transition count 2138
Iterating global reduction 2 with 1 rules applied. Total rules applied 96 place count 752 transition count 2138
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 100 place count 750 transition count 2136
Applied a total of 100 rules in 212 ms. Remains 750 /800 variables (removed 50) and now considering 2136/2186 (removed 50) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 213 ms. Remains : 750/800 places, 2136/2186 transitions.
RANDOM walk for 40000 steps (2908 resets) in 1773 ms. (22 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (363 resets) in 532 ms. (75 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 166062 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :0 out of 1
Probabilistic random walk after 166062 steps, saw 28542 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :0
[2024-05-28 10:26:46] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
// Phase 1: matrix 2127 rows 750 cols
[2024-05-28 10:26:46] [INFO ] Computed 102 invariants in 52 ms
[2024-05-28 10:26:46] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 234/689 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/689 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 59/748 variables, 21/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/748 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/749 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/749 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2127/2876 variables, 749/851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2876 variables, 1/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2876 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/2877 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2877 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2877 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2877/2877 variables, and 853 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1189 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 750/750 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/455 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 234/689 variables, 79/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/689 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 59/748 variables, 21/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/748 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/749 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/749 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2127/2876 variables, 749/851 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2876 variables, 1/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2876 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/2877 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2877 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/2877 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2877/2877 variables, and 853 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3376 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 750/750 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 4712ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 42 ms.
Support contains 455 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 2136/2136 transitions.
Applied a total of 0 rules in 52 ms. Remains 750 /750 variables (removed 0) and now considering 2136/2136 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 750/750 places, 2136/2136 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 2136/2136 transitions.
Applied a total of 0 rules in 53 ms. Remains 750 /750 variables (removed 0) and now considering 2136/2136 (removed 0) transitions.
[2024-05-28 10:26:50] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2024-05-28 10:26:50] [INFO ] Invariant cache hit.
[2024-05-28 10:26:51] [INFO ] Implicit Places using invariants in 899 ms returned []
[2024-05-28 10:26:51] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2024-05-28 10:26:51] [INFO ] Invariant cache hit.
[2024-05-28 10:26:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-28 10:27:00] [INFO ] Implicit Places using invariants and state equation in 8490 ms returned []
Implicit Place search using SMT with State Equation took 9394 ms to find 0 implicit places.
[2024-05-28 10:27:00] [INFO ] Redundant transitions in 176 ms returned []
Running 2125 sub problems to find dead transitions.
[2024-05-28 10:27:00] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
[2024-05-28 10:27:00] [INFO ] Invariant cache hit.
[2024-05-28 10:27:00] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/740 variables, 12/92 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 4.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 4.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 0.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 9.0)
(s146 1.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 4.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 1.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 2.0)
(s265 0.0)
(s266 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 1.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 1.0)
(s287 1.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 1.0)
(s306 0.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 1.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 1.0)
(s335 0.0)
(s336 0.0)
(s337 1.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 4.0)
(s357 0.0)
(s358 0.0)
(s360 1.0)
(s361 0.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 0.0)
(s367 0.0)
(s368 0.0)
(s369 0.0)
(s370 0.0)
(s371 1.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 1.0)
(s377 0.0)
(s378 0.0)
(s379 0.0)
(s380 0.0)
(s381 0.0)
(s382 0.0)
(s383 0.0)
(s384 0.0)
(s385 0.0)
(s386 0.0)
(s387 0.0)
(s388 1.0)
(s389 0.0)
(s390 0.0)
(s391 0.0)
(s392 0.0)
(s393 0.0)
(s394 0.0)
(s395 0.0)
(s396 0.0)
(s397 0.0)
(s398 0.0)
(s399 0.0)
(s400 0.0)
(s401 0.0)
(s402 0.0)
(s403 0.0)
(s404 0.0)
(s405 0.0)
(s406 0.0)
(s407 0.0)
(s408 0.0)
(s409 0.0)
(s410 0.0)
(s411 0.0)
(s412 0.0)
(s413 0.0)
(s414 0.0)
(s415 1.0)
(s416 0.0)
(s417 0.0)
(s418 0.0)
(s419 0.0)
(s420 0.0)
(s421 0.0)
(s422 0.0)
(s423 0.0)
(s424 0.0)
(s425 0.0)
(s426 0.0)
(s427 0.0)
(s428 0.0)
(s429 0.0)
(s430 0.0)
(s431 1.0)
(s432 0.0)
(s433 0.0)
(s434 0.0)
(s435 0.0)
(s436 0.0)
(s437 0.0)
(s438 0.0)
(s439 0.0)
(s440 0.0)
(s441 0.0)
(s442 0.0)
(s443 0.0)
(s444 1.0)
(s446 0.0)
(s447 0.0)
(s448 0.0)
(s449 0.0)
(s450 0.0)
(s451 0.0)
(s452 0.0)
(s453 0.0)
(s454 4.0)
(s455 0.0)
(s456 0.0)
(s457 0.0)
(s458 0.0)
(s459 1.0)
(s460 0.0)
(s461 0.0)
(s462 0.0)
(s463 0.0)
(s464 0.0)
(s465 0.0)
(s466 0.0)
(s467 0.0)
(s468 0.0)
(s469 0.0)
(s470 0.0)
(s471 0.0)
(s472 0.0)
(s473 0.0)
(s474 0.0)
(s475 0.0)
(s476 0.0)
(s477 0.0)
(s478 0.0)
(s479 0.0)
(s481 0.0)
(s482 0.0)
(s483 0.0)
(s484 0.0)
(s485 0.0)
(s486 0.0)
(s487 0.0)
(s488 0.0)
(s489 0.0)
(s490 0.0)
(s491 0.0)
(s492 0.0)
(s493 0.0)
(s494 0.0)
(s495 0.0)
(s496 0.0)
(s497 0.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 0.0)
(s504 0.0)
(s505 0.0)
(s506 0.0)
(s507 0.0)
(s508 0.0)
(s509 0.0)
(s510 0.0)
(s511 0.0)
(s512 0.0)
(s513 0.0)
(s514 0.0)
(s515 0.0)
(s516 0.0)
(s517 0.0)
(s518 0.0)
(s519 0.0)
(s520 0.0)
(s521 0.0)
(s522 0.0)
(s523 0.0)
(s524 0.0)
(s525 0.0)
(s526 0.0)
(s527 0.0)
(s528 0.0)
(s529 0.0)
(s530 0.0)
(s531 0.0)
(s532 0.0)
(s533 0.0)
(s534 0.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 1.0)
(s543 0.0)
(s544 0.0)
(s545 0.0)
(s546 0.0)
(s547 0.0)
(s548 0.0)
(s549 0.0)
(s550 0.0)
(s551 0.0)
(s552 0.0)
(s553 0.0)
(s554 0.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)
(s562 0.0)
(s563 0.0)
(s564 0.0)
(s565 0.0)
(s567 0.0)
(s568 1.0)
(s570 0.0)
(s571 0.0)
(s572 4.0)
(s573 0.0)
(s574 0.0)
(s575 0.0)
(s576 0.0)
(s577 0.0)
(s578 0.0)
(s579 0.0)
(s580 0.0)
(s581 0.0)
(s582 0.0)
(s583 0.0)
(s584 0.0)
(s585 0.0)
(s586 0.0)
(s587 0.0)
(s588 4.0)
(s589 0.0)
(s590 0.0)
(s591 0.0)
(s592 0.0)
(s593 0.0)
(s594 0.0)
(s595 0.0)
(s596 0.0)
(s597 0.0)
(s598 0.0)
(s599 0.0)
(s600 0.0)
(s601 0.0)
(s602 1.0)
(s603 0.0)
(s604 0.0)
(s605 0.0)
(s606 0.0)
(s607 0.0)
(s608 0.0)
(s609 0.0)
(s610 0.0)
(s611 1.0)
(s612 0.0)
(s613 timeout
0.0)
(s614 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 740/2877 variables, and 92 constraints, problems are : Problem set: 0 solved, 2125 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 12/22 constraints, State Equation: 0/750 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2125/1125 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/740 variables, 12/92 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
[2024-05-28 10:27:53] [INFO ] Deduced a trap composed of 20 places in 310 ms of which 1 ms to minimize.
[2024-05-28 10:27:54] [INFO ] Deduced a trap composed of 22 places in 280 ms of which 1 ms to minimize.
[2024-05-28 10:27:54] [INFO ] Deduced a trap composed of 18 places in 287 ms of which 1 ms to minimize.
[2024-05-28 10:28:16] [INFO ] Deduced a trap composed of 13 places in 390 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 740/2877 variables, and 96 constraints, problems are : Problem set: 0 solved, 2125 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 12/22 constraints, State Equation: 0/750 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1125 constraints, Known Traps: 4/4 constraints]
After SMT, in 76613ms problems are : Problem set: 0 solved, 2125 unsolved
Search for dead transitions found 0 dead transitions in 76636ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86275 ms. Remains : 750/750 places, 2136/2136 transitions.
Successfully simplified 35 atomic propositions for a total of 16 simplifications.
Initial state reduction rules removed 3 formulas.
FORMULA PolyORBNT-PT-S10J40-CTLCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J40-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J40-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J40-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J40-CTLCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J40-CTLCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 10:28:17] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-28 10:28:17] [INFO ] Flatten gal took : 97 ms
FORMULA PolyORBNT-PT-S10J40-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-28 10:28:17] [INFO ] Flatten gal took : 106 ms
[2024-05-28 10:28:17] [INFO ] Input system was already deterministic with 2230 transitions.
Support contains 59 out of 845 places (down from 641) after GAL structural reductions.
FORMULA PolyORBNT-PT-S10J40-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 845/845 places, 2230/2230 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 844 transition count 2230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 843 transition count 2229
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 843 transition count 2229
Applied a total of 3 rules in 69 ms. Remains 843 /845 variables (removed 2) and now considering 2229/2230 (removed 1) transitions.
Running 2218 sub problems to find dead transitions.
[2024-05-28 10:28:17] [INFO ] Flow matrix only has 2220 transitions (discarded 9 similar events)
// Phase 1: matrix 2220 rows 843 cols
[2024-05-28 10:28:17] [INFO ] Computed 102 invariants in 27 ms
[2024-05-28 10:28:17] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 4.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 4.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s125 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 1.0)
(s147 1.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 1.0)
(s152 0.0)
(s153 1.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 1.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 9.0)
(s165 1.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
SMT process timed out in 37168ms, After SMT, problems are : Problem set: 0 solved, 2218 unsolved
Search for dead transitions found 0 dead transitions in 37187ms
Finished structural reductions in LTL mode , in 1 iterations and 37262 ms. Remains : 843/845 places, 2229/2230 transitions.
[2024-05-28 10:28:55] [INFO ] Flatten gal took : 127 ms
[2024-05-28 10:28:55] [INFO ] Flatten gal took : 126 ms
[2024-05-28 10:28:55] [INFO ] Input system was already deterministic with 2229 transitions.
Starting structural reductions in LTL mode, iteration 0 : 845/845 places, 2230/2230 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 844 transition count 2230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 843 transition count 2229
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 843 transition count 2229
Applied a total of 3 rules in 58 ms. Remains 843 /845 variables (removed 2) and now considering 2229/2230 (removed 1) transitions.
Running 2218 sub problems to find dead transitions.
[2024-05-28 10:28:55] [INFO ] Flow matrix only has 2220 transitions (discarded 9 similar events)
[2024-05-28 10:28:55] [INFO ] Invariant cache hit.
[2024-05-28 10:28:55] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
SMT process timed out in 36461ms, After SMT, problems are : Problem set: 0 solved, 2218 unsolved
Search for dead transitions found 0 dead transitions in 36480ms
Finished structural reductions in LTL mode , in 1 iterations and 36544 ms. Remains : 843/845 places, 2229/2230 transitions.
[2024-05-28 10:29:32] [INFO ] Flatten gal took : 92 ms
[2024-05-28 10:29:32] [INFO ] Flatten gal took : 97 ms
[2024-05-28 10:29:32] [INFO ] Input system was already deterministic with 2229 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 845/845 places, 2230/2230 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 844 transition count 2187
Reduce places removed 43 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 44 rules applied. Total rules applied 87 place count 801 transition count 2186
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 88 place count 800 transition count 2186
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 88 place count 800 transition count 2141
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 178 place count 755 transition count 2141
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 182 place count 753 transition count 2139
Applied a total of 182 rules in 185 ms. Remains 753 /845 variables (removed 92) and now considering 2139/2230 (removed 91) transitions.
Running 2128 sub problems to find dead transitions.
[2024-05-28 10:29:32] [INFO ] Flow matrix only has 2130 transitions (discarded 9 similar events)
// Phase 1: matrix 2130 rows 753 cols
[2024-05-28 10:29:32] [INFO ] Computed 102 invariants in 24 ms
[2024-05-28 10:29:32] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/743 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 2128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/743 variables, 12/92 constraints. Problems are: Problem set: 0 solved, 2128 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 743/2883 variables, and 92 constraints, problems are : Problem set: 0 solved, 2128 unsolved in 20031 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 12/22 constraints, State Equation: 0/753 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2128/1128 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/743 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 2128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/743 variables, 12/92 constraints. Problems are: Problem set: 0 solved, 2128 unsolved
[2024-05-28 10:30:19] [INFO ] Deduced a trap composed of 182 places in 473 ms of which 4 ms to minimize.
[2024-05-28 10:30:20] [INFO ] Deduced a trap composed of 324 places in 458 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 743/2883 variables, and 94 constraints, problems are : Problem set: 0 solved, 2128 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 12/22 constraints, State Equation: 0/753 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1128 constraints, Known Traps: 2/2 constraints]
After SMT, in 56654ms problems are : Problem set: 0 solved, 2128 unsolved
Search for dead transitions found 0 dead transitions in 56672ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 56863 ms. Remains : 753/845 places, 2139/2230 transitions.
[2024-05-28 10:30:29] [INFO ] Flatten gal took : 66 ms
[2024-05-28 10:30:29] [INFO ] Flatten gal took : 72 ms
[2024-05-28 10:30:29] [INFO ] Input system was already deterministic with 2139 transitions.
RANDOM walk for 1175 steps (87 resets) in 22 ms. (51 steps per ms) remains 0/1 properties
FORMULA PolyORBNT-PT-S10J40-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 845/845 places, 2230/2230 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 844 transition count 2230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 843 transition count 2229
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 843 transition count 2229
Applied a total of 3 rules in 53 ms. Remains 843 /845 variables (removed 2) and now considering 2229/2230 (removed 1) transitions.
Running 2218 sub problems to find dead transitions.
[2024-05-28 10:30:29] [INFO ] Flow matrix only has 2220 transitions (discarded 9 similar events)
// Phase 1: matrix 2220 rows 843 cols
[2024-05-28 10:30:29] [INFO ] Computed 102 invariants in 37 ms
[2024-05-28 10:30:29] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
SMT process timed out in 36878ms, After SMT, problems are : Problem set: 0 solved, 2218 unsolved
Search for dead transitions found 0 dead transitions in 36895ms
Finished structural reductions in LTL mode , in 1 iterations and 36954 ms. Remains : 843/845 places, 2229/2230 transitions.
[2024-05-28 10:31:06] [INFO ] Flatten gal took : 158 ms
[2024-05-28 10:31:06] [INFO ] Flatten gal took : 149 ms
[2024-05-28 10:31:07] [INFO ] Input system was already deterministic with 2229 transitions.
Starting structural reductions in LTL mode, iteration 0 : 845/845 places, 2230/2230 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 844 transition count 2230
Applied a total of 1 rules in 43 ms. Remains 844 /845 variables (removed 1) and now considering 2230/2230 (removed 0) transitions.
Running 2219 sub problems to find dead transitions.
[2024-05-28 10:31:07] [INFO ] Flow matrix only has 2221 transitions (discarded 9 similar events)
// Phase 1: matrix 2221 rows 844 cols
[2024-05-28 10:31:07] [INFO ] Computed 102 invariants in 26 ms
[2024-05-28 10:31:07] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/833 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2219 unsolved
SMT process timed out in 39110ms, After SMT, problems are : Problem set: 0 solved, 2219 unsolved
Search for dead transitions found 0 dead transitions in 39143ms
Finished structural reductions in LTL mode , in 1 iterations and 39194 ms. Remains : 844/845 places, 2230/2230 transitions.
[2024-05-28 10:31:46] [INFO ] Flatten gal took : 85 ms
[2024-05-28 10:31:46] [INFO ] Flatten gal took : 91 ms
[2024-05-28 10:31:46] [INFO ] Input system was already deterministic with 2230 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 845/845 places, 2230/2230 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 844 transition count 2184
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 92 place count 798 transition count 2184
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 92 place count 798 transition count 2139
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 182 place count 753 transition count 2139
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 183 place count 752 transition count 2138
Iterating global reduction 2 with 1 rules applied. Total rules applied 184 place count 752 transition count 2138
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 188 place count 750 transition count 2136
Applied a total of 188 rules in 153 ms. Remains 750 /845 variables (removed 95) and now considering 2136/2230 (removed 94) transitions.
Running 2125 sub problems to find dead transitions.
[2024-05-28 10:31:46] [INFO ] Flow matrix only has 2127 transitions (discarded 9 similar events)
// Phase 1: matrix 2127 rows 750 cols
[2024-05-28 10:31:46] [INFO ] Computed 102 invariants in 46 ms
[2024-05-28 10:31:46] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/740 variables, 12/92 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 740/2877 variables, and 92 constraints, problems are : Problem set: 0 solved, 2125 unsolved in 20043 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 12/22 constraints, State Equation: 0/750 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 2125/1125 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2125 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/740 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/740 variables, 12/92 constraints. Problems are: Problem set: 0 solved, 2125 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 740/2877 variables, and 92 constraints, problems are : Problem set: 0 solved, 2125 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 80/80 constraints, Generalized P Invariants (flows): 12/22 constraints, State Equation: 0/750 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 1000/1125 constraints, Known Traps: 0/0 constraints]
After SMT, in 56772ms problems are : Problem set: 0 solved, 2125 unsolved
Search for dead transitions found 0 dead transitions in 56790ms
Finished structural reductions in SI_CTL mode , in 1 iterations and 56949 ms. Remains : 750/845 places, 2136/2230 transitions.
[2024-05-28 10:32:43] [INFO ] Flatten gal took : 85 ms
[2024-05-28 10:32:43] [INFO ] Flatten gal took : 92 ms
[2024-05-28 10:32:43] [INFO ] Input system was already deterministic with 2136 transitions.
Starting structural reductions in LTL mode, iteration 0 : 845/845 places, 2230/2230 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 844 transition count 2230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 843 transition count 2229
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 843 transition count 2229
Applied a total of 3 rules in 54 ms. Remains 843 /845 variables (removed 2) and now considering 2229/2230 (removed 1) transitions.
Running 2218 sub problems to find dead transitions.
[2024-05-28 10:32:44] [INFO ] Flow matrix only has 2220 transitions (discarded 9 similar events)
// Phase 1: matrix 2220 rows 843 cols
[2024-05-28 10:32:44] [INFO ] Computed 102 invariants in 55 ms
[2024-05-28 10:32:44] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 1.0)
(s4 0.0)
(s5 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 1.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 4.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 1.0)
(s45 0.0)
(s46 0.0)
(s47 1.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 1.0)
(s84 1.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 1.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 1.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 1.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 4.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s125 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
SMT process timed out in 36466ms, After SMT, problems are : Problem set: 0 solved, 2218 unsolved
Search for dead transitions found 0 dead transitions in 36485ms
Finished structural reductions in LTL mode , in 1 iterations and 36545 ms. Remains : 843/845 places, 2229/2230 transitions.
[2024-05-28 10:33:20] [INFO ] Flatten gal took : 111 ms
[2024-05-28 10:33:20] [INFO ] Flatten gal took : 138 ms
[2024-05-28 10:33:21] [INFO ] Input system was already deterministic with 2229 transitions.
Starting structural reductions in LTL mode, iteration 0 : 845/845 places, 2230/2230 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 844 transition count 2230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 843 transition count 2229
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 843 transition count 2229
Applied a total of 3 rules in 67 ms. Remains 843 /845 variables (removed 2) and now considering 2229/2230 (removed 1) transitions.
Running 2218 sub problems to find dead transitions.
[2024-05-28 10:33:21] [INFO ] Flow matrix only has 2220 transitions (discarded 9 similar events)
[2024-05-28 10:33:21] [INFO ] Invariant cache hit.
[2024-05-28 10:33:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/832 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 2218 unsolved
SMT process timed out in 36389ms, After SMT, problems are : Problem set: 0 solved, 2218 unsolved
Search for dead transitions found 0 dead transitions in 36412ms
Finished structural reductions in LTL mode , in 1 iterations and 36485 ms. Remains : 843/845 places, 2229/2230 transitions.
[2024-05-28 10:33:57] [INFO ] Flatten gal took : 87 ms
[2024-05-28 10:33:57] [INFO ] Flatten gal took : 93 ms
[2024-05-28 10:33:57] [INFO ] Input system was already deterministic with 2229 transitions.
[2024-05-28 10:33:58] [INFO ] Flatten gal took : 92 ms
[2024-05-28 10:33:58] [INFO ] Flatten gal took : 92 ms
[2024-05-28 10:33:58] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2024-05-28 10:33:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 845 places, 2230 transitions and 14411 arcs took 20 ms.
Total runtime 629497 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running PolyORBNT-PT-S10J40

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 845
TRANSITIONS: 2230
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.061s, Sys 0.011s]


SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.008s, 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: 715
MODEL NAME: /home/mcc/execution/415/model
845 places, 2230 transitions.

No place bound informations found.
No place bound informations found.
No place bound informations found.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
No place bound informations found.
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-PT-S10J40"
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 PolyORBNT-PT-S10J40, 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 r289-tajo-171654446100497"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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