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

About the Execution of LTSMin+red for PolyORBNT-COL-S10J80

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
16201.987 218558.00 340781.00 485.70 [undef] Cannot compute

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 6.7K Apr 12 11:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Apr 12 11:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 12 10:45 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 10:45 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 4.3K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Apr 12 14:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Apr 12 14:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 13:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 97K Apr 12 13:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 95K 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-COL-S10J80-CTLFireability-2024-00
FORMULA_NAME PolyORBNT-COL-S10J80-CTLFireability-2024-01
FORMULA_NAME PolyORBNT-COL-S10J80-CTLFireability-2024-02
FORMULA_NAME PolyORBNT-COL-S10J80-CTLFireability-2024-03
FORMULA_NAME PolyORBNT-COL-S10J80-CTLFireability-2024-04
FORMULA_NAME PolyORBNT-COL-S10J80-CTLFireability-2024-05
FORMULA_NAME PolyORBNT-COL-S10J80-CTLFireability-2024-06
FORMULA_NAME PolyORBNT-COL-S10J80-CTLFireability-2024-07
FORMULA_NAME PolyORBNT-COL-S10J80-CTLFireability-2024-08
FORMULA_NAME PolyORBNT-COL-S10J80-CTLFireability-2024-09
FORMULA_NAME PolyORBNT-COL-S10J80-CTLFireability-2024-10
FORMULA_NAME PolyORBNT-COL-S10J80-CTLFireability-2024-11
FORMULA_NAME PolyORBNT-COL-S10J80-CTLFireability-2024-12
FORMULA_NAME PolyORBNT-COL-S10J80-CTLFireability-2024-13
FORMULA_NAME PolyORBNT-COL-S10J80-CTLFireability-2024-14
FORMULA_NAME PolyORBNT-COL-S10J80-CTLFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717259620147

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-COL-S10J80
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 16:33:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 16:33:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 16:33:41] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 16:33:42] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 16:33:42] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 654 ms
[2024-06-01 16:33:42] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1694 PT places and 13742.0 transition bindings in 27 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 16 ms.
[2024-06-01 16:33:42] [INFO ] Built PT skeleton of HLPN with 48 places and 38 transitions 140 arcs in 5 ms.
[2024-06-01 16:33:42] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 7 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
Reduction of identical properties reduced properties to check from 29 to 27
RANDOM walk for 40010 steps (2286 resets) in 1262 ms. (31 steps per ms) remains 15/27 properties
BEST_FIRST walk for 4009 steps (70 resets) in 67 ms. (58 steps per ms) remains 5/15 properties
BEST_FIRST walk for 4002 steps (80 resets) in 40 ms. (97 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4003 steps (96 resets) in 54 ms. (72 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4003 steps (74 resets) in 42 ms. (93 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4002 steps (82 resets) in 27 ms. (142 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4002 steps (82 resets) in 14 ms. (266 steps per ms) remains 5/5 properties
// Phase 1: matrix 38 rows 48 cols
[2024-06-01 16:33:43] [INFO ] Computed 13 invariants in 7 ms
[2024-06-01 16:33:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 15/34 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
At refinement iteration 4 (OVERLAPS) 13/47 variables, 6/13 constraints. Problems are: Problem set: 4 solved, 1 unsolved
[2024-06-01 16:33:43] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 8 ms to minimize.
[2024-06-01 16:33:43] [INFO ] Deduced a trap composed of 14 places in 41 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/47 variables, 2/15 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/15 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 38/85 variables, 47/62 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 1/63 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/85 variables, 0/63 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/86 variables, 1/64 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/86 variables, 0/64 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/86 variables, 0/64 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 64 constraints, problems are : Problem set: 4 solved, 1 unsolved in 368 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 48/48 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 4 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/12 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 22/34 variables, 2/3 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 7/41 variables, 4/7 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/41 variables, 0/7 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/42 variables, 1/8 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/42 variables, 0/8 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/47 variables, 5/13 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/47 variables, 2/15 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/47 variables, 0/15 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 38/85 variables, 47/62 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/85 variables, 1/63 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/85 variables, 0/63 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/86 variables, 1/64 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/86 variables, 1/65 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/86 variables, 0/65 constraints. Problems are: Problem set: 4 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/86 variables, 0/65 constraints. Problems are: Problem set: 4 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 65 constraints, problems are : Problem set: 4 solved, 1 unsolved in 69 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 48/48 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/5 constraints, Known Traps: 2/2 constraints]
After SMT, in 477ms problems are : Problem set: 4 solved, 1 unsolved
Parikh walk visited 0 properties in 5 ms.
Support contains 1 out of 48 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 48/48 places, 38/38 transitions.
Ensure Unique test removed 1 places
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 0 with 5 rules applied. Total rules applied 5 place count 47 transition count 34
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 43 transition count 34
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 9 place count 43 transition count 31
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 15 place count 40 transition count 31
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 17 place count 38 transition count 29
Iterating global reduction 2 with 2 rules applied. Total rules applied 19 place count 38 transition count 29
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 19 place count 38 transition count 28
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 21 place count 37 transition count 28
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 25 place count 35 transition count 26
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 27 place count 34 transition count 28
Applied a total of 27 rules in 22 ms. Remains 34 /48 variables (removed 14) and now considering 28/38 (removed 10) transitions.
Running 25 sub problems to find dead transitions.
// Phase 1: matrix 28 rows 34 cols
[2024-06-01 16:33:43] [INFO ] Computed 12 invariants in 1 ms
[2024-06-01 16:33:43] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (OVERLAPS) 1/34 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (OVERLAPS) 28/62 variables, 34/46 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/62 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (OVERLAPS) 0/62 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 47 constraints, problems are : Problem set: 0 solved, 25 unsolved in 293 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 34/34 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 25 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-01 16:33:44] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/33 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 4 (OVERLAPS) 1/34 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 6 (OVERLAPS) 28/62 variables, 34/47 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/62 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 25/73 constraints. Problems are: Problem set: 0 solved, 25 unsolved
[2024-06-01 16:33:44] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/62 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 25 unsolved
At refinement iteration 11 (OVERLAPS) 0/62 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 25 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 74 constraints, problems are : Problem set: 0 solved, 25 unsolved in 630 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 34/34 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 25/25 constraints, Known Traps: 2/2 constraints]
After SMT, in 940ms problems are : Problem set: 0 solved, 25 unsolved
Search for dead transitions found 0 dead transitions in 942ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 975 ms. Remains : 34/48 places, 28/38 transitions.
RANDOM walk for 40003 steps (2946 resets) in 163 ms. (243 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1172 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
Probably explored full state space saw : 521 states, properties seen :0
Probabilistic random walk after 1393 steps, saw 521 distinct states, run finished after 26 ms. (steps per millisecond=53 ) properties seen :0
Explored full state space saw : 521 states, properties seen :0
Exhaustive walk after 1393 steps, saw 521 distinct states, run finished after 3 ms. (steps per millisecond=464 ) properties seen :0
Successfully simplified 5 atomic propositions for a total of 7 simplifications.
[2024-06-01 16:33:44] [INFO ] Flatten gal took : 37 ms
[2024-06-01 16:33:44] [INFO ] Flatten gal took : 9 ms
Transition Run forces synchronizations/join behavior on parameter j of sort Jobs
Transition trans_376 forces synchronizations/join behavior on parameter s of sort Sources
Symmetric sort wr.t. initial and guards and successors and join/free detected :States
Arc [42:1*[$t, 0, $j]] contains constants of sort States
Transition WillPerformWork : constants on arcs in [[42:1*[$t, 0, $j]]] introduces in States(2) partition with 1 elements that refines current partition to 2 subsets.
[2024-06-01 16:33:45] [INFO ] Unfolded HLPN to a Petri net with 1694 places and 13580 transitions 119919 arcs in 340 ms.
[2024-06-01 16:33:45] [INFO ] Unfolded 16 HLPN properties in 5 ms.
[2024-06-01 16:33:45] [INFO ] Reduced 9285 identical enabling conditions.
[2024-06-01 16:33:45] [INFO ] Reduced 45 identical enabling conditions.
[2024-06-01 16:33:45] [INFO ] Reduced 9285 identical enabling conditions.
[2024-06-01 16:33:45] [INFO ] Reduced 780 identical enabling conditions.
Deduced a syphon composed of 80 places in 25 ms
Reduce places removed 80 places and 80 transitions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
Support contains 1613 out of 1614 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1614/1614 places, 3390/3390 transitions.
Applied a total of 0 rules in 37 ms. Remains 1614 /1614 variables (removed 0) and now considering 3390/3390 (removed 0) transitions.
Running 3379 sub problems to find dead transitions.
[2024-06-01 16:33:45] [INFO ] Flow matrix only has 3381 transitions (discarded 9 similar events)
// Phase 1: matrix 3381 rows 1614 cols
[2024-06-01 16:33:45] [INFO ] Computed 192 invariants in 314 ms
[2024-06-01 16:33:45] [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/1593 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 3379 unsolved
SMT process timed out in 47748ms, After SMT, problems are : Problem set: 0 solved, 3379 unsolved
Search for dead transitions found 0 dead transitions in 47795ms
[2024-06-01 16:34:33] [INFO ] Flow matrix only has 3381 transitions (discarded 9 similar events)
[2024-06-01 16:34:33] [INFO ] Invariant cache hit.
[2024-06-01 16:34:33] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-06-01 16:34:33] [INFO ] Flow matrix only has 3381 transitions (discarded 9 similar events)
[2024-06-01 16:34:33] [INFO ] Invariant cache hit.
[2024-06-01 16:34:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-06-01 16:34:36] [INFO ] Implicit Places using invariants and state equation in 2728 ms returned []
Implicit Place search using SMT with State Equation took 2987 ms to find 0 implicit places.
Running 3379 sub problems to find dead transitions.
[2024-06-01 16:34:36] [INFO ] Flow matrix only has 3381 transitions (discarded 9 similar events)
[2024-06-01 16:34:36] [INFO ] Invariant cache hit.
[2024-06-01 16:34:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1593 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 3379 unsolved
SMT process timed out in 56708ms, After SMT, problems are : Problem set: 0 solved, 3379 unsolved
Search for dead transitions found 0 dead transitions in 56743ms
Finished structural reductions in LTL mode , in 1 iterations and 107580 ms. Remains : 1614/1614 places, 3390/3390 transitions.
Support contains 1613 out of 1614 places after structural reductions.
[2024-06-01 16:35:34] [INFO ] Flatten gal took : 746 ms
[2024-06-01 16:35:35] [INFO ] Flatten gal took : 557 ms
[2024-06-01 16:35:37] [INFO ] Input system was already deterministic with 3390 transitions.
Reduction of identical properties reduced properties to check from 52 to 50
RANDOM walk for 40000 steps (2238 resets) in 14234 ms. (2 steps per ms) remains 39/50 properties
BEST_FIRST walk for 4002 steps (41 resets) in 298 ms. (13 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (39 resets) in 296 ms. (13 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (40 resets) in 283 ms. (14 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (40 resets) in 386 ms. (10 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (40 resets) in 334 ms. (11 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (40 resets) in 336 ms. (11 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (40 resets) in 353 ms. (11 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (40 resets) in 247 ms. (16 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (40 resets) in 237 ms. (16 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (40 resets) in 270 ms. (14 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (40 resets) in 348 ms. (11 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4002 steps (40 resets) in 356 ms. (11 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4003 steps (41 resets) in 334 ms. (11 steps per ms) remains 39/39 properties
BEST_FIRST walk for 4004 steps (8 resets) in 612 ms. (6 steps per ms) remains 35/39 properties
BEST_FIRST walk for 4002 steps (40 resets) in 413 ms. (9 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (39 resets) in 185 ms. (21 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (40 resets) in 192 ms. (20 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (41 resets) in 216 ms. (18 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (40 resets) in 272 ms. (14 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (40 resets) in 231 ms. (17 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4002 steps (40 resets) in 260 ms. (15 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4001 steps (41 resets) in 198 ms. (20 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (40 resets) in 197 ms. (20 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 618 ms. (6 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (40 resets) in 216 ms. (18 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (40 resets) in 252 ms. (15 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (40 resets) in 281 ms. (14 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (37 resets) in 654 ms. (6 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (40 resets) in 213 ms. (18 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (40 resets) in 240 ms. (16 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (40 resets) in 224 ms. (17 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4003 steps (40 resets) in 625 ms. (6 steps per ms) remains 35/35 properties
BEST_FIRST walk for 4004 steps (8 resets) in 167 ms. (23 steps per ms) remains 34/35 properties
BEST_FIRST walk for 4002 steps (40 resets) in 140 ms. (28 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (39 resets) in 145 ms. (27 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (40 resets) in 202 ms. (19 steps per ms) remains 34/34 properties
[2024-06-01 16:35:45] [INFO ] Flow matrix only has 3381 transitions (discarded 9 similar events)
[2024-06-01 16:35:45] [INFO ] Invariant cache hit.
[2024-06-01 16:35:45] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1609 variables, 183/183 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1609 variables, 7/190 constraints. Problems are: Problem set: 0 solved, 34 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1609/4995 variables, and 190 constraints, problems are : Problem set: 0 solved, 34 unsolved in 5029 ms.
Refiners :[Positive P Invariants (semi-flows): 183/185 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/1614 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 34/27 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1609 variables, 183/183 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1609 variables, 7/190 constraints. Problems are: Problem set: 0 solved, 34 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1609/4995 variables, and 190 constraints, problems are : Problem set: 0 solved, 34 unsolved in 5037 ms.
Refiners :[Positive P Invariants (semi-flows): 183/185 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 0/1614 constraints, ReadFeed: 0/1 constraints, PredecessorRefiner: 7/27 constraints, Known Traps: 0/0 constraints]
After SMT, in 19121ms problems are : Problem set: 0 solved, 34 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 1609 out of 1614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1614/1614 places, 3390/3390 transitions.
Applied a total of 0 rules in 191 ms. Remains 1614 /1614 variables (removed 0) and now considering 3390/3390 (removed 0) transitions.
Running 3379 sub problems to find dead transitions.
[2024-06-01 16:36:04] [INFO ] Flow matrix only has 3381 transitions (discarded 9 similar events)
[2024-06-01 16:36:04] [INFO ] Invariant cache hit.
[2024-06-01 16:36:04] [INFO ] State equation strengthened by 1 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 3.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 1.0)
(s83 1.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 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 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.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 0.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 1.0)
(s247 1.0)
(s248 1.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 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.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 0.0)
(s287 0.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 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.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 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.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 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.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 0.0)
(s372 0.0)
(s373 0.0)
(s374 0.0)
(s375 0.0)
(s376 0.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 0.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 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 0.0)
(s499 0.0)
(s500 0.0)
(s501 0.0)
(s502 0.0)
(s503 1.0)
(s504 4.0)
(s505 4.0)
(s506 4.0)
(s507 4.0)
(s508 4.0)
(s509 4.0)
(s510 4.0)
(s511 4.0)
(s512 4.0)
(s513 4.0)
(s514 9.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 1.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 1.0)
(s535 0.0)
(s536 0.0)
(s537 0.0)
(s538 0.0)
(s539 0.0)
(s540 0.0)
(s541 0.0)
(s542 0.0)
(s543 0.0)
(s544 1.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 1.0)
(s555 0.0)
(s556 0.0)
(s557 0.0)
(s558 0.0)
(s559 0.0)
(s560 0.0)
(s561 0.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/1593 variables, 166/166 constraints. Problems are: Problem set: 0 solved, 3379 unsolved
SMT process timed out in 48547ms, After SMT, problems are : Problem set: 0 solved, 3379 unsolved
Search for dead transitions found 0 dead transitions in 48607ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48821 ms. Remains : 1614/1614 places, 3390/3390 transitions.
RANDOM walk for 40000 steps (2242 resets) in 6554 ms. (6 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (40 resets) in 127 ms. (31 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (40 resets) in 173 ms. (23 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (40 resets) in 132 ms. (30 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (40 resets) in 155 ms. (25 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (41 resets) in 135 ms. (29 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (40 resets) in 184 ms. (21 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (40 resets) in 139 ms. (28 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (40 resets) in 130 ms. (30 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (40 resets) in 125 ms. (31 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (40 resets) in 141 ms. (28 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (39 resets) in 167 ms. (23 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (40 resets) in 146 ms. (27 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (41 resets) in 193 ms. (20 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (41 resets) in 381 ms. (10 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (34 resets) in 146 ms. (27 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (40 resets) in 139 ms. (28 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (40 resets) in 152 ms. (26 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (40 resets) in 219 ms. (18 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (39 resets) in 134 ms. (29 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (40 resets) in 130 ms. (30 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (39 resets) in 133 ms. (29 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (40 resets) in 129 ms. (30 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 594 ms. (6 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (41 resets) in 140 ms. (28 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (40 resets) in 203 ms. (19 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (40 resets) in 181 ms. (22 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (40 resets) in 502 ms. (7 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (40 resets) in 155 ms. (25 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (39 resets) in 146 ms. (27 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (40 resets) in 150 ms. (26 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4003 steps (40 resets) in 542 ms. (7 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (40 resets) in 229 ms. (17 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4004 steps (39 resets) in 129 ms. (30 steps per ms) remains 34/34 properties
BEST_FIRST walk for 4002 steps (40 resets) in 166 ms. (23 steps per ms) remains 34/34 properties
Interrupted probabilistic random walk after 208895 steps, run timeout after 12001 ms. (steps per millisecond=17 ) properties seen :5 out of 34
Probabilistic random walk after 208895 steps, saw 62948 distinct states, run finished after 12007 ms. (steps per millisecond=17 ) properties seen :5
[2024-06-01 16:37:09] [INFO ] Flow matrix only has 3381 transitions (discarded 9 similar events)
[2024-06-01 16:37:09] [INFO ] Invariant cache hit.
[2024-06-01 16:37:09] [INFO ] State equation strengthened by 1 read => feed constraints.
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : PolyORBNT-COL-S10J80-CTLFireability-2024-00
Could not compute solution for formula : PolyORBNT-COL-S10J80-CTLFireability-2024-01
Could not compute solution for formula : PolyORBNT-COL-S10J80-CTLFireability-2024-02
Could not compute solution for formula : PolyORBNT-COL-S10J80-CTLFireability-2024-03
Could not compute solution for formula : PolyORBNT-COL-S10J80-CTLFireability-2024-04
Could not compute solution for formula : PolyORBNT-COL-S10J80-CTLFireability-2024-05
Could not compute solution for formula : PolyORBNT-COL-S10J80-CTLFireability-2024-06
Could not compute solution for formula : PolyORBNT-COL-S10J80-CTLFireability-2024-07
Could not compute solution for formula : PolyORBNT-COL-S10J80-CTLFireability-2024-08
Could not compute solution for formula : PolyORBNT-COL-S10J80-CTLFireability-2024-09
Could not compute solution for formula : PolyORBNT-COL-S10J80-CTLFireability-2024-10
Could not compute solution for formula : PolyORBNT-COL-S10J80-CTLFireability-2024-11
Could not compute solution for formula : PolyORBNT-COL-S10J80-CTLFireability-2024-12
Could not compute solution for formula : PolyORBNT-COL-S10J80-CTLFireability-2024-13
Could not compute solution for formula : PolyORBNT-COL-S10J80-CTLFireability-2024-14
Could not compute solution for formula : PolyORBNT-COL-S10J80-CTLFireability-2024-15

BK_STOP 1717259838705

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-COL-S10J80"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S10J80.tgz
mv PolyORBNT-COL-S10J80 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;