fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r176-tajo-158987872100590
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for PolyORBNT-COL-S05J80

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15740.490 3600000.00 6998496.00 581.10 ?TTTFTF?FFFTTTTF normal

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-158987872100590.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-S05J80, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r176-tajo-158987872100590
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 276K
-rw-r--r-- 1 mcc users 3.9K Apr 12 06:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 12 06:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 11 05:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 13K Apr 11 05:49 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.6K 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.5K Apr 14 12:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Apr 10 12:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 10 12:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 9 18:40 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 9 18:40 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-S05J80-ReachabilityCardinality-00
FORMULA_NAME PolyORBNT-COL-S05J80-ReachabilityCardinality-01
FORMULA_NAME PolyORBNT-COL-S05J80-ReachabilityCardinality-02
FORMULA_NAME PolyORBNT-COL-S05J80-ReachabilityCardinality-03
FORMULA_NAME PolyORBNT-COL-S05J80-ReachabilityCardinality-04
FORMULA_NAME PolyORBNT-COL-S05J80-ReachabilityCardinality-05
FORMULA_NAME PolyORBNT-COL-S05J80-ReachabilityCardinality-06
FORMULA_NAME PolyORBNT-COL-S05J80-ReachabilityCardinality-07
FORMULA_NAME PolyORBNT-COL-S05J80-ReachabilityCardinality-08
FORMULA_NAME PolyORBNT-COL-S05J80-ReachabilityCardinality-09
FORMULA_NAME PolyORBNT-COL-S05J80-ReachabilityCardinality-10
FORMULA_NAME PolyORBNT-COL-S05J80-ReachabilityCardinality-11
FORMULA_NAME PolyORBNT-COL-S05J80-ReachabilityCardinality-12
FORMULA_NAME PolyORBNT-COL-S05J80-ReachabilityCardinality-13
FORMULA_NAME PolyORBNT-COL-S05J80-ReachabilityCardinality-14
FORMULA_NAME PolyORBNT-COL-S05J80-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591167187224

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 06:53:08] [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:53:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 06:53:08] [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:53:09] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 526 ms
[2020-06-03 06:53:09] [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:53:09] [INFO ] ms1 symmetric to ms3 in transition trans_489
[2020-06-03 06:53:09] [INFO ] ms3 symmetric to ms4 in transition trans_489
[2020-06-03 06:53:09] [INFO ] ms4 symmetric to ms2 in transition trans_489
[2020-06-03 06:53:09] [INFO ] ms1 symmetric to ms3 in transition trans_488
[2020-06-03 06:53:09] [INFO ] ms3 symmetric to ms2 in transition trans_488
[2020-06-03 06:53:09] [INFO ] ms1 symmetric to ms2 in transition trans_487
[2020-06-03 06:53:09] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 1269 PT places and 2592.0 transition bindings in 21 ms.
[2020-06-03 06:53:09] [INFO ] Computed order based on color domains.
[2020-06-03 06:53:09] [INFO ] Unfolded HLPN to a Petri net with 1269 places and 1775 transitions in 26 ms.
[2020-06-03 06:53:09] [INFO ] Unfolded HLPN properties in 0 ms.
Deduced a syphon composed of 80 places in 9 ms
Reduce places removed 80 places and 80 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 65 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 701 resets, run finished after 158 ms. (steps per millisecond=63 ) properties seen :[0, 0, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 0]
FORMULA PolyORBNT-COL-S05J80-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J80-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 303 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 64 ms. (steps per millisecond=156 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 110 resets, run finished after 36 ms. (steps per millisecond=277 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 246 resets, run finished after 52 ms. (steps per millisecond=192 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 274 resets, run finished after 40 ms. (steps per millisecond=250 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 40 ms. (steps per millisecond=250 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 124 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10000 steps, including 252 resets, run finished after 40 ms. (steps per millisecond=250 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 61 ms. (steps per millisecond=163 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
[2020-06-03 06:53:09] [INFO ] Flow matrix only has 1691 transitions (discarded 4 similar events)
// Phase 1: matrix 1691 rows 1189 cols
[2020-06-03 06:53:10] [INFO ] Computed 182 place invariants in 206 ms
[2020-06-03 06:53:10] [INFO ] [Real]Absence check using 175 positive place invariants in 191 ms returned sat
[2020-06-03 06:53:10] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 42 ms returned sat
[2020-06-03 06:53:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:53:14] [INFO ] [Real]Absence check using state equation in 3813 ms returned sat
[2020-06-03 06:53:14] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:53:14] [INFO ] [Nat]Absence check using 175 positive place invariants in 120 ms returned sat
[2020-06-03 06:53:14] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 80 ms returned sat
[2020-06-03 06:53:14] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:53:18] [INFO ] [Nat]Absence check using state equation in 3907 ms returned sat
[2020-06-03 06:53:18] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 06:53:18] [INFO ] [Nat]Added 1 Read/Feed constraints in 23 ms returned sat
[2020-06-03 06:53:19] [INFO ] Computed and/alt/rep : 1689/52482/1685 causal constraints in 269 ms.
[2020-06-03 06:53:19] [INFO ] Added : 5 causal constraints over 1 iterations in 647 ms. Result :(error "Failed to check-sat")
[2020-06-03 06:53:19] [INFO ] [Real]Absence check using 175 positive place invariants in 17 ms returned unsat
[2020-06-03 06:53:19] [INFO ] [Real]Absence check using 175 positive place invariants in 155 ms returned sat
[2020-06-03 06:53:19] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 29 ms returned unsat
[2020-06-03 06:53:20] [INFO ] [Real]Absence check using 175 positive place invariants in 85 ms returned unsat
[2020-06-03 06:53:20] [INFO ] [Real]Absence check using 175 positive place invariants in 215 ms returned sat
[2020-06-03 06:53:20] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 50 ms returned sat
[2020-06-03 06:53:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:53:24] [INFO ] [Real]Absence check using state equation in 4165 ms returned sat
[2020-06-03 06:53:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:53:24] [INFO ] [Nat]Absence check using 175 positive place invariants in 132 ms returned sat
[2020-06-03 06:53:25] [INFO ] [Nat]Absence check using 175 positive and 7 generalized place invariants in 33 ms returned sat
[2020-06-03 06:53:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:53:28] [INFO ] [Nat]Absence check using state equation in 3712 ms returned sat
[2020-06-03 06:53:28] [INFO ] [Nat]Added 1 Read/Feed constraints in 92 ms returned sat
[2020-06-03 06:53:29] [INFO ] Deduced a trap composed of 14 places in 146 ms
[2020-06-03 06:53:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 288 ms
[2020-06-03 06:53:29] [INFO ] Computed and/alt/rep : 1689/52482/1685 causal constraints in 120 ms.
[2020-06-03 06:53:29] [INFO ] Added : 5 causal constraints over 1 iterations in 654 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-03 06:53:29] [INFO ] [Real]Absence check using 175 positive place invariants in 74 ms returned unsat
[2020-06-03 06:53:30] [INFO ] [Real]Absence check using 175 positive place invariants in 125 ms returned unsat
[2020-06-03 06:53:30] [INFO ] [Real]Absence check using 175 positive place invariants in 166 ms returned sat
[2020-06-03 06:53:30] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 8 ms returned unsat
[2020-06-03 06:53:30] [INFO ] [Real]Absence check using 175 positive place invariants in 224 ms returned sat
[2020-06-03 06:53:30] [INFO ] [Real]Absence check using 175 positive and 7 generalized place invariants in 22 ms returned unsat
FORMULA PolyORBNT-COL-S05J80-ReachabilityCardinality-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-COL-S05J80-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-COL-S05J80-ReachabilityCardinality-11 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-COL-S05J80-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-COL-S05J80-ReachabilityCardinality-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-COL-S05J80-ReachabilityCardinality-02 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-COL-S05J80-ReachabilityCardinality-01 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 4 out of 1189 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1189/1189 places, 1695/1695 transitions.
Ensure Unique test removed 5 places
Performed 85 Post agglomeration using F-continuation condition.Transition count delta: 85
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 1184 transition count 1610
Reduce places removed 85 places and 0 transitions.
Iterating post reduction 1 with 85 rules applied. Total rules applied 175 place count 1099 transition count 1610
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 175 place count 1099 transition count 1526
Deduced a syphon composed of 84 places in 3 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 343 place count 1015 transition count 1526
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 347 place count 1013 transition count 1524
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 348 place count 1013 transition count 1523
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 349 place count 1012 transition count 1523
Applied a total of 349 rules in 491 ms. Remains 1012 /1189 variables (removed 177) and now considering 1523/1695 (removed 172) transitions.
[2020-06-03 06:53:31] [INFO ] Flow matrix only has 1519 transitions (discarded 4 similar events)
// Phase 1: matrix 1519 rows 1012 cols
[2020-06-03 06:53:31] [INFO ] Computed 177 place invariants in 106 ms
[2020-06-03 06:53:37] [INFO ] Dead Transitions using invariants and state equation in 5938 ms returned [984, 985, 986, 987, 988, 989, 990, 991, 992, 993, 994, 995, 996, 997, 998, 999, 1000, 1001, 1002, 1003, 1005, 1006, 1007, 1008, 1009, 1010, 1011, 1012, 1013, 1014, 1015, 1016, 1017, 1018, 1019, 1020, 1021, 1022, 1023, 1025, 1026, 1027, 1028, 1029, 1031, 1034, 1035, 1036, 1037, 1038, 1039, 1040, 1041, 1042, 1043, 1044, 1045, 1046, 1047, 1048, 1049, 1050, 1051, 1052, 1053, 1054, 1055, 1056, 1057, 1058, 1060, 1061, 1062, 1063, 1064, 1066, 1069, 1070, 1071, 1072, 1073, 1074, 1076, 1079, 1083, 1084, 1085, 1086, 1087, 1088, 1089, 1091, 1094, 1098, 1103]
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions :[1103, 1098, 1094, 1091, 1089, 1088, 1087, 1086, 1085, 1084, 1083, 1079, 1076, 1074, 1073, 1072, 1071, 1070, 1069, 1066, 1064, 1063, 1062, 1061, 1060, 1058, 1057, 1056, 1055, 1054, 1053, 1052, 1051, 1050, 1049, 1048, 1047, 1046, 1045, 1044, 1043, 1042, 1041, 1040, 1039, 1038, 1037, 1036, 1035, 1034, 1031, 1029, 1028, 1027, 1026, 1025, 1023, 1022, 1021, 1020, 1019, 1018, 1017, 1016, 1015, 1014, 1013, 1012, 1011, 1010, 1009, 1008, 1007, 1006, 1005, 1003, 1002, 1001, 1000, 999, 998, 997, 996, 995, 994, 993, 992, 991, 990, 989, 988, 987, 986, 985, 984]
Starting structural reductions, iteration 1 : 1012/1189 places, 1428/1695 transitions.
Applied a total of 0 rules in 77 ms. Remains 1012 /1012 variables (removed 0) and now considering 1428/1428 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 1012/1189 places, 1428/1695 transitions.
Incomplete random walk after 1000000 steps, including 58985 resets, run finished after 5819 ms. (steps per millisecond=171 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000000 steps, including 34482 resets, run finished after 2316 ms. (steps per millisecond=431 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 30929 resets, run finished after 2436 ms. (steps per millisecond=410 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 4645481 steps, run timeout after 30001 ms. (steps per millisecond=154 ) properties seen :[0, 0]
Probabilistic random walk after 4645481 steps, saw 1449167 distinct states, run finished after 30001 ms. (steps per millisecond=154 ) properties seen :[0, 0]
[2020-06-03 06:54:18] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1012 cols
[2020-06-03 06:54:18] [INFO ] Computed 177 place invariants in 39 ms
[2020-06-03 06:54:18] [INFO ] [Real]Absence check using 170 positive place invariants in 123 ms returned sat
[2020-06-03 06:54:18] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 41 ms returned sat
[2020-06-03 06:54:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:54:21] [INFO ] [Real]Absence check using state equation in 3018 ms returned sat
[2020-06-03 06:54:21] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:54:21] [INFO ] [Nat]Absence check using 170 positive place invariants in 117 ms returned sat
[2020-06-03 06:54:21] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 36 ms returned sat
[2020-06-03 06:54:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:54:25] [INFO ] [Nat]Absence check using state equation in 3295 ms returned sat
[2020-06-03 06:54:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 06:54:25] [INFO ] [Nat]Added 1 Read/Feed constraints in 56 ms returned sat
[2020-06-03 06:54:25] [INFO ] Deduced a trap composed of 402 places in 694 ms
[2020-06-03 06:54:26] [INFO ] Deduced a trap composed of 396 places in 717 ms
[2020-06-03 06:54:27] [INFO ] Deduced a trap composed of 402 places in 663 ms
[2020-06-03 06:54:28] [INFO ] Deduced a trap composed of 412 places in 657 ms
[2020-06-03 06:54:28] [INFO ] Deduced a trap composed of 404 places in 607 ms
[2020-06-03 06:54:29] [INFO ] Deduced a trap composed of 218 places in 717 ms
[2020-06-03 06:54:30] [INFO ] Deduced a trap composed of 394 places in 627 ms
[2020-06-03 06:54:31] [INFO ] Deduced a trap composed of 222 places in 645 ms
[2020-06-03 06:54:32] [INFO ] Deduced a trap composed of 422 places in 637 ms
[2020-06-03 06:54:32] [INFO ] Deduced a trap composed of 400 places in 603 ms
[2020-06-03 06:54:33] [INFO ] Deduced a trap composed of 422 places in 632 ms
[2020-06-03 06:54:34] [INFO ] Deduced a trap composed of 402 places in 531 ms
[2020-06-03 06:54:36] [INFO ] Deduced a trap composed of 402 places in 495 ms
[2020-06-03 06:54:37] [INFO ] Deduced a trap composed of 410 places in 515 ms
[2020-06-03 06:54:37] [INFO ] Deduced a trap composed of 408 places in 670 ms
[2020-06-03 06:54:38] [INFO ] Deduced a trap composed of 390 places in 675 ms
[2020-06-03 06:54:39] [INFO ] Deduced a trap composed of 404 places in 655 ms
[2020-06-03 06:54:40] [INFO ] Deduced a trap composed of 402 places in 669 ms
[2020-06-03 06:54:40] [INFO ] Deduced a trap composed of 398 places in 485 ms
[2020-06-03 06:54:41] [INFO ] Deduced a trap composed of 396 places in 515 ms
[2020-06-03 06:54:42] [INFO ] Deduced a trap composed of 420 places in 653 ms
[2020-06-03 06:54:42] [INFO ] Deduced a trap composed of 388 places in 573 ms
[2020-06-03 06:54:43] [INFO ] Deduced a trap composed of 390 places in 651 ms
[2020-06-03 06:54:45] [INFO ] Deduced a trap composed of 396 places in 663 ms
[2020-06-03 06:54:45] [INFO ] Deduced a trap composed of 408 places in 649 ms
[2020-06-03 06:54:47] [INFO ] Deduced a trap composed of 400 places in 672 ms
[2020-06-03 06:54:49] [INFO ] Deduced a trap composed of 396 places in 662 ms
[2020-06-03 06:54:50] [INFO ] Deduced a trap composed of 410 places in 669 ms
[2020-06-03 06:54:52] [INFO ] Deduced a trap composed of 396 places in 682 ms
[2020-06-03 06:54:53] [INFO ] Deduced a trap composed of 396 places in 624 ms
[2020-06-03 06:54:54] [INFO ] Deduced a trap composed of 398 places in 661 ms
[2020-06-03 06:54:56] [INFO ] Deduced a trap composed of 392 places in 624 ms
[2020-06-03 06:54:57] [INFO ] Deduced a trap composed of 398 places in 644 ms
[2020-06-03 06:54:58] [INFO ] Deduced a trap composed of 408 places in 647 ms
[2020-06-03 06:54:58] [INFO ] Deduced a trap composed of 396 places in 656 ms
[2020-06-03 06:54:59] [INFO ] Deduced a trap composed of 396 places in 491 ms
[2020-06-03 06:55:01] [INFO ] Deduced a trap composed of 396 places in 654 ms
[2020-06-03 06:55:04] [INFO ] Deduced a trap composed of 400 places in 573 ms
[2020-06-03 06:55:06] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 06:55:07] [INFO ] Deduced a trap composed of 6 places in 861 ms
[2020-06-03 06:55:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s849 s850 s851 s852 s853 s987) 0)") while checking expression at index 0
[2020-06-03 06:55:07] [INFO ] [Real]Absence check using 170 positive place invariants in 81 ms returned sat
[2020-06-03 06:55:07] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 24 ms returned sat
[2020-06-03 06:55:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:55:10] [INFO ] [Real]Absence check using state equation in 2689 ms returned sat
[2020-06-03 06:55:10] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:55:10] [INFO ] [Nat]Absence check using 170 positive place invariants in 120 ms returned sat
[2020-06-03 06:55:10] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 36 ms returned sat
[2020-06-03 06:55:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:55:13] [INFO ] [Nat]Absence check using state equation in 2841 ms returned sat
[2020-06-03 06:55:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 18 ms returned sat
[2020-06-03 06:55:13] [INFO ] Computed and/alt/rep : 1422/36681/1418 causal constraints in 93 ms.
[2020-06-03 06:55:17] [INFO ] Added : 74 causal constraints over 15 iterations in 4513 ms. Result :sat
[2020-06-03 06:55:18] [INFO ] Deduced a trap composed of 13 places in 479 ms
[2020-06-03 06:55:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1284 ms
Attempting to minimize the solution found.
Minimization took 87 ms.
Incomplete Parikh walk after 10400 steps, including 870 resets, run finished after 98 ms. (steps per millisecond=106 ) properties seen :[0, 0] could not realise parikh vector
Support contains 4 out of 1012 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1012/1012 places, 1428/1428 transitions.
Applied a total of 0 rules in 90 ms. Remains 1012 /1012 variables (removed 0) and now considering 1428/1428 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 1012/1012 places, 1428/1428 transitions.
Starting structural reductions, iteration 0 : 1012/1012 places, 1428/1428 transitions.
Applied a total of 0 rules in 42 ms. Remains 1012 /1012 variables (removed 0) and now considering 1428/1428 (removed 0) transitions.
[2020-06-03 06:55:19] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1012 cols
[2020-06-03 06:55:19] [INFO ] Computed 177 place invariants in 42 ms
[2020-06-03 06:55:24] [INFO ] Implicit Places using invariants in 4595 ms returned []
[2020-06-03 06:55:24] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1012 cols
[2020-06-03 06:55:24] [INFO ] Computed 177 place invariants in 56 ms
[2020-06-03 06:55:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 06:55:39] [INFO ] Implicit Places using invariants and state equation in 15238 ms returned []
Implicit Place search using SMT with State Equation took 19836 ms to find 0 implicit places.
[2020-06-03 06:55:39] [INFO ] Redundant transitions in 97 ms returned []
[2020-06-03 06:55:39] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1012 cols
[2020-06-03 06:55:39] [INFO ] Computed 177 place invariants in 29 ms
[2020-06-03 06:55:44] [INFO ] Dead Transitions using invariants and state equation in 5478 ms returned []
Finished structural reductions, in 1 iterations. Remains : 1012/1012 places, 1428/1428 transitions.
Incomplete random walk after 100000 steps, including 5930 resets, run finished after 849 ms. (steps per millisecond=117 ) properties seen :[0, 0]
[2020-06-03 06:55:45] [INFO ] Flow matrix only has 1424 transitions (discarded 4 similar events)
// Phase 1: matrix 1424 rows 1012 cols
[2020-06-03 06:55:45] [INFO ] Computed 177 place invariants in 37 ms
[2020-06-03 06:55:46] [INFO ] [Real]Absence check using 170 positive place invariants in 121 ms returned sat
[2020-06-03 06:55:46] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 37 ms returned sat
[2020-06-03 06:55:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:55:48] [INFO ] [Real]Absence check using state equation in 2752 ms returned sat
[2020-06-03 06:55:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:55:49] [INFO ] [Nat]Absence check using 170 positive place invariants in 118 ms returned sat
[2020-06-03 06:55:49] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 37 ms returned sat
[2020-06-03 06:55:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:55:52] [INFO ] [Nat]Absence check using state equation in 3534 ms returned sat
[2020-06-03 06:55:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2020-06-03 06:55:52] [INFO ] [Nat]Added 1 Read/Feed constraints in 54 ms returned sat
[2020-06-03 06:55:53] [INFO ] Deduced a trap composed of 402 places in 499 ms
[2020-06-03 06:55:53] [INFO ] Deduced a trap composed of 396 places in 490 ms
[2020-06-03 06:55:54] [INFO ] Deduced a trap composed of 402 places in 491 ms
[2020-06-03 06:55:55] [INFO ] Deduced a trap composed of 412 places in 493 ms
[2020-06-03 06:55:55] [INFO ] Deduced a trap composed of 404 places in 507 ms
[2020-06-03 06:55:56] [INFO ] Deduced a trap composed of 218 places in 539 ms
[2020-06-03 06:55:57] [INFO ] Deduced a trap composed of 394 places in 529 ms
[2020-06-03 06:55:57] [INFO ] Deduced a trap composed of 222 places in 692 ms
[2020-06-03 06:55:58] [INFO ] Deduced a trap composed of 422 places in 612 ms
[2020-06-03 06:55:59] [INFO ] Deduced a trap composed of 400 places in 546 ms
[2020-06-03 06:55:59] [INFO ] Deduced a trap composed of 422 places in 666 ms
[2020-06-03 06:56:01] [INFO ] Deduced a trap composed of 402 places in 649 ms
[2020-06-03 06:56:03] [INFO ] Deduced a trap composed of 402 places in 635 ms
[2020-06-03 06:56:03] [INFO ] Deduced a trap composed of 410 places in 645 ms
[2020-06-03 06:56:04] [INFO ] Deduced a trap composed of 408 places in 650 ms
[2020-06-03 06:56:05] [INFO ] Deduced a trap composed of 390 places in 662 ms
[2020-06-03 06:56:06] [INFO ] Deduced a trap composed of 404 places in 649 ms
[2020-06-03 06:56:06] [INFO ] Deduced a trap composed of 402 places in 652 ms
[2020-06-03 06:56:07] [INFO ] Deduced a trap composed of 398 places in 652 ms
[2020-06-03 06:56:08] [INFO ] Deduced a trap composed of 396 places in 672 ms
[2020-06-03 06:56:09] [INFO ] Deduced a trap composed of 420 places in 643 ms
[2020-06-03 06:56:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s39 s40 s41 s42 s43 s44 s45 s46 s47 s48 s49 s50 s51 s52 s53 s54 s55 s56 s57 s58 s59 s60 s61 s62 s63 s64 s65 s66 s67 s68 s69 s70 s71 s72 s73 s74 s75 s76 s77 s78 s79 s80 s81 s82 s86 s88 s90 s91 s96 s97 s100 s101 s102 s104 s108 s113 s116 s117 s118 s119 s124 s125 s126 s130 s131 s133 s134 s135 s136 s139 s141 s143 s144 s146 s147 s148 s149 s151 s153 s154 s155 s156 s157 s160 s161 s163 s167 s169 s171 s172 s177 s178 s181 s182 s183 s185 s189 s194 s197 s198 s199 s200 s205 s206 s207 s211 s212 s214 s215 s216 s217 s220 s222 s224 s225 s227 s228 s229 s230 s232 s234 s235 s236 s237 s238 s241 s242 s244 s251 s253 s255 s256 s261 s262 s265 s266 s267 s269 s273 s278 s281 s282 s283 s284 s289 s290 s291 s295 s296 s298 s299 s300 s301 s304 s306 s308 s309 s311 s312 s313 s314 s316 s318 s319 s320 s321 s322 s325 s326 s328 s332 s334 s336 s337 s342 s343 s346 s347 s348 s350 s354 s359 s362 s363 s364 s365 s370 s371 s372 s376 s377 s379 s380 s381 s382 s385 s387 s389 s390 s392 s393 s394 s395 s397 s399 s400 s401 s402 s403 s406 s407 s409 s416 s418 s420 s421 s426 s427 s430 s431 s432 s434 s438 s443 s446 s447 s448 s449 s454 s455 s456 s460 s461 s463 s464 s465 s466 s469 s471 s473 s474 s476 s477 s478 s479 s481 s483 s484 s485 s486 s487 s490 s491 s493 s497 s504 s506 s508 s509 s511 s513 s519 s521 s523 s529 s531 s533 s544 s546 s548 s549 s551 s553 s554 s556 s558 s559 s561 s563 s574 s576 s578 s579 s581 s583 s599 s601 s603 s609 s611 s613 s614 s616 s618 s619 s621 s623 s629 s631 s633 s634 s636 s638 s639 s641 s643 s644 s646 s648 s654 s656 s658 s659 s661 s663 s684 s686 s688 s689 s691 s693 s694 s696 s698 s699 s701 s703 s719 s721 s723 s724 s726 s728 s729 s731 s733 s744 s746 s748 s769 s771 s773 s774 s776 s778 s784 s786 s788 s794 s796 s798 s809 s811 s813 s834 s836 s838 s844 s846 s848 s874 s876 s878 s879 s881 s883 s894 s896 s898 s904 s906 s908 s909 s911 s913 s916 s917 s1004 s1006 s1007 s1008 s1009) 0)") while checking expression at index 0
[2020-06-03 06:56:09] [INFO ] [Real]Absence check using 170 positive place invariants in 115 ms returned sat
[2020-06-03 06:56:09] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 27 ms returned sat
[2020-06-03 06:56:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:56:12] [INFO ] [Real]Absence check using state equation in 2764 ms returned sat
[2020-06-03 06:56:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:56:12] [INFO ] [Nat]Absence check using 170 positive place invariants in 118 ms returned sat
[2020-06-03 06:56:12] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 36 ms returned sat
[2020-06-03 06:56:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:56:15] [INFO ] [Nat]Absence check using state equation in 2924 ms returned sat
[2020-06-03 06:56:15] [INFO ] [Nat]Added 1 Read/Feed constraints in 21 ms returned sat
[2020-06-03 06:56:15] [INFO ] Computed and/alt/rep : 1422/36681/1418 causal constraints in 116 ms.
[2020-06-03 06:56:19] [INFO ] Added : 74 causal constraints over 15 iterations in 4359 ms. Result :sat
[2020-06-03 06:56:20] [INFO ] Deduced a trap composed of 13 places in 490 ms
[2020-06-03 06:56:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1271 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 1012 transition count 1424
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 1012 transition count 1423
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 1011 transition count 1423
Applied a total of 6 rules in 67 ms. Remains 1011 /1012 variables (removed 1) and now considering 1423/1428 (removed 5) transitions.
// Phase 1: matrix 1423 rows 1011 cols
[2020-06-03 06:56:21] [INFO ] Computed 177 place invariants in 42 ms
[2020-06-03 06:56:21] [INFO ] [Real]Absence check using 170 positive place invariants in 118 ms returned sat
[2020-06-03 06:56:21] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 35 ms returned sat
[2020-06-03 06:56:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:56:24] [INFO ] [Real]Absence check using state equation in 2870 ms returned sat
[2020-06-03 06:56:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:56:24] [INFO ] [Nat]Absence check using 170 positive place invariants in 116 ms returned sat
[2020-06-03 06:56:24] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 35 ms returned sat
[2020-06-03 06:56:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:56:33] [INFO ] [Nat]Absence check using state equation in 8714 ms returned sat
[2020-06-03 06:56:33] [INFO ] Deduced a trap composed of 13 places in 244 ms
[2020-06-03 06:56:34] [INFO ] Deduced a trap composed of 13 places in 499 ms
[2020-06-03 06:56:35] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 1566 ms
[2020-06-03 06:56:35] [INFO ] Computed and/alt/rep : 1417/36671/1417 causal constraints in 65 ms.
[2020-06-03 06:56:55] [INFO ] Added : 405 causal constraints over 81 iterations in 20302 ms.(timeout) Result :sat
Attempting to minimize the solution found.
Minimization took 201 ms.
[2020-06-03 06:56:55] [INFO ] [Real]Absence check using 170 positive place invariants in 95 ms returned sat
[2020-06-03 06:56:55] [INFO ] [Real]Absence check using 170 positive and 7 generalized place invariants in 26 ms returned sat
[2020-06-03 06:56:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 06:56:58] [INFO ] [Real]Absence check using state equation in 2821 ms returned sat
[2020-06-03 06:56:58] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 06:56:59] [INFO ] [Nat]Absence check using 170 positive place invariants in 117 ms returned sat
[2020-06-03 06:56:59] [INFO ] [Nat]Absence check using 170 positive and 7 generalized place invariants in 45 ms returned sat
[2020-06-03 06:56:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 06:57:09] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 06:57:12] [INFO ] [Nat]Absence check using state equation in 13213 ms returned unknown
[2020-06-03 06:57:12] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 9 ms.
[2020-06-03 06:57:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 29 ms.
[2020-06-03 06:57:12] [INFO ] Flatten gal took : 224 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ PolyORBNT-COL-S05J80 @ 3570 seconds
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16427456 kB
MemFree: 9918116 kB
After kill :
MemTotal: 16427456 kB
MemFree: 16133352 kB

--------------------
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-S05J80"
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-S05J80, 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-158987872100590"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S05J80.tgz
mv PolyORBNT-COL-S05J80 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 ;