Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2020-input.r176-tajo-158987872100582.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is PolyORBNT-COL-S05J60, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987872100582
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 276K
-rw-r--r-- 1 mcc users 3.5K Apr 12 06:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 17K Apr 12 06:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 11 05:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 11 05:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 14 12:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 14 12:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Apr 10 12:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 10 12:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 9 18:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 9 18:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 10 22:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 10 22:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 equiv_pt
-rw-r--r-- 1 mcc users 7 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 94K Mar 24 05:37 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 PolyORBNT-COL-S05J60-ReachabilityCardinality-00
FORMULA_NAME PolyORBNT-COL-S05J60-ReachabilityCardinality-01
FORMULA_NAME PolyORBNT-COL-S05J60-ReachabilityCardinality-02
FORMULA_NAME PolyORBNT-COL-S05J60-ReachabilityCardinality-03
FORMULA_NAME PolyORBNT-COL-S05J60-ReachabilityCardinality-04
FORMULA_NAME PolyORBNT-COL-S05J60-ReachabilityCardinality-05
FORMULA_NAME PolyORBNT-COL-S05J60-ReachabilityCardinality-06
FORMULA_NAME PolyORBNT-COL-S05J60-ReachabilityCardinality-07
FORMULA_NAME PolyORBNT-COL-S05J60-ReachabilityCardinality-08
FORMULA_NAME PolyORBNT-COL-S05J60-ReachabilityCardinality-09
FORMULA_NAME PolyORBNT-COL-S05J60-ReachabilityCardinality-10
FORMULA_NAME PolyORBNT-COL-S05J60-ReachabilityCardinality-11
FORMULA_NAME PolyORBNT-COL-S05J60-ReachabilityCardinality-12
FORMULA_NAME PolyORBNT-COL-S05J60-ReachabilityCardinality-13
FORMULA_NAME PolyORBNT-COL-S05J60-ReachabilityCardinality-14
FORMULA_NAME PolyORBNT-COL-S05J60-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591166017431

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 06:33:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 06:33:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 06:33:39] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-03 06:33:39] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 656 ms
[2020-06-03 06:33:39] [INFO ] sort/places :
D4->place_482,
Threads->FetchJobB,QueueJobE,NotifyEventJobQueuedE,NotifyEventEndOfCheckSourcesE,NotifyEventEndOfCheckSourcesB,place_523,place_522,place_521,place_520,place_518,place_500,Check_Sources_E,Check_Sources_B,place_782,place_787,Perform_Work_E,Schedule_Task_B,Try_Check_Sources_E,Try_Check_Sources_B,
D5->Schedule_Task_E,
D6->CreatedJobs,
Jobs->f3,f2,f1,AvailableJobId,
Dot->block,mo3,mo2,mo1,mi3,mi2,mi1,cSources,place_462,place_460,place_458,place_456,CanInjectEvent,JobCnt,cJobCnt,
Sources->ModifiedSrc,DataOnSrc,TheSour,
D1->FetchJobE,QueueJobB,NotifyEventJobQueuedB,Perform_Work_B,

[2020-06-03 06:33:39] [INFO ] ms1 symmetric to ms3 in transition trans_489
[2020-06-03 06:33:39] [INFO ] ms3 symmetric to ms4 in transition trans_489
[2020-06-03 06:33:39] [INFO ] ms4 symmetric to ms2 in transition trans_489
[2020-06-03 06:33:39] [INFO ] ms1 symmetric to ms3 in transition trans_488
[2020-06-03 06:33:39] [INFO ] ms3 symmetric to ms2 in transition trans_488
[2020-06-03 06:33:39] [INFO ] ms1 symmetric to ms2 in transition trans_487
[2020-06-03 06:33:39] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 969 PT places and 2152.0 transition bindings in 38 ms.
[2020-06-03 06:33:39] [INFO ] Computed order based on color domains.
[2020-06-03 06:33:39] [INFO ] Unfolded HLPN to a Petri net with 969 places and 1375 transitions in 31 ms.
[2020-06-03 06:33:39] [INFO ] Unfolded HLPN properties in 1 ms.
Deduced a syphon composed of 60 places in 10 ms
Reduce places removed 60 places and 60 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 81 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 697 resets, run finished after 222 ms. (steps per millisecond=45 ) properties seen :[0, 0, 0, 0, 1, 1, 0, 1, 1, 1, 0, 1, 1, 0, 0, 1]
FORMULA PolyORBNT-COL-S05J60-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-ReachabilityCardinality-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J60-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 252 resets, run finished after 47 ms. (steps per millisecond=212 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 303 resets, run finished after 80 ms. (steps per millisecond=125 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 291 resets, run finished after 46 ms. (steps per millisecond=217 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 19 ms. (steps per millisecond=526 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 250 resets, run finished after 30 ms. (steps per millisecond=333 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 303 resets, run finished after 38 ms. (steps per millisecond=263 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 36 ms. (steps per millisecond=277 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 303 resets, run finished after 63 ms. (steps per millisecond=158 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0]
[2020-06-03 06:33:40] [INFO ] Flow matrix only has 1311 transitions (discarded 4 similar events)
// Phase 1: matrix 1311 rows 909 cols
[2020-06-03 06:33:40] [INFO ] Computed 142 place invariants in 144 ms
[2020-06-03 06:33:40] [INFO ] [Real]Absence check using 135 positive place invariants in 130 ms returned sat
[2020-06-03 06:33:41] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 27 ms returned unsat
[2020-06-03 06:33:41] [INFO ] [Real]Absence check using 135 positive place invariants in 114 ms returned sat
[2020-06-03 06:33:41] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 34 ms returned sat
[2020-06-03 06:33:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:33:43] [INFO ] [Real]Absence check using state equation in 2550 ms returned sat
[2020-06-03 06:33:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:33:44] [INFO ] [Nat]Absence check using 135 positive place invariants in 145 ms returned sat
[2020-06-03 06:33:44] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 22 ms returned sat
[2020-06-03 06:33:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:33:49] [INFO ] [Nat]Absence check using state equation in 4731 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 06:33:49] [INFO ] [Real]Absence check using 135 positive place invariants in 117 ms returned sat
[2020-06-03 06:33:49] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 34 ms returned sat
[2020-06-03 06:33:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:33:51] [INFO ] [Real]Absence check using state equation in 2501 ms returned sat
[2020-06-03 06:33:51] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:33:51] [INFO ] [Nat]Absence check using 135 positive place invariants in 85 ms returned sat
[2020-06-03 06:33:52] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 89 ms returned sat
[2020-06-03 06:33:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:33:56] [INFO ] [Nat]Absence check using state equation in 4747 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 06:33:57] [INFO ] [Real]Absence check using 135 positive place invariants in 117 ms returned unsat
[2020-06-03 06:33:57] [INFO ] [Real]Absence check using 135 positive place invariants in 113 ms returned sat
[2020-06-03 06:33:57] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 7 ms returned unsat
[2020-06-03 06:33:57] [INFO ] [Real]Absence check using 135 positive place invariants in 100 ms returned unsat
[2020-06-03 06:33:57] [INFO ] [Real]Absence check using 135 positive place invariants in 112 ms returned sat
[2020-06-03 06:33:57] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 33 ms returned sat
[2020-06-03 06:33:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:34:00] [INFO ] [Real]Absence check using state equation in 2555 ms returned sat
[2020-06-03 06:34:00] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:34:00] [INFO ] [Nat]Absence check using 135 positive place invariants in 109 ms returned sat
[2020-06-03 06:34:00] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 7 ms returned unsat
[2020-06-03 06:34:00] [INFO ] [Real]Absence check using 135 positive place invariants in 350 ms returned sat
[2020-06-03 06:34:00] [INFO ] [Real]Absence check using 135 positive and 7 generalized place invariants in 19 ms returned sat
[2020-06-03 06:34:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:34:04] [INFO ] [Real]Absence check using state equation in 3959 ms returned sat
[2020-06-03 06:34:04] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:34:05] [INFO ] [Nat]Absence check using 135 positive place invariants in 419 ms returned sat
[2020-06-03 06:34:05] [INFO ] [Nat]Absence check using 135 positive and 7 generalized place invariants in 29 ms returned unsat
FORMULA PolyORBNT-COL-S05J60-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-COL-S05J60-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-COL-S05J60-ReachabilityCardinality-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-COL-S05J60-ReachabilityCardinality-06 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-COL-S05J60-ReachabilityCardinality-03 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-COL-S05J60-ReachabilityCardinality-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 448 out of 909 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 909/909 places, 1315/1315 transitions.
Ensure Unique test removed 5 places
Performed 64 Post agglomeration using F-continuation condition.Transition count delta: 64
Iterating post reduction 0 with 69 rules applied. Total rules applied 69 place count 904 transition count 1251
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 1 with 64 rules applied. Total rules applied 133 place count 840 transition count 1251
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 64 Pre rules applied. Total rules applied 133 place count 840 transition count 1187
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 2 with 128 rules applied. Total rules applied 261 place count 776 transition count 1187
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 263 place count 775 transition count 1186
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 264 place count 775 transition count 1185
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 265 place count 774 transition count 1185
Applied a total of 265 rules in 365 ms. Remains 774 /909 variables (removed 135) and now considering 1185/1315 (removed 130) transitions.
[2020-06-03 06:34:05] [INFO ] Flow matrix only has 1181 transitions (discarded 4 similar events)
// Phase 1: matrix 1181 rows 774 cols
[2020-06-03 06:34:06] [INFO ] Computed 137 place invariants in 130 ms
[2020-06-03 06:34:13] [INFO ] Dead Transitions using invariants and state equation in 7456 ms returned [433, 434, 435, 436, 437, 438, 439, 440, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 454, 455, 456, 457, 458, 459, 460, 461, 462, 463, 464, 465, 466, 467, 468, 469, 470, 471, 472, 474, 475, 476, 477, 478, 480, 483, 484, 485, 486, 487, 488, 489, 490, 491, 492, 493, 494, 495, 496, 497, 498, 499, 500, 501, 502, 503, 504, 505, 506, 507, 509, 510, 511, 512, 513, 515, 518, 519, 520, 521, 522, 523, 525, 528, 532, 533, 534, 535, 536, 537, 538, 540, 543, 547, 552]
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions :[552, 547, 543, 540, 538, 537, 536, 535, 534, 533, 532, 528, 525, 523, 522, 521, 520, 519, 518, 515, 513, 512, 511, 510, 509, 507, 506, 505, 504, 503, 502, 501, 500, 499, 498, 497, 496, 495, 494, 493, 492, 491, 490, 489, 488, 487, 486, 485, 484, 483, 480, 478, 477, 476, 475, 474, 472, 471, 470, 469, 468, 467, 466, 465, 464, 463, 462, 461, 460, 459, 458, 457, 456, 455, 454, 452, 451, 450, 449, 448, 447, 446, 445, 444, 443, 442, 441, 440, 439, 438, 437, 436, 435, 434, 433]
Starting structural reductions, iteration 1 : 774/909 places, 1090/1315 transitions.
Applied a total of 0 rules in 62 ms. Remains 774 /774 variables (removed 0) and now considering 1090/1090 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 774/909 places, 1090/1315 transitions.
Incomplete random walk after 1000000 steps, including 46045 resets, run finished after 5687 ms. (steps per millisecond=175 ) properties seen :[0, 0]
Interrupted Best-First random walk after 961508 steps, including 33155 resets, run timeout after 5001 ms. (steps per millisecond=192 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 33347 resets, run finished after 2639 ms. (steps per millisecond=378 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 4695763 steps, run timeout after 30001 ms. (steps per millisecond=156 ) properties seen :[0, 0]
Probabilistic random walk after 4695763 steps, saw 1483483 distinct states, run finished after 30007 ms. (steps per millisecond=156 ) properties seen :[0, 0]
[2020-06-03 06:34:56] [INFO ] Flow matrix only has 1086 transitions (discarded 4 similar events)
// Phase 1: matrix 1086 rows 774 cols
[2020-06-03 06:34:56] [INFO ] Computed 137 place invariants in 47 ms
[2020-06-03 06:34:57] [INFO ] [Real]Absence check using 130 positive place invariants in 92 ms returned sat
[2020-06-03 06:34:57] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 31 ms returned sat
[2020-06-03 06:34:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:34:58] [INFO ] [Real]Absence check using state equation in 1807 ms returned sat
[2020-06-03 06:34:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:34:59] [INFO ] [Nat]Absence check using 130 positive place invariants in 97 ms returned sat
[2020-06-03 06:34:59] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 80 ms returned sat
[2020-06-03 06:34:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:35:01] [INFO ] [Nat]Absence check using state equation in 1818 ms returned unsat
[2020-06-03 06:35:01] [INFO ] [Real]Absence check using 130 positive place invariants in 88 ms returned sat
[2020-06-03 06:35:01] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 41 ms returned sat
[2020-06-03 06:35:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:35:03] [INFO ] [Real]Absence check using state equation in 1902 ms returned sat
[2020-06-03 06:35:03] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:35:03] [INFO ] [Nat]Absence check using 130 positive place invariants in 89 ms returned sat
[2020-06-03 06:35:03] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 53 ms returned sat
[2020-06-03 06:35:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:35:06] [INFO ] [Nat]Absence check using state equation in 2838 ms returned sat
[2020-06-03 06:35:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 06:35:06] [INFO ] [Nat]Added 1 Read/Feed constraints in 12 ms returned sat
[2020-06-03 06:35:06] [INFO ] Deduced a trap composed of 253 places in 524 ms
[2020-06-03 06:35:07] [INFO ] Deduced a trap composed of 265 places in 670 ms
[2020-06-03 06:35:08] [INFO ] Deduced a trap composed of 268 places in 530 ms
[2020-06-03 06:35:08] [INFO ] Deduced a trap composed of 280 places in 537 ms
[2020-06-03 06:35:09] [INFO ] Deduced a trap composed of 244 places in 515 ms
[2020-06-03 06:35:10] [INFO ] Deduced a trap composed of 241 places in 537 ms
[2020-06-03 06:35:10] [INFO ] Deduced a trap composed of 241 places in 523 ms
[2020-06-03 06:35:10] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4474 ms
[2020-06-03 06:35:11] [INFO ] Computed and/alt/rep : 1084/22481/1080 causal constraints in 147 ms.
[2020-06-03 06:35:13] [INFO ] Added : 62 causal constraints over 13 iterations in 2683 ms. Result :sat
[2020-06-03 06:35:14] [INFO ] Deduced a trap composed of 11 places in 496 ms
[2020-06-03 06:35:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 991 ms
Attempting to minimize the solution found.
Minimization took 56 ms.
FORMULA PolyORBNT-COL-S05J60-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 9700 steps, including 872 resets, run finished after 100 ms. (steps per millisecond=97 ) properties seen :[0] could not realise parikh vector
Support contains 70 out of 774 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 774/774 places, 1090/1090 transitions.
Applied a total of 0 rules in 34 ms. Remains 774 /774 variables (removed 0) and now considering 1090/1090 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 774/774 places, 1090/1090 transitions.
Incomplete random walk after 1000000 steps, including 46438 resets, run finished after 4751 ms. (steps per millisecond=210 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 33318 resets, run finished after 2752 ms. (steps per millisecond=363 ) properties seen :[0]
Interrupted probabilistic random walk after 5110662 steps, run timeout after 30001 ms. (steps per millisecond=170 ) properties seen :[0]
Probabilistic random walk after 5110662 steps, saw 1622767 distinct states, run finished after 30001 ms. (steps per millisecond=170 ) properties seen :[0]
[2020-06-03 06:35:52] [INFO ] Flow matrix only has 1086 transitions (discarded 4 similar events)
// Phase 1: matrix 1086 rows 774 cols
[2020-06-03 06:35:52] [INFO ] Computed 137 place invariants in 19 ms
[2020-06-03 06:35:52] [INFO ] [Real]Absence check using 130 positive place invariants in 97 ms returned sat
[2020-06-03 06:35:52] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 42 ms returned sat
[2020-06-03 06:35:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:35:54] [INFO ] [Real]Absence check using state equation in 2135 ms returned sat
[2020-06-03 06:35:54] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:35:54] [INFO ] [Nat]Absence check using 130 positive place invariants in 87 ms returned sat
[2020-06-03 06:35:54] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 47 ms returned sat
[2020-06-03 06:35:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:35:57] [INFO ] [Nat]Absence check using state equation in 2547 ms returned sat
[2020-06-03 06:35:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 06:35:57] [INFO ] [Nat]Added 1 Read/Feed constraints in 12 ms returned sat
[2020-06-03 06:35:58] [INFO ] Deduced a trap composed of 253 places in 517 ms
[2020-06-03 06:35:58] [INFO ] Deduced a trap composed of 265 places in 508 ms
[2020-06-03 06:35:59] [INFO ] Deduced a trap composed of 268 places in 475 ms
[2020-06-03 06:35:59] [INFO ] Deduced a trap composed of 280 places in 513 ms
[2020-06-03 06:36:00] [INFO ] Deduced a trap composed of 244 places in 518 ms
[2020-06-03 06:36:00] [INFO ] Deduced a trap composed of 241 places in 523 ms
[2020-06-03 06:36:01] [INFO ] Deduced a trap composed of 241 places in 491 ms
[2020-06-03 06:36:01] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4131 ms
[2020-06-03 06:36:01] [INFO ] Computed and/alt/rep : 1084/22481/1080 causal constraints in 74 ms.
[2020-06-03 06:36:04] [INFO ] Added : 62 causal constraints over 13 iterations in 2463 ms. Result :sat
[2020-06-03 06:36:04] [INFO ] Deduced a trap composed of 11 places in 511 ms
[2020-06-03 06:36:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1012 ms
Attempting to minimize the solution found.
Minimization took 49 ms.
Incomplete Parikh walk after 9700 steps, including 867 resets, run finished after 91 ms. (steps per millisecond=106 ) properties seen :[0] could not realise parikh vector
Support contains 70 out of 774 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 774/774 places, 1090/1090 transitions.
Applied a total of 0 rules in 29 ms. Remains 774 /774 variables (removed 0) and now considering 1090/1090 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 774/774 places, 1090/1090 transitions.
Starting structural reductions, iteration 0 : 774/774 places, 1090/1090 transitions.
Applied a total of 0 rules in 29 ms. Remains 774 /774 variables (removed 0) and now considering 1090/1090 (removed 0) transitions.
[2020-06-03 06:36:05] [INFO ] Flow matrix only has 1086 transitions (discarded 4 similar events)
// Phase 1: matrix 1086 rows 774 cols
[2020-06-03 06:36:05] [INFO ] Computed 137 place invariants in 29 ms
[2020-06-03 06:36:08] [INFO ] Implicit Places using invariants in 2711 ms returned []
[2020-06-03 06:36:08] [INFO ] Flow matrix only has 1086 transitions (discarded 4 similar events)
// Phase 1: matrix 1086 rows 774 cols
[2020-06-03 06:36:08] [INFO ] Computed 137 place invariants in 54 ms
[2020-06-03 06:36:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 06:36:17] [INFO ] Implicit Places using invariants and state equation in 9758 ms returned []
Implicit Place search using SMT with State Equation took 12479 ms to find 0 implicit places.
[2020-06-03 06:36:17] [INFO ] Redundant transitions in 112 ms returned []
[2020-06-03 06:36:17] [INFO ] Flow matrix only has 1086 transitions (discarded 4 similar events)
// Phase 1: matrix 1086 rows 774 cols
[2020-06-03 06:36:18] [INFO ] Computed 137 place invariants in 30 ms
[2020-06-03 06:36:21] [INFO ] Dead Transitions using invariants and state equation in 3891 ms returned []
Finished structural reductions, in 1 iterations. Remains : 774/774 places, 1090/1090 transitions.
Incomplete random walk after 100000 steps, including 4627 resets, run finished after 599 ms. (steps per millisecond=166 ) properties seen :[0]
[2020-06-03 06:36:22] [INFO ] Flow matrix only has 1086 transitions (discarded 4 similar events)
// Phase 1: matrix 1086 rows 774 cols
[2020-06-03 06:36:22] [INFO ] Computed 137 place invariants in 19 ms
[2020-06-03 06:36:22] [INFO ] [Real]Absence check using 130 positive place invariants in 89 ms returned sat
[2020-06-03 06:36:22] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 40 ms returned sat
[2020-06-03 06:36:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:36:24] [INFO ] [Real]Absence check using state equation in 1813 ms returned sat
[2020-06-03 06:36:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:36:24] [INFO ] [Nat]Absence check using 130 positive place invariants in 91 ms returned sat
[2020-06-03 06:36:24] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 42 ms returned sat
[2020-06-03 06:36:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:36:27] [INFO ] [Nat]Absence check using state equation in 2294 ms returned sat
[2020-06-03 06:36:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 06:36:27] [INFO ] [Nat]Added 1 Read/Feed constraints in 12 ms returned sat
[2020-06-03 06:36:27] [INFO ] Deduced a trap composed of 253 places in 516 ms
[2020-06-03 06:36:28] [INFO ] Deduced a trap composed of 265 places in 512 ms
[2020-06-03 06:36:28] [INFO ] Deduced a trap composed of 268 places in 500 ms
[2020-06-03 06:36:29] [INFO ] Deduced a trap composed of 280 places in 479 ms
[2020-06-03 06:36:29] [INFO ] Deduced a trap composed of 244 places in 486 ms
[2020-06-03 06:36:30] [INFO ] Deduced a trap composed of 241 places in 463 ms
[2020-06-03 06:36:30] [INFO ] Deduced a trap composed of 241 places in 520 ms
[2020-06-03 06:36:31] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 4066 ms
[2020-06-03 06:36:31] [INFO ] Computed and/alt/rep : 1084/22481/1080 causal constraints in 112 ms.
[2020-06-03 06:36:33] [INFO ] Added : 62 causal constraints over 13 iterations in 2473 ms. Result :sat
[2020-06-03 06:36:34] [INFO ] Deduced a trap composed of 11 places in 519 ms
[2020-06-03 06:36:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1091 ms
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 774 transition count 1086
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 774 transition count 1085
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 773 transition count 1085
Applied a total of 6 rules in 94 ms. Remains 773 /774 variables (removed 1) and now considering 1085/1090 (removed 5) transitions.
// Phase 1: matrix 1085 rows 773 cols
[2020-06-03 06:36:34] [INFO ] Computed 137 place invariants in 30 ms
[2020-06-03 06:36:35] [INFO ] [Real]Absence check using 130 positive place invariants in 84 ms returned sat
[2020-06-03 06:36:35] [INFO ] [Real]Absence check using 130 positive and 7 generalized place invariants in 39 ms returned sat
[2020-06-03 06:36:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:36:36] [INFO ] [Real]Absence check using state equation in 1837 ms returned sat
[2020-06-03 06:36:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:36:37] [INFO ] [Nat]Absence check using 130 positive place invariants in 89 ms returned sat
[2020-06-03 06:36:37] [INFO ] [Nat]Absence check using 130 positive and 7 generalized place invariants in 37 ms returned sat
[2020-06-03 06:36:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:36:39] [INFO ] [Nat]Absence check using state equation in 2016 ms returned sat
[2020-06-03 06:36:39] [INFO ] Deduced a trap composed of 13 places in 502 ms
[2020-06-03 06:36:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 615 ms
[2020-06-03 06:36:39] [INFO ] Computed and/alt/rep : 1079/22471/1079 causal constraints in 110 ms.
[2020-06-03 06:36:42] [INFO ] Added : 58 causal constraints over 12 iterations in 2178 ms. Result :sat
[2020-06-03 06:36:42] [INFO ] Deduced a trap composed of 132 places in 519 ms
[2020-06-03 06:36:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 790 ms
Attempting to minimize the solution found.
Minimization took 35 ms.
[2020-06-03 06:36:42] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2020-06-03 06:36:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 31 ms.
[2020-06-03 06:36:43] [INFO ] Flatten gal took : 169 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ PolyORBNT-COL-S05J60 @ 3570 seconds
vrfy: finished
info: timeLeft: 3566
rslt: Output for ReachabilityCardinality @ PolyORBNT-COL-S05J60

{
"build":
{
"architecture": 64,
"assertions": false,
"build_hostname": "mcc2019",
"build_system": "x86_64-unknown-linux-gnu",
"optimizations": true,
"package_version": "2.0",
"svn_version": "3189M"
},
"call":
{
"exec_host": "mcc2020",
"localtimelimit": 0,
"markinglimit": null,
"parameters":
[
"--pnmlnet",
"model.pnml",
"--xmlformula",
"--formula=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 06:36:43 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 27396,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 1,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 70,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 70,
"visible_transitions": 0
},
"processed": "E (F (((p768 + 1 <= p380) AND (p387 <= 1) AND ((p382 + p383 + p384 + p385 + p386 <= 1) OR (p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + 1 <= p375)))))",
"processed_size": 533,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 5514,
"conflict_clusters": 74,
"places": 774,
"places_significant": 637,
"singleton_clusters": 0,
"transitions": 1090
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 6,
"problems": 2
},
"type": "reachability",
"workflow": "stateequation||search"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 1864/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 24768
lola: finding significant places
lola: 774 places, 1090 transitions, 637 significant places
lola: compute conflict clusters
lola: computed conflict clusters
lola: Computing conflicting sets
lola: Computing back conflicting sets
lola: TASK
lola: Reading formula in XML format (--xmlformula)
lola: reading pnml
lola: reading formula from ReachabilityCardinality.xml
lola: E (F (((p768 + 1 <= p380) AND (p387 <= 1) AND ((p382 + p383 + p384 + p385 + p386 <= 1) OR (p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + 1 <= p375)))))
lola: checking reachability
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: processed formula: E (F (((p768 + 1 <= p380) AND (p387 <= 1) AND ((p382 + p383 + p384 + p385 + p386 <= 1) OR (p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + ... (shortened)
lola: processed formula length: 533
lola: 1 rewrites
lola: closed formula file ReachabilityCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space)
lola: state space: using reachability graph (--search=depth)
lola: state space: using reachability preserving stubborn set method with insertion algorithm (--stubborn=tarjan)
lola: built state equation task
lola: RUNNING
lola: subprocess will run for 0 seconds at most (--localtimelimit)
lola: state equation task get result started, id 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: state equation task get result rewrite finished id 0
lola: local time limit reached - aborting
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((p768 + 1 <= p380) AND (p387 <= 1) AND ((p382 + p383 + p384 + p385 + p386 <= 1) OR (p189 + p190 + p191 + p192 + p193 + p194 + p195 + p196 + p197 + p198 + p199 + p200 + p201 + p202 + p203 + p204 + p205 + p206 + p207 + p208 + p209 + p210 + p211 + p212 + p213 + p214 + p215 + p216 + p217 + p218 + p219 + p220 + p221 + p222 + p223 + p224 + p225 + p226 + p227 + p228 + p229 + p230 + p231 + p232 + p233 + p234 + p235 + p236 + p237 + p238 + p239 + p240 + p241 + p242 + p243 + p244 + p245 + p246 + p247 + p248 + p249 + 1 <= p375)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 6 literals and 2 conjunctive subformulas
lola: memory consumption: 27396 KB
lola: time consumption: 4 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
rslt: finished

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

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="PolyORBNT-COL-S05J60"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# 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 itslola"
echo " Input is PolyORBNT-COL-S05J60, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r176-tajo-158987872100582"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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