Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r170-oct2-162089287200184.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is PolyORBNT-COL-S05J20, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-oct2-162089287200184
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 14K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 13K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 91K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 28 16:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Mar 28 16:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 16:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 27 09:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 09:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Mar 25 12:18 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Mar 25 12:18 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_pt
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 5 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 92K May 5 16:51 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-S05J20-ReachabilityFireability-00
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-01
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-02
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-03
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-04
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-05
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-06
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-07
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-08
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-09
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-10
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-11
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-12
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-13
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-14
FORMULA_NAME PolyORBNT-COL-S05J20-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1621384531270

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-19 00:35:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2021-05-19 00:35:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-19 00:35:33] [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.
[2021-05-19 00:35:33] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 507 ms
[2021-05-19 00:35:33] [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,

[2021-05-19 00:35:33] [INFO ] ms1 symmetric to ms3 in transition trans_489
[2021-05-19 00:35:33] [INFO ] ms3 symmetric to ms4 in transition trans_489
[2021-05-19 00:35:33] [INFO ] ms4 symmetric to ms2 in transition trans_489
[2021-05-19 00:35:33] [INFO ] ms1 symmetric to ms3 in transition trans_488
[2021-05-19 00:35:33] [INFO ] ms3 symmetric to ms2 in transition trans_488
[2021-05-19 00:35:33] [INFO ] ms1 symmetric to ms2 in transition trans_487
[2021-05-19 00:35:33] [INFO ] Imported 48 HL places and 38 HL transitions for a total of 369 PT places and 1272.0 transition bindings in 28 ms.
[2021-05-19 00:35:33] [INFO ] Computed order based on color domains.
[2021-05-19 00:35:33] [INFO ] Unfolded HLPN to a Petri net with 369 places and 575 transitions in 14 ms.
[2021-05-19 00:35:33] [INFO ] Unfolded HLPN properties in 0 ms.
Deduced a syphon composed of 20 places in 3 ms
Reduce places removed 20 places and 20 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 39 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 677 resets, run finished after 120 ms. (steps per millisecond=83 ) properties seen :[0, 1, 1, 0, 0, 1, 1, 1, 1, 1, 0, 1, 1, 0, 0, 1]
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 201 resets, run finished after 136 ms. (steps per millisecond=73 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 159 resets, run finished after 20 ms. (steps per millisecond=500 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 164 resets, run finished after 22 ms. (steps per millisecond=454 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 166 resets, run finished after 136 ms. (steps per millisecond=73 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 120 resets, run finished after 114 ms. (steps per millisecond=87 ) properties seen :[0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 242 resets, run finished after 32 ms. (steps per millisecond=312 ) properties seen :[0, 0, 0, 0, 0, 0]
[2021-05-19 00:35:34] [INFO ] Flow matrix only has 551 transitions (discarded 4 similar events)
// Phase 1: matrix 551 rows 349 cols
[2021-05-19 00:35:34] [INFO ] Computed 62 place invariants in 26 ms
[2021-05-19 00:35:34] [INFO ] [Real]Absence check using 55 positive place invariants in 48 ms returned sat
[2021-05-19 00:35:34] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned unsat
[2021-05-19 00:35:34] [INFO ] [Real]Absence check using 55 positive place invariants in 33 ms returned sat
[2021-05-19 00:35:34] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned sat
[2021-05-19 00:35:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 00:35:35] [INFO ] [Real]Absence check using state equation in 421 ms returned sat
[2021-05-19 00:35:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 00:35:35] [INFO ] [Nat]Absence check using 55 positive place invariants in 25 ms returned sat
[2021-05-19 00:35:35] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2021-05-19 00:35:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 00:35:35] [INFO ] [Nat]Absence check using state equation in 513 ms returned sat
[2021-05-19 00:35:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-19 00:35:35] [INFO ] [Nat]Added 1 Read/Feed constraints in 27 ms returned sat
[2021-05-19 00:35:35] [INFO ] Computed and/alt/rep : 549/8982/545 causal constraints in 41 ms.
[2021-05-19 00:35:36] [INFO ] Added : 31 causal constraints over 7 iterations in 602 ms. Result :sat
[2021-05-19 00:35:36] [INFO ] Deduced a trap composed of 189 places in 154 ms
[2021-05-19 00:35:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 270 ms
Attempting to minimize the solution found.
Minimization took 29 ms.
[2021-05-19 00:35:36] [INFO ] [Real]Absence check using 55 positive place invariants in 43 ms returned sat
[2021-05-19 00:35:36] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 9 ms returned sat
[2021-05-19 00:35:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 00:35:37] [INFO ] [Real]Absence check using state equation in 467 ms returned sat
[2021-05-19 00:35:37] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 00:35:37] [INFO ] [Nat]Absence check using 55 positive place invariants in 20 ms returned sat
[2021-05-19 00:35:37] [INFO ] [Nat]Absence check using 55 positive and 7 generalized place invariants in 8 ms returned sat
[2021-05-19 00:35:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 00:35:37] [INFO ] [Nat]Absence check using state equation in 544 ms returned sat
[2021-05-19 00:35:37] [INFO ] [Nat]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-19 00:35:37] [INFO ] Computed and/alt/rep : 549/8982/545 causal constraints in 35 ms.
[2021-05-19 00:35:38] [INFO ] Added : 19 causal constraints over 4 iterations in 263 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 19 ms.
[2021-05-19 00:35:38] [INFO ] [Real]Absence check using 55 positive place invariants in 40 ms returned sat
[2021-05-19 00:35:38] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned unsat
[2021-05-19 00:35:38] [INFO ] [Real]Absence check using 55 positive place invariants in 26 ms returned sat
[2021-05-19 00:35:38] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 7 ms returned unsat
[2021-05-19 00:35:38] [INFO ] [Real]Absence check using 55 positive place invariants in 20 ms returned sat
[2021-05-19 00:35:38] [INFO ] [Real]Absence check using 55 positive and 7 generalized place invariants in 5 ms returned unsat
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-10 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-00 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 2000 steps, including 97 resets, run finished after 29 ms. (steps per millisecond=68 ) properties seen :[0, 1] could not realise parikh vector
FORMULA PolyORBNT-COL-S05J20-ReachabilityFireability-04 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 5300 steps, including 348 resets, run finished after 22 ms. (steps per millisecond=240 ) properties seen :[0] could not realise parikh vector
Support contains 1 out of 349 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 349/349 places, 555/555 transitions.
Ensure Unique test removed 5 places
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 344 transition count 529
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 57 place count 318 transition count 529
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 57 place count 318 transition count 504
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 107 place count 293 transition count 504
Symmetric choice reduction at 2 with 1 rule applications. Total rules 108 place count 293 transition count 504
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 110 place count 292 transition count 503
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 114 place count 290 transition count 501
Applied a total of 114 rules in 69 ms. Remains 290 /349 variables (removed 59) and now considering 501/555 (removed 54) transitions.
[2021-05-19 00:35:38] [INFO ] Flow matrix only has 497 transitions (discarded 4 similar events)
// Phase 1: matrix 497 rows 290 cols
[2021-05-19 00:35:38] [INFO ] Computed 57 place invariants in 23 ms
[2021-05-19 00:35:39] [INFO ] Dead Transitions using invariants and state equation in 784 ms returned [260, 261, 263, 266, 270, 275, 281, 282, 283, 284, 285, 286, 287, 288, 289, 290, 291, 292, 293, 294, 295, 296, 297, 298, 299, 300, 302, 303, 304, 305, 306, 307, 308, 309, 310, 311, 312, 313, 314, 315, 316, 317, 318, 319, 320, 322, 323, 324, 325, 326, 328, 331, 332, 333, 334, 335, 336, 337, 338, 339, 340, 341, 342, 343, 344, 345, 346, 347, 348, 349, 350, 351, 352, 353, 354, 355, 357, 358, 359, 360, 361, 363, 366, 367, 368, 369, 370, 371, 373, 376, 380, 381, 382, 383, 384]
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions :[384, 383, 382, 381, 380, 376, 373, 371, 370, 369, 368, 367, 366, 363, 361, 360, 359, 358, 357, 355, 354, 353, 352, 351, 350, 349, 348, 347, 346, 345, 344, 343, 342, 341, 340, 339, 338, 337, 336, 335, 334, 333, 332, 331, 328, 326, 325, 324, 323, 322, 320, 319, 318, 317, 316, 315, 314, 313, 312, 311, 310, 309, 308, 307, 306, 305, 304, 303, 302, 300, 299, 298, 297, 296, 295, 294, 293, 292, 291, 290, 289, 288, 287, 286, 285, 284, 283, 282, 281, 275, 270, 266, 263, 261, 260]
Starting structural reductions, iteration 1 : 290/349 places, 406/555 transitions.
Applied a total of 0 rules in 20 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 290/349 places, 406/555 transitions.
Incomplete random walk after 1000000 steps, including 51963 resets, run finished after 1982 ms. (steps per millisecond=504 ) properties seen :[0]
Incomplete Best-First random walk after 1000000 steps, including 7124 resets, run finished after 642 ms. (steps per millisecond=1557 ) properties seen :[0]
Interrupted probabilistic random walk after 17311857 steps, run timeout after 30001 ms. (steps per millisecond=577 ) properties seen :[0]
Probabilistic random walk after 17311857 steps, saw 4943382 distinct states, run finished after 30001 ms. (steps per millisecond=577 ) properties seen :[0]
[2021-05-19 00:36:12] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2021-05-19 00:36:12] [INFO ] Computed 57 place invariants in 20 ms
[2021-05-19 00:36:12] [INFO ] [Real]Absence check using 50 positive place invariants in 46 ms returned sat
[2021-05-19 00:36:12] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 9 ms returned sat
[2021-05-19 00:36:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 00:36:12] [INFO ] [Real]Absence check using state equation in 278 ms returned sat
[2021-05-19 00:36:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-19 00:36:12] [INFO ] [Real]Added 1 Read/Feed constraints in 5 ms returned sat
[2021-05-19 00:36:12] [INFO ] Deduced a trap composed of 89 places in 212 ms
[2021-05-19 00:36:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 259 ms
[2021-05-19 00:36:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 00:36:12] [INFO ] [Nat]Absence check using 50 positive place invariants in 29 ms returned sat
[2021-05-19 00:36:12] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 19 ms returned sat
[2021-05-19 00:36:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 00:36:13] [INFO ] [Nat]Absence check using state equation in 422 ms returned sat
[2021-05-19 00:36:13] [INFO ] [Nat]Added 1 Read/Feed constraints in 49 ms returned sat
[2021-05-19 00:36:13] [INFO ] Deduced a trap composed of 89 places in 211 ms
[2021-05-19 00:36:13] [INFO ] Deduced a trap composed of 89 places in 88 ms
[2021-05-19 00:36:13] [INFO ] Deduced a trap composed of 89 places in 162 ms
[2021-05-19 00:36:14] [INFO ] Deduced a trap composed of 92 places in 120 ms
[2021-05-19 00:36:14] [INFO ] Deduced a trap composed of 86 places in 200 ms
[2021-05-19 00:36:14] [INFO ] Deduced a trap composed of 89 places in 182 ms
[2021-05-19 00:36:14] [INFO ] Deduced a trap composed of 89 places in 223 ms
[2021-05-19 00:36:14] [INFO ] Deduced a trap composed of 80 places in 190 ms
[2021-05-19 00:36:15] [INFO ] Deduced a trap composed of 86 places in 174 ms
[2021-05-19 00:36:15] [INFO ] Deduced a trap composed of 86 places in 220 ms
[2021-05-19 00:36:18] [INFO ] Deduced a trap composed of 77 places in 3233 ms
[2021-05-19 00:36:18] [INFO ] Deduced a trap composed of 89 places in 175 ms
[2021-05-19 00:36:19] [INFO ] Deduced a trap composed of 80 places in 340 ms
[2021-05-19 00:36:19] [INFO ] Deduced a trap composed of 90 places in 114 ms
[2021-05-19 00:36:19] [INFO ] Deduced a trap composed of 89 places in 291 ms
[2021-05-19 00:36:20] [INFO ] Deduced a trap composed of 84 places in 165 ms
[2021-05-19 00:36:21] [INFO ] Deduced a trap composed of 83 places in 1005 ms
[2021-05-19 00:36:21] [INFO ] Deduced a trap composed of 86 places in 357 ms
[2021-05-19 00:36:22] [INFO ] Deduced a trap composed of 92 places in 527 ms
[2021-05-19 00:36:22] [INFO ] Deduced a trap composed of 92 places in 209 ms
[2021-05-19 00:36:24] [INFO ] Deduced a trap composed of 92 places in 111 ms
[2021-05-19 00:36:25] [INFO ] Deduced a trap composed of 95 places in 92 ms
[2021-05-19 00:36:25] [INFO ] Deduced a trap composed of 92 places in 88 ms
[2021-05-19 00:36:26] [INFO ] Deduced a trap composed of 98 places in 622 ms
[2021-05-19 00:36:27] [INFO ] Deduced a trap composed of 92 places in 681 ms
[2021-05-19 00:36:27] [INFO ] Deduced a trap composed of 83 places in 493 ms
[2021-05-19 00:36:28] [INFO ] Deduced a trap composed of 80 places in 301 ms
[2021-05-19 00:36:28] [INFO ] Deduced a trap composed of 92 places in 93 ms
[2021-05-19 00:36:28] [INFO ] Deduced a trap composed of 86 places in 104 ms
[2021-05-19 00:36:31] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 00:36:31] [INFO ] Deduced a trap composed of 92 places in 89 ms
[2021-05-19 00:36:31] [INFO ] Deduced a trap composed of 83 places in 97 ms
[2021-05-19 00:36:32] [INFO ] Deduced a trap composed of 86 places in 95 ms
[2021-05-19 00:36:32] [INFO ] Deduced a trap composed of 89 places in 187 ms
[2021-05-19 00:36:32] [INFO ] Deduced a trap composed of 83 places in 208 ms
[2021-05-19 00:36:33] [INFO ] Deduced a trap composed of 89 places in 99 ms
[2021-05-19 00:36:33] [INFO ] Deduced a trap composed of 86 places in 95 ms
[2021-05-19 00:36:33] [INFO ] Deduced a trap composed of 89 places in 82 ms
[2021-05-19 00:36:34] [INFO ] Deduced a trap composed of 89 places in 536 ms
[2021-05-19 00:36:34] [INFO ] Deduced a trap composed of 83 places in 85 ms
[2021-05-19 00:36:34] [INFO ] Deduced a trap composed of 95 places in 211 ms
[2021-05-19 00:36:35] [INFO ] Deduced a trap composed of 89 places in 235 ms
[2021-05-19 00:36:35] [INFO ] Deduced a trap composed of 89 places in 82 ms
[2021-05-19 00:36:35] [INFO ] Deduced a trap composed of 83 places in 86 ms
[2021-05-19 00:36:36] [INFO ] Deduced a trap composed of 86 places in 158 ms
[2021-05-19 00:36:39] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 00:36:40] [INFO ] Deduced a trap composed of 98 places in 104 ms
[2021-05-19 00:36:43] [INFO ] Deduced a trap composed of 74 places in 77 ms
[2021-05-19 00:36:44] [INFO ] Deduced a trap composed of 86 places in 85 ms
[2021-05-19 00:36:44] [INFO ] Deduced a trap composed of 95 places in 191 ms
[2021-05-19 00:36:44] [INFO ] Deduced a trap composed of 80 places in 84 ms
[2021-05-19 00:36:45] [INFO ] Deduced a trap composed of 89 places in 90 ms
[2021-05-19 00:36:45] [INFO ] Deduced a trap composed of 98 places in 97 ms
[2021-05-19 00:36:45] [INFO ] Deduced a trap composed of 86 places in 107 ms
[2021-05-19 00:36:47] [INFO ] Deduced a trap composed of 89 places in 2404 ms
[2021-05-19 00:36:48] [INFO ] Deduced a trap composed of 92 places in 149 ms
[2021-05-19 00:36:48] [INFO ] Deduced a trap composed of 89 places in 150 ms
[2021-05-19 00:36:48] [INFO ] Deduced a trap composed of 95 places in 89 ms
[2021-05-19 00:36:49] [INFO ] Deduced a trap composed of 89 places in 89 ms
[2021-05-19 00:36:49] [INFO ] Deduced a trap composed of 80 places in 88 ms
[2021-05-19 00:36:49] [INFO ] Deduced a trap composed of 86 places in 124 ms
[2021-05-19 00:36:50] [INFO ] Deduced a trap composed of 90 places in 224 ms
[2021-05-19 00:36:51] [INFO ] Deduced a trap composed of 98 places in 152 ms
[2021-05-19 00:36:51] [INFO ] Deduced a trap composed of 89 places in 251 ms
[2021-05-19 00:36:53] [INFO ] Deduced a trap composed of 80 places in 1813 ms
[2021-05-19 00:36:54] [INFO ] Deduced a trap composed of 98 places in 195 ms
[2021-05-19 00:36:55] [INFO ] Deduced a trap composed of 92 places in 98 ms
[2021-05-19 00:36:57] [INFO ] Deduced a trap composed of 80 places in 165 ms
[2021-05-19 00:36:57] [INFO ] Deduced a trap composed of 83 places in 95 ms
[2021-05-19 00:36:57] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 00:36:57] [INFO ] Deduced a trap composed of 2 places in 139 ms
[2021-05-19 00:36:57] [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 (> (+ s288 s289) 0)") while checking expression at index 0
Support contains 1 out of 290 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 27 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 290/290 places, 406/406 transitions.
Starting structural reductions, iteration 0 : 290/290 places, 406/406 transitions.
Applied a total of 0 rules in 8 ms. Remains 290 /290 variables (removed 0) and now considering 406/406 (removed 0) transitions.
[2021-05-19 00:36:57] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2021-05-19 00:36:57] [INFO ] Computed 57 place invariants in 7 ms
[2021-05-19 00:36:58] [INFO ] Implicit Places using invariants in 856 ms returned []
[2021-05-19 00:36:58] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2021-05-19 00:36:58] [INFO ] Computed 57 place invariants in 22 ms
[2021-05-19 00:36:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-19 00:37:00] [INFO ] Implicit Places using invariants and state equation in 2165 ms returned []
Implicit Place search using SMT with State Equation took 3027 ms to find 0 implicit places.
[2021-05-19 00:37:01] [INFO ] Redundant transitions in 27 ms returned []
[2021-05-19 00:37:01] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2021-05-19 00:37:01] [INFO ] Computed 57 place invariants in 4 ms
[2021-05-19 00:37:01] [INFO ] Dead Transitions using invariants and state equation in 630 ms returned []
Finished structural reductions, in 1 iterations. Remains : 290/290 places, 406/406 transitions.
Incomplete random walk after 100000 steps, including 5146 resets, run finished after 188 ms. (steps per millisecond=531 ) properties seen :[0]
[2021-05-19 00:37:01] [INFO ] Flow matrix only has 402 transitions (discarded 4 similar events)
// Phase 1: matrix 402 rows 290 cols
[2021-05-19 00:37:01] [INFO ] Computed 57 place invariants in 4 ms
[2021-05-19 00:37:01] [INFO ] [Real]Absence check using 50 positive place invariants in 73 ms returned sat
[2021-05-19 00:37:01] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 6 ms returned sat
[2021-05-19 00:37:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 00:37:02] [INFO ] [Real]Absence check using state equation in 812 ms returned sat
[2021-05-19 00:37:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2021-05-19 00:37:02] [INFO ] [Real]Added 1 Read/Feed constraints in 3 ms returned sat
[2021-05-19 00:37:02] [INFO ] Deduced a trap composed of 89 places in 158 ms
[2021-05-19 00:37:02] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 187 ms
[2021-05-19 00:37:02] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 00:37:03] [INFO ] [Nat]Absence check using 50 positive place invariants in 54 ms returned sat
[2021-05-19 00:37:03] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 7 ms returned sat
[2021-05-19 00:37:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 00:37:03] [INFO ] [Nat]Absence check using state equation in 302 ms returned sat
[2021-05-19 00:37:03] [INFO ] [Nat]Added 1 Read/Feed constraints in 43 ms returned sat
[2021-05-19 00:37:03] [INFO ] Deduced a trap composed of 89 places in 133 ms
[2021-05-19 00:37:03] [INFO ] Deduced a trap composed of 89 places in 322 ms
[2021-05-19 00:37:04] [INFO ] Deduced a trap composed of 89 places in 109 ms
[2021-05-19 00:37:04] [INFO ] Deduced a trap composed of 92 places in 80 ms
[2021-05-19 00:37:04] [INFO ] Deduced a trap composed of 86 places in 86 ms
[2021-05-19 00:37:04] [INFO ] Deduced a trap composed of 89 places in 80 ms
[2021-05-19 00:37:04] [INFO ] Deduced a trap composed of 89 places in 84 ms
[2021-05-19 00:37:04] [INFO ] Deduced a trap composed of 80 places in 139 ms
[2021-05-19 00:37:04] [INFO ] Deduced a trap composed of 86 places in 142 ms
[2021-05-19 00:37:05] [INFO ] Deduced a trap composed of 86 places in 110 ms
[2021-05-19 00:37:05] [INFO ] Deduced a trap composed of 77 places in 94 ms
[2021-05-19 00:37:05] [INFO ] Deduced a trap composed of 89 places in 95 ms
[2021-05-19 00:37:05] [INFO ] Deduced a trap composed of 80 places in 109 ms
[2021-05-19 00:37:05] [INFO ] Deduced a trap composed of 90 places in 110 ms
[2021-05-19 00:37:05] [INFO ] Deduced a trap composed of 89 places in 106 ms
[2021-05-19 00:37:05] [INFO ] Deduced a trap composed of 84 places in 97 ms
[2021-05-19 00:37:05] [INFO ] Deduced a trap composed of 83 places in 85 ms
[2021-05-19 00:37:06] [INFO ] Deduced a trap composed of 86 places in 90 ms
[2021-05-19 00:37:06] [INFO ] Deduced a trap composed of 92 places in 141 ms
[2021-05-19 00:37:06] [INFO ] Deduced a trap composed of 92 places in 143 ms
[2021-05-19 00:37:08] [INFO ] Deduced a trap composed of 92 places in 132 ms
[2021-05-19 00:37:09] [INFO ] Deduced a trap composed of 95 places in 89 ms
[2021-05-19 00:37:09] [INFO ] Deduced a trap composed of 92 places in 127 ms
[2021-05-19 00:37:09] [INFO ] Deduced a trap composed of 98 places in 118 ms
[2021-05-19 00:37:10] [INFO ] Deduced a trap composed of 92 places in 492 ms
[2021-05-19 00:37:11] [INFO ] Deduced a trap composed of 83 places in 661 ms
[2021-05-19 00:37:13] [INFO ] Deduced a trap composed of 80 places in 2094 ms
[2021-05-19 00:37:13] [INFO ] Deduced a trap composed of 92 places in 198 ms
[2021-05-19 00:37:17] [INFO ] Deduced a trap composed of 86 places in 3802 ms
[2021-05-19 00:37:20] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 00:37:20] [INFO ] Deduced a trap composed of 86 places in 149 ms
[2021-05-19 00:37:21] [INFO ] Deduced a trap composed of 86 places in 187 ms
[2021-05-19 00:37:24] [INFO ] Deduced a trap composed of 80 places in 2725 ms
[2021-05-19 00:37:24] [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 s24 s30 s45 s51 s69 s75 s90 s96 s114 s120 s136 s137 s151 s153 s156 s158 s161 s163 s166 s168 s171 s173 s181 s183 s186 s188 s191 s193 s196 s198 s201 s203 s206 s208 s211 s213 s216 s218 s221 s223 s226 s228 s231 s233 s236 s238 s241 s243 s246 s248 s251 s253 s255 s256 s257 s284 s286 s287) 0)") while checking expression at index 0
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 290 transition count 402
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 290 transition count 401
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 289 transition count 401
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 289 transition count 400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 288 transition count 400
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 288 transition count 395
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 283 transition count 395
Applied a total of 18 rules in 77 ms. Remains 283 /290 variables (removed 7) and now considering 395/406 (removed 11) transitions.
// Phase 1: matrix 395 rows 283 cols
[2021-05-19 00:37:24] [INFO ] Computed 57 place invariants in 12 ms
[2021-05-19 00:37:24] [INFO ] [Real]Absence check using 50 positive place invariants in 191 ms returned sat
[2021-05-19 00:37:24] [INFO ] [Real]Absence check using 50 positive and 7 generalized place invariants in 54 ms returned sat
[2021-05-19 00:37:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-19 00:37:26] [INFO ] [Real]Absence check using state equation in 1290 ms returned sat
[2021-05-19 00:37:29] [INFO ] Deduced a trap composed of 78 places in 3319 ms
[2021-05-19 00:37:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 3364 ms
[2021-05-19 00:37:29] [INFO ] Solution in real domain found non-integer solution.
[2021-05-19 00:37:29] [INFO ] [Nat]Absence check using 50 positive place invariants in 258 ms returned sat
[2021-05-19 00:37:29] [INFO ] [Nat]Absence check using 50 positive and 7 generalized place invariants in 17 ms returned sat
[2021-05-19 00:37:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-19 00:37:31] [INFO ] [Nat]Absence check using state equation in 1323 ms returned sat
[2021-05-19 00:37:34] [INFO ] Deduced a trap composed of 81 places in 3688 ms
[2021-05-19 00:37:37] [INFO ] Deduced a trap composed of 81 places in 2251 ms
[2021-05-19 00:37:38] [INFO ] Deduced a trap composed of 81 places in 1670 ms
[2021-05-19 00:37:40] [INFO ] Deduced a trap composed of 81 places in 2056 ms
[2021-05-19 00:37:43] [INFO ] Deduced a trap composed of 96 places in 3093 ms
[2021-05-19 00:37:47] [INFO ] Deduced a trap composed of 84 places in 3162 ms
[2021-05-19 00:37:49] [INFO ] Deduced a trap composed of 90 places in 2381 ms
[2021-05-19 00:37:51] [INFO ] Deduced a trap composed of 84 places in 2234 ms
[2021-05-19 00:37:52] [INFO ] Deduced a trap composed of 84 places in 187 ms
[2021-05-19 00:37:52] [INFO ] Deduced a trap composed of 87 places in 172 ms
[2021-05-19 00:37:53] [INFO ] Deduced a trap composed of 90 places in 1043 ms
[2021-05-19 00:37:53] [INFO ] Deduced a trap composed of 93 places in 200 ms
[2021-05-19 00:37:53] [INFO ] Deduced a trap composed of 84 places in 96 ms
[2021-05-19 00:37:54] [INFO ] Deduced a trap composed of 75 places in 253 ms
[2021-05-19 00:37:54] [INFO ] Deduced a trap composed of 84 places in 383 ms
[2021-05-19 00:37:54] [INFO ] Deduced a trap composed of 93 places in 186 ms
[2021-05-19 00:37:56] [INFO ] Deduced a trap composed of 81 places in 1330 ms
[2021-05-19 00:37:56] [INFO ] Deduced a trap composed of 87 places in 107 ms
[2021-05-19 00:37:56] [INFO ] Deduced a trap composed of 81 places in 206 ms
[2021-05-19 00:37:56] [INFO ] Deduced a trap composed of 81 places in 111 ms
[2021-05-19 00:37:56] [INFO ] Deduced a trap composed of 87 places in 109 ms
[2021-05-19 00:37:57] [INFO ] Deduced a trap composed of 87 places in 160 ms
[2021-05-19 00:37:57] [INFO ] Deduced a trap composed of 96 places in 173 ms
[2021-05-19 00:37:58] [INFO ] Deduced a trap composed of 87 places in 1141 ms
[2021-05-19 00:37:58] [INFO ] Deduced a trap composed of 90 places in 152 ms
[2021-05-19 00:37:59] [INFO ] Deduced a trap composed of 90 places in 495 ms
[2021-05-19 00:37:59] [INFO ] Deduced a trap composed of 84 places in 180 ms
[2021-05-19 00:37:59] [INFO ] Deduced a trap composed of 78 places in 101 ms
[2021-05-19 00:37:59] [INFO ] Deduced a trap composed of 81 places in 213 ms
[2021-05-19 00:38:00] [INFO ] Deduced a trap composed of 87 places in 175 ms
[2021-05-19 00:38:00] [INFO ] Deduced a trap composed of 87 places in 103 ms
[2021-05-19 00:38:00] [INFO ] Deduced a trap composed of 87 places in 149 ms
[2021-05-19 00:38:03] [INFO ] Deduced a trap composed of 87 places in 3006 ms
[2021-05-19 00:38:04] [INFO ] Deduced a trap composed of 78 places in 1086 ms
[2021-05-19 00:38:05] [INFO ] Deduced a trap composed of 87 places in 179 ms
[2021-05-19 00:38:05] [INFO ] Deduced a trap composed of 87 places in 94 ms
[2021-05-19 00:38:05] [INFO ] Deduced a trap composed of 81 places in 353 ms
[2021-05-19 00:38:05] [INFO ] Deduced a trap composed of 87 places in 95 ms
[2021-05-19 00:38:06] [INFO ] Deduced a trap composed of 99 places in 365 ms
[2021-05-19 00:38:08] [INFO ] Deduced a trap composed of 90 places in 1166 ms
[2021-05-19 00:38:11] [INFO ] SMT solver returned unknown. Retrying;
[2021-05-19 00:38:17] [INFO ] Deduced a trap composed of 2 places in 2664 ms
[2021-05-19 00:38:17] [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 (> (+ s281 s282) 0)") while checking expression at index 0
[2021-05-19 00:38:17] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 5 ms.
[2021-05-19 00:38:17] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 11 ms.
[2021-05-19 00:38:17] [INFO ] Flatten gal took : 136 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ PolyORBNT-COL-S05J20 @ 3570 seconds
vrfy: finished
info: timeLeft: 3562
rslt: Output for ReachabilityFireability @ PolyORBNT-COL-S05J20

{
"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=ReachabilityFireability.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed May 19 00:38:17 2021
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 19020,
"runtime": 8.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 0,
"E": 1,
"F": 1,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "E (F ((4 <= p135)))",
"processed_size": 19,
"rewrites": 1,
"skeleton": "E(F(**))"
},
"net":
{
"arcs": 2109,
"conflict_clusters": 30,
"places": 290,
"places_significant": 233,
"singleton_clusters": 0,
"transitions": 406
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 1,
"problems": 1
},
"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: 696/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 9280
lola: finding significant places
lola: 290 places, 406 transitions, 233 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 ReachabilityFireability.xml
lola: E (F ((4 <= p135)))
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 ((4 <= p135)))
lola: processed formula length: 19
lola: 1 rewrites
lola: closed formula file ReachabilityFireability.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: local time limit reached - aborting
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: state equation task get result unparse finished++ id 0
lola: formula 0: (4 <= p135)
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 1 literals and 1 conjunctive subformulas
lola: state equation: write sara problem file to ReachabilityFireability-0.sara
lola: state equation: calling and running sara
sara: try reading problem file ReachabilityFireability-0.sara.
lola: memory consumption: 19020 KB
lola: time consumption: 8 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityFireability.json
lola: closed JSON file ReachabilityFireability.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-S05J20"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool gold2020"
echo " Input is PolyORBNT-COL-S05J20, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r170-oct2-162089287200184"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PolyORBNT-COL-S05J20.tgz
mv PolyORBNT-COL-S05J20 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;