Execution Chart

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

Trace from the execution

Formatting '/local/x2003239/mcc2020-input.r174-csrt-158987853500678.qcow2', fmt=qcow2 size=4294967296 backing_file=/local/x2003239/mcc2020-input.qcow2 encryption=off 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 itslola
Input is Peterson-COL-4, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853500678
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 224K
-rw-r--r-- 1 mcc users 3.5K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 27 15:14 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.3K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_pt
-rw-r--r-- 1 mcc users 2 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 44K Apr 27 15:14 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 Peterson-COL-4-ReachabilityCardinality-00
FORMULA_NAME Peterson-COL-4-ReachabilityCardinality-01
FORMULA_NAME Peterson-COL-4-ReachabilityCardinality-02
FORMULA_NAME Peterson-COL-4-ReachabilityCardinality-03
FORMULA_NAME Peterson-COL-4-ReachabilityCardinality-04
FORMULA_NAME Peterson-COL-4-ReachabilityCardinality-05
FORMULA_NAME Peterson-COL-4-ReachabilityCardinality-06
FORMULA_NAME Peterson-COL-4-ReachabilityCardinality-07
FORMULA_NAME Peterson-COL-4-ReachabilityCardinality-08
FORMULA_NAME Peterson-COL-4-ReachabilityCardinality-09
FORMULA_NAME Peterson-COL-4-ReachabilityCardinality-10
FORMULA_NAME Peterson-COL-4-ReachabilityCardinality-11
FORMULA_NAME Peterson-COL-4-ReachabilityCardinality-12
FORMULA_NAME Peterson-COL-4-ReachabilityCardinality-13
FORMULA_NAME Peterson-COL-4-ReachabilityCardinality-14
FORMULA_NAME Peterson-COL-4-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591162709768

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 05:38:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 05:38:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 05:38:31] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
SLF4J: Failed to load class "org.slf4j.impl.StaticLoggerBinder".
SLF4J: Defaulting to no-operation (NOP) logger implementation
SLF4J: See http://www.slf4j.org/codes.html#StaticLoggerBinder for further details.
[2020-06-03 05:38:32] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 791 ms
[2020-06-03 05:38:32] [INFO ] sort/places :
ProcTourProc->beginLoop,testIdentity,testAlone,isEndLoop,
ProcBool->wantSection,
TourProc->turn,
ProcTour->askForSection,testTurn,endTurn,
Process->idle,CS,

[2020-06-03 05:38:32] [INFO ] Imported 11 HL places and 14 HL transitions for a total of 500 PT places and 795.0 transition bindings in 28 ms.
[2020-06-03 05:38:32] [INFO ] Computed order based on color domains.
[2020-06-03 05:38:32] [INFO ] Unfolded HLPN to a Petri net with 500 places and 730 transitions in 46 ms.
[2020-06-03 05:38:32] [INFO ] Unfolded HLPN properties in 1 ms.
Deduced a syphon composed of 20 places in 6 ms
Reduce places removed 20 places and 40 transitions.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 107 ms.
Working with output stream class java.io.PrintStream
FORMULA Peterson-COL-4-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-4-ReachabilityCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-COL-4-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 200 ms. (steps per millisecond=50 ) properties seen :[1, 0, 1, 1, 1, 1, 0, 0, 0, 1, 0, 0, 0]
FORMULA Peterson-COL-4-ReachabilityCardinality-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Peterson-COL-4-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 44 ms. (steps per millisecond=227 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 41 ms. (steps per millisecond=243 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 37 ms. (steps per millisecond=270 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 35 ms. (steps per millisecond=285 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 42 ms. (steps per millisecond=238 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 27 ms. (steps per millisecond=370 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
[2020-06-03 05:38:33] [INFO ] Flow matrix only has 630 transitions (discarded 60 similar events)
// Phase 1: matrix 630 rows 480 cols
[2020-06-03 05:38:33] [INFO ] Computed 19 place invariants in 27 ms
[2020-06-03 05:38:33] [INFO ] [Real]Absence check using 14 positive place invariants in 77 ms returned unsat
[2020-06-03 05:38:34] [INFO ] [Real]Absence check using 14 positive place invariants in 80 ms returned unsat
[2020-06-03 05:38:34] [INFO ] [Real]Absence check using 14 positive place invariants in 17 ms returned unsat
[2020-06-03 05:38:34] [INFO ] [Real]Absence check using 14 positive place invariants in 22 ms returned sat
[2020-06-03 05:38:34] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 7 ms returned sat
[2020-06-03 05:38:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:38:35] [INFO ] [Real]Absence check using state equation in 861 ms returned sat
[2020-06-03 05:38:35] [INFO ] State equation strengthened by 132 read => feed constraints.
[2020-06-03 05:38:35] [INFO ] [Real]Added 132 Read/Feed constraints in 47 ms returned sat
[2020-06-03 05:38:35] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:38:35] [INFO ] [Nat]Absence check using 14 positive place invariants in 25 ms returned sat
[2020-06-03 05:38:35] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 12 ms returned sat
[2020-06-03 05:38:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:38:36] [INFO ] [Nat]Absence check using state equation in 844 ms returned sat
[2020-06-03 05:38:36] [INFO ] [Nat]Added 132 Read/Feed constraints in 60 ms returned sat
[2020-06-03 05:38:37] [INFO ] Deduced a trap composed of 18 places in 489 ms
[2020-06-03 05:38:37] [INFO ] Deduced a trap composed of 64 places in 323 ms
[2020-06-03 05:38:37] [INFO ] Deduced a trap composed of 61 places in 320 ms
[2020-06-03 05:38:38] [INFO ] Deduced a trap composed of 60 places in 241 ms
[2020-06-03 05:38:38] [INFO ] Deduced a trap composed of 40 places in 289 ms
[2020-06-03 05:38:39] [INFO ] Deduced a trap composed of 73 places in 511 ms
[2020-06-03 05:38:39] [INFO ] Deduced a trap composed of 17 places in 307 ms
[2020-06-03 05:38:39] [INFO ] Deduced a trap composed of 14 places in 354 ms
[2020-06-03 05:38:40] [INFO ] Deduced a trap composed of 69 places in 935 ms
[2020-06-03 05:38:40] [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 (> (+ s13 s31 s32 s33 s45 s46 s47 s49 s69 s71 s72 s145 s146 s147 s148 s149 s155 s156 s157 s158 s159 s160 s161 s162 s163 s164 s191 s192 s270 s271 s272 s273 s274 s280 s281 s282 s283 s284 s285 s286 s287 s288 s289 s356 s357 s358 s359 s364 s365 s366 s367 s368 s369 s370 s371 s450 s451 s452 s453 s460 s461 s462 s463 s464 s465 s466 s467 s468 s469) 0)") while checking expression at index 3
[2020-06-03 05:38:40] [INFO ] [Real]Absence check using 14 positive place invariants in 79 ms returned sat
[2020-06-03 05:38:41] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 13 ms returned sat
[2020-06-03 05:38:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:38:41] [INFO ] [Real]Absence check using state equation in 952 ms returned sat
[2020-06-03 05:38:41] [INFO ] [Real]Added 132 Read/Feed constraints in 24 ms returned sat
[2020-06-03 05:38:42] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:38:42] [INFO ] [Nat]Absence check using 14 positive place invariants in 28 ms returned sat
[2020-06-03 05:38:42] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 7 ms returned sat
[2020-06-03 05:38:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:38:42] [INFO ] [Nat]Absence check using state equation in 801 ms returned sat
[2020-06-03 05:38:43] [INFO ] [Nat]Added 132 Read/Feed constraints in 65 ms returned sat
[2020-06-03 05:38:44] [INFO ] Deduced a trap composed of 79 places in 1360 ms
[2020-06-03 05:38:45] [INFO ] Deduced a trap composed of 25 places in 629 ms
[2020-06-03 05:38:45] [INFO ] Deduced a trap composed of 18 places in 607 ms
[2020-06-03 05:38:46] [INFO ] Deduced a trap composed of 10 places in 231 ms
[2020-06-03 05:38:46] [INFO ] Deduced a trap composed of 31 places in 224 ms
[2020-06-03 05:38:46] [INFO ] Deduced a trap composed of 18 places in 226 ms
[2020-06-03 05:38:46] [INFO ] Deduced a trap composed of 19 places in 227 ms
[2020-06-03 05:38:47] [INFO ] Deduced a trap composed of 77 places in 196 ms
[2020-06-03 05:38:47] [INFO ] Deduced a trap composed of 2 places in 318 ms
[2020-06-03 05:38:47] [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 s8) 0)") while checking expression at index 4
[2020-06-03 05:38:47] [INFO ] [Real]Absence check using 14 positive place invariants in 25 ms returned sat
[2020-06-03 05:38:47] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 7 ms returned sat
[2020-06-03 05:38:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:38:48] [INFO ] [Real]Absence check using state equation in 848 ms returned sat
[2020-06-03 05:38:48] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:38:48] [INFO ] [Nat]Absence check using 14 positive place invariants in 41 ms returned unsat
[2020-06-03 05:38:48] [INFO ] [Real]Absence check using 14 positive place invariants in 82 ms returned sat
[2020-06-03 05:38:48] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 13 ms returned sat
[2020-06-03 05:38:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:38:49] [INFO ] [Real]Absence check using state equation in 862 ms returned sat
[2020-06-03 05:38:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:38:49] [INFO ] [Nat]Absence check using 14 positive place invariants in 21 ms returned sat
[2020-06-03 05:38:49] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 7 ms returned sat
[2020-06-03 05:38:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:38:50] [INFO ] [Nat]Absence check using state equation in 779 ms returned sat
[2020-06-03 05:38:50] [INFO ] [Nat]Added 132 Read/Feed constraints in 49 ms returned sat
[2020-06-03 05:38:50] [INFO ] Deduced a trap composed of 38 places in 210 ms
[2020-06-03 05:38:51] [INFO ] Deduced a trap composed of 36 places in 251 ms
[2020-06-03 05:38:51] [INFO ] Deduced a trap composed of 26 places in 205 ms
[2020-06-03 05:38:51] [INFO ] Deduced a trap composed of 80 places in 219 ms
[2020-06-03 05:38:51] [INFO ] Deduced a trap composed of 18 places in 216 ms
[2020-06-03 05:38:52] [INFO ] Deduced a trap composed of 22 places in 215 ms
[2020-06-03 05:38:52] [INFO ] Deduced a trap composed of 79 places in 207 ms
[2020-06-03 05:38:52] [INFO ] Deduced a trap composed of 25 places in 269 ms
[2020-06-03 05:38:52] [INFO ] Deduced a trap composed of 96 places in 253 ms
[2020-06-03 05:38:53] [INFO ] Deduced a trap composed of 21 places in 224 ms
[2020-06-03 05:38:53] [INFO ] Deduced a trap composed of 80 places in 260 ms
[2020-06-03 05:38:53] [INFO ] Deduced a trap composed of 85 places in 245 ms
[2020-06-03 05:38:54] [INFO ] Deduced a trap composed of 38 places in 225 ms
[2020-06-03 05:38:54] [INFO ] Deduced a trap composed of 61 places in 239 ms
[2020-06-03 05:38:54] [INFO ] Deduced a trap composed of 10 places in 212 ms
[2020-06-03 05:38:54] [INFO ] Deduced a trap composed of 35 places in 229 ms
[2020-06-03 05:38:54] [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 (> (+ s5 s15 s26 s30 s34 s35 s37 s38 s39 s45 s46 s49 s50 s52 s53 s54 s59 s62 s65 s69 s95 s110 s125 s145 s185 s189 s193 s220 s235 s250 s270 s316 s328 s340 s356) 0)") while checking expression at index 6
FORMULA Peterson-COL-4-ReachabilityCardinality-14 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-COL-4-ReachabilityCardinality-09 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-COL-4-ReachabilityCardinality-08 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-COL-4-ReachabilityCardinality-01 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Support contains 145 out of 480 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 480/480 places, 690/690 transitions.
Performed 160 Post agglomeration using F-continuation condition.Transition count delta: 160
Iterating post reduction 0 with 160 rules applied. Total rules applied 160 place count 480 transition count 530
Reduce places removed 160 places and 0 transitions.
Iterating post reduction 1 with 160 rules applied. Total rules applied 320 place count 320 transition count 530
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 20 Pre rules applied. Total rules applied 320 place count 320 transition count 510
Deduced a syphon composed of 20 places in 2 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 360 place count 300 transition count 510
Applied a total of 360 rules in 146 ms. Remains 300 /480 variables (removed 180) and now considering 510/690 (removed 180) transitions.
Finished structural reductions, in 1 iterations. Remains : 300/480 places, 510/690 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 3072 ms. (steps per millisecond=325 ) properties seen :[1, 0, 0]
FORMULA Peterson-COL-4-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1418 ms. (steps per millisecond=705 ) properties seen :[0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 1741 ms. (steps per millisecond=574 ) properties seen :[0, 0]
[2020-06-03 05:39:01] [INFO ] Flow matrix only has 450 transitions (discarded 60 similar events)
// Phase 1: matrix 450 rows 300 cols
[2020-06-03 05:39:01] [INFO ] Computed 19 place invariants in 5 ms
[2020-06-03 05:39:01] [INFO ] [Real]Absence check using 14 positive place invariants in 27 ms returned sat
[2020-06-03 05:39:01] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 9 ms returned sat
[2020-06-03 05:39:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:39:01] [INFO ] [Real]Absence check using state equation in 396 ms returned sat
[2020-06-03 05:39:01] [INFO ] State equation strengthened by 132 read => feed constraints.
[2020-06-03 05:39:01] [INFO ] [Real]Added 132 Read/Feed constraints in 25 ms returned sat
[2020-06-03 05:39:01] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:39:01] [INFO ] [Nat]Absence check using 14 positive place invariants in 18 ms returned sat
[2020-06-03 05:39:01] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 5 ms returned sat
[2020-06-03 05:39:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:39:02] [INFO ] [Nat]Absence check using state equation in 369 ms returned sat
[2020-06-03 05:39:02] [INFO ] [Nat]Added 132 Read/Feed constraints in 22 ms returned sat
[2020-06-03 05:39:02] [INFO ] Deduced a trap composed of 22 places in 189 ms
[2020-06-03 05:39:02] [INFO ] Deduced a trap composed of 8 places in 119 ms
[2020-06-03 05:39:02] [INFO ] Deduced a trap composed of 21 places in 129 ms
[2020-06-03 05:39:02] [INFO ] Deduced a trap composed of 49 places in 139 ms
[2020-06-03 05:39:02] [INFO ] Deduced a trap composed of 40 places in 123 ms
[2020-06-03 05:39:03] [INFO ] Deduced a trap composed of 47 places in 122 ms
[2020-06-03 05:39:03] [INFO ] Deduced a trap composed of 47 places in 125 ms
[2020-06-03 05:39:03] [INFO ] Deduced a trap composed of 14 places in 92 ms
[2020-06-03 05:39:03] [INFO ] Deduced a trap composed of 40 places in 95 ms
[2020-06-03 05:39:03] [INFO ] Deduced a trap composed of 40 places in 99 ms
[2020-06-03 05:39:03] [INFO ] Deduced a trap composed of 36 places in 92 ms
[2020-06-03 05:39:03] [INFO ] Deduced a trap composed of 44 places in 80 ms
[2020-06-03 05:39:03] [INFO ] Deduced a trap composed of 10 places in 78 ms
[2020-06-03 05:39:04] [INFO ] Deduced a trap composed of 10 places in 96 ms
[2020-06-03 05:39:04] [INFO ] Deduced a trap composed of 23 places in 90 ms
[2020-06-03 05:39:04] [INFO ] Deduced a trap composed of 22 places in 104 ms
[2020-06-03 05:39:04] [INFO ] Deduced a trap composed of 34 places in 87 ms
[2020-06-03 05:39:04] [INFO ] Deduced a trap composed of 63 places in 75 ms
[2020-06-03 05:39:04] [INFO ] Deduced a trap composed of 61 places in 91 ms
[2020-06-03 05:39:04] [INFO ] Deduced a trap composed of 57 places in 132 ms
[2020-06-03 05:39:04] [INFO ] Deduced a trap composed of 54 places in 109 ms
[2020-06-03 05:39:05] [INFO ] Deduced a trap composed of 48 places in 137 ms
[2020-06-03 05:39:05] [INFO ] Deduced a trap composed of 12 places in 116 ms
[2020-06-03 05:39:05] [INFO ] Deduced a trap composed of 67 places in 124 ms
[2020-06-03 05:39:05] [INFO ] Deduced a trap composed of 30 places in 122 ms
[2020-06-03 05:39:05] [INFO ] Deduced a trap composed of 85 places in 101 ms
[2020-06-03 05:39:05] [INFO ] Deduced a trap composed of 71 places in 130 ms
[2020-06-03 05:39:05] [INFO ] Deduced a trap composed of 24 places in 161 ms
[2020-06-03 05:39:06] [INFO ] Deduced a trap composed of 21 places in 103 ms
[2020-06-03 05:39:06] [INFO ] Deduced a trap composed of 40 places in 100 ms
[2020-06-03 05:39:06] [INFO ] Deduced a trap composed of 29 places in 107 ms
[2020-06-03 05:39:06] [INFO ] Deduced a trap composed of 28 places in 79 ms
[2020-06-03 05:39:06] [INFO ] Deduced a trap composed of 12 places in 104 ms
[2020-06-03 05:39:06] [INFO ] Deduced a trap composed of 49 places in 96 ms
[2020-06-03 05:39:06] [INFO ] Deduced a trap composed of 48 places in 87 ms
[2020-06-03 05:39:07] [INFO ] Deduced a trap composed of 12 places in 157 ms
[2020-06-03 05:39:07] [INFO ] Deduced a trap composed of 40 places in 115 ms
[2020-06-03 05:39:07] [INFO ] Deduced a trap composed of 32 places in 109 ms
[2020-06-03 05:39:07] [INFO ] Deduced a trap composed of 10 places in 130 ms
[2020-06-03 05:39:07] [INFO ] Deduced a trap composed of 27 places in 119 ms
[2020-06-03 05:39:07] [INFO ] Deduced a trap composed of 49 places in 108 ms
[2020-06-03 05:39:07] [INFO ] Deduced a trap composed of 53 places in 98 ms
[2020-06-03 05:39:08] [INFO ] Deduced a trap composed of 53 places in 143 ms
[2020-06-03 05:39:08] [INFO ] Deduced a trap composed of 29 places in 126 ms
[2020-06-03 05:39:08] [INFO ] Deduced a trap composed of 60 places in 152 ms
[2020-06-03 05:39:08] [INFO ] Deduced a trap composed of 51 places in 131 ms
[2020-06-03 05:39:08] [INFO ] Deduced a trap composed of 51 places in 128 ms
[2020-06-03 05:39:08] [INFO ] Deduced a trap composed of 61 places in 129 ms
[2020-06-03 05:39:09] [INFO ] Deduced a trap composed of 82 places in 150 ms
[2020-06-03 05:39:09] [INFO ] Deduced a trap composed of 77 places in 149 ms
[2020-06-03 05:39:11] [INFO ] Deduced a trap composed of 47 places in 121 ms
[2020-06-03 05:39:12] [INFO ] Deduced a trap composed of 27 places in 141 ms
[2020-06-03 05:39:13] [INFO ] Deduced a trap composed of 61 places in 122 ms
[2020-06-03 05:39:14] [INFO ] Deduced a trap composed of 51 places in 106 ms
[2020-06-03 05:39:14] [INFO ] Deduced a trap composed of 97 places in 135 ms
[2020-06-03 05:39:14] [INFO ] Deduced a trap composed of 83 places in 110 ms
[2020-06-03 05:39:14] [INFO ] Deduced a trap composed of 42 places in 122 ms
[2020-06-03 05:39:15] [INFO ] Deduced a trap composed of 42 places in 95 ms
[2020-06-03 05:39:15] [INFO ] Deduced a trap composed of 38 places in 126 ms
[2020-06-03 05:39:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 59 trap constraints in 13527 ms
[2020-06-03 05:39:15] [INFO ] [Real]Absence check using 14 positive place invariants in 20 ms returned sat
[2020-06-03 05:39:15] [INFO ] [Real]Absence check using 14 positive and 5 generalized place invariants in 13 ms returned sat
[2020-06-03 05:39:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 05:39:16] [INFO ] [Real]Absence check using state equation in 469 ms returned sat
[2020-06-03 05:39:16] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 05:39:16] [INFO ] [Nat]Absence check using 14 positive place invariants in 35 ms returned sat
[2020-06-03 05:39:16] [INFO ] [Nat]Absence check using 14 positive and 5 generalized place invariants in 9 ms returned sat
[2020-06-03 05:39:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 05:39:16] [INFO ] [Nat]Absence check using state equation in 337 ms returned sat
[2020-06-03 05:39:16] [INFO ] [Nat]Added 132 Read/Feed constraints in 20 ms returned sat
[2020-06-03 05:39:16] [INFO ] Deduced a trap composed of 10 places in 195 ms
[2020-06-03 05:39:17] [INFO ] Deduced a trap composed of 54 places in 156 ms
[2020-06-03 05:39:17] [INFO ] Deduced a trap composed of 27 places in 132 ms
[2020-06-03 05:39:17] [INFO ] Deduced a trap composed of 51 places in 117 ms
[2020-06-03 05:39:17] [INFO ] Deduced a trap composed of 28 places in 121 ms
[2020-06-03 05:39:17] [INFO ] Deduced a trap composed of 51 places in 140 ms
[2020-06-03 05:39:17] [INFO ] Deduced a trap composed of 27 places in 117 ms
[2020-06-03 05:39:18] [INFO ] Deduced a trap composed of 47 places in 127 ms
[2020-06-03 05:39:18] [INFO ] Deduced a trap composed of 53 places in 159 ms
[2020-06-03 05:39:18] [INFO ] Deduced a trap composed of 62 places in 124 ms
[2020-06-03 05:39:18] [INFO ] Deduced a trap composed of 24 places in 125 ms
[2020-06-03 05:39:18] [INFO ] Deduced a trap composed of 10 places in 136 ms
[2020-06-03 05:39:18] [INFO ] Deduced a trap composed of 20 places in 126 ms
[2020-06-03 05:39:18] [INFO ] Deduced a trap composed of 55 places in 172 ms
[2020-06-03 05:39:19] [INFO ] Deduced a trap composed of 18 places in 150 ms
[2020-06-03 05:39:19] [INFO ] Deduced a trap composed of 16 places in 175 ms
[2020-06-03 05:39:19] [INFO ] Deduced a trap composed of 10 places in 114 ms
[2020-06-03 05:39:19] [INFO ] Deduced a trap composed of 51 places in 133 ms
[2020-06-03 05:39:19] [INFO ] Deduced a trap composed of 12 places in 127 ms
[2020-06-03 05:39:19] [INFO ] Deduced a trap composed of 42 places in 122 ms
[2020-06-03 05:39:20] [INFO ] Deduced a trap composed of 39 places in 116 ms
[2020-06-03 05:39:20] [INFO ] Deduced a trap composed of 23 places in 121 ms
[2020-06-03 05:39:20] [INFO ] Deduced a trap composed of 75 places in 164 ms
[2020-06-03 05:39:20] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 23 trap constraints in 3640 ms
FORMULA Peterson-COL-4-ReachabilityCardinality-15 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
FORMULA Peterson-COL-4-ReachabilityCardinality-13 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
All properties solved without resorting to model-checking.

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is Peterson-COL-4, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r174-csrt-158987853500678"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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