fond
Model Checking Contest 2020
10th edition, Paris, France, June 23, 2020
Execution of r174-csrt-158987853100343
Last Updated
Jun 28, 2020

About the Execution of ITS-LoLa for NoC3x3-PT-1B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15745.660 3600000.00 68845.00 140.70 FTTTTFFTFTTTTTTF normal

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-158987853100343.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 NoC3x3-PT-1B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r174-csrt-158987853100343
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 3.1K Apr 8 15:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 18K Apr 8 15:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 7 18:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 7 18:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.0K Apr 14 12:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K Apr 14 12:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 6 20:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 6 20:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 6 03:57 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 12K Apr 6 03:57 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 6 20:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 6 20:25 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 362K 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 NoC3x3-PT-1B-ReachabilityFireability-00
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-01
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-02
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-03
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-04
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-05
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-06
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-07
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-08
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-09
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-10
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-11
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-12
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-13
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-14
FORMULA_NAME NoC3x3-PT-1B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1591140712461

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-02 23:31:56] [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-02 23:31:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-02 23:31:56] [INFO ] Load time of PNML (sax parser for PT used): 151 ms
[2020-06-02 23:31:56] [INFO ] Transformed 1416 places.
[2020-06-02 23:31:56] [INFO ] Transformed 1640 transitions.
[2020-06-02 23:31:56] [INFO ] Found NUPN structural information;
[2020-06-02 23:31:56] [INFO ] Parsed PT model containing 1416 places and 1640 transitions in 211 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 60 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 8 resets, run finished after 67 ms. (steps per millisecond=149 ) properties seen :[1, 1, 0, 1, 1, 1, 1, 1, 1, 0, 0, 1, 0, 0, 0, 0]
FORMULA NoC3x3-PT-1B-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityFireability-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityFireability-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 19 ms. (steps per millisecond=526 ) 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 1 resets, run finished after 18 ms. (steps per millisecond=555 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 21 ms. (steps per millisecond=476 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 0, 0, 0, 0, 0, 0]
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 13 ms. (steps per millisecond=769 ) properties seen :[0, 1, 0, 0, 0, 0, 0]
FORMULA NoC3x3-PT-1B-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 1 resets, run finished after 29 ms. (steps per millisecond=344 ) properties seen :[0, 0, 0, 0, 0, 0]
// Phase 1: matrix 1640 rows 1416 cols
[2020-06-02 23:31:56] [INFO ] Computed 40 place invariants in 53 ms
[2020-06-02 23:31:57] [INFO ] [Real]Absence check using 40 positive place invariants in 102 ms returned sat
[2020-06-02 23:31:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:32:01] [INFO ] [Real]Absence check using state equation in 4378 ms returned sat
[2020-06-02 23:32:02] [INFO ] Deduced a trap composed of 7 places in 1116 ms
[2020-06-02 23:32:02] [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 (> (+ s0 s1 s2 s3 s1236 s1237 s1238) 0)") while checking expression at index 0
[2020-06-02 23:32:03] [INFO ] [Real]Absence check using 40 positive place invariants in 135 ms returned sat
[2020-06-02 23:32:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:32:07] [INFO ] [Real]Absence check using state equation in 4470 ms returned sat
[2020-06-02 23:32:07] [INFO ] Deduced a trap composed of 102 places in 195 ms
[2020-06-02 23:32:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s32 s33 s34 s35 s36 s37 s38 s58 s59 s60 s61 s62 s63 s68 s191 s192 s193 s194 s195 s196 s197 s198 s199 s200 s201 s202 s203 s204 s205 s206 s207 s209 s210 s211 s212 s213 s214 s215 s216 s217 s218 s219 s220 s221 s222 s223 s224 s225 s226 s227 s228 s229 s230 s231 s232 s233 s234 s235 s236 s237 s238 s239 s240 s241 s242 s243 s244 s245 s246 s247) 0)") while checking expression at index 1
[2020-06-02 23:32:08] [INFO ] [Real]Absence check using 40 positive place invariants in 146 ms returned sat
[2020-06-02 23:32:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:32:12] [INFO ] [Real]Absence check using state equation in 4451 ms returned sat
[2020-06-02 23:32:13] [INFO ] Deduced a trap composed of 91 places in 209 ms
[2020-06-02 23:32:13] [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 (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s26 s27 s28 s29 s30 s31 s259 s275 s276 s338 s339 s340 s341 s342 s343 s344 s345 s346 s347 s348 s349 s350 s351 s352 s354 s355 s356 s357 s358 s359 s360 s361 s362 s363 s364 s365 s366 s367 s368 s369 s370 s371 s372 s373 s374 s375 s376 s377 s378 s379 s380 s381 s382 s383 s384 s385 s386 s387 s388 s389 s390 s391 s392 s393 s394) 0)") while checking expression at index 2
[2020-06-02 23:32:13] [INFO ] [Real]Absence check using 40 positive place invariants in 88 ms returned sat
[2020-06-02 23:32:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:32:17] [INFO ] [Real]Absence check using state equation in 4201 ms returned sat
[2020-06-02 23:32:17] [INFO ] Deduced a trap composed of 69 places in 185 ms
[2020-06-02 23:32:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 351 ms
[2020-06-02 23:32:18] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:32:18] [INFO ] [Nat]Absence check using 40 positive place invariants in 341 ms returned sat
[2020-06-02 23:32:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:32:23] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-02 23:32:23] [INFO ] [Nat]Absence check using state equation in 4310 ms returned (error "Failed to check-sat")
[2020-06-02 23:32:23] [INFO ] [Real]Absence check using 40 positive place invariants in 84 ms returned sat
[2020-06-02 23:32:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:32:27] [INFO ] [Real]Absence check using state equation in 4547 ms returned sat
[2020-06-02 23:32:28] [INFO ] Deduced a trap composed of 90 places in 629 ms
[2020-06-02 23:32:28] [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 (> (+ s0 s1 s2 s3 s4 s5 s6 s7 s8 s9 s10 s11 s12 s13 s14 s15 s16 s17 s18 s19 s20 s21 s22 s23 s24 s25 s486 s487 s488 s489 s490 s491 s492 s493 s679 s680 s681 s682 s683 s684 s685 s686 s687 s688 s689 s690 s691 s692 s693 s694 s695 s697 s698 s699 s700 s701 s702 s703 s704 s705 s706 s707 s708 s709 s710 s711 s712 s713 s714 s715 s716 s717 s718 s719 s720 s721 s722 s723 s724 s725 s726 s727 s728 s729 s730 s731 s732 s733 s734 s735) 0)") while checking expression at index 4
[2020-06-02 23:32:28] [INFO ] [Real]Absence check using 40 positive place invariants in 89 ms returned sat
[2020-06-02 23:32:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:32:33] [INFO ] [Real]Absence check using state equation in 4488 ms returned sat
[2020-06-02 23:32:33] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Error writing to Z3 solver: java.io.IOException: Broken pipe") while checking expression at index 5
Support contains 17 out of 1416 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1416/1416 places, 1640/1640 transitions.
Graph (trivial) has 1395 edges and 1416 vertex of which 756 / 1416 are part of one of the 19 SCC in 36 ms
Free SCC test removed 737 places
Drop transitions removed 886 transitions
Reduce isomorphic transitions removed 886 transitions.
Performed 133 Post agglomeration using F-continuation condition.Transition count delta: 133
Iterating post reduction 0 with 1019 rules applied. Total rules applied 1020 place count 679 transition count 621
Reduce places removed 133 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 150 rules applied. Total rules applied 1170 place count 546 transition count 604
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1170 place count 546 transition count 603
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1172 place count 545 transition count 603
Symmetric choice reduction at 2 with 159 rule applications. Total rules 1331 place count 545 transition count 603
Deduced a syphon composed of 159 places in 1 ms
Reduce places removed 159 places and 159 transitions.
Iterating global reduction 2 with 318 rules applied. Total rules applied 1649 place count 386 transition count 444
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 1651 place count 386 transition count 442
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1652 place count 385 transition count 442
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 28 Pre rules applied. Total rules applied 1652 place count 385 transition count 414
Deduced a syphon composed of 28 places in 3 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 1708 place count 357 transition count 414
Symmetric choice reduction at 4 with 17 rule applications. Total rules 1725 place count 357 transition count 414
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 17 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 1759 place count 340 transition count 397
Performed 88 Post agglomeration using F-continuation condition.Transition count delta: 88
Deduced a syphon composed of 88 places in 1 ms
Reduce places removed 88 places and 0 transitions.
Iterating global reduction 4 with 176 rules applied. Total rules applied 1935 place count 252 transition count 309
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 1937 place count 252 transition count 307
Performed 8 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 1953 place count 244 transition count 373
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1959 place count 244 transition count 367
Free-agglomeration rule applied 89 times.
Iterating global reduction 6 with 89 rules applied. Total rules applied 2048 place count 244 transition count 278
Reduce places removed 89 places and 0 transitions.
Drop transitions removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Discarding 21 places :
Also discarding 0 output transitions
Graph (complete) has 473 edges and 155 vertex of which 134 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.28 ms
Iterating post reduction 6 with 117 rules applied. Total rules applied 2165 place count 134 transition count 251
Drop transitions removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 7 with 25 rules applied. Total rules applied 2190 place count 134 transition count 226
Symmetric choice reduction at 8 with 7 rule applications. Total rules 2197 place count 134 transition count 226
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 7 transitions.
Iterating global reduction 8 with 14 rules applied. Total rules applied 2211 place count 127 transition count 219
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 2214 place count 127 transition count 219
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 2218 place count 127 transition count 215
Applied a total of 2218 rules in 424 ms. Remains 127 /1416 variables (removed 1289) and now considering 215/1640 (removed 1425) transitions.
Finished structural reductions, in 1 iterations. Remains : 127/1416 places, 215/1640 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 1753 ms. (steps per millisecond=570 ) properties seen :[0, 1, 0, 0, 1, 1]
FORMULA NoC3x3-PT-1B-ReachabilityFireability-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA NoC3x3-PT-1B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 684 ms. (steps per millisecond=1461 ) properties seen :[0, 0, 0]
Incomplete Best-First random walk after 1000001 steps, including 0 resets, run finished after 713 ms. (steps per millisecond=1402 ) properties seen :[0, 0, 1]
FORMULA NoC3x3-PT-1B-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2020-06-02 23:32:37] [INFO ] Flow matrix only has 205 transitions (discarded 10 similar events)
// Phase 1: matrix 205 rows 127 cols
[2020-06-02 23:32:37] [INFO ] Computed 34 place invariants in 1 ms
[2020-06-02 23:32:37] [INFO ] [Real]Absence check using 34 positive place invariants in 19 ms returned sat
[2020-06-02 23:32:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:32:37] [INFO ] [Real]Absence check using state equation in 128 ms returned sat
[2020-06-02 23:32:37] [INFO ] State equation strengthened by 63 read => feed constraints.
[2020-06-02 23:32:37] [INFO ] [Real]Added 63 Read/Feed constraints in 23 ms returned sat
[2020-06-02 23:32:37] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:32:37] [INFO ] [Nat]Absence check using 34 positive place invariants in 15 ms returned sat
[2020-06-02 23:32:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:32:37] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2020-06-02 23:32:37] [INFO ] [Nat]Added 63 Read/Feed constraints in 9 ms returned sat
[2020-06-02 23:32:37] [INFO ] Computed and/alt/rep : 199/2676/189 causal constraints in 68 ms.
[2020-06-02 23:32:39] [INFO ] Added : 181 causal constraints over 37 iterations in 1431 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 41 ms.
[2020-06-02 23:32:39] [INFO ] [Real]Absence check using 34 positive place invariants in 19 ms returned sat
[2020-06-02 23:32:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-02 23:32:39] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2020-06-02 23:32:39] [INFO ] [Real]Added 63 Read/Feed constraints in 12 ms returned sat
[2020-06-02 23:32:39] [INFO ] Solution in real domain found non-integer solution.
[2020-06-02 23:32:39] [INFO ] [Nat]Absence check using 34 positive place invariants in 21 ms returned sat
[2020-06-02 23:32:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-02 23:32:39] [INFO ] [Nat]Absence check using state equation in 164 ms returned sat
[2020-06-02 23:32:39] [INFO ] [Nat]Added 63 Read/Feed constraints in 17 ms returned sat
[2020-06-02 23:32:39] [INFO ] Computed and/alt/rep : 199/2676/189 causal constraints in 19 ms.
[2020-06-02 23:32:41] [INFO ] Added : 180 causal constraints over 37 iterations in 1402 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 29 ms.
Incomplete Parikh walk after 15000 steps, including 258 resets, run finished after 67 ms. (steps per millisecond=223 ) properties seen :[0, 1] could not realise parikh vector
FORMULA NoC3x3-PT-1B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
Finished Parikh walk after 155 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=77 )
FORMULA NoC3x3-PT-1B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL PARIKH_WALK
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="NoC3x3-PT-1B"
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 NoC3x3-PT-1B, 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 r174-csrt-158987853100343"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-1B.tgz
mv NoC3x3-PT-1B 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 ;