About the Execution of GreatSPN+red for BugTracking-PT-q8m008
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
16203.224 | 3600000.00 | 9446601.00 | 946.50 | FFFFTTFFFTFFFTT? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r047-tajo-171620398100403.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is BugTracking-PT-q8m008, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398100403
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 13K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 129K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16M 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 BugTracking-PT-q8m008-LTLCardinality-00
FORMULA_NAME BugTracking-PT-q8m008-LTLCardinality-01
FORMULA_NAME BugTracking-PT-q8m008-LTLCardinality-02
FORMULA_NAME BugTracking-PT-q8m008-LTLCardinality-03
FORMULA_NAME BugTracking-PT-q8m008-LTLCardinality-04
FORMULA_NAME BugTracking-PT-q8m008-LTLCardinality-05
FORMULA_NAME BugTracking-PT-q8m008-LTLCardinality-06
FORMULA_NAME BugTracking-PT-q8m008-LTLCardinality-07
FORMULA_NAME BugTracking-PT-q8m008-LTLCardinality-08
FORMULA_NAME BugTracking-PT-q8m008-LTLCardinality-09
FORMULA_NAME BugTracking-PT-q8m008-LTLCardinality-10
FORMULA_NAME BugTracking-PT-q8m008-LTLCardinality-11
FORMULA_NAME BugTracking-PT-q8m008-LTLCardinality-12
FORMULA_NAME BugTracking-PT-q8m008-LTLCardinality-13
FORMULA_NAME BugTracking-PT-q8m008-LTLCardinality-14
FORMULA_NAME BugTracking-PT-q8m008-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716297574750
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m008
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 13:19:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 13:19:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 13:19:38] [INFO ] Load time of PNML (sax parser for PT used): 1441 ms
[2024-05-21 13:19:38] [INFO ] Transformed 754 places.
[2024-05-21 13:19:38] [INFO ] Transformed 27370 transitions.
[2024-05-21 13:19:38] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1844 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 52 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 474 places in 179 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m008-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 10 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 278 transition count 3904
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 277 transition count 3871
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 277 transition count 3871
Applied a total of 4 rules in 151 ms. Remains 277 /280 variables (removed 3) and now considering 3871/3904 (removed 33) transitions.
[2024-05-21 13:19:39] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2024-05-21 13:19:39] [INFO ] Computed 8 invariants in 54 ms
[2024-05-21 13:19:40] [INFO ] Implicit Places using invariants in 1485 ms returned []
[2024-05-21 13:19:40] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-05-21 13:19:40] [INFO ] Invariant cache hit.
[2024-05-21 13:19:41] [INFO ] State equation strengthened by 282 read => feed constraints.
[2024-05-21 13:19:43] [INFO ] Implicit Places using invariants and state equation in 2919 ms returned []
Implicit Place search using SMT with State Equation took 4514 ms to find 0 implicit places.
Running 3869 sub problems to find dead transitions.
[2024-05-21 13:19:43] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-05-21 13:19:44] [INFO ] Invariant cache hit.
[2024-05-21 13:19:44] [INFO ] State equation strengthened by 282 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3869 unsolved
[2024-05-21 13:21:01] [INFO ] Deduced a trap composed of 10 places in 301 ms of which 20 ms to minimize.
[2024-05-21 13:21:02] [INFO ] Deduced a trap composed of 7 places in 378 ms of which 2 ms to minimize.
[2024-05-21 13:21:02] [INFO ] Deduced a trap composed of 23 places in 206 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 276/3984 variables, and 11 constraints, problems are : Problem set: 0 solved, 3869 unsolved in 30100 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/277 constraints, ReadFeed: 0/282 constraints, PredecessorRefiner: 3869/2672 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3869 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3869 unsolved
SMT process timed out in 116689ms, After SMT, problems are : Problem set: 0 solved, 3869 unsolved
Search for dead transitions found 0 dead transitions in 116812ms
Starting structural reductions in LTL mode, iteration 1 : 277/280 places, 3871/3904 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 121565 ms. Remains : 277/280 places, 3871/3904 transitions.
Support contains 10 out of 277 places after structural reductions.
[2024-05-21 13:21:41] [INFO ] Flatten gal took : 472 ms
[2024-05-21 13:21:41] [INFO ] Flatten gal took : 374 ms
[2024-05-21 13:21:42] [INFO ] Input system was already deterministic with 3871 transitions.
RANDOM walk for 40001 steps (251 resets) in 1946 ms. (20 steps per ms) remains 7/10 properties
BEST_FIRST walk for 40003 steps (57 resets) in 1164 ms. (34 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (49 resets) in 227 ms. (175 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (48 resets) in 165 ms. (240 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (45 resets) in 144 ms. (275 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (44 resets) in 161 ms. (246 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (45 resets) in 213 ms. (186 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (56 resets) in 152 ms. (261 steps per ms) remains 7/7 properties
[2024-05-21 13:21:43] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-05-21 13:21:43] [INFO ] Invariant cache hit.
[2024-05-21 13:21:44] [INFO ] State equation strengthened by 282 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
At refinement iteration 1 (OVERLAPS) 84/91 variables, 4/4 constraints. Problems are: Problem set: 6 solved, 1 unsolved
[2024-05-21 13:21:44] [INFO ] Deduced a trap composed of 17 places in 195 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/91 variables, 1/5 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/91 variables, 0/5 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 2151/2242 variables, 91/96 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2242 variables, 75/171 constraints. Problems are: Problem set: 6 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/2242 variables, 0/171 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1493/3735 variables, 106/277 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3735 variables, 1/278 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3735 variables, 164/442 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3735 variables, 0/442 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 231/3966 variables, 64/506 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3966 variables, 1/507 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3966 variables, 43/550 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3966 variables, 0/550 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/3968 variables, 1/551 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3968 variables, 0/551 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 16/3984 variables, 16/567 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3984 variables, 1/568 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3984 variables, 0/568 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/3984 variables, 0/568 constraints. Problems are: Problem set: 6 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3984/3984 variables, and 568 constraints, problems are : Problem set: 6 solved, 1 unsolved in 1482 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 277/277 constraints, ReadFeed: 282/282 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 6 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/28 variables, 1/1 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 1/2 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 0/2 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1856/1884 variables, 30/32 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1884 variables, 1/33 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1884 variables, 127/160 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1884 variables, 0/160 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 4/1888 variables, 1/161 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1888 variables, 0/161 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1111/2999 variables, 123/284 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2999 variables, 1/285 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2999 variables, 53/338 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2999 variables, 1/339 constraints. Problems are: Problem set: 6 solved, 1 unsolved
[2024-05-21 13:21:46] [INFO ] Deduced a trap composed of 26 places in 336 ms of which 2 ms to minimize.
[2024-05-21 13:21:46] [INFO ] Deduced a trap composed of 23 places in 162 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2999 variables, 2/341 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2999 variables, 0/341 constraints. Problems are: Problem set: 6 solved, 1 unsolved
Problem AtomicPropp0 is UNSAT
After SMT solving in domain Int declared 3252/3984 variables, and 381 constraints, problems are : Problem set: 7 solved, 0 unsolved in 1602 ms.
Refiners :[Positive P Invariants (semi-flows): 3/8 constraints, State Equation: 194/277 constraints, ReadFeed: 181/282 constraints, PredecessorRefiner: 1/7 constraints, Known Traps: 2/3 constraints]
After SMT, in 3134ms problems are : Problem set: 7 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 7 atomic propositions for a total of 6 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA BugTracking-PT-q8m008-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 6 stabilizing places and 131 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 277 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 275 transition count 3877
Applied a total of 4 rules in 157 ms. Remains 275 /277 variables (removed 2) and now considering 3877/3871 (removed -6) transitions.
[2024-05-21 13:21:47] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
// Phase 1: matrix 3705 rows 275 cols
[2024-05-21 13:21:47] [INFO ] Computed 8 invariants in 31 ms
[2024-05-21 13:21:48] [INFO ] Implicit Places using invariants in 706 ms returned []
[2024-05-21 13:21:48] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2024-05-21 13:21:48] [INFO ] Invariant cache hit.
[2024-05-21 13:21:48] [INFO ] State equation strengthened by 283 read => feed constraints.
[2024-05-21 13:21:50] [INFO ] Implicit Places using invariants and state equation in 2617 ms returned []
Implicit Place search using SMT with State Equation took 3332 ms to find 0 implicit places.
[2024-05-21 13:21:51] [INFO ] Redundant transitions in 299 ms returned []
Running 3875 sub problems to find dead transitions.
[2024-05-21 13:21:51] [INFO ] Flow matrix only has 3705 transitions (discarded 172 similar events)
[2024-05-21 13:21:51] [INFO ] Invariant cache hit.
[2024-05-21 13:21:51] [INFO ] State equation strengthened by 283 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3875 unsolved
[2024-05-21 13:23:09] [INFO ] Deduced a trap composed of 10 places in 166 ms of which 1 ms to minimize.
[2024-05-21 13:23:09] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 13 ms to minimize.
[2024-05-21 13:23:18] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 2 ms to minimize.
Problem TDEAD784 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 274/3980 variables, and 11 constraints, problems are : Problem set: 14 solved, 3861 unsolved in 30072 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/275 constraints, ReadFeed: 0/283 constraints, PredecessorRefiner: 3875/2672 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 14 solved, 3861 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 8/8 constraints. Problems are: Problem set: 14 solved, 3861 unsolved
Problem TDEAD2774 is UNSAT
Problem TDEAD2775 is UNSAT
Problem TDEAD2776 is UNSAT
Problem TDEAD2777 is UNSAT
Problem TDEAD2778 is UNSAT
Problem TDEAD2779 is UNSAT
Problem TDEAD2780 is UNSAT
Problem TDEAD2781 is UNSAT
Problem TDEAD2786 is UNSAT
Problem TDEAD2787 is UNSAT
Problem TDEAD2788 is UNSAT
Problem TDEAD2789 is UNSAT
Problem TDEAD2790 is UNSAT
Problem TDEAD2791 is UNSAT
Problem TDEAD2792 is UNSAT
Problem TDEAD2793 is UNSAT
Problem TDEAD2794 is UNSAT
Problem TDEAD2795 is UNSAT
Problem TDEAD2796 is UNSAT
Problem TDEAD2797 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 3/11 constraints. Problems are: Problem set: 34 solved, 3841 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 274/3980 variables, and 11 constraints, problems are : Problem set: 34 solved, 3841 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/275 constraints, ReadFeed: 0/283 constraints, PredecessorRefiner: 1203/2672 constraints, Known Traps: 3/3 constraints]
After SMT, in 120360ms problems are : Problem set: 34 solved, 3841 unsolved
Search for dead transitions found 34 dead transitions in 120488ms
Found 34 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 34 transitions
Dead transitions reduction (with SMT) removed 34 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 275/277 places, 3843/3871 transitions.
Reduce places removed 9 places and 294 transitions.
Reduce places removed 5 places and 153 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 261 transition count 3396
Reduce places removed 2 places and 58 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 259 transition count 3338
Reduce places removed 1 places and 32 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 258 transition count 3306
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 9 place count 257 transition count 3281
Iterating global reduction 3 with 1 rules applied. Total rules applied 10 place count 257 transition count 3281
Applied a total of 10 rules in 277 ms. Remains 257 /275 variables (removed 18) and now considering 3281/3843 (removed 562) transitions.
[2024-05-21 13:23:51] [INFO ] Flow matrix only has 3141 transitions (discarded 140 similar events)
// Phase 1: matrix 3141 rows 257 cols
[2024-05-21 13:23:51] [INFO ] Computed 8 invariants in 26 ms
[2024-05-21 13:23:52] [INFO ] Implicit Places using invariants in 520 ms returned []
[2024-05-21 13:23:52] [INFO ] Flow matrix only has 3141 transitions (discarded 140 similar events)
[2024-05-21 13:23:52] [INFO ] Invariant cache hit.
[2024-05-21 13:23:53] [INFO ] State equation strengthened by 251 read => feed constraints.
[2024-05-21 13:23:54] [INFO ] Implicit Places using invariants and state equation in 2510 ms returned []
Implicit Place search using SMT with State Equation took 3040 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 257/277 places, 3281/3871 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 127643 ms. Remains : 257/277 places, 3281/3871 transitions.
Stuttering acceptance computed with spot in 230 ms :[(NOT p0)]
Running random walk in product with property : BugTracking-PT-q8m008-LTLCardinality-06
Stuttering criterion allowed to conclude after 160 steps with 0 reset in 8 ms.
FORMULA BugTracking-PT-q8m008-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BugTracking-PT-q8m008-LTLCardinality-06 finished in 127960 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))&&F(p1))))'
Support contains 2 out of 277 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 277/277 places, 3871/3871 transitions.
Applied a total of 0 rules in 18 ms. Remains 277 /277 variables (removed 0) and now considering 3871/3871 (removed 0) transitions.
[2024-05-21 13:23:55] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2024-05-21 13:23:55] [INFO ] Computed 8 invariants in 17 ms
[2024-05-21 13:23:55] [INFO ] Implicit Places using invariants in 692 ms returned []
[2024-05-21 13:23:55] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-05-21 13:23:55] [INFO ] Invariant cache hit.
[2024-05-21 13:23:56] [INFO ] State equation strengthened by 282 read => feed constraints.
[2024-05-21 13:23:57] [INFO ] Implicit Places using invariants and state equation in 1986 ms returned []
Implicit Place search using SMT with State Equation took 2686 ms to find 0 implicit places.
Running 3869 sub problems to find dead transitions.
[2024-05-21 13:23:58] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-05-21 13:23:58] [INFO ] Invariant cache hit.
[2024-05-21 13:23:58] [INFO ] State equation strengthened by 282 read => feed constraints.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running BugTracking-PT-q8m008
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 754
TRANSITIONS: 27370
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.702s, Sys 0.058s]
SAVING FILE /home/mcc/execution/model (.net / .def) ...
EXPORT TIME: [User 0.105s, Sys 0.007s]
----------------------------------------------------------------------
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: 663
MODEL NAME: /home/mcc/execution/model
754 places, 27370 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ 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 LTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory
Error in allocating array of size 1048576 at unique_table.cc, line 313
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="BugTracking-PT-q8m008"
export BK_EXAMINATION="LTLCardinality"
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 BugTracking-PT-q8m008, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r047-tajo-171620398100403"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q8m008.tgz
mv BugTracking-PT-q8m008 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;