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.r276-smll-171654416500349.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 Philosophers-PT-005000, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r276-smll-171654416500349
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 162M
-rw-r--r-- 1 mcc users 5.5M Apr 13 19:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 27M Apr 13 19:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7M Apr 13 14:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 16M Apr 13 14:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 2.2M Apr 23 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 7.8M Apr 23 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.7M Apr 23 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 7.0M Apr 23 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11M Apr 14 03:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 54M Apr 14 03:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.7M Apr 13 23:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15M Apr 13 23:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 501K Apr 23 07:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 1.3M Apr 23 07:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 11M 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

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1716844409075

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Philosophers-PT-005000
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-27 21:13:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2024-05-27 21:13:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 21:13:32] [INFO ] Load time of PNML (sax parser for PT used): 1279 ms
[2024-05-27 21:13:32] [INFO ] Transformed 25000 places.
[2024-05-27 21:13:32] [INFO ] Transformed 25000 transitions.
[2024-05-27 21:13:32] [INFO ] Parsed PT model containing 25000 places and 25000 transitions and 80000 arcs in 1641 ms.
Built sparse matrix representations for Structural reductions in 55 ms.118254KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 636 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 666 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 313 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
// Phase 1: matrix 25000 rows 25000 cols
[2024-05-27 21:13:35] [INFO ] Computed 10000 invariants in 212 ms
[2024-05-27 21:13:49] [INFO ] Implicit Places using invariants in 14168 ms returned []
Implicit Place search using SMT only with invariants took 14230 ms to find 0 implicit places.
Running 15000 sub problems to find dead transitions.
[2024-05-27 21:13:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20000 variables, 5000/5000 constraints. Problems are: Problem set: 0 solved, 15000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20000/50000 variables, and 5000 constraints, problems are : Problem set: 0 solved, 15000 unsolved in 30937 ms.
Refiners :[Positive P Invariants (semi-flows): 5000/10000 constraints, State Equation: 0/25000 constraints, PredecessorRefiner: 15000/15000 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 20000/50000 variables, and 5000 constraints, problems are : Problem set: 0 solved, 15000 unsolved in 30378 ms.
Refiners :[Positive P Invariants (semi-flows): 5000/10000 constraints, State Equation: 0/25000 constraints, PredecessorRefiner: 0/15000 constraints, Known Traps: 0/0 constraints]
After SMT, in 100808ms problems are : Problem set: 0 solved, 15000 unsolved
Search for dead transitions found 0 dead transitions in 101143ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 115782 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Interrupted Random walk after 72237 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=2 )
[2024-05-27 21:16:00] [INFO ] Invariant cache hit.
[2024-05-27 21:21:00] [INFO ] [Real]Absence check using 10000 positive place invariants in 210423 ms returned unknown
Interrupted Random directed walk after 20000 steps, including 0 resets, run timeout after 37679 ms. (steps per millisecond=0 )
Interrupted Random walk after 76176 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=2 )
Interrupted Random directed walk after 19994 steps, including 0 resets, run timeout after 36604 ms. (steps per millisecond=0 )
Interrupted Random walk after 75943 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=2 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 212 ms. Remains 25000 /25000 variables (removed 0) and now considering 25000/25000 (removed 0) transitions.
[2024-05-27 21:23:15] [INFO ] Invariant cache hit.
[2024-05-27 21:23:28] [INFO ] Implicit Places using invariants in 13722 ms returned []
Implicit Place search using SMT only with invariants took 13735 ms to find 0 implicit places.
Running 15000 sub problems to find dead transitions.
[2024-05-27 21:23:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/20000 variables, 5000/5000 constraints. Problems are: Problem set: 0 solved, 15000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 20000/50000 variables, and 5000 constraints, problems are : Problem set: 0 solved, 15000 unsolved in 30558 ms.
Refiners :[Positive P Invariants (semi-flows): 5000/10000 constraints, State Equation: 0/25000 constraints, PredecessorRefiner: 15000/15000 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15000 unsolved
SMT process timed out in 101130ms, After SMT, problems are : Problem set: 0 solved, 15000 unsolved
Search for dead transitions found 0 dead transitions in 101329ms
Finished structural reductions in DEADLOCK mode , in 1 iterations and 115346 ms. Remains : 25000/25000 places, 25000/25000 transitions.
Interrupted Random walk after 69938 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=2 )
[2024-05-27 21:25:40] [INFO ] Invariant cache hit.
[2024-05-27 21:30:40] [INFO ] [Real]Absence check using 10000 positive place invariants in 205902 ms returned unknown
Interrupted Random directed walk after 19997 steps, including 0 resets, run timeout after 37648 ms. (steps per millisecond=0 )
Interrupted Random walk after 75337 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=2 )
Interrupted Random directed walk after 20000 steps, including 0 resets, run timeout after 37336 ms. (steps per millisecond=0 )
Interrupted Random walk after 74725 steps, including 0 resets, run timeout after 30001 ms. (steps per millisecond=2 )
[2024-05-27 21:32:57] [INFO ] Flatten gal took : 1633 ms
Starting structural reductions in LIVENESS mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Performed 5000 Post agglomeration using F-continuation condition.Transition count delta: 5000
Deduced a syphon composed of 5000 places in 29 ms
Reduce places removed 5000 places and 0 transitions.
Iterating global reduction 0 with 10000 rules applied. Total rules applied 10000 place count 20000 transition count 20000
Applied a total of 10000 rules in 3582 ms. Remains 20000 /25000 variables (removed 5000) and now considering 20000/25000 (removed 5000) transitions.
// Phase 1: matrix 20000 rows 20000 cols
[2024-05-27 21:33:01] [INFO ] Computed 10000 invariants in 80 ms
[2024-05-27 21:33:42] [INFO ] Performed 10800/20000 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-27 21:34:05] [INFO ] Implicit Places using invariants in 64417 ms returned []
Implicit Place search using SMT only with invariants took 64419 ms to find 0 implicit places.
Running 10000 sub problems to find dead transitions.
[2024-05-27 21:34:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/15000 variables, 5000/5000 constraints. Problems are: Problem set: 0 solved, 10000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 15000/40000 variables, and 5000 constraints, problems are : Problem set: 0 solved, 10000 unsolved in 30214 ms.
Refiners :[Positive P Invariants (semi-flows): 5000/10000 constraints, State Equation: 0/20000 constraints, PredecessorRefiner: 10000/10000 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10000 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15000 variables, 5000/5000 constraints. Problems are: Problem set: 0 solved, 10000 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 Int declared 15000/40000 variables, and 5000 constraints, problems are : Problem set: 0 solved, 10000 unsolved in 30172 ms.
Refiners :[Positive P Invariants (semi-flows): 5000/10000 constraints, State Equation: 0/20000 constraints, PredecessorRefiner: 0/10000 constraints, Known Traps: 0/0 constraints]
After SMT, in 79532ms problems are : Problem set: 0 solved, 10000 unsolved
Search for dead transitions found 0 dead transitions in 79753ms
Starting structural reductions in LIVENESS mode, iteration 1 : 20000/25000 places, 20000/25000 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 147787 ms. Remains : 20000/25000 places, 20000/25000 transitions.
Initial state reduction rules removed 10000 formulas.
RANDOM walk for 40000 steps (8 resets) in 72008 ms. (0 steps per ms) remains 363/10000 properties
BEST_FIRST walk for 404 steps (0 resets) in 111 ms. (3 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (0 resets) in 131 ms. (3 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (0 resets) in 110 ms. (3 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (0 resets) in 88 ms. (4 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (0 resets) in 88 ms. (4 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (0 resets) in 89 ms. (4 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (0 resets) in 87 ms. (4 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (0 resets) in 93 ms. (4 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (0 resets) in 96 ms. (4 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (0 resets) in 115 ms. (3 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (0 resets) in 113 ms. (3 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (0 resets) in 137 ms. (2 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (0 resets) in 114 ms. (3 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (0 resets) in 124 ms. (3 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (0 resets) in 112 ms. (3 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (0 resets) in 116 ms. (3 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (0 resets) in 120 ms. (3 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (0 resets) in 114 ms. (3 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (0 resets) in 113 ms. (3 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (0 resets) in 113 ms. (3 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (0 resets) in 111 ms. (3 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (0 resets) in 115 ms. (3 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (0 resets) in 112 ms. (3 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (0 resets) in 108 ms. (3 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (0 resets) in 111 ms. (3 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (0 resets) in 114 ms. (3 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (0 resets) in 108 ms. (3 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (0 resets) in 110 ms. (3 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (0 resets) in 109 ms. (3 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (0 resets) in 110 ms. (3 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (0 resets) in 108 ms. (3 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (0 resets) in 112 ms. (3 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (0 resets) in 107 ms. (3 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (0 resets) in 107 ms. (3 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (0 resets) in 108 ms. (3 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (0 resets) in 106 ms. (3 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (0 resets) in 106 ms. (3 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (0 resets) in 108 ms. (3 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (0 resets) in 104 ms. (3 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (0 resets) in 104 ms. (3 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (0 resets) in 102 ms. (3 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (0 resets) in 102 ms. (3 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (0 resets) in 111 ms. (3 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (0 resets) in 104 ms. (3 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (0 resets) in 112 ms. (3 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (0 resets) in 115 ms. (3 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (0 resets) in 109 ms. (3 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (0 resets) in 104 ms. (3 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (0 resets) in 104 ms. (3 steps per ms) remains 363/363 properties
BEST_FIRST walk for 404 steps (0 resets) in 116 ms. (3 steps per ms) remains 363/363 properties
[2024-05-27 21:35:46] [INFO ] Invariant cache hit.
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 718/40000 variables, and 0 constraints, problems are : Problem set: 0 solved, 363 unsolved in 5018 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10000 constraints, State Equation: 0/20000 constraints, PredecessorRefiner: 363/363 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 363 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 Int declared 718/40000 variables, and 0 constraints, problems are : Problem set: 0 solved, 363 unsolved in 5019 ms.
Refiners :[Positive P Invariants (semi-flows): 0/10000 constraints, State Equation: 0/20000 constraints, PredecessorRefiner: 0/363 constraints, Known Traps: 0/0 constraints]
After SMT, in 11177ms problems are : Problem set: 0 solved, 363 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 718 out of 20000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 20000/20000 places, 20000/20000 transitions.
Free-agglomeration rule (complex) applied 8946 times.
Iterating global reduction 0 with 8946 rules applied. Total rules applied 8946 place count 20000 transition count 11054
Reduce places removed 17563 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 8946 transitions
Reduce isomorphic transitions removed 8946 transitions.
Iterating post reduction 0 with 26509 rules applied. Total rules applied 35455 place count 2437 transition count 2108
Applied a total of 35455 rules in 14748 ms. Remains 2437 /20000 variables (removed 17563) and now considering 2108/20000 (removed 17892) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14751 ms. Remains : 2437/20000 places, 2108/20000 transitions.
RANDOM walk for 60102 steps (0 resets) in 8146 ms. (7 steps per ms) remains 0/363 properties
Able to resolve query QuasiLiveness after proving 20000 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 25000/25000 places, 25000/25000 transitions.
Performed 5000 Post agglomeration using F-continuation condition.Transition count delta: 5000
Deduced a syphon composed of 5000 places in 3 ms
Reduce places removed 5000 places and 0 transitions.
Iterating global reduction 0 with 10000 rules applied. Total rules applied 10000 place count 20000 transition count 20000
Applied a total of 10000 rules in 3067 ms. Remains 20000 /25000 variables (removed 5000) and now considering 20000/25000 (removed 5000) transitions.
[2024-05-27 21:36:18] [INFO ] Invariant cache hit.
[2024-05-27 21:36:59] [INFO ] Performed 10397/20000 implicitness test of which 0 returned IMPLICIT in 30 seconds.
[2024-05-27 21:37:23] [INFO ] Implicit Places using invariants in 65382 ms returned []
Implicit Place search using SMT only with invariants took 65386 ms to find 0 implicit places.
Running 10000 sub problems to find dead transitions.
[2024-05-27 21:37:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/15000 variables, 5000/5000 constraints. Problems are: Problem set: 0 solved, 10000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 15000/40000 variables, and 5000 constraints, problems are : Problem set: 0 solved, 10000 unsolved in 30256 ms.
Refiners :[Positive P Invariants (semi-flows): 5000/10000 constraints, State Equation: 0/20000 constraints, PredecessorRefiner: 10000/10000 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 10000 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/15000 variables, 5000/5000 constraints. Problems are: Problem set: 0 solved, 10000 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 15000/40000 variables, and 5000 constraints, problems are : Problem set: 0 solved, 10000 unsolved in 30287 ms.
Refiners :[Positive P Invariants (semi-flows): 5000/10000 constraints, State Equation: 0/20000 constraints, PredecessorRefiner: 0/10000 constraints, Known Traps: 0/0 constraints]
After SMT, in 79848ms problems are : Problem set: 0 solved, 10000 unsolved
Search for dead transitions found 0 dead transitions in 79974ms
Starting structural reductions in LIVENESS mode, iteration 1 : 20000/25000 places, 20000/25000 transitions.
Finished structural reductions in LIVENESS mode , in 1 iterations and 148458 ms. Remains : 20000/25000 places, 20000/25000 transitions.
Net is quasi-live, checking if it is reversible to establish liveness.
Unable to solve all queries for examination Liveness. Remains :1 assertions to prove.
Unable to solve all queries for examination Liveness. Remains :20000 assertions to prove.
No /home/mcc/execution/Liveness.xml examination file found. Proceeding without properties.
Parsed 20000 properties from file /home/mcc/execution/Liveness.xml in 2 ms.
Working with output stream class java.io.PrintStream
Total runtime 1512752 ms.
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running Philosophers-PT-005000

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: 25000
TRANSITIONS: 25000
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.925s, Sys 0.084s]


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


----------------------------------------------------------------------
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: 653
MODEL NAME: /home/mcc/execution/model
25000 places, 25000 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..

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 Liveness -timeout 180 -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="Philosophers-PT-005000"
export BK_EXAMINATION="Liveness"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 Philosophers-PT-005000, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r276-smll-171654416500349"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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