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.r399-tall-171690529800199.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 StigmergyCommit-PT-08b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r399-tall-171690529800199
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 39M
-rw-r--r-- 1 mcc users 8.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 16:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 19:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Apr 11 17:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 11 17:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 38M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716994800349

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=StigmergyCommit-PT-08b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-29 15:00:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 15:00:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 15:00:03] [INFO ] Load time of PNML (sax parser for PT used): 1496 ms
[2024-05-29 15:00:03] [INFO ] Transformed 2746 places.
[2024-05-29 15:00:03] [INFO ] Transformed 42776 transitions.
[2024-05-29 15:00:03] [INFO ] Found NUPN structural information;
[2024-05-29 15:00:03] [INFO ] Parsed PT model containing 2746 places and 42776 transitions and 723933 arcs in 1899 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 32 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (237 resets) in 3073 ms. (13 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 74 ms. (53 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 307 ms. (12 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 95 ms. (41 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 69 ms. (57 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 148 ms. (26 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 134 ms. (29 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (8 resets) in 30 ms. (129 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 69 ms. (57 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 48 ms. (81 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
Interrupted probabilistic random walk after 25402 steps, run timeout after 3001 ms. (steps per millisecond=8 ) properties seen :0 out of 16
Probabilistic random walk after 25402 steps, saw 11461 distinct states, run finished after 3020 ms. (steps per millisecond=8 ) properties seen :0
// Phase 1: matrix 42776 rows 2746 cols
[2024-05-29 15:00:09] [INFO ] Computed 10 invariants in 1212 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 89/89 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem StigmergyCommit-PT-08b-ReachabilityFireability-2024-05 is UNSAT
FORMULA StigmergyCommit-PT-08b-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem StigmergyCommit-PT-08b-ReachabilityFireability-2024-12 is UNSAT
FORMULA StigmergyCommit-PT-08b-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
Problem StigmergyCommit-PT-08b-ReachabilityFireability-2024-13 is UNSAT
FORMULA StigmergyCommit-PT-08b-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 2657/2746 variables, 10/99 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2746 variables, 2657/2756 constraints. Problems are: Problem set: 3 solved, 13 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2746/45522 variables, and 2756 constraints, problems are : Problem set: 3 solved, 13 unsolved in 5051 ms.
Refiners :[Domain max(s): 2746/2746 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/2746 constraints, PredecessorRefiner: 16/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 13 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/78 variables, 78/78 constraints. Problems are: Problem set: 3 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/78 variables, 0/78 constraints. Problems are: Problem set: 3 solved, 13 unsolved
Problem StigmergyCommit-PT-08b-ReachabilityFireability-2024-07 is UNSAT
FORMULA StigmergyCommit-PT-08b-ReachabilityFireability-2024-07 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 2668/2746 variables, 10/88 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2746 variables, 2668/2756 constraints. Problems are: Problem set: 4 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2746/45522 variables, and 2756 constraints, problems are : Problem set: 4 solved, 12 unsolved in 5491 ms.
Refiners :[Domain max(s): 2746/2746 constraints, Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 0/2746 constraints, PredecessorRefiner: 13/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 13096ms problems are : Problem set: 4 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 76 out of 2746 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2746/2746 places, 42776/42776 transitions.
Graph (trivial) has 2471 edges and 2746 vertex of which 189 / 2746 are part of one of the 27 SCC in 16 ms
Free SCC test removed 162 places
Drop transitions (Empty/Sink Transition effects.) removed 207 transitions
Reduce isomorphic transitions removed 207 transitions.
Graph (complete) has 4665 edges and 2584 vertex of which 2566 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.147 ms
Discarding 18 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1856 transitions
Trivial Post-agglo rules discarded 1856 transitions
Performed 1856 trivial Post agglomeration. Transition count delta: 1856
Iterating post reduction 0 with 1865 rules applied. Total rules applied 1867 place count 2566 transition count 40695
Reduce places removed 1856 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 1 with 1880 rules applied. Total rules applied 3747 place count 710 transition count 40671
Reduce places removed 11 places and 0 transitions.
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Iterating post reduction 2 with 62 rules applied. Total rules applied 3809 place count 699 transition count 40620
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 3 with 51 rules applied. Total rules applied 3860 place count 648 transition count 40620
Performed 154 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 154 Pre rules applied. Total rules applied 3860 place count 648 transition count 40466
Deduced a syphon composed of 154 places in 26 ms
Reduce places removed 154 places and 0 transitions.
Iterating global reduction 4 with 308 rules applied. Total rules applied 4168 place count 494 transition count 40466
Discarding 150 places :
Symmetric choice reduction at 4 with 150 rule applications. Total rules 4318 place count 344 transition count 40316
Iterating global reduction 4 with 150 rules applied. Total rules applied 4468 place count 344 transition count 40316
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 4 with 32 rules applied. Total rules applied 4500 place count 344 transition count 40284
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 4500 place count 344 transition count 40283
Deduced a syphon composed of 1 places in 46 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 4502 place count 343 transition count 40283
Discarding 53 places :
Symmetric choice reduction at 5 with 53 rule applications. Total rules 4555 place count 290 transition count 40229
Iterating global reduction 5 with 53 rules applied. Total rules applied 4608 place count 290 transition count 40229
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 4617 place count 290 transition count 40220
Discarding 25 places :
Symmetric choice reduction at 6 with 25 rule applications. Total rules 4642 place count 265 transition count 40188
Iterating global reduction 6 with 25 rules applied. Total rules applied 4667 place count 265 transition count 40188
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 4685 place count 247 transition count 40170
Iterating global reduction 6 with 18 rules applied. Total rules applied 4703 place count 247 transition count 40170
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 4721 place count 247 transition count 40152
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 21 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 7 with 40 rules applied. Total rules applied 4761 place count 227 transition count 40132
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 4770 place count 218 transition count 40123
Iterating global reduction 7 with 9 rules applied. Total rules applied 4779 place count 218 transition count 40123
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 4788 place count 209 transition count 40114
Iterating global reduction 7 with 9 rules applied. Total rules applied 4797 place count 209 transition count 40114
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 4806 place count 200 transition count 40105
Iterating global reduction 7 with 9 rules applied. Total rules applied 4815 place count 200 transition count 40105
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 14 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 4821 place count 197 transition count 40113
Free-agglomeration rule applied 8 times.
Iterating global reduction 7 with 8 rules applied. Total rules applied 4829 place count 197 transition count 40105
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 7 with 8 rules applied. Total rules applied 4837 place count 189 transition count 40105
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 8 with 4 rules applied. Total rules applied 4841 place count 189 transition count 40101
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 4845 place count 185 transition count 40101
Partial Free-agglomeration rule applied 26 times.
Drop transitions (Partial Free agglomeration) removed 26 transitions
Iterating global reduction 9 with 26 rules applied. Total rules applied 4871 place count 185 transition count 40101
Applied a total of 4871 rules in 8046 ms. Remains 185 /2746 variables (removed 2561) and now considering 40101/42776 (removed 2675) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8063 ms. Remains : 185/2746 places, 40101/42776 transitions.
RANDOM walk for 40000 steps (1597 resets) in 3381 ms. (11 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (143 resets) in 232 ms. (171 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (143 resets) in 430 ms. (92 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (148 resets) in 248 ms. (160 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (148 resets) in 280 ms. (142 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (141 resets) in 206 ms. (193 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (145 resets) in 369 ms. (108 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (144 resets) in 202 ms. (197 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (137 resets) in 219 ms. (181 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (137 resets) in 256 ms. (155 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (148 resets) in 305 ms. (130 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (141 resets) in 422 ms. (94 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (143 resets) in 269 ms. (148 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 39011 steps, run timeout after 3001 ms. (steps per millisecond=12 ) properties seen :0 out of 12
Probabilistic random walk after 39011 steps, saw 11275 distinct states, run finished after 3001 ms. (steps per millisecond=12 ) properties seen :0
[2024-05-29 15:00:34] [INFO ] Flow matrix only has 40100 transitions (discarded 1 similar events)
// Phase 1: matrix 40100 rows 185 cols
[2024-05-29 15:00:34] [INFO ] Computed 10 invariants in 320 ms
[2024-05-29 15:00:36] [INFO ] State equation strengthened by 310 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 109/185 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 40100/40285 variables, 185/195 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40285 variables, 310/505 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 40285/40285 variables, and 505 constraints, problems are : Problem set: 0 solved, 12 unsolved in 45036 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 185/185 constraints, ReadFeed: 310/310 constraints, PredecessorRefiner: 12/0 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/76 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 109/185 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 40100/40285 variables, 185/195 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40285 variables, 310/505 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 Int declared 40285/40285 variables, and 505 constraints, problems are : Problem set: 0 solved, 12 unsolved in 45031 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, State Equation: 185/185 constraints, ReadFeed: 310/310 constraints, PredecessorRefiner: 12/0 constraints, Known Traps: 0/0 constraints]
After SMT, in 92130ms problems are : Problem set: 0 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 76 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 40101/40101 transitions.
Applied a total of 0 rules in 429 ms. Remains 185 /185 variables (removed 0) and now considering 40101/40101 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 429 ms. Remains : 185/185 places, 40101/40101 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 40101/40101 transitions.
Applied a total of 0 rules in 429 ms. Remains 185 /185 variables (removed 0) and now considering 40101/40101 (removed 0) transitions.
[2024-05-29 15:02:07] [INFO ] Flow matrix only has 40100 transitions (discarded 1 similar events)
[2024-05-29 15:02:07] [INFO ] Invariant cache hit.
[2024-05-29 15:02:07] [INFO ] Implicit Places using invariants in 125 ms returned []
Implicit Place search using SMT only with invariants took 132 ms to find 0 implicit places.
Running 40085 sub problems to find dead transitions.
[2024-05-29 15:02:08] [INFO ] Flow matrix only has 40100 transitions (discarded 1 similar events)
[2024-05-29 15:02:08] [INFO ] Invariant cache hit.
[2024-05-29 15:02:09] [INFO ] State equation strengthened by 310 read => feed constraints.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 184/40285 variables, and 0 constraints, problems are : Problem set: 0 solved, 40085 unsolved in 30488 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/185 constraints, ReadFeed: 0/310 constraints, PredecessorRefiner: 40085/427 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40085 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 184/40285 variables, and 0 constraints, problems are : Problem set: 0 solved, 40085 unsolved in 30422 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10 constraints, State Equation: 0/185 constraints, ReadFeed: 0/310 constraints, PredecessorRefiner: 39658/427 constraints, Known Traps: 0/0 constraints]
After SMT, in 721951ms problems are : Problem set: 0 solved, 40085 unsolved
Search for dead transitions found 0 dead transitions in 722364ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 723079 ms. Remains : 185/185 places, 40101/40101 transitions.
[2024-05-29 15:14:10] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 11 ms.
[2024-05-29 15:14:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 185 places, 40101 transitions and 718524 arcs took 310 ms.
[2024-05-29 15:14:16] [INFO ] Flatten gal took : 5318 ms
Total runtime 855086 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running StigmergyCommit-PT-08b

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: 185
TRANSITIONS: 40101
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 3.053s, Sys 0.153s]


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


----------------------------------------------------------------------
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: 587
MODEL NAME: /home/mcc/execution/411/model
185 places, 40101 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA StigmergyCommit-PT-08b-ReachabilityFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyCommit-PT-08b-ReachabilityFireability-2024-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyCommit-PT-08b-ReachabilityFireability-2024-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyCommit-PT-08b-ReachabilityFireability-2024-00 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyCommit-PT-08b-ReachabilityFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyCommit-PT-08b-ReachabilityFireability-2024-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyCommit-PT-08b-ReachabilityFireability-2024-09 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyCommit-PT-08b-ReachabilityFireability-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyCommit-PT-08b-ReachabilityFireability-2024-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyCommit-PT-08b-ReachabilityFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyCommit-PT-08b-ReachabilityFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA StigmergyCommit-PT-08b-ReachabilityFireability-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716995685713

--------------------
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 ReachabilityFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="StigmergyCommit-PT-08b"
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 StigmergyCommit-PT-08b, 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 r399-tall-171690529800199"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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