fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r537-tall-167987254700009
Last Updated
May 14, 2023

About the Execution of Smart+red for Anderson-PT-05

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
3214.075 1800000.00 1840081.00 4634.90 [undef] Time out reached

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r537-tall-167987254700009.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................
=====================================================================
Generated by BenchKit 2-5348
Executing tool smartxred
Input is Anderson-PT-05, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r537-tall-167987254700009
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.1K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 7.5K Mar 23 15:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K Mar 23 15:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Mar 23 15:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 23 15:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 185K Mar 31 16:48 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 1680818318705

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=smartxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=Anderson-PT-05
Applying reductions before tool smart
Invoking reducer
Running Version 202304061127
[2023-04-06 21:58:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2023-04-06 21:58:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-06 21:58:40] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2023-04-06 21:58:40] [INFO ] Transformed 161 places.
[2023-04-06 21:58:40] [INFO ] Transformed 365 transitions.
[2023-04-06 21:58:40] [INFO ] Found NUPN structural information;
[2023-04-06 21:58:40] [INFO ] Parsed PT model containing 161 places and 365 transitions and 1380 arcs in 123 ms.
Built sparse matrix representations for Structural reductions in 7 ms.19403KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 161/161 places, 365/365 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 28 ms. Remains 161 /161 variables (removed 0) and now considering 365/365 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 28 ms. Remains : 161/161 places, 365/365 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 161/161 places, 365/365 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 17 ms. Remains 161 /161 variables (removed 0) and now considering 365/365 (removed 0) transitions.
// Phase 1: matrix 365 rows 161 cols
[2023-04-06 21:58:40] [INFO ] Computed 13 invariants in 26 ms
[2023-04-06 21:58:40] [INFO ] Implicit Places using invariants in 224 ms returned []
[2023-04-06 21:58:40] [INFO ] Invariant cache hit.
[2023-04-06 21:58:40] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-04-06 21:58:40] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 424 ms to find 0 implicit places.
[2023-04-06 21:58:40] [INFO ] Redundant transitions in 20 ms returned []
[2023-04-06 21:58:40] [INFO ] Invariant cache hit.
[2023-04-06 21:58:41] [INFO ] Dead Transitions using invariants and state equation in 288 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 757 ms. Remains : 161/161 places, 365/365 transitions.
Random walk for 1250000 steps, including 0 resets, run took 1276 ms (no deadlock found). (steps per millisecond=979 )
Random directed walk for 1250000 steps, including 0 resets, run took 1050 ms (no deadlock found). (steps per millisecond=1190 )
[2023-04-06 21:58:43] [INFO ] Invariant cache hit.
[2023-04-06 21:58:43] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2023-04-06 21:58:43] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 43 ms returned unsat
Starting structural reductions in LIVENESS mode, iteration 0 : 161/161 places, 365/365 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 161 transition count 345
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 141 transition count 345
Applied a total of 40 rules in 14 ms. Remains 141 /161 variables (removed 20) and now considering 345/365 (removed 20) transitions.
// Phase 1: matrix 345 rows 141 cols
[2023-04-06 21:58:43] [INFO ] Computed 13 invariants in 11 ms
[2023-04-06 21:58:43] [INFO ] Implicit Places using invariants in 190 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 193 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 140/161 places, 345/365 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 140 transition count 320
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 115 transition count 320
Applied a total of 50 rules in 4 ms. Remains 115 /140 variables (removed 25) and now considering 320/345 (removed 25) transitions.
// Phase 1: matrix 320 rows 115 cols
[2023-04-06 21:58:43] [INFO ] Computed 12 invariants in 3 ms
[2023-04-06 21:58:44] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-04-06 21:58:44] [INFO ] Invariant cache hit.
[2023-04-06 21:58:44] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-04-06 21:58:44] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 514 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 115/161 places, 320/365 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 725 ms. Remains : 115/161 places, 320/365 transitions.
Initial state reduction rules removed 5 formulas.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 456 ms. (steps per millisecond=21 ) properties (out of 315) seen :269
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 46) seen :6
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 40) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 37) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 35) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 35) seen :2
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 33) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 31) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 26) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :2
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 23) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 17) seen :0
Running SMT prover for 17 properties.
[2023-04-06 21:58:45] [INFO ] Invariant cache hit.
[2023-04-06 21:58:45] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-04-06 21:58:45] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 21:58:45] [INFO ] After 612ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2023-04-06 21:58:45] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-04-06 21:58:45] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2023-04-06 21:58:46] [INFO ] After 429ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2023-04-06 21:58:46] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-04-06 21:58:46] [INFO ] After 352ms SMT Verify possible using 35 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2023-04-06 21:58:47] [INFO ] After 859ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 361 ms.
[2023-04-06 21:58:47] [INFO ] After 1792ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Parikh walk visited 0 properties in 54 ms.
Support contains 13 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 320/320 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 86 transition count 219
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 86 transition count 219
Applied a total of 58 rules in 16 ms. Remains 86 /115 variables (removed 29) and now considering 219/320 (removed 101) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 86/115 places, 219/320 transitions.
Finished random walk after 703739 steps, including 2 resets, run visited all 17 properties in 7508 ms. (steps per millisecond=93 )
Parikh walk visited 0 properties in 0 ms.
Able to resolve query QuasiLiveness after proving 320 properties.
Starting structural reductions in LIVENESS mode, iteration 0 : 161/161 places, 365/365 transitions.
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 20 Pre rules applied. Total rules applied 0 place count 161 transition count 345
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 40 place count 141 transition count 345
Applied a total of 40 rules in 5 ms. Remains 141 /161 variables (removed 20) and now considering 345/365 (removed 20) transitions.
// Phase 1: matrix 345 rows 141 cols
[2023-04-06 21:58:55] [INFO ] Computed 13 invariants in 6 ms
[2023-04-06 21:58:55] [INFO ] Implicit Places using invariants in 171 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 172 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 140/161 places, 345/365 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 140 transition count 320
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 115 transition count 320
Applied a total of 50 rules in 4 ms. Remains 115 /140 variables (removed 25) and now considering 320/345 (removed 25) transitions.
// Phase 1: matrix 320 rows 115 cols
[2023-04-06 21:58:55] [INFO ] Computed 12 invariants in 3 ms
[2023-04-06 21:58:55] [INFO ] Implicit Places using invariants in 116 ms returned []
[2023-04-06 21:58:55] [INFO ] Invariant cache hit.
[2023-04-06 21:58:55] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-04-06 21:58:55] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 453 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 115/161 places, 320/365 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 634 ms. Remains : 115/161 places, 320/365 transitions.
Unable to solve all queries for examination Liveness. Remains :320 assertions to prove.
No /home/mcc/execution/Liveness.xml examination file found. Proceeding without properties.
Parsed 320 properties from file /home/mcc/execution/Liveness.xml in 0 ms.
Working with output stream class java.io.PrintStream
Total runtime 15571 ms.
======================================================
========== this is Smart for the MCC'2018 ============
======================================================
Running Anderson (PT), instance 05
Examination Liveness
Parser /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//parser/Liveness.jar
Model checker /home/mcc/BenchKit/bin//../reducer/bin//../../smart/bin//rem_exec//smart

PNML FILE: model.pnml
Petri model created: 161 places, 365 transitions, 1380 arcs.
(potential((tk(P17)>=1) & (tk(P7)>=1)))
(potential((tk(P17)>=1) & (tk(P8)>=1)))
(potential((tk(P17)>=1) & (tk(P9)>=1)))
(potential((tk(P17)>=1) & (tk(P10)>=1)))
(potential((tk(P17)>=1) & (tk(P11)>=1)))
(potential((tk(P17)>=1) & (tk(P12)>=1)))
(potential((tk(P17)>=1) & (tk(P13)>=1)))
(potential((tk(P17)>=1) & (tk(P14)>=1)))
(potential((tk(P17)>=1) & (tk(P15)>=1)))
(potential((tk(P18)>=1) & (tk(P7)>=1)))
(potential((tk(P18)>=1) & (tk(P8)>=1)))
(potential((tk(P18)>=1) & (tk(P9)>=1)))
(potential((tk(P18)>=1) & (tk(P10)>=1)))
(potential((tk(P18)>=1) & (tk(P11)>=1)))
(potential((tk(P18)>=1) & (tk(P12)>=1)))
(potential((tk(P18)>=1) & (tk(P13)>=1)))
(potential((tk(P18)>=1) & (tk(P14)>=1)))
(potential((tk(P18)>=1) & (tk(P15)>=1)))
(potential((tk(P19)>=1) & (tk(P7)>=1)))
(potential((tk(P19)>=1) & (tk(P8)>=1)))
(potential((tk(P19)>=1) & (tk(P9)>=1)))
(potential((tk(P19)>=1) & (tk(P10)>=1)))
(potential((tk(P19)>=1) & (tk(P11)>=1)))
(potential((tk(P19)>=1) & (tk(P12)>=1)))
(potential((tk(P19)>=1) & (tk(P13)>=1)))
(potential((tk(P19)>=1) & (tk(P14)>=1)))
(potential((tk(P19)>=1) & (tk(P15)>=1)))
(potential((tk(P20)>=1) & (tk(P7)>=1)))
(potential((tk(P20)>=1) & (tk(P8)>=1)))
(potential((tk(P20)>=1) & (tk(P9)>=1)))
(potential((tk(P20)>=1) & (tk(P10)>=1)))
(potential((tk(P20)>=1) & (tk(P11)>=1)))
(potential((tk(P20)>=1) & (tk(P12)>=1)))
(potential((tk(P20)>=1) & (tk(P13)>=1)))
(potential((tk(P20)>=1) & (tk(P14)>=1)))
(potential((tk(P20)>=1) & (tk(P15)>=1)))
(potential((tk(P21)>=1) & (tk(P7)>=1)))
(potential((tk(P21)>=1) & (tk(P8)>=1)))
(potential((tk(P21)>=1) & (tk(P9)>=1)))
(potential((tk(P21)>=1) & (tk(P10)>=1)))
(potential((tk(P21)>=1) & (tk(P11)>=1)))
(potential((tk(P21)>=1) & (tk(P12)>=1)))
(potential((tk(P21)>=1) & (tk(P13)>=1)))
(potential((tk(P21)>=1) & (tk(P14)>=1)))
(potential((tk(P21)>=1) & (tk(P15)>=1)))
(potential((tk(P22)>=1) & (tk(P7)>=1)))
(potential((tk(P22)>=1) & (tk(P8)>=1)))
(potential((tk(P22)>=1) & (tk(P9)>=1)))
(potential((tk(P22)>=1) & (tk(P10)>=1)))
(potential((tk(P22)>=1) & (tk(P11)>=1)))
(potential((tk(P22)>=1) & (tk(P12)>=1)))
(potential((tk(P22)>=1) & (tk(P13)>=1)))
(potential((tk(P22)>=1) & (tk(P14)>=1)))
(potential((tk(P22)>=1) & (tk(P15)>=1)))
(potential((tk(P23)>=1) & (tk(P7)>=1)))
(potential((tk(P23)>=1) & (tk(P8)>=1)))
(potential((tk(P23)>=1) & (tk(P9)>=1)))
(potential((tk(P23)>=1) & (tk(P10)>=1)))
(potential((tk(P23)>=1) & (tk(P11)>=1)))
(potential((tk(P23)>=1) & (tk(P12)>=1)))
(potential((tk(P23)>=1) & (tk(P13)>=1)))
(potential((tk(P23)>=1) & (tk(P14)>=1)))
(potential((tk(P23)>=1) & (tk(P15)>=1)))
(potential((tk(P24)>=1) & (tk(P7)>=1)))
(potential((tk(P24)>=1) & (tk(P8)>=1)))
(potential((tk(P24)>=1) & (tk(P9)>=1)))
(potential((tk(P24)>=1) & (tk(P10)>=1)))
(potential((tk(P24)>=1) & (tk(P11)>=1)))
(potential((tk(P24)>=1) & (tk(P12)>=1)))
(potential((tk(P24)>=1) & (tk(P13)>=1)))
(potential((tk(P24)>=1) & (tk(P14)>=1)))
(potential((tk(P24)>=1) & (tk(P15)>=1)))
(potential((tk(P25)>=1) & (tk(P7)>=1)))
(potential((tk(P25)>=1) & (tk(P8)>=1)))
(potential((tk(P25)>=1) & (tk(P9)>=1)))
(potential((tk(P25)>=1) & (tk(P10)>=1)))
(potential((tk(P25)>=1) & (tk(P11)>=1)))
(potential((tk(P25)>=1) & (tk(P12)>=1)))
(potential((tk(P25)>=1) & (tk(P13)>=1)))
(potential((tk(P25)>=1) & (tk(P14)>=1)))
(potential((tk(P25)>=1) & (tk(P15)>=1)))
(potential((tk(P26)>=1) & (tk(P7)>=1)))
(potential((tk(P26)>=1) & (tk(P8)>=1)))
(potential((tk(P26)>=1) & (tk(P9)>=1)))
(potential((tk(P26)>=1) & (tk(P10)>=1)))
(potential((tk(P26)>=1) & (tk(P11)>=1)))
(potential((tk(P26)>=1) & (tk(P12)>=1)))
(potential((tk(P26)>=1) & (tk(P13)>=1)))
(potential((tk(P26)>=1) & (tk(P14)>=1)))
(potential((tk(P26)>=1) & (tk(P15)>=1)))
(potential((tk(P27)>=1) & (tk(P7)>=1)))
(potential((tk(P27)>=1) & (tk(P8)>=1)))
(potential((tk(P27)>=1) & (tk(P9)>=1)))
(potential((tk(P27)>=1) & (tk(P10)>=1)))
(potential((tk(P27)>=1) & (tk(P11)>=1)))
(potential((tk(P27)>=1) & (tk(P12)>=1)))
(potential((tk(P27)>=1) & (tk(P13)>=1)))
(potential((tk(P27)>=1) & (tk(P14)>=1)))
(potential((tk(P27)>=1) & (tk(P15)>=1)))
(potential((tk(P28)>=1) & (tk(P7)>=1)))
(potential((tk(P28)>=1) & (tk(P8)>=1)))
(potential((tk(P28)>=1) & (tk(P9)>=1)))
(potential((tk(P28)>=1) & (tk(P10)>=1)))
(potential((tk(P28)>=1) & (tk(P11)>=1)))
(potential((tk(P28)>=1) & (tk(P12)>=1)))
(potential((tk(P28)>=1) & (tk(P13)>=1)))
(potential((tk(P28)>=1) & (tk(P14)>=1)))
(potential((tk(P28)>=1) & (tk(P15)>=1)))
(potential((tk(P29)>=1) & (tk(P7)>=1)))
(potential((tk(P29)>=1) & (tk(P8)>=1)))
(potential((tk(P29)>=1) & (tk(P9)>=1)))
(potential((tk(P29)>=1) & (tk(P10)>=1)))
(potential((tk(P29)>=1) & (tk(P11)>=1)))
(potential((tk(P29)>=1) & (tk(P12)>=1)))
(potential((tk(P29)>=1) & (tk(P13)>=1)))
(potential((tk(P29)>=1) & (tk(P14)>=1)))
(potential((tk(P29)>=1) & (tk(P15)>=1)))
(potential((tk(P30)>=1) & (tk(P7)>=1)))
(potential((tk(P30)>=1) & (tk(P8)>=1)))
(potential((tk(P30)>=1) & (tk(P9)>=1)))
(potential((tk(P30)>=1) & (tk(P10)>=1)))
(potential((tk(P30)>=1) & (tk(P11)>=1)))
(potential((tk(P30)>=1) & (tk(P12)>=1)))
(potential((tk(P30)>=1) & (tk(P13)>=1)))
(potential((tk(P30)>=1) & (tk(P14)>=1)))
(potential((tk(P30)>=1) & (tk(P15)>=1)))
(potential((tk(P31)>=1) & (tk(P7)>=1)))
(potential((tk(P31)>=1) & (tk(P8)>=1)))
(potential((tk(P31)>=1) & (tk(P9)>=1)))
(potential((tk(P31)>=1) & (tk(P10)>=1)))
(potential((tk(P31)>=1) & (tk(P11)>=1)))
(potential((tk(P31)>=1) & (tk(P12)>=1)))
(potential((tk(P31)>=1) & (tk(P13)>=1)))
(potential((tk(P31)>=1) & (tk(P14)>=1)))
(potential((tk(P31)>=1) & (tk(P15)>=1)))
(potential((tk(P32)>=1) & (tk(P7)>=1)))
(potential((tk(P32)>=1) & (tk(P8)>=1)))
(potential((tk(P32)>=1) & (tk(P9)>=1)))
(potential((tk(P32)>=1) & (tk(P10)>=1)))
(potential((tk(P32)>=1) & (tk(P11)>=1)))
(potential((tk(P32)>=1) & (tk(P12)>=1)))
(potential((tk(P32)>=1) & (tk(P13)>=1)))
(potential((tk(P32)>=1) & (tk(P14)>=1)))
(potential((tk(P32)>=1) & (tk(P15)>=1)))
(potential((tk(P33)>=1) & (tk(P7)>=1)))
(potential((tk(P33)>=1) & (tk(P8)>=1)))
(potential((tk(P33)>=1) & (tk(P9)>=1)))
(potential((tk(P33)>=1) & (tk(P10)>=1)))
(potential((tk(P33)>=1) & (tk(P11)>=1)))
(potential((tk(P33)>=1) & (tk(P12)>=1)))
(potential((tk(P33)>=1) & (tk(P13)>=1)))
(potential((tk(P33)>=1) & (tk(P14)>=1)))
(potential((tk(P33)>=1) & (tk(P15)>=1)))
(potential((tk(P34)>=1) & (tk(P7)>=1)))
(potential((tk(P34)>=1) & (tk(P8)>=1)))
(potential((tk(P34)>=1) & (tk(P9)>=1)))
(potential((tk(P34)>=1) & (tk(P10)>=1)))
(potential((tk(P34)>=1) & (tk(P11)>=1)))
(potential((tk(P34)>=1) & (tk(P12)>=1)))
(potential((tk(P34)>=1) & (tk(P13)>=1)))
(potential((tk(P34)>=1) & (tk(P14)>=1)))
(potential((tk(P34)>=1) & (tk(P15)>=1)))
(potential((tk(P35)>=1) & (tk(P7)>=1)))
(potential((tk(P35)>=1) & (tk(P8)>=1)))
(potential((tk(P35)>=1) & (tk(P9)>=1)))
(potential((tk(P35)>=1) & (tk(P10)>=1)))
(potential((tk(P35)>=1) & (tk(P11)>=1)))
(potential((tk(P35)>=1) & (tk(P12)>=1)))
(potential((tk(P35)>=1) & (tk(P13)>=1)))
(potential((tk(P35)>=1) & (tk(P14)>=1)))
(potential((tk(P35)>=1) & (tk(P15)>=1)))
(potential((tk(P36)>=1) & (tk(P7)>=1)))
(potential((tk(P36)>=1) & (tk(P8)>=1)))
(potential((tk(P36)>=1) & (tk(P9)>=1)))
(potential((tk(P36)>=1) & (tk(P10)>=1)))
(potential((tk(P36)>=1) & (tk(P11)>=1)))
(potential((tk(P36)>=1) & (tk(P12)>=1)))
(potential((tk(P36)>=1) & (tk(P13)>=1)))
(potential((tk(P36)>=1) & (tk(P14)>=1)))
(potential((tk(P36)>=1) & (tk(P15)>=1)))
(potential((tk(P37)>=1) & (tk(P7)>=1)))
(potential((tk(P37)>=1) & (tk(P8)>=1)))
(potential((tk(P37)>=1) & (tk(P9)>=1)))
(potential((tk(P37)>=1) & (tk(P10)>=1)))
(potential((tk(P37)>=1) & (tk(P11)>=1)))
(potential((tk(P37)>=1) & (tk(P12)>=1)))
(potential((tk(P37)>=1) & (tk(P13)>=1)))
(potential((tk(P37)>=1) & (tk(P14)>=1)))
(potential((tk(P37)>=1) & (tk(P15)>=1)))
(potential((tk(P38)>=1) & (tk(P7)>=1)))
(potential((tk(P38)>=1) & (tk(P8)>=1)))
(potential((tk(P38)>=1) & (tk(P9)>=1)))
(potential((tk(P38)>=1) & (tk(P10)>=1)))
(potential((tk(P38)>=1) & (tk(P11)>=1)))
(potential((tk(P38)>=1) & (tk(P12)>=1)))
(potential((tk(P38)>=1) & (tk(P13)>=1)))
(potential((tk(P38)>=1) & (tk(P14)>=1)))
(potential((tk(P38)>=1) & (tk(P15)>=1)))
(potential((tk(P39)>=1) & (tk(P7)>=1)))
(potential((tk(P39)>=1) & (tk(P8)>=1)))
(potential((tk(P39)>=1) & (tk(P9)>=1)))
(potential((tk(P39)>=1) & (tk(P10)>=1)))
(potential((tk(P39)>=1) & (tk(P11)>=1)))
(potential((tk(P39)>=1) & (tk(P12)>=1)))
(potential((tk(P39)>=1) & (tk(P13)>=1)))
(potential((tk(P39)>=1) & (tk(P14)>=1)))
(potential((tk(P39)>=1) & (tk(P15)>=1)))
(potential((tk(P40)>=1) & (tk(P7)>=1)))
(potential((tk(P40)>=1) & (tk(P8)>=1)))
(potential((tk(P40)>=1) & (tk(P9)>=1)))
(potential((tk(P40)>=1) & (tk(P10)>=1)))
(potential((tk(P40)>=1) & (tk(P11)>=1)))
(potential((tk(P40)>=1) & (tk(P12)>=1)))
(potential((tk(P40)>=1) & (tk(P13)>=1)))
(potential((tk(P40)>=1) & (tk(P14)>=1)))
(potential((tk(P40)>=1) & (tk(P15)>=1)))
(potential((tk(P41)>=1) & (tk(P7)>=1)))
(potential((tk(P41)>=1) & (tk(P8)>=1)))
(potential((tk(P41)>=1) & (tk(P9)>=1)))
(potential((tk(P41)>=1) & (tk(P10)>=1)))
(potential((tk(P41)>=1) & (tk(P11)>=1)))
(potential((tk(P41)>=1) & (tk(P12)>=1)))
(potential((tk(P41)>=1) & (tk(P13)>=1)))
(potential((tk(P41)>=1) & (tk(P14)>=1)))
(potential((tk(P41)>=1) & (tk(P15)>=1)))
(potential((tk(P46)>=1) & (tk(P12)>=1)))
(potential((tk(P46)>=1) & (tk(P13)>=1)))
(potential((tk(P46)>=1) & (tk(P14)>=1)))
(potential((tk(P46)>=1) & (tk(P15)>=1)))
(potential((tk(P46)>=1) & (tk(P16)>=1)))
(potential((tk(P55)>=1) & (tk(P12)>=1)))
(potential((tk(P55)>=1) & (tk(P13)>=1)))
(potential((tk(P55)>=1) & (tk(P14)>=1)))
(potential((tk(P55)>=1) & (tk(P15)>=1)))
(potential((tk(P55)>=1) & (tk(P16)>=1)))
(potential((tk(P64)>=1) & (tk(P12)>=1)))
(potential((tk(P64)>=1) & (tk(P13)>=1)))
(potential((tk(P64)>=1) & (tk(P14)>=1)))
(potential((tk(P64)>=1) & (tk(P15)>=1)))
(potential((tk(P64)>=1) & (tk(P16)>=1)))
(potential((tk(P73)>=1) & (tk(P12)>=1)))
(potential((tk(P73)>=1) & (tk(P13)>=1)))
(potential((tk(P73)>=1) & (tk(P14)>=1)))
(potential((tk(P73)>=1) & (tk(P15)>=1)))
(potential((tk(P73)>=1) & (tk(P16)>=1)))
(potential((tk(P82)>=1) & (tk(P12)>=1)))
(potential((tk(P82)>=1) & (tk(P13)>=1)))
(potential((tk(P82)>=1) & (tk(P14)>=1)))
(potential((tk(P82)>=1) & (tk(P15)>=1)))
(potential((tk(P82)>=1) & (tk(P16)>=1)))
(potential((tk(P42)>=1)))
(potential((tk(P43)>=1)))
(potential((tk(P44)>=1)))
(potential((tk(P45)>=1)))
(potential((tk(P47)>=1)))
(potential((tk(P48)>=1)))
(potential((tk(P49)>=1)))
(potential((tk(P50)>=1)))
(potential((tk(P51)>=1)))
(potential((tk(P52)>=1)))
(potential((tk(P53)>=1)))
(potential((tk(P54)>=1)))
(potential((tk(P56)>=1)))
(potential((tk(P57)>=1)))
(potential((tk(P58)>=1)))
(potential((tk(P59)>=1)))
(potential((tk(P60)>=1)))
(potential((tk(P61)>=1)))
(potential((tk(P62)>=1)))
(potential((tk(P63)>=1)))
(potential((tk(P65)>=1)))
(potential((tk(P66)>=1)))
(potential((tk(P67)>=1)))
(potential((tk(P68)>=1)))
(potential((tk(P69)>=1)))
(potential((tk(P70)>=1)))
(potential((tk(P71)>=1)))
(potential((tk(P72)>=1)))
(potential((tk(P74)>=1)))
(potential((tk(P75)>=1)))
(potential((tk(P76)>=1)))
(potential((tk(P77)>=1)))
(potential((tk(P78)>=1)))
(potential((tk(P79)>=1)))
(potential((tk(P80)>=1)))
(potential((tk(P81)>=1)))
(potential((tk(P83)>=1)))
(potential((tk(P84)>=1)))
(potential((tk(P85)>=1)))
(potential((tk(P86)>=1)))
(potential((tk(P87)>=1) & (tk(P6)>=1)))
(potential((tk(P88)>=1) & (tk(P5)>=1)))
(potential((tk(P89)>=1) & (tk(P4)>=1)))
(potential((tk(P90)>=1) & (tk(P3)>=1)))
(potential((tk(P91)>=1) & (tk(P2)>=1)))
(potential((tk(P92)>=1) & (tk(P6)>=1)))
(potential((tk(P93)>=1) & (tk(P5)>=1)))
(potential((tk(P94)>=1) & (tk(P4)>=1)))
(potential((tk(P95)>=1) & (tk(P3)>=1)))
(potential((tk(P96)>=1) & (tk(P2)>=1)))
(potential((tk(P97)>=1) & (tk(P6)>=1)))
(potential((tk(P98)>=1) & (tk(P5)>=1)))
(potential((tk(P99)>=1) & (tk(P4)>=1)))
(potential((tk(P100)>=1) & (tk(P3)>=1)))
(potential((tk(P101)>=1) & (tk(P2)>=1)))
(potential((tk(P102)>=1) & (tk(P6)>=1)))
(potential((tk(P103)>=1) & (tk(P5)>=1)))
(potential((tk(P104)>=1) & (tk(P4)>=1)))
(potential((tk(P105)>=1) & (tk(P3)>=1)))
(potential((tk(P106)>=1) & (tk(P2)>=1)))
(potential((tk(P107)>=1) & (tk(P6)>=1)))
(potential((tk(P108)>=1) & (tk(P5)>=1)))
(potential((tk(P109)>=1) & (tk(P4)>=1)))
(potential((tk(P110)>=1) & (tk(P3)>=1)))
(potential((tk(P111)>=1) & (tk(P2)>=1)))
(potential((tk(P112)>=1) & (tk(P6)>=1)))
(potential((tk(P113)>=1) & (tk(P5)>=1)))
(potential((tk(P114)>=1) & (tk(P4)>=1)))
(potential((tk(P115)>=1) & (tk(P3)>=1)))
(potential((tk(P116)>=1) & (tk(P2)>=1)))
(potential((tk(P117)>=1) & (tk(P6)>=1)))
(potential((tk(P118)>=1) & (tk(P5)>=1)))
(potential((tk(P119)>=1) & (tk(P4)>=1)))
(potential((tk(P120)>=1) & (tk(P3)>=1)))
(potential((tk(P121)>=1) & (tk(P2)>=1)))
(potential((tk(P122)>=1) & (tk(P6)>=1)))
(potential((tk(P123)>=1) & (tk(P5)>=1)))
(potential((tk(P124)>=1) & (tk(P4)>=1)))
(potential((tk(P125)>=1) & (tk(P3)>=1)))
(potential((tk(P126)>=1) & (tk(P2)>=1)))
(potential((tk(P127)>=1) & (tk(P6)>=1)))
(potential((tk(P128)>=1) & (tk(P5)>=1)))
(potential((tk(P129)>=1) & (tk(P4)>=1)))
(potential((tk(P130)>=1) & (tk(P3)>=1)))
(potential((tk(P131)>=1) & (tk(P2)>=1)))
(potential((tk(P132)>=1) & (tk(P6)>=1)))
(potential((tk(P133)>=1) & (tk(P5)>=1)))
(potential((tk(P134)>=1) & (tk(P4)>=1)))
(potential((tk(P135)>=1) & (tk(P3)>=1)))
(potential((tk(P136)>=1) & (tk(P2)>=1)))
(potential((tk(P137)>=1) & (tk(P1)>=1)))
(potential((tk(P138)>=1) & (tk(P1)>=1)))
(potential((tk(P139)>=1) & (tk(P1)>=1)))
(potential((tk(P140)>=1) & (tk(P1)>=1)))
(potential((tk(P141)>=1) & (tk(P1)>=1)))
(potential((tk(P142)>=1) & (tk(P1)>=1)))
(potential((tk(P143)>=1) & (tk(P1)>=1)))
(potential((tk(P144)>=1) & (tk(P1)>=1)))
(potential((tk(P145)>=1) & (tk(P1)>=1)))
(potential((tk(P146)>=1) & (tk(P1)>=1)))
(potential((tk(P147)>=1) & (tk(P1)>=1)))
(potential((tk(P148)>=1) & (tk(P1)>=1)))
(potential((tk(P149)>=1) & (tk(P1)>=1)))
(potential((tk(P150)>=1) & (tk(P1)>=1)))
(potential((tk(P151)>=1) & (tk(P1)>=1)))
(potential((tk(P152)>=1) & (tk(P1)>=1)))
(potential((tk(P153)>=1) & (tk(P1)>=1)))
(potential((tk(P154)>=1) & (tk(P1)>=1)))
(potential((tk(P155)>=1) & (tk(P1)>=1)))
(potential((tk(P156)>=1) & (tk(P1)>=1)))
(potential((tk(P157)>=1) & (tk(P1)>=1)))
(potential((tk(P158)>=1) & (tk(P1)>=1)))
(potential((tk(P159)>=1) & (tk(P1)>=1)))
(potential((tk(P160)>=1) & (tk(P1)>=1)))
(potential((tk(P161)>=1) & (tk(P1)>=1)))
TIME LIMIT: Killed by timeout after 1800 seconds
MemTotal: 16393216 kB
MemFree: 13000636 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16168260 kB

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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -timeout 180 -rebuildPNML
Caught signal 15, terminating.

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="Anderson-PT-05"
export BK_EXAMINATION="Liveness"
export BK_TOOL="smartxred"
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-5348"
echo " Executing tool smartxred"
echo " Input is Anderson-PT-05, 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 r537-tall-167987254700009"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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