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

About the Execution of LTSMin+red for Vasy2003-PT-none

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
513.296 26033.00 61106.00 274.20 FTTTFFFTFFTFFTTF normal

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.r489-tall-167912707901231.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 ltsminxred
Input is Vasy2003-PT-none, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r489-tall-167912707901231
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 6.5K Feb 25 14:33 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Feb 25 14:33 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 25 14:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 25 14:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Feb 25 17:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 14:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 131K Feb 25 14:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 25 14:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 14:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 207K Mar 5 18:23 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 Vasy2003-PT-none-ReachabilityFireability-00
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-01
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-02
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-03
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-04
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-05
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-06
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-07
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-08
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-09
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-10
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-11
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-12
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-13
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-14
FORMULA_NAME Vasy2003-PT-none-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679346986903

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=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Vasy2003-PT-none
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 21:16:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 21:16:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 21:16:28] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2023-03-20 21:16:28] [INFO ] Transformed 485 places.
[2023-03-20 21:16:28] [INFO ] Transformed 776 transitions.
[2023-03-20 21:16:28] [INFO ] Found NUPN structural information;
[2023-03-20 21:16:28] [INFO ] Parsed PT model containing 485 places and 776 transitions and 2809 arcs in 153 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 24 transitions
Reduce redundant transitions removed 24 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 462 ms. (steps per millisecond=21 ) properties (out of 16) seen :7
FORMULA Vasy2003-PT-none-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
[2023-03-20 21:16:29] [INFO ] Flow matrix only has 696 transitions (discarded 56 similar events)
// Phase 1: matrix 696 rows 485 cols
[2023-03-20 21:16:29] [INFO ] Computed 66 place invariants in 30 ms
[2023-03-20 21:16:30] [INFO ] [Real]Absence check using 59 positive place invariants in 32 ms returned sat
[2023-03-20 21:16:30] [INFO ] [Real]Absence check using 59 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-20 21:16:30] [INFO ] After 483ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-20 21:16:30] [INFO ] [Nat]Absence check using 59 positive place invariants in 38 ms returned sat
[2023-03-20 21:16:30] [INFO ] [Nat]Absence check using 59 positive and 7 generalized place invariants in 5 ms returned sat
[2023-03-20 21:16:31] [INFO ] After 1267ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :7
[2023-03-20 21:16:31] [INFO ] State equation strengthened by 73 read => feed constraints.
[2023-03-20 21:16:33] [INFO ] After 1391ms SMT Verify possible using 73 Read/Feed constraints in natural domain returned unsat :2 sat :7
[2023-03-20 21:16:34] [INFO ] After 2922ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :7
Attempting to minimize the solution found.
Minimization took 1418 ms.
[2023-03-20 21:16:36] [INFO ] After 6055ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :7
FORMULA Vasy2003-PT-none-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Vasy2003-PT-none-ReachabilityFireability-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 9 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 24 ms.
Support contains 87 out of 485 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 485/485 places, 752/752 transitions.
Graph (complete) has 1559 edges and 485 vertex of which 483 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 483 transition count 744
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 9 Pre rules applied. Total rules applied 8 place count 483 transition count 735
Deduced a syphon composed of 9 places in 4 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 1 with 18 rules applied. Total rules applied 26 place count 474 transition count 735
Discarding 131 places :
Symmetric choice reduction at 1 with 131 rule applications. Total rules 157 place count 343 transition count 604
Ensure Unique test removed 1 places
Iterating global reduction 1 with 132 rules applied. Total rules applied 289 place count 342 transition count 604
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 326 place count 342 transition count 567
Discarding 59 places :
Symmetric choice reduction at 2 with 59 rule applications. Total rules 385 place count 283 transition count 495
Iterating global reduction 2 with 59 rules applied. Total rules applied 444 place count 283 transition count 495
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 2 with 43 rules applied. Total rules applied 487 place count 283 transition count 452
Discarding 19 places :
Symmetric choice reduction at 3 with 19 rule applications. Total rules 506 place count 264 transition count 422
Iterating global reduction 3 with 19 rules applied. Total rules applied 525 place count 264 transition count 422
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 535 place count 264 transition count 412
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 537 place count 262 transition count 409
Iterating global reduction 4 with 2 rules applied. Total rules applied 539 place count 262 transition count 409
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 551 place count 256 transition count 403
Graph (complete) has 877 edges and 256 vertex of which 244 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Iterating post reduction 4 with 1 rules applied. Total rules applied 552 place count 244 transition count 400
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 558 place count 244 transition count 394
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 561 place count 241 transition count 390
Iterating global reduction 6 with 3 rules applied. Total rules applied 564 place count 241 transition count 390
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 566 place count 241 transition count 388
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 568 place count 239 transition count 385
Iterating global reduction 7 with 2 rules applied. Total rules applied 570 place count 239 transition count 385
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 7 with 8 rules applied. Total rules applied 578 place count 239 transition count 377
Applied a total of 578 rules in 171 ms. Remains 239 /485 variables (removed 246) and now considering 377/752 (removed 375) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 239/485 places, 377/752 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 7) seen :4
FORMULA Vasy2003-PT-none-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-20 21:16:36] [INFO ] Flow matrix only has 347 transitions (discarded 30 similar events)
// Phase 1: matrix 347 rows 239 cols
[2023-03-20 21:16:36] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-20 21:16:36] [INFO ] After 216ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 21:16:37] [INFO ] [Nat]Absence check using 52 positive place invariants in 8 ms returned sat
[2023-03-20 21:16:37] [INFO ] [Nat]Absence check using 52 positive and 6 generalized place invariants in 9 ms returned sat
[2023-03-20 21:16:37] [INFO ] After 310ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 21:16:37] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-20 21:16:37] [INFO ] After 196ms SMT Verify possible using 48 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 21:16:37] [INFO ] After 417ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 191 ms.
[2023-03-20 21:16:38] [INFO ] After 1072ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 35 ms.
Support contains 40 out of 239 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 239/239 places, 377/377 transitions.
Graph (trivial) has 16 edges and 239 vertex of which 2 / 239 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 817 edges and 238 vertex of which 234 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 3 rules applied. Total rules applied 5 place count 234 transition count 371
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 233 transition count 371
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 233 transition count 369
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 231 transition count 369
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 35 place count 206 transition count 334
Iterating global reduction 2 with 25 rules applied. Total rules applied 60 place count 206 transition count 334
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 73 place count 206 transition count 321
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 85 place count 194 transition count 303
Iterating global reduction 3 with 12 rules applied. Total rules applied 97 place count 194 transition count 303
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 107 place count 194 transition count 293
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 109 place count 192 transition count 291
Iterating global reduction 4 with 2 rules applied. Total rules applied 111 place count 192 transition count 291
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 121 place count 187 transition count 286
Graph (complete) has 627 edges and 187 vertex of which 155 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.0 ms
Discarding 32 places :
Also discarding 8 output transitions
Drop transitions removed 8 transitions
Iterating post reduction 4 with 1 rules applied. Total rules applied 122 place count 155 transition count 278
Drop transitions removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 5 with 16 rules applied. Total rules applied 138 place count 155 transition count 262
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 141 place count 152 transition count 258
Iterating global reduction 6 with 3 rules applied. Total rules applied 144 place count 152 transition count 258
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 6 with 3 rules applied. Total rules applied 147 place count 152 transition count 255
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 149 place count 150 transition count 252
Iterating global reduction 7 with 2 rules applied. Total rules applied 151 place count 150 transition count 252
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 158 place count 150 transition count 245
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 160 place count 150 transition count 243
Applied a total of 160 rules in 53 ms. Remains 150 /239 variables (removed 89) and now considering 243/377 (removed 134) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 150/239 places, 243/377 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 348794 steps, run timeout after 3001 ms. (steps per millisecond=116 ) properties seen :{}
Probabilistic random walk after 348794 steps, saw 265454 distinct states, run finished after 3002 ms. (steps per millisecond=116 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-20 21:16:41] [INFO ] Flow matrix only has 216 transitions (discarded 27 similar events)
// Phase 1: matrix 216 rows 150 cols
[2023-03-20 21:16:41] [INFO ] Computed 40 place invariants in 3 ms
[2023-03-20 21:16:41] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 21:16:41] [INFO ] [Nat]Absence check using 34 positive place invariants in 11 ms returned sat
[2023-03-20 21:16:41] [INFO ] [Nat]Absence check using 34 positive and 6 generalized place invariants in 3 ms returned sat
[2023-03-20 21:16:41] [INFO ] After 144ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 21:16:41] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-20 21:16:41] [INFO ] After 128ms SMT Verify possible using 35 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-20 21:16:41] [INFO ] After 271ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 113 ms.
[2023-03-20 21:16:42] [INFO ] After 619ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 12 ms.
Support contains 40 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 243/243 transitions.
Applied a total of 0 rules in 5 ms. Remains 150 /150 variables (removed 0) and now considering 243/243 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 150/150 places, 243/243 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 243/243 transitions.
Applied a total of 0 rules in 5 ms. Remains 150 /150 variables (removed 0) and now considering 243/243 (removed 0) transitions.
[2023-03-20 21:16:42] [INFO ] Flow matrix only has 216 transitions (discarded 27 similar events)
[2023-03-20 21:16:42] [INFO ] Invariant cache hit.
[2023-03-20 21:16:42] [INFO ] Implicit Places using invariants in 187 ms returned [37, 39, 41, 43, 45, 46, 48, 133]
Discarding 8 places :
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Implicit Place search using SMT only with invariants took 190 ms to find 8 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 142/150 places, 241/243 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 142 transition count 237
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 138 transition count 237
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 8 place count 138 transition count 234
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 135 transition count 234
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 16 place count 133 transition count 232
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 133 transition count 232
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 20 place count 132 transition count 233
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 21 place count 132 transition count 232
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 24 place count 132 transition count 229
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 26 place count 132 transition count 227
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 28 place count 130 transition count 227
Applied a total of 28 rules in 35 ms. Remains 130 /142 variables (removed 12) and now considering 227/241 (removed 14) transitions.
[2023-03-20 21:16:42] [INFO ] Flow matrix only has 204 transitions (discarded 23 similar events)
// Phase 1: matrix 204 rows 130 cols
[2023-03-20 21:16:42] [INFO ] Computed 30 place invariants in 2 ms
[2023-03-20 21:16:42] [INFO ] Implicit Places using invariants in 177 ms returned [28, 31, 32, 33]
Discarding 4 places :
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Implicit Place search using SMT only with invariants took 178 ms to find 4 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 126/150 places, 221/243 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 126 transition count 219
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 124 transition count 219
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 124 transition count 215
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 120 transition count 215
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 120 transition count 214
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 120 transition count 214
Applied a total of 14 rules in 27 ms. Remains 120 /126 variables (removed 6) and now considering 214/221 (removed 7) transitions.
[2023-03-20 21:16:42] [INFO ] Flow matrix only has 198 transitions (discarded 16 similar events)
// Phase 1: matrix 198 rows 120 cols
[2023-03-20 21:16:42] [INFO ] Computed 26 place invariants in 1 ms
[2023-03-20 21:16:42] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-20 21:16:42] [INFO ] Flow matrix only has 198 transitions (discarded 16 similar events)
[2023-03-20 21:16:42] [INFO ] Invariant cache hit.
[2023-03-20 21:16:42] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 21:16:42] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 120/150 places, 214/243 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 599 ms. Remains : 120/150 places, 214/243 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 156 ms. (steps per millisecond=64 ) properties (out of 3) seen :1
FORMULA Vasy2003-PT-none-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-20 21:16:42] [INFO ] Flow matrix only has 198 transitions (discarded 16 similar events)
[2023-03-20 21:16:42] [INFO ] Invariant cache hit.
[2023-03-20 21:16:42] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 21:16:42] [INFO ] [Nat]Absence check using 23 positive place invariants in 3 ms returned sat
[2023-03-20 21:16:43] [INFO ] [Nat]Absence check using 23 positive and 3 generalized place invariants in 7 ms returned sat
[2023-03-20 21:16:43] [INFO ] After 94ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 21:16:43] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-20 21:16:43] [INFO ] After 59ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-20 21:16:43] [INFO ] After 150ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 58 ms.
[2023-03-20 21:16:43] [INFO ] After 355ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 35 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 214/214 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 120 transition count 213
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 119 transition count 213
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 4 place count 117 transition count 209
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 117 transition count 209
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 8 place count 117 transition count 207
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 10 place count 116 transition count 206
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 115 transition count 205
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 115 transition count 205
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 114 transition count 203
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 114 transition count 203
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 15 place count 114 transition count 202
Applied a total of 15 rules in 23 ms. Remains 114 /120 variables (removed 6) and now considering 202/214 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 114/120 places, 202/214 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Finished probabilistic random walk after 292090 steps, run visited all 2 properties in 1175 ms. (steps per millisecond=248 )
Probabilistic random walk after 292090 steps, saw 179154 distinct states, run finished after 1178 ms. (steps per millisecond=247 ) properties seen :2
FORMULA Vasy2003-PT-none-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA Vasy2003-PT-none-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 16309 ms.
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --inv-bin-par --invariant=/tmp/495/inv_0_ --invariant=/tmp/495/inv_1_ --invariant=/tmp/495/inv_2_ --invariant=/tmp/495/inv_3_ --invariant=/tmp/495/inv_4_ --invariant=/tmp/495/inv_5_ --invariant=/tmp/495/inv_6_ --invariant=/tmp/495/inv_7_ --invariant=/tmp/495/inv_8_ --invariant=/tmp/495/inv_9_ --invariant=/tmp/495/inv_10_ --invariant=/tmp/495/inv_11_ --invariant=/tmp/495/inv_12_ --invariant=/tmp/495/inv_13_ --invariant=/tmp/495/inv_14_ --invariant=/tmp/495/inv_15_ --inv-par
FORMULA Vasy2003-PT-none-ReachabilityFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Vasy2003-PT-none-ReachabilityFireability-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Vasy2003-PT-none-ReachabilityFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Vasy2003-PT-none-ReachabilityFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Vasy2003-PT-none-ReachabilityFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Vasy2003-PT-none-ReachabilityFireability-05 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Vasy2003-PT-none-ReachabilityFireability-06 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Vasy2003-PT-none-ReachabilityFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Vasy2003-PT-none-ReachabilityFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Vasy2003-PT-none-ReachabilityFireability-09 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Vasy2003-PT-none-ReachabilityFireability-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Vasy2003-PT-none-ReachabilityFireability-11 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Vasy2003-PT-none-ReachabilityFireability-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Vasy2003-PT-none-ReachabilityFireability-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Vasy2003-PT-none-ReachabilityFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA Vasy2003-PT-none-ReachabilityFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679347012936

--------------------
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.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML
mcc2023
rfs formula name Vasy2003-PT-none-ReachabilityFireability-00
rfs formula type AG
rfs formula formula --invariant=/tmp/495/inv_0_
rfs formula name Vasy2003-PT-none-ReachabilityFireability-01
rfs formula type EF
rfs formula formula --invariant=/tmp/495/inv_1_
rfs formula name Vasy2003-PT-none-ReachabilityFireability-02
rfs formula type EF
rfs formula formula --invariant=/tmp/495/inv_2_
rfs formula name Vasy2003-PT-none-ReachabilityFireability-03
rfs formula type AG
rfs formula formula --invariant=/tmp/495/inv_3_
rfs formula name Vasy2003-PT-none-ReachabilityFireability-04
rfs formula type AG
rfs formula formula --invariant=/tmp/495/inv_4_
rfs formula name Vasy2003-PT-none-ReachabilityFireability-05
rfs formula type AG
rfs formula formula --invariant=/tmp/495/inv_5_
rfs formula name Vasy2003-PT-none-ReachabilityFireability-06
rfs formula type AG
rfs formula formula --invariant=/tmp/495/inv_6_
rfs formula name Vasy2003-PT-none-ReachabilityFireability-07
rfs formula type EF
rfs formula formula --invariant=/tmp/495/inv_7_
rfs formula name Vasy2003-PT-none-ReachabilityFireability-08
rfs formula type AG
rfs formula formula --invariant=/tmp/495/inv_8_
rfs formula name Vasy2003-PT-none-ReachabilityFireability-09
rfs formula type AG
rfs formula formula --invariant=/tmp/495/inv_9_
rfs formula name Vasy2003-PT-none-ReachabilityFireability-10
rfs formula type EF
rfs formula formula --invariant=/tmp/495/inv_10_
rfs formula name Vasy2003-PT-none-ReachabilityFireability-11
rfs formula type EF
rfs formula formula --invariant=/tmp/495/inv_11_
rfs formula name Vasy2003-PT-none-ReachabilityFireability-12
rfs formula type AG
rfs formula formula --invariant=/tmp/495/inv_12_
rfs formula name Vasy2003-PT-none-ReachabilityFireability-13
rfs formula type EF
rfs formula formula --invariant=/tmp/495/inv_13_
rfs formula name Vasy2003-PT-none-ReachabilityFireability-14
rfs formula type EF
rfs formula formula --invariant=/tmp/495/inv_14_
rfs formula name Vasy2003-PT-none-ReachabilityFireability-15
rfs formula type AG
rfs formula formula --invariant=/tmp/495/inv_15_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 485 places, 776 transitions and 2809 arcs
pnml2lts-sym: Petri net Vasy2003-PT-none analyzed
pnml2lts-sym: There are safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 776->744 groups
pnml2lts-sym: Regrouping took 0.370 real 0.370 user 0.000 sys
pnml2lts-sym: state vector length is 485; there are 744 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/495/inv_1_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/495/inv_2_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/495/inv_6_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/495/inv_8_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/495/inv_7_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/495/inv_10_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/495/inv_15_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/495/inv_14_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/495/inv_12_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/495/inv_9_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/495/inv_4_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/495/inv_5_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/495/inv_0_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym:
pnml2lts-sym: Invariant violation (/tmp/495/inv_13_) found at depth -1!
pnml2lts-sym:
pnml2lts-sym: Exploration took 121714 group checks and 0 next state calls
pnml2lts-sym: reachability took 1.980 real 7.850 user 0.070 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.010 real 0.010 user 0.000 sys
pnml2lts-sym: state space has 9.7947391476109e+21 states, 21727 nodes
pnml2lts-sym: group_next: 4725 nodes total
pnml2lts-sym: group_explored: 2661 nodes, 2590 short vectors total
pnml2lts-sym: max token count: 1

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="Vasy2003-PT-none"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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-5348"
echo " Executing tool ltsminxred"
echo " Input is Vasy2003-PT-none, 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 r489-tall-167912707901231"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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