Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r168-smll-158987806600335.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/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 CloudDeployment-PT-6a, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-smll-158987806600335
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 3.6K Mar 30 01:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 30 01:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 15:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 14K Mar 28 15:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 8 14:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 8 14:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 08:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 08:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Mar 26 08:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 26 08:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 317K 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 CloudDeployment-PT-6a-ReachabilityFireability-00
FORMULA_NAME CloudDeployment-PT-6a-ReachabilityFireability-01
FORMULA_NAME CloudDeployment-PT-6a-ReachabilityFireability-02
FORMULA_NAME CloudDeployment-PT-6a-ReachabilityFireability-03
FORMULA_NAME CloudDeployment-PT-6a-ReachabilityFireability-04
FORMULA_NAME CloudDeployment-PT-6a-ReachabilityFireability-05
FORMULA_NAME CloudDeployment-PT-6a-ReachabilityFireability-06
FORMULA_NAME CloudDeployment-PT-6a-ReachabilityFireability-07
FORMULA_NAME CloudDeployment-PT-6a-ReachabilityFireability-08
FORMULA_NAME CloudDeployment-PT-6a-ReachabilityFireability-09
FORMULA_NAME CloudDeployment-PT-6a-ReachabilityFireability-10
FORMULA_NAME CloudDeployment-PT-6a-ReachabilityFireability-11
FORMULA_NAME CloudDeployment-PT-6a-ReachabilityFireability-12
FORMULA_NAME CloudDeployment-PT-6a-ReachabilityFireability-13
FORMULA_NAME CloudDeployment-PT-6a-ReachabilityFireability-14
FORMULA_NAME CloudDeployment-PT-6a-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591303775017

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-04 20:49:37] [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]
[2020-06-04 20:49:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-04 20:49:38] [INFO ] Load time of PNML (sax parser for PT used): 254 ms
[2020-06-04 20:49:38] [INFO ] Transformed 221 places.
[2020-06-04 20:49:38] [INFO ] Transformed 908 transitions.
[2020-06-04 20:49:38] [INFO ] Found NUPN structural information;
[2020-06-04 20:49:38] [INFO ] Parsed PT model containing 221 places and 908 transitions in 350 ms.
Ensure Unique test removed 114 transitions
Reduce redundant transitions removed 114 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 76 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 117 resets, run finished after 180 ms. (steps per millisecond=55 ) properties seen :[0, 1, 0, 1, 0, 0, 0, 0, 0, 1, 1, 1, 0, 1, 0, 1]
FORMULA CloudDeployment-PT-6a-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6a-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6a-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6a-ReachabilityFireability-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6a-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6a-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA CloudDeployment-PT-6a-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 73 ms. (steps per millisecond=136 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 9 resets, run finished after 96 ms. (steps per millisecond=104 ) properties seen :[0, 1, 0, 0, 0, 0, 1, 0, 0]
FORMULA CloudDeployment-PT-6a-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-6a-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 45 ms. (steps per millisecond=222 ) properties seen :[0, 0, 1, 1, 0, 0, 0]
FORMULA CloudDeployment-PT-6a-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA CloudDeployment-PT-6a-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 48 ms. (steps per millisecond=208 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 49 ms. (steps per millisecond=204 ) properties seen :[0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 26 ms. (steps per millisecond=384 ) properties seen :[0, 0, 0, 0, 0]
[2020-06-04 20:49:38] [INFO ] Flow matrix only has 384 transitions (discarded 410 similar events)
// Phase 1: matrix 384 rows 221 cols
[2020-06-04 20:49:38] [INFO ] Computed 36 place invariants in 27 ms
[2020-06-04 20:49:39] [INFO ] [Real]Absence check using 0 positive and 36 generalized place invariants in 50 ms returned sat
[2020-06-04 20:49:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:49:39] [INFO ] [Real]Absence check using state equation in 339 ms returned sat
[2020-06-04 20:49:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:49:40] [INFO ] [Nat]Absence check using 0 positive and 36 generalized place invariants in 466 ms returned sat
[2020-06-04 20:49:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:49:40] [INFO ] [Nat]Absence check using state equation in 415 ms returned sat
[2020-06-04 20:49:40] [INFO ] State equation strengthened by 182 read => feed constraints.
[2020-06-04 20:49:40] [INFO ] [Nat]Added 182 Read/Feed constraints in 49 ms returned sat
[2020-06-04 20:49:40] [INFO ] Computed and/alt/rep : 793/5824/383 causal constraints in 72 ms.
[2020-06-04 20:49:42] [INFO ] Added : 220 causal constraints over 44 iterations in 2229 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 31 ms.
[2020-06-04 20:49:43] [INFO ] [Real]Absence check using 0 positive and 36 generalized place invariants in 20 ms returned unsat
[2020-06-04 20:49:43] [INFO ] [Real]Absence check using 0 positive and 36 generalized place invariants in 14 ms returned unsat
[2020-06-04 20:49:43] [INFO ] [Real]Absence check using 0 positive and 36 generalized place invariants in 28 ms returned sat
[2020-06-04 20:49:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:49:43] [INFO ] [Real]Absence check using state equation in 305 ms returned sat
[2020-06-04 20:49:43] [INFO ] [Real]Added 182 Read/Feed constraints in 75 ms returned sat
[2020-06-04 20:49:43] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:49:44] [INFO ] [Nat]Absence check using 0 positive and 36 generalized place invariants in 625 ms returned sat
[2020-06-04 20:49:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:49:44] [INFO ] [Nat]Absence check using state equation in 384 ms returned sat
[2020-06-04 20:49:44] [INFO ] [Nat]Added 182 Read/Feed constraints in 77 ms returned sat
[2020-06-04 20:49:44] [INFO ] Computed and/alt/rep : 793/5824/383 causal constraints in 75 ms.
[2020-06-04 20:49:48] [INFO ] Added : 269 causal constraints over 64 iterations in 3827 ms. Result :(error "Solver has unexpectedly terminated")
[2020-06-04 20:49:48] [INFO ] [Real]Absence check using 0 positive and 36 generalized place invariants in 15 ms returned unsat
FORMULA CloudDeployment-PT-6a-ReachabilityFireability-14 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CloudDeployment-PT-6a-ReachabilityFireability-07 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA CloudDeployment-PT-6a-ReachabilityFireability-04 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Incomplete Parikh walk after 18600 steps, including 159 resets, run finished after 201 ms. (steps per millisecond=92 ) properties seen :[0, 0] could not realise parikh vector
Support contains 22 out of 221 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 221/221 places, 794/794 transitions.
Graph (trivial) has 208 edges and 221 vertex of which 53 / 221 are part of one of the 16 SCC in 8 ms
Free SCC test removed 37 places
Ensure Unique test removed 12 places
Drop transitions removed 197 transitions
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 232 transitions.
Iterating post reduction 0 with 244 rules applied. Total rules applied 245 place count 172 transition count 562
Symmetric choice reduction at 1 with 4 rule applications. Total rules 249 place count 172 transition count 562
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 4 transitions.
Iterating global reduction 1 with 8 rules applied. Total rules applied 257 place count 168 transition count 558
Symmetric choice reduction at 1 with 3 rule applications. Total rules 260 place count 168 transition count 558
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 3 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 266 place count 165 transition count 555
Symmetric choice reduction at 1 with 2 rule applications. Total rules 268 place count 165 transition count 555
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 272 place count 163 transition count 553
Symmetric choice reduction at 1 with 1 rule applications. Total rules 273 place count 163 transition count 553
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 275 place count 162 transition count 552
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -35
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 1 with 26 rules applied. Total rules applied 301 place count 149 transition count 587
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 1 with 4 rules applied. Total rules applied 305 place count 149 transition count 838
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 309 place count 145 transition count 838
Partial Post-agglomeration rule applied 12 times.
Drop transitions removed 12 transitions
Iterating global reduction 2 with 12 rules applied. Total rules applied 321 place count 145 transition count 838
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 327 place count 145 transition count 832
Drop transitions removed 67 transitions
Redundant transition composition rules discarded 67 transitions
Iterating global reduction 3 with 67 rules applied. Total rules applied 394 place count 145 transition count 765
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 400 place count 142 transition count 762
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 401 place count 142 transition count 761
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 402 place count 141 transition count 761
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 403 place count 141 transition count 1016
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 404 place count 140 transition count 1016
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 405 place count 140 transition count 1016
Applied a total of 405 rules in 413 ms. Remains 140 /221 variables (removed 81) and now considering 1016/794 (removed -222) transitions.
Finished structural reductions, in 1 iterations. Remains : 140/221 places, 1016/794 transitions.
Incomplete random walk after 1000000 steps, including 13762 resets, run finished after 6967 ms. (steps per millisecond=143 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1976 resets, run finished after 2612 ms. (steps per millisecond=382 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 1 resets, run finished after 2181 ms. (steps per millisecond=458 ) properties seen :[0, 0]
Interrupted probabilistic random walk after 5523907 steps, run timeout after 30001 ms. (steps per millisecond=184 ) properties seen :[0, 0]
Probabilistic random walk after 5523907 steps, saw 801571 distinct states, run finished after 30001 ms. (steps per millisecond=184 ) properties seen :[0, 0]
[2020-06-04 20:50:31] [INFO ] Flow matrix only has 722 transitions (discarded 294 similar events)
// Phase 1: matrix 722 rows 140 cols
[2020-06-04 20:50:31] [INFO ] Computed 24 place invariants in 22 ms
[2020-06-04 20:50:31] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 17 ms returned sat
[2020-06-04 20:50:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:50:31] [INFO ] [Real]Absence check using state equation in 334 ms returned sat
[2020-06-04 20:50:31] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:50:31] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 21 ms returned sat
[2020-06-04 20:50:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:50:31] [INFO ] [Nat]Absence check using state equation in 293 ms returned sat
[2020-06-04 20:50:31] [INFO ] State equation strengthened by 136 read => feed constraints.
[2020-06-04 20:50:32] [INFO ] [Nat]Added 136 Read/Feed constraints in 40 ms returned sat
[2020-06-04 20:50:32] [INFO ] Computed and/alt/rep : 1015/9882/721 causal constraints in 87 ms.
[2020-06-04 20:50:33] [INFO ] Added : 114 causal constraints over 23 iterations in 1011 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 17 ms.
[2020-06-04 20:50:33] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 16 ms returned sat
[2020-06-04 20:50:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:50:33] [INFO ] [Real]Absence check using state equation in 321 ms returned sat
[2020-06-04 20:50:33] [INFO ] [Real]Added 136 Read/Feed constraints in 33 ms returned sat
[2020-06-04 20:50:33] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:50:33] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 26 ms returned sat
[2020-06-04 20:50:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:50:34] [INFO ] [Nat]Absence check using state equation in 415 ms returned sat
[2020-06-04 20:50:34] [INFO ] [Nat]Added 136 Read/Feed constraints in 63 ms returned sat
[2020-06-04 20:50:34] [INFO ] Computed and/alt/rep : 1015/9882/721 causal constraints in 118 ms.
[2020-06-04 20:50:36] [INFO ] Added : 143 causal constraints over 37 iterations in 2210 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 23 ms.
Incomplete Parikh walk after 8000 steps, including 117 resets, run finished after 87 ms. (steps per millisecond=91 ) properties seen :[0, 1] could not realise parikh vector
FORMULA CloudDeployment-PT-6a-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 10400 steps, including 167 resets, run finished after 80 ms. (steps per millisecond=130 ) properties seen :[0] could not realise parikh vector
Support contains 14 out of 140 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 140/140 places, 1016/1016 transitions.
Graph (trivial) has 59 edges and 140 vertex of which 7 / 140 are part of one of the 3 SCC in 1 ms
Free SCC test removed 4 places
Drop transitions removed 8 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 136 transition count 1001
Applied a total of 16 rules in 26 ms. Remains 136 /140 variables (removed 4) and now considering 1001/1016 (removed 15) transitions.
Finished structural reductions, in 1 iterations. Remains : 136/140 places, 1001/1016 transitions.
Incomplete random walk after 1000000 steps, including 14546 resets, run finished after 6744 ms. (steps per millisecond=148 ) properties seen :[0]
Incomplete Best-First random walk after 1000001 steps, including 2084 resets, run finished after 2428 ms. (steps per millisecond=411 ) properties seen :[0]
Interrupted probabilistic random walk after 5715635 steps, run timeout after 30001 ms. (steps per millisecond=190 ) properties seen :[0]
Probabilistic random walk after 5715635 steps, saw 830842 distinct states, run finished after 30001 ms. (steps per millisecond=190 ) properties seen :[0]
[2020-06-04 20:51:15] [INFO ] Flow matrix only has 713 transitions (discarded 288 similar events)
// Phase 1: matrix 713 rows 136 cols
[2020-06-04 20:51:15] [INFO ] Computed 24 place invariants in 15 ms
[2020-06-04 20:51:15] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 16 ms returned sat
[2020-06-04 20:51:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:51:16] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2020-06-04 20:51:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:51:16] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 22 ms returned sat
[2020-06-04 20:51:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:51:16] [INFO ] [Nat]Absence check using state equation in 292 ms returned sat
[2020-06-04 20:51:16] [INFO ] State equation strengthened by 135 read => feed constraints.
[2020-06-04 20:51:16] [INFO ] [Nat]Added 135 Read/Feed constraints in 63 ms returned sat
[2020-06-04 20:51:16] [INFO ] Computed and/alt/rep : 1000/9801/712 causal constraints in 112 ms.
[2020-06-04 20:51:17] [INFO ] Added : 112 causal constraints over 23 iterations in 1274 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 10 ms.
Incomplete Parikh walk after 8800 steps, including 125 resets, run finished after 63 ms. (steps per millisecond=139 ) properties seen :[0] could not realise parikh vector
Support contains 14 out of 136 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 136/136 places, 1001/1001 transitions.
Applied a total of 0 rules in 26 ms. Remains 136 /136 variables (removed 0) and now considering 1001/1001 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 136/136 places, 1001/1001 transitions.
Starting structural reductions, iteration 0 : 136/136 places, 1001/1001 transitions.
Applied a total of 0 rules in 25 ms. Remains 136 /136 variables (removed 0) and now considering 1001/1001 (removed 0) transitions.
[2020-06-04 20:51:18] [INFO ] Flow matrix only has 713 transitions (discarded 288 similar events)
// Phase 1: matrix 713 rows 136 cols
[2020-06-04 20:51:18] [INFO ] Computed 24 place invariants in 13 ms
[2020-06-04 20:51:18] [INFO ] Implicit Places using invariants in 261 ms returned []
[2020-06-04 20:51:18] [INFO ] Flow matrix only has 713 transitions (discarded 288 similar events)
// Phase 1: matrix 713 rows 136 cols
[2020-06-04 20:51:18] [INFO ] Computed 24 place invariants in 11 ms
[2020-06-04 20:51:18] [INFO ] State equation strengthened by 135 read => feed constraints.
[2020-06-04 20:51:19] [INFO ] Implicit Places using invariants and state equation in 1322 ms returned []
Implicit Place search using SMT with State Equation took 1584 ms to find 0 implicit places.
[2020-06-04 20:51:20] [INFO ] Redundant transitions in 695 ms returned []
[2020-06-04 20:51:20] [INFO ] Flow matrix only has 713 transitions (discarded 288 similar events)
// Phase 1: matrix 713 rows 136 cols
[2020-06-04 20:51:20] [INFO ] Computed 24 place invariants in 20 ms
[2020-06-04 20:51:22] [INFO ] Dead Transitions using invariants and state equation in 1583 ms returned []
Finished structural reductions, in 1 iterations. Remains : 136/136 places, 1001/1001 transitions.
Incomplete random walk after 100000 steps, including 1448 resets, run finished after 635 ms. (steps per millisecond=157 ) properties seen :[0]
[2020-06-04 20:51:22] [INFO ] Flow matrix only has 713 transitions (discarded 288 similar events)
// Phase 1: matrix 713 rows 136 cols
[2020-06-04 20:51:22] [INFO ] Computed 24 place invariants in 14 ms
[2020-06-04 20:51:22] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 25 ms returned sat
[2020-06-04 20:51:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:51:23] [INFO ] [Real]Absence check using state equation in 266 ms returned sat
[2020-06-04 20:51:23] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:51:23] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 22 ms returned sat
[2020-06-04 20:51:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:51:23] [INFO ] [Nat]Absence check using state equation in 386 ms returned sat
[2020-06-04 20:51:23] [INFO ] State equation strengthened by 135 read => feed constraints.
[2020-06-04 20:51:23] [INFO ] [Nat]Added 135 Read/Feed constraints in 94 ms returned sat
[2020-06-04 20:51:23] [INFO ] Computed and/alt/rep : 1000/9801/712 causal constraints in 85 ms.
[2020-06-04 20:51:24] [INFO ] Added : 112 causal constraints over 23 iterations in 1191 ms. Result :sat
Graph (trivial) has 99 edges and 136 vertex of which 42 / 136 are part of one of the 6 SCC in 0 ms
Free SCC test removed 36 places
Ensure Unique test removed 5 places
Drop transitions removed 48 transitions
Ensure Unique test removed 288 transitions
Reduce isomorphic transitions removed 336 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Iterating post reduction 0 with 357 rules applied. Total rules applied 358 place count 95 transition count 649
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 374 place count 79 transition count 649
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 374 place count 79 transition count 641
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 390 place count 71 transition count 641
Symmetric choice reduction at 2 with 5 rule applications. Total rules 395 place count 71 transition count 641
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 5 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 405 place count 66 transition count 636
Symmetric choice reduction at 2 with 5 rule applications. Total rules 410 place count 66 transition count 636
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 30 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 420 place count 61 transition count 606
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 425 place count 61 transition count 601
Free-agglomeration rule applied 8 times with reduction of 416 identical transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 433 place count 61 transition count 177
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 64 transitions
Reduce isomorphic transitions removed 64 transitions.
Iterating post reduction 3 with 72 rules applied. Total rules applied 505 place count 53 transition count 113
Partial Post-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 509 place count 53 transition count 113
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 520 place count 53 transition count 102
Symmetric choice reduction at 4 with 1 rule applications. Total rules 521 place count 53 transition count 102
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 523 place count 52 transition count 101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 524 place count 52 transition count 100
Free-agglomeration rule applied 3 times with reduction of 16 identical transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 527 place count 52 transition count 81
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 542 place count 49 transition count 69
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 544 place count 49 transition count 69
Symmetric choice reduction at 6 with 2 rule applications. Total rules 546 place count 49 transition count 69
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 3 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 550 place count 47 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 552 place count 47 transition count 64
Applied a total of 552 rules in 59 ms. Remains 47 /136 variables (removed 89) and now considering 64/1001 (removed 937) transitions.
// Phase 1: matrix 64 rows 47 cols
[2020-06-04 20:51:24] [INFO ] Computed 19 place invariants in 0 ms
[2020-06-04 20:51:24] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 9 ms returned sat
[2020-06-04 20:51:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-04 20:51:24] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2020-06-04 20:51:24] [INFO ] Solution in real domain found non-integer solution.
[2020-06-04 20:51:24] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 20 ms returned sat
[2020-06-04 20:51:24] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-04 20:51:25] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2020-06-04 20:51:25] [INFO ] Computed and/alt/rep : 63/259/63 causal constraints in 3 ms.
[2020-06-04 20:51:25] [INFO ] Added : 24 causal constraints over 6 iterations in 57 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 3 ms.
[2020-06-04 20:51:25] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 3 ms.
[2020-06-04 20:51:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 28 ms.
[2020-06-04 20:51:25] [INFO ] Flatten gal took : 234 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityFireability @ CloudDeployment-PT-6a @ 3570 seconds
vrfy: finished
info: timeLeft: 3566
rslt: Output for ReachabilityFireability @ CloudDeployment-PT-6a

{
"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",
"--safe",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityFireability.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Thu Jun 4 20:51:26 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 38612,
"runtime": 4.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityFireability.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 6,
"aneg": 0,
"comp": 22,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 22,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 14,
"visible_transitions": 0
},
"processed": "A (G (((((p46 <= 0)) AND ((p50 <= 0) OR (p65 <= 0)) AND ((p1 <= 0) OR (p2 <= 0) OR (p14 <= 0) OR (p121 <= 0) OR (p134 <= 0)) AND ((p64 <= 0) OR (p65 <= 0) OR (p76 <= 0) OR (p121 <= 0) OR (p134 <= 0))) OR ((1 <= p50) AND (((1 <= p2) AND (1 <= p32)) OR ((1 <= p32) AND (1 <= p33) AND (1 <= p44) AND (1 <= p121) AND (1 <= p134) AND (1 <= p34)))))))",
"processed_size": 356,
"rewrites": 2,
"skeleton": "A(G(**))"
},
"net":
{
"arcs": 7548,
"conflict_clusters": 5,
"places": 136,
"places_significant": 112,
"singleton_clusters": 0,
"transitions": 1001
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 182,
"problems": 39
},
"type": "invariance",
"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: 1137/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 136
lola: finding significant places
lola: 136 places, 1001 transitions, 112 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: LP says that atomic proposition is always true: (p46 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p1 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p14 <= 1)
lola: LP says that atomic proposition is always true: (p121 <= 1)
lola: LP says that atomic proposition is always true: (p134 <= 1)
lola: LP says that atomic proposition is always true: (p64 <= 1)
lola: LP says that atomic proposition is always true: (p65 <= 1)
lola: LP says that atomic proposition is always true: (p76 <= 1)
lola: LP says that atomic proposition is always true: (p121 <= 1)
lola: LP says that atomic proposition is always true: (p134 <= 1)
lola: LP says that atomic proposition is always true: (p50 <= 1)
lola: LP says that atomic proposition is always true: (p2 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p32 <= 1)
lola: LP says that atomic proposition is always true: (p33 <= 1)
lola: LP says that atomic proposition is always true: (p44 <= 1)
lola: LP says that atomic proposition is always true: (p121 <= 1)
lola: LP says that atomic proposition is always true: (p134 <= 1)
lola: LP says that atomic proposition is always true: (p34 <= 1)
lola: A (G (((((p46 <= 0)) AND ((p50 <= 0) OR (p65 <= 0)) AND ((p1 <= 0) OR (p2 <= 0) OR (p14 <= 0) OR (p121 <= 0) OR (p134 <= 0)) AND ((p64 <= 0) OR (p65 <= 0) OR (p76 <= 0) OR (p121 <= 0) OR (p134 <= 0))) OR ((1 <= p50) AND (((1 <= p2) AND (1 <= p32)) OR ((1 <= p32) AND (1 <= p33) AND (1 <= p44) AND (1 <= p121) AND (1 <= p134) AND (1 <= p34)))))))
lola: checking invariance
lola: Planning: workflow for reachability check: stateequation||search (--findpath=off)
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: A (G (((((p46 <= 0)) AND ((p50 <= 0) OR (p65 <= 0)) AND ((p1 <= 0) OR (p2 <= 0) OR (p14 <= 0) OR (p121 <= 0) OR (p134 <= 0)) AND ((p64 <= 0) OR (p65 <= 0) OR (p76 <= 0) OR (p121 <= 0) OR (p134 <= 0))) OR ((1 <= p50) AND (((1 <= p2) AND (1 <= p32)) OR ((1 <= p32) AND (1 <= p33) AND (1 <= p44) AND (1 <= p121) AND (1 <= p134) AND (1 <= p34)))))))
lola: processed formula length: 356
lola: 2 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:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: state equation task get result rewrite finished id 0
lola: state equation task get result unparse finished++ id 0
lola: formula 0: ((((1 <= p46)) OR ((1 <= p50) AND (1 <= p65)) OR ((1 <= p1) AND (1 <= p2) AND (1 <= p14) AND (1 <= p121) AND (1 <= p134)) OR ((1 <= p64) AND (1 <= p65) AND (1 <= p76) AND (1 <= p121) AND (1 <= p134))) AND ((p50 <= 0) OR (((p2 <= 0) OR (p32 <= 0)) AND ((p32 <= 0) OR (p33 <= 0) OR (p44 <= 0) OR (p121 <= 0) OR (p134 <= 0) OR (p34 <= 0)))))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 182 literals and 39 conjunctive subformulas
lola: memory consumption: 38612 KB
lola: time consumption: 4 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="CloudDeployment-PT-6a"
export BK_EXAMINATION="ReachabilityFireability"
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 CloudDeployment-PT-6a, 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 r168-smll-158987806600335"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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