Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r024-tall-165251918400319.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is BridgeAndVehicles-PT-V80P50N50, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918400319
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 27M
-rw-r--r-- 1 mcc users 18K Apr 30 01:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 30 01:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 395K Apr 30 01:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.5M Apr 30 01:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 13K May 9 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 46K May 9 07:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 387K May 9 07:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.2M May 9 07:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 41K Apr 30 02:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 215K Apr 30 02:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3M Apr 30 02:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 13M Apr 30 02:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 07:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 07:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 10 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 7.1M May 10 09:33 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 BridgeAndVehicles-PT-V80P50N50-ReachabilityFireability-00
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-ReachabilityFireability-01
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-ReachabilityFireability-02
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-ReachabilityFireability-03
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-ReachabilityFireability-04
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-ReachabilityFireability-05
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-ReachabilityFireability-06
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-ReachabilityFireability-07
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-ReachabilityFireability-08
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-ReachabilityFireability-09
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-ReachabilityFireability-10
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-ReachabilityFireability-11
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-ReachabilityFireability-12
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-ReachabilityFireability-13
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-ReachabilityFireability-14
FORMULA_NAME BridgeAndVehicles-PT-V80P50N50-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1654199200648

Running Version 202205111006
[2022-06-02 19:46:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-02 19:46:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-02 19:46:42] [INFO ] Load time of PNML (sax parser for PT used): 548 ms
[2022-06-02 19:46:42] [INFO ] Transformed 228 places.
[2022-06-02 19:46:42] [INFO ] Transformed 8588 transitions.
[2022-06-02 19:46:42] [INFO ] Parsed PT model containing 228 places and 8588 transitions in 709 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 341 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA BridgeAndVehicles-PT-V80P50N50-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BridgeAndVehicles-PT-V80P50N50-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 14 resets, run finished after 2057 ms. (steps per millisecond=4 ) properties (out of 14) seen :3
FORMULA BridgeAndVehicles-PT-V80P50N50-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P50N50-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BridgeAndVehicles-PT-V80P50N50-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 2734 steps, including 1 resets, run timeout after 5006 ms. (steps per millisecond=0 ) properties seen 0
Interrupted Best-First random walk after 9058 steps, including 5 resets, run timeout after 5001 ms. (steps per millisecond=1 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 464 ms. (steps per millisecond=21 ) properties (out of 11) seen :0
Interrupted Best-First random walk after 9491 steps, including 5 resets, run timeout after 5002 ms. (steps per millisecond=1 ) properties seen 0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 454 ms. (steps per millisecond=22 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 454 ms. (steps per millisecond=22 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 572 ms. (steps per millisecond=17 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 380 ms. (steps per millisecond=26 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 562 ms. (steps per millisecond=17 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 439 ms. (steps per millisecond=22 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 490 ms. (steps per millisecond=20 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2022-06-02 19:47:04] [INFO ] Flow matrix only has 530 transitions (discarded 8058 similar events)
// Phase 1: matrix 530 rows 228 cols
[2022-06-02 19:47:04] [INFO ] Computed 7 place invariants in 31 ms
[2022-06-02 19:50:36] [INFO ] [Real]Absence check using 7 positive place invariants in 8 ms returned sat
[2022-06-02 19:50:37] [INFO ] After 1558ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:10
[2022-06-02 19:50:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2022-06-02 19:50:38] [INFO ] After 617ms SMT Verify possible using state equation in natural domain returned unsat :8 sat :3
[2022-06-02 19:50:38] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-06-02 19:50:41] [INFO ] After 2500ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :8 sat :3
[2022-06-02 19:50:43] [INFO ] After 4614ms SMT Verify possible using trap constraints in natural domain returned unsat :8 sat :3
Attempting to minimize the solution found.
Minimization took 499 ms.
[2022-06-02 19:50:43] [INFO ] After 6577ms SMT Verify possible using all constraints in natural domain returned unsat :8 sat :3
FORMULA BridgeAndVehicles-PT-V80P50N50-ReachabilityFireability-12 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V80P50N50-ReachabilityFireability-11 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V80P50N50-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V80P50N50-ReachabilityFireability-08 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V80P50N50-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V80P50N50-ReachabilityFireability-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V80P50N50-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA BridgeAndVehicles-PT-V80P50N50-ReachabilityFireability-02 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 11 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 4320 ms.
Support contains 50 out of 228 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 228/228 places, 8588/8588 transitions.
Graph (complete) has 2202 edges and 228 vertex of which 226 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.36 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 225 transition count 8587
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 225 transition count 8587
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 18 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 223 transition count 8586
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 20 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 222 transition count 8585
Applied a total of 8 rules in 3234 ms. Remains 222 /228 variables (removed 6) and now considering 8585/8588 (removed 3) transitions.
Finished structural reductions, in 1 iterations. Remains : 222/228 places, 8585/8588 transitions.
Interrupted random walk after 784429 steps, including 1607 resets, run timeout after 30001 ms. (steps per millisecond=26 ) properties seen 1
FORMULA BridgeAndVehicles-PT-V80P50N50-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Interrupted Best-First random walk after 304628 steps, including 292 resets, run timeout after 5001 ms. (steps per millisecond=60 ) properties seen 0
Interrupted Best-First random walk after 303235 steps, including 298 resets, run timeout after 5001 ms. (steps per millisecond=60 ) properties seen 0
Running SMT prover for 2 properties.
[2022-06-02 19:51:31] [INFO ] Flow matrix only has 527 transitions (discarded 8058 similar events)
// Phase 1: matrix 527 rows 222 cols
[2022-06-02 19:51:31] [INFO ] Computed 4 place invariants in 12 ms
[2022-06-02 19:51:31] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2022-06-02 19:51:32] [INFO ] After 586ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-02 19:51:32] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-06-02 19:51:32] [INFO ] After 252ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-02 19:51:32] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-06-02 19:51:33] [INFO ] After 887ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-02 19:51:33] [INFO ] After 1440ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 5479 ms.
[2022-06-02 19:51:39] [INFO ] After 7301ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 698 ms.
Support contains 10 out of 222 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 222/222 places, 8585/8585 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 17 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 221 transition count 8584
Applied a total of 2 rules in 2551 ms. Remains 221 /222 variables (removed 1) and now considering 8584/8585 (removed 1) transitions.
Finished structural reductions, in 1 iterations. Remains : 221/222 places, 8584/8585 transitions.
Interrupted random walk after 902695 steps, including 1854 resets, run timeout after 30001 ms. (steps per millisecond=30 ) properties seen 0
Interrupted Best-First random walk after 341786 steps, including 328 resets, run timeout after 5001 ms. (steps per millisecond=68 ) properties seen 0
Interrupted Best-First random walk after 356089 steps, including 350 resets, run timeout after 5001 ms. (steps per millisecond=71 ) properties seen 0
Interrupted probabilistic random walk after 3093517 steps, run timeout after 120001 ms. (steps per millisecond=25 ) properties seen :{0=1}
Probabilistic random walk after 3093517 steps, saw 909421 distinct states, run finished after 120002 ms. (steps per millisecond=25 ) properties seen :1
FORMULA BridgeAndVehicles-PT-V80P50N50-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
[2022-06-02 19:54:22] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
// Phase 1: matrix 526 rows 221 cols
[2022-06-02 19:54:22] [INFO ] Computed 4 place invariants in 8 ms
[2022-06-02 19:54:22] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-06-02 19:54:23] [INFO ] After 348ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 19:54:23] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-06-02 19:54:23] [INFO ] After 289ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 19:54:23] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-06-02 19:54:23] [INFO ] After 230ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 19:54:23] [INFO ] After 390ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 98 ms.
[2022-06-02 19:54:23] [INFO ] After 879ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 66 ms.
Support contains 6 out of 221 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 221/221 places, 8584/8584 transitions.
Applied a total of 0 rules in 2396 ms. Remains 221 /221 variables (removed 0) and now considering 8584/8584 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 221/221 places, 8584/8584 transitions.
Incomplete random walk after 1000000 steps, including 2054 resets, run finished after 26411 ms. (steps per millisecond=37 ) properties (out of 1) seen :0
Interrupted Best-First random walk after 407373 steps, including 402 resets, run timeout after 5001 ms. (steps per millisecond=81 ) properties seen 0
Interrupted probabilistic random walk after 2252425 steps, run timeout after 93001 ms. (steps per millisecond=24 ) properties seen :{}
Probabilistic random walk after 2252425 steps, saw 678772 distinct states, run finished after 93002 ms. (steps per millisecond=24 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-02 19:56:30] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
// Phase 1: matrix 526 rows 221 cols
[2022-06-02 19:56:30] [INFO ] Computed 4 place invariants in 7 ms
[2022-06-02 19:56:30] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-06-02 19:56:31] [INFO ] After 325ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 19:56:31] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-06-02 19:56:31] [INFO ] After 298ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 19:56:31] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-06-02 19:56:31] [INFO ] After 241ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 19:56:32] [INFO ] After 406ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 105 ms.
[2022-06-02 19:56:32] [INFO ] After 917ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 58 ms.
Support contains 6 out of 221 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 221/221 places, 8584/8584 transitions.
Applied a total of 0 rules in 2467 ms. Remains 221 /221 variables (removed 0) and now considering 8584/8584 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 221/221 places, 8584/8584 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 221/221 places, 8584/8584 transitions.
Applied a total of 0 rules in 2496 ms. Remains 221 /221 variables (removed 0) and now considering 8584/8584 (removed 0) transitions.
[2022-06-02 19:56:37] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
// Phase 1: matrix 526 rows 221 cols
[2022-06-02 19:56:37] [INFO ] Computed 4 place invariants in 8 ms
[2022-06-02 19:56:38] [INFO ] Implicit Places using invariants in 1040 ms returned []
[2022-06-02 19:56:38] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
// Phase 1: matrix 526 rows 221 cols
[2022-06-02 19:56:38] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-02 19:56:38] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-06-02 19:56:41] [INFO ] Implicit Places using invariants and state equation in 3498 ms returned [82, 166]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 4556 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 219/221 places, 8584/8584 transitions.
Applied a total of 0 rules in 2449 ms. Remains 219 /219 variables (removed 0) and now considering 8584/8584 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 219/221 places, 8584/8584 transitions.
Incomplete random walk after 1000000 steps, including 2054 resets, run finished after 24965 ms. (steps per millisecond=40 ) properties (out of 1) seen :0
Interrupted Best-First random walk after 437307 steps, including 431 resets, run timeout after 5001 ms. (steps per millisecond=87 ) properties seen 0
Interrupted probabilistic random walk after 2207779 steps, run timeout after 87001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 2207779 steps, saw 652689 distinct states, run finished after 87002 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-02 19:58:41] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
// Phase 1: matrix 526 rows 219 cols
[2022-06-02 19:58:41] [INFO ] Computed 4 place invariants in 7 ms
[2022-06-02 19:58:41] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-06-02 19:58:41] [INFO ] After 737ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 19:58:41] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-06-02 19:58:42] [INFO ] After 697ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 19:58:42] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-06-02 19:58:42] [INFO ] After 244ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 19:58:43] [INFO ] After 435ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 111 ms.
[2022-06-02 19:58:43] [INFO ] After 1344ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 45 ms.
Support contains 6 out of 219 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 219/219 places, 8584/8584 transitions.
Applied a total of 0 rules in 2411 ms. Remains 219 /219 variables (removed 0) and now considering 8584/8584 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 219/219 places, 8584/8584 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 219/219 places, 8584/8584 transitions.
Applied a total of 0 rules in 2471 ms. Remains 219 /219 variables (removed 0) and now considering 8584/8584 (removed 0) transitions.
[2022-06-02 19:58:48] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
// Phase 1: matrix 526 rows 219 cols
[2022-06-02 19:58:48] [INFO ] Computed 4 place invariants in 6 ms
[2022-06-02 19:58:49] [INFO ] Implicit Places using invariants in 881 ms returned []
[2022-06-02 19:58:49] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
// Phase 1: matrix 526 rows 219 cols
[2022-06-02 19:58:49] [INFO ] Computed 4 place invariants in 6 ms
[2022-06-02 19:58:50] [INFO ] Implicit Places using invariants and state equation in 1622 ms returned []
Implicit Place search using SMT with State Equation took 2508 ms to find 0 implicit places.
[2022-06-02 19:58:51] [INFO ] Redundant transitions in 1203 ms returned []
[2022-06-02 19:58:51] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
// Phase 1: matrix 526 rows 219 cols
[2022-06-02 19:58:51] [INFO ] Computed 4 place invariants in 5 ms
[2022-06-02 19:58:54] [INFO ] Dead Transitions using invariants and state equation in 2708 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 219/219 places, 8584/8584 transitions.
Incomplete random walk after 1000000 steps, including 2054 resets, run finished after 25958 ms. (steps per millisecond=38 ) properties (out of 1) seen :0
Interrupted Best-First random walk after 423727 steps, including 418 resets, run timeout after 5001 ms. (steps per millisecond=84 ) properties seen 0
Interrupted probabilistic random walk after 2341028 steps, run timeout after 90001 ms. (steps per millisecond=26 ) properties seen :{}
Probabilistic random walk after 2341028 steps, saw 689452 distinct states, run finished after 90002 ms. (steps per millisecond=26 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-02 20:00:55] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
// Phase 1: matrix 526 rows 219 cols
[2022-06-02 20:00:55] [INFO ] Computed 4 place invariants in 6 ms
[2022-06-02 20:00:55] [INFO ] [Real]Absence check using 4 positive place invariants in 5 ms returned sat
[2022-06-02 20:00:56] [INFO ] After 898ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 20:00:56] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-06-02 20:00:57] [INFO ] After 694ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 20:00:57] [INFO ] State equation strengthened by 102 read => feed constraints.
[2022-06-02 20:00:57] [INFO ] After 245ms SMT Verify possible using 102 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 20:00:57] [INFO ] After 425ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 105 ms.
[2022-06-02 20:00:57] [INFO ] After 1328ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 38 ms.
Support contains 6 out of 219 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 219/219 places, 8584/8584 transitions.
Applied a total of 0 rules in 2238 ms. Remains 219 /219 variables (removed 0) and now considering 8584/8584 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 219/219 places, 8584/8584 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 219/219 places, 8584/8584 transitions.
Applied a total of 0 rules in 2293 ms. Remains 219 /219 variables (removed 0) and now considering 8584/8584 (removed 0) transitions.
[2022-06-02 20:01:02] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
// Phase 1: matrix 526 rows 219 cols
[2022-06-02 20:01:02] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-02 20:01:03] [INFO ] Implicit Places using invariants in 906 ms returned []
[2022-06-02 20:01:03] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
// Phase 1: matrix 526 rows 219 cols
[2022-06-02 20:01:03] [INFO ] Computed 4 place invariants in 3 ms
[2022-06-02 20:01:04] [INFO ] Implicit Places using invariants and state equation in 1560 ms returned []
Implicit Place search using SMT with State Equation took 2485 ms to find 0 implicit places.
[2022-06-02 20:01:05] [INFO ] Redundant transitions in 860 ms returned []
[2022-06-02 20:01:05] [INFO ] Flow matrix only has 526 transitions (discarded 8058 similar events)
// Phase 1: matrix 526 rows 219 cols
[2022-06-02 20:01:05] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-02 20:01:08] [INFO ] Dead Transitions using invariants and state equation in 2623 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 219/219 places, 8584/8584 transitions.
Ensure Unique test removed 8058 transitions
Reduce isomorphic transitions removed 8058 transitions.
Iterating post reduction 0 with 8058 rules applied. Total rules applied 8058 place count 219 transition count 526
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 1 with 2 rules applied. Total rules applied 8060 place count 219 transition count 524
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 8062 place count 217 transition count 524
Applied a total of 8062 rules in 34 ms. Remains 217 /219 variables (removed 2) and now considering 524/8584 (removed 8060) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 524 rows 217 cols
[2022-06-02 20:01:08] [INFO ] Computed 4 place invariants in 2 ms
[2022-06-02 20:01:08] [INFO ] [Real]Absence check using 4 positive place invariants in 29 ms returned sat
[2022-06-02 20:01:08] [INFO ] After 377ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-02 20:01:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2022-06-02 20:01:09] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-02 20:01:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2022-06-02 20:01:09] [INFO ] After 37ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-02 20:01:09] [INFO ] After 98ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2022-06-02 20:01:09] [INFO ] After 398ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-02 20:01:09] [INFO ] Flatten gal took : 199 ms
[2022-06-02 20:01:09] [INFO ] Flatten gal took : 85 ms
[2022-06-02 20:01:09] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16909799679603343055.gal : 19 ms
[2022-06-02 20:01:09] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality4642380416332153361.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16909799679603343055.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality4642380416332153361.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality4642380416332153361.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 2
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :2 after 10
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :10 after 18
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :18 after 26
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :26 after 42
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :42 after 74
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :74 after 138
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :138 after 606
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :606 after 670640
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1.34128e+06 after 1.99828e+06
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :3.3532e+06 after 4.02384e+06
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2.22652e+09,1.47231,34780,2,6854,18,65677,7,0,1402,48293,0
Total reachable state count : 2226524800

Verifying 1 reachability properties.
Reachability property BridgeAndVehicles-PT-V80P50N50-ReachabilityFireability-14 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
BridgeAndVehicles-PT-V80P50N50-ReachabilityFireability-14,81,1.47589,34780,2,218,18,65677,7,0,1409,48293,0
[2022-06-02 20:01:12] [INFO ] Flatten gal took : 492 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14921063114040234584
[2022-06-02 20:01:12] [INFO ] Too many transitions (8584) to apply POR reductions. Disabling POR matrices.
[2022-06-02 20:01:13] [INFO ] Built C files in 315ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14921063114040234584
Running compilation step : cd /tmp/ltsmin14921063114040234584;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-02 20:01:13] [INFO ] Applying decomposition
[2022-06-02 20:01:13] [INFO ] Flatten gal took : 683 ms
[2022-06-02 20:01:13] [INFO ] Flatten gal took : 652 ms
[2022-06-02 20:01:14] [INFO ] Input system was already deterministic with 8584 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3151679799731820685.txt' '-o' '/tmp/graph3151679799731820685.bin' '-w' '/tmp/graph3151679799731820685.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3151679799731820685.bin' '-l' '-1' '-v' '-w' '/tmp/graph3151679799731820685.weights' '-q' '0' '-e' '0.001'
[2022-06-02 20:01:16] [INFO ] Decomposing Gal with order
[2022-06-02 20:01:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-02 20:01:22] [INFO ] Ran tautology test, simplified 0 / 1 in 9358 ms.
[2022-06-02 20:01:22] [INFO ] BMC solution for property BridgeAndVehicles-PT-V80P50N50-ReachabilityFireability-14(UNSAT) depth K=0 took 43 ms
[2022-06-02 20:01:23] [INFO ] BMC solution for property BridgeAndVehicles-PT-V80P50N50-ReachabilityFireability-14(UNSAT) depth K=1 took 42 ms
[2022-06-02 20:01:24] [INFO ] BMC solution for property BridgeAndVehicles-PT-V80P50N50-ReachabilityFireability-14(UNSAT) depth K=2 took 1142 ms
[2022-06-02 20:01:24] [INFO ] Removed a total of 16515 redundant transitions.
[2022-06-02 20:01:24] [INFO ] Flatten gal took : 8112 ms
[2022-06-02 20:01:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 597 labels/synchronizations in 434 ms.
[2022-06-02 20:01:25] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability6602426404253480420.gal : 19 ms
[2022-06-02 20:01:25] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability1483873855094774603.prop : 12 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityFireability6602426404253480420.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability1483873855094774603.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...298
Loading property file /tmp/ReachabilityFireability1483873855094774603.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 12
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :12 after 37
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :37 after 82
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :82 after 167
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :167 after 332
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :332 after 453
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :453 after 654
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :654 after 6872
Presburger conditions satisfied. Using coverability to approximate state space in K-Induction.
Normalized transition count is 526 out of 8584 initially.
// Phase 1: matrix 526 rows 219 cols
[2022-06-02 20:01:28] [INFO ] Computed 4 place invariants in 23 ms
[2022-06-02 20:01:28] [INFO ] Computed 4 place invariants in 23 ms
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :6872 after 39042
[2022-06-02 20:01:29] [INFO ] BMC solution for property BridgeAndVehicles-PT-V80P50N50-ReachabilityFireability-14(UNSAT) depth K=3 took 4765 ms
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :39042 after 65120
[2022-06-02 20:01:33] [INFO ] Proved 219 variables to be positive in 5052 ms
[2022-06-02 20:01:33] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V80P50N50-ReachabilityFireability-14
[2022-06-02 20:01:33] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V80P50N50-ReachabilityFireability-14(SAT) depth K=0 took 58 ms
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :65120 after 116474
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :116474 after 205420
[2022-06-02 20:01:46] [INFO ] BMC solution for property BridgeAndVehicles-PT-V80P50N50-ReachabilityFireability-14(UNSAT) depth K=4 took 17568 ms
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.04675e+06 after 2.05075e+06
Compilation finished in 58650 ms.
Running link step : cd /tmp/ltsmin14921063114040234584;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 91 ms.
Running LTSmin : cd /tmp/ltsmin14921063114040234584;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '-i' 'BridgeAndVehiclesPTV80P50N50ReachabilityFireability14==true'
[2022-06-02 20:03:00] [INFO ] Induction result is SAT, non conclusive we might be starting from unreachable statesBridgeAndVehicles-PT-V80P50N50-ReachabilityFireability-14
[2022-06-02 20:03:00] [INFO ] KInduction solution for property BridgeAndVehicles-PT-V80P50N50-ReachabilityFireability-14(SAT) depth K=1 took 86065 ms
[2022-06-02 20:03:33] [INFO ] BMC solution for property BridgeAndVehicles-PT-V80P50N50-ReachabilityFireability-14(UNSAT) depth K=5 took 106792 ms

BK_STOP 1654200336732

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination ReachabilityFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="BridgeAndVehicles-PT-V80P50N50"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is BridgeAndVehicles-PT-V80P50N50, 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 r024-tall-165251918400319"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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