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

About the Execution of GreatSPN+red for CANConstruction-PT-090

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
13534.888 791538.00 1517348.00 1560.50 FTTFTFT??TTFTF?? normal

Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 9.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 19 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:32 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 92K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 12M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716381947224

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANConstruction-PT-090
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 12:45:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 12:45:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 12:45:49] [INFO ] Load time of PNML (sax parser for PT used): 670 ms
[2024-05-22 12:45:49] [INFO ] Transformed 17282 places.
[2024-05-22 12:45:49] [INFO ] Transformed 33120 transitions.
[2024-05-22 12:45:49] [INFO ] Parsed PT model containing 17282 places and 33120 transitions and 99000 arcs in 916 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 28 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (23 resets) in 3881 ms. (10 steps per ms) remains 12/16 properties
FORMULA CANConstruction-PT-090-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 868 ms. (46 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 530 ms. (75 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 279 ms. (142 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 340 ms. (117 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 177 ms. (224 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 277 ms. (143 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 153 ms. (259 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 87 ms. (454 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 12/12 properties
// Phase 1: matrix 33120 rows 17282 cols
[2024-05-22 12:45:52] [INFO ] Computed 181 invariants in 447 ms
[2024-05-22 12:45:52] [INFO ] State equation strengthened by 16110 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/298 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 16893/17191 variables, 89/89 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17191 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 12 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 17191/50402 variables, and 90 constraints, problems are : Problem set: 0 solved, 12 unsolved in 5051 ms.
Refiners :[Positive P Invariants (semi-flows): 89/91 constraints, Generalized P Invariants (flows): 1/90 constraints, State Equation: 0/17282 constraints, ReadFeed: 0/16110 constraints, PredecessorRefiner: 12/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/298 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 16893/17191 variables, 89/89 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17191 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 12 unsolved
[2024-05-22 12:46:44] [INFO ] Deduced a trap composed of 5 places in 42737 ms of which 604 ms to minimize.
SMT process timed out in 52792ms, After SMT, problems are : Problem set: 0 solved, 12 unsolved
Fused 12 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 298 out of 17282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17282/17282 places, 33120/33120 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 420 transitions
Trivial Post-agglo rules discarded 420 transitions
Performed 420 trivial Post agglomeration. Transition count delta: 420
Iterating post reduction 0 with 420 rules applied. Total rules applied 420 place count 17282 transition count 32700
Reduce places removed 420 places and 0 transitions.
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Iterating post reduction 1 with 511 rules applied. Total rules applied 931 place count 16862 transition count 32609
Reduce places removed 91 places and 0 transitions.
Iterating post reduction 2 with 91 rules applied. Total rules applied 1022 place count 16771 transition count 32609
Performed 48 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 48 Pre rules applied. Total rules applied 1022 place count 16771 transition count 32561
Deduced a syphon composed of 48 places in 17 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 1118 place count 16723 transition count 32561
Discarding 7799 places :
Symmetric choice reduction at 3 with 7799 rule applications. Total rules 8917 place count 8924 transition count 16963
Iterating global reduction 3 with 7799 rules applied. Total rules applied 16716 place count 8924 transition count 16963
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 12 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 16798 place count 8883 transition count 16922
Free-agglomeration rule applied 52 times.
Iterating global reduction 3 with 52 rules applied. Total rules applied 16850 place count 8883 transition count 16870
Reduce places removed 52 places and 0 transitions.
Iterating post reduction 3 with 52 rules applied. Total rules applied 16902 place count 8831 transition count 16870
Partial Free-agglomeration rule applied 174 times.
Drop transitions (Partial Free agglomeration) removed 174 transitions
Iterating global reduction 4 with 174 rules applied. Total rules applied 17076 place count 8831 transition count 16870
Partial Free-agglomeration rule applied 29 times.
Drop transitions (Partial Free agglomeration) removed 29 transitions
Iterating global reduction 4 with 29 rules applied. Total rules applied 17105 place count 8831 transition count 16870
Applied a total of 17105 rules in 18213 ms. Remains 8831 /17282 variables (removed 8451) and now considering 16870/33120 (removed 16250) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18226 ms. Remains : 8831/17282 places, 16870/33120 transitions.
RANDOM walk for 40000 steps (56 resets) in 1932 ms. (20 steps per ms) remains 7/12 properties
FORMULA CANConstruction-PT-090-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 129 ms. (307 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 7/7 properties
// Phase 1: matrix 16870 rows 8831 cols
[2024-05-22 12:47:03] [INFO ] Computed 181 invariants in 129 ms
[2024-05-22 12:47:03] [INFO ] State equation strengthened by 16260 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 8532/8732 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8732 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8732 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 10/8742 variables, 10/92 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8742 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 89/8831 variables, 89/181 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8831 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 16870/25701 variables, 8831/9012 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/25701 variables, 16260/25272 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/25701 variables, 0/25272 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 0/25701 variables, 0/25272 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25701/25701 variables, and 25272 constraints, problems are : Problem set: 0 solved, 7 unsolved in 28906 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 90/90 constraints, State Equation: 8831/8831 constraints, ReadFeed: 16260/16260 constraints, PredecessorRefiner: 7/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 8532/8732 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8732 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 12:47:48] [INFO ] Deduced a trap composed of 2 places in 13846 ms of which 54 ms to minimize.
[2024-05-22 12:48:03] [INFO ] Deduced a trap composed of 2 places in 14724 ms of which 53 ms to minimize.
[2024-05-22 12:48:08] [INFO ] Deduced a trap composed of 95 places in 5338 ms of which 34 ms to minimize.
[2024-05-22 12:48:13] [INFO ] Deduced a trap composed of 105 places in 4974 ms of which 33 ms to minimize.
[2024-05-22 12:48:18] [INFO ] Deduced a trap composed of 104 places in 5304 ms of which 33 ms to minimize.
SMT process timed out in 75407ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 200 out of 8831 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8831/8831 places, 16870/16870 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 8831 transition count 16867
Reduce places removed 3 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 21 rules applied. Total rules applied 24 place count 8828 transition count 16849
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 42 place count 8810 transition count 16849
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 47 place count 8805 transition count 16839
Iterating global reduction 3 with 5 rules applied. Total rules applied 52 place count 8805 transition count 16839
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 4 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 130 place count 8766 transition count 16800
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 4 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 140 place count 8761 transition count 16800
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 142 place count 8761 transition count 16800
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 143 place count 8760 transition count 16798
Iterating global reduction 3 with 1 rules applied. Total rules applied 144 place count 8760 transition count 16798
Applied a total of 144 rules in 16163 ms. Remains 8760 /8831 variables (removed 71) and now considering 16798/16870 (removed 72) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16163 ms. Remains : 8760/8831 places, 16798/16870 transitions.
RANDOM walk for 40000 steps (59 resets) in 1367 ms. (29 steps per ms) remains 5/7 properties
FORMULA CANConstruction-PT-090-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CANConstruction-PT-090-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 186 ms. (213 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 106 ms. (373 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 148 ms. (268 steps per ms) remains 5/5 properties
// Phase 1: matrix 16798 rows 8760 cols
[2024-05-22 12:48:35] [INFO ] Computed 181 invariants in 140 ms
[2024-05-22 12:48:36] [INFO ] State equation strengthened by 16300 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8487/8660 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8660 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/8660 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 11/8671 variables, 11/92 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8671 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 89/8760 variables, 89/181 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8760 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 16798/25558 variables, 8760/8941 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/25558 variables, 16300/25241 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/25558 variables, 0/25241 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/25558 variables, 0/25241 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25558/25558 variables, and 25241 constraints, problems are : Problem set: 0 solved, 5 unsolved in 23096 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 90/90 constraints, State Equation: 8760/8760 constraints, ReadFeed: 16300/16300 constraints, PredecessorRefiner: 5/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 8487/8660 variables, 80/80 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8660 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 12:49:13] [INFO ] Deduced a trap composed of 2 places in 13252 ms of which 43 ms to minimize.
[2024-05-22 12:49:18] [INFO ] Deduced a trap composed of 96 places in 4284 ms of which 31 ms to minimize.
[2024-05-22 12:49:22] [INFO ] Deduced a trap composed of 96 places in 4035 ms of which 29 ms to minimize.
[2024-05-22 12:49:26] [INFO ] Deduced a trap composed of 96 places in 4319 ms of which 32 ms to minimize.
[2024-05-22 12:49:31] [INFO ] Deduced a trap composed of 95 places in 4393 ms of which 26 ms to minimize.
[2024-05-22 12:49:35] [INFO ] Deduced a trap composed of 97 places in 3861 ms of which 26 ms to minimize.
[2024-05-22 12:49:38] [INFO ] Deduced a trap composed of 96 places in 3620 ms of which 29 ms to minimize.
[2024-05-22 12:49:42] [INFO ] Deduced a trap composed of 99 places in 3888 ms of which 30 ms to minimize.
[2024-05-22 12:49:46] [INFO ] Deduced a trap composed of 96 places in 3605 ms of which 30 ms to minimize.
[2024-05-22 12:49:50] [INFO ] Deduced a trap composed of 94 places in 3788 ms of which 30 ms to minimize.
[2024-05-22 12:49:54] [INFO ] Deduced a trap composed of 94 places in 3965 ms of which 29 ms to minimize.
[2024-05-22 12:49:58] [INFO ] Deduced a trap composed of 94 places in 3930 ms of which 29 ms to minimize.
[2024-05-22 12:50:02] [INFO ] Deduced a trap composed of 95 places in 3708 ms of which 28 ms to minimize.
[2024-05-22 12:50:06] [INFO ] Deduced a trap composed of 96 places in 3623 ms of which 27 ms to minimize.
[2024-05-22 12:50:09] [INFO ] Deduced a trap composed of 95 places in 3637 ms of which 28 ms to minimize.
[2024-05-22 12:50:13] [INFO ] Deduced a trap composed of 94 places in 3476 ms of which 28 ms to minimize.
[2024-05-22 12:50:17] [INFO ] Deduced a trap composed of 96 places in 3808 ms of which 28 ms to minimize.
SMT process timed out in 101717ms, After SMT, problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 173 out of 8760 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8760/8760 places, 16798/16798 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 8760 transition count 16793
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 8755 transition count 16793
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 12 place count 8753 transition count 16789
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 8753 transition count 16789
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 3 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 40 place count 8740 transition count 16776
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 44 place count 8738 transition count 16776
Applied a total of 44 rules in 10203 ms. Remains 8738 /8760 variables (removed 22) and now considering 16776/16798 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10203 ms. Remains : 8738/8760 places, 16776/16798 transitions.
RANDOM walk for 40000 steps (59 resets) in 1514 ms. (26 steps per ms) remains 4/5 properties
FORMULA CANConstruction-PT-090-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 152 ms. (261 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 188 ms. (211 steps per ms) remains 4/4 properties
// Phase 1: matrix 16776 rows 8738 cols
[2024-05-22 12:50:28] [INFO ] Computed 181 invariants in 112 ms
[2024-05-22 12:50:28] [INFO ] State equation strengthened by 16313 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 8474/8634 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8634 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/8634 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 15/8649 variables, 15/92 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/8649 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 89/8738 variables, 89/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8738 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 16776/25514 variables, 8738/8919 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/25514 variables, 16313/25232 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/25514 variables, 0/25232 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/25514 variables, 0/25232 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25514/25514 variables, and 25232 constraints, problems are : Problem set: 0 solved, 4 unsolved in 18356 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 90/90 constraints, State Equation: 8738/8738 constraints, ReadFeed: 16313/16313 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 8474/8634 variables, 76/76 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8634 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-05-22 12:51:03] [INFO ] Deduced a trap composed of 2 places in 15208 ms of which 45 ms to minimize.
[2024-05-22 12:51:09] [INFO ] Deduced a trap composed of 100 places in 5712 ms of which 34 ms to minimize.
[2024-05-22 12:51:15] [INFO ] Deduced a trap composed of 97 places in 5737 ms of which 33 ms to minimize.
[2024-05-22 12:51:20] [INFO ] Deduced a trap composed of 96 places in 5438 ms of which 31 ms to minimize.
[2024-05-22 12:51:26] [INFO ] Deduced a trap composed of 96 places in 5422 ms of which 32 ms to minimize.
[2024-05-22 12:51:31] [INFO ] Deduced a trap composed of 96 places in 5148 ms of which 27 ms to minimize.
[2024-05-22 12:51:37] [INFO ] Deduced a trap composed of 96 places in 5454 ms of which 35 ms to minimize.
[2024-05-22 12:51:42] [INFO ] Deduced a trap composed of 94 places in 5013 ms of which 31 ms to minimize.
[2024-05-22 12:51:47] [INFO ] Deduced a trap composed of 110 places in 5065 ms of which 32 ms to minimize.
[2024-05-22 12:51:52] [INFO ] Deduced a trap composed of 98 places in 4966 ms of which 29 ms to minimize.
[2024-05-22 12:51:57] [INFO ] Deduced a trap composed of 98 places in 4977 ms of which 32 ms to minimize.
[2024-05-22 12:52:02] [INFO ] Deduced a trap composed of 95 places in 4431 ms of which 35 ms to minimize.
[2024-05-22 12:52:06] [INFO ] Deduced a trap composed of 94 places in 4418 ms of which 29 ms to minimize.
[2024-05-22 12:52:11] [INFO ] Deduced a trap composed of 94 places in 4384 ms of which 28 ms to minimize.
[2024-05-22 12:52:15] [INFO ] Deduced a trap composed of 94 places in 4482 ms of which 30 ms to minimize.
[2024-05-22 12:52:20] [INFO ] Deduced a trap composed of 94 places in 4530 ms of which 29 ms to minimize.
SMT process timed out in 111943ms, After SMT, problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 160 out of 8738 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8738/8738 places, 16776/16776 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 8738 transition count 16773
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 8735 transition count 16773
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 4 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 24 place count 8726 transition count 16764
Applied a total of 24 rules in 5197 ms. Remains 8726 /8738 variables (removed 12) and now considering 16764/16776 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5197 ms. Remains : 8726/8738 places, 16764/16776 transitions.
[2024-05-22 12:52:25] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 9 ms.
[2024-05-22 12:52:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 8726 places, 16764 transitions and 66742 arcs took 73 ms.
[2024-05-22 12:52:26] [INFO ] Flatten gal took : 834 ms
Total runtime 398496 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running CANConstruction-PT-090

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/411/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 8726
TRANSITIONS: 16764
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.365s, Sys 0.012s]


SAVING FILE /home/mcc/execution/411/model (.net / .def) ...
EXPORT TIME: [User 0.055s, Sys 0.003s]


----------------------------------------------------------------------
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: 702
MODEL NAME: /home/mcc/execution/411/model
8726 places, 16764 transitions.

No place bound informations found.
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..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1716382738762

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

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANConstruction-PT-090"
export BK_EXAMINATION="ReachabilityFireability"
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 CANConstruction-PT-090, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r069-tall-171620503800079"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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