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

About the Execution of ITS-LoLa for TokenRing-PT-015

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
15741.140 3600000.00 145190.00 169.60 FFTTFFFTFFT?TTFF 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.r194-csrt-159033390100494.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 TokenRing-PT-015, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r194-csrt-159033390100494
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 22M
-rw-r--r-- 1 mcc users 138K Apr 27 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 460K Apr 27 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4M Apr 27 15:14 CTLFireability.txt
-rw-r--r-- 1 mcc users 6.5M 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.2K Apr 27 15:14 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 165K Apr 27 15:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 582K Apr 28 14:02 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.2M Apr 27 15:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 3.3M Apr 28 14:02 LTLFireability.xml
-rw-r--r-- 1 mcc users 104K Apr 27 15:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 338K Apr 27 15:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 984K Apr 27 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 2.7M Apr 27 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 30K Apr 27 15:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 71K Apr 27 15:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Apr 27 15:14 equiv_col
-rw-r--r-- 1 mcc users 4 Apr 27 15:14 instance
-rw-r--r-- 1 mcc users 6 Apr 27 15:14 iscolored
-rw-r--r-- 1 mcc users 2.6M 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 TokenRing-PT-015-ReachabilityCardinality-00
FORMULA_NAME TokenRing-PT-015-ReachabilityCardinality-01
FORMULA_NAME TokenRing-PT-015-ReachabilityCardinality-02
FORMULA_NAME TokenRing-PT-015-ReachabilityCardinality-03
FORMULA_NAME TokenRing-PT-015-ReachabilityCardinality-04
FORMULA_NAME TokenRing-PT-015-ReachabilityCardinality-05
FORMULA_NAME TokenRing-PT-015-ReachabilityCardinality-06
FORMULA_NAME TokenRing-PT-015-ReachabilityCardinality-07
FORMULA_NAME TokenRing-PT-015-ReachabilityCardinality-08
FORMULA_NAME TokenRing-PT-015-ReachabilityCardinality-09
FORMULA_NAME TokenRing-PT-015-ReachabilityCardinality-10
FORMULA_NAME TokenRing-PT-015-ReachabilityCardinality-11
FORMULA_NAME TokenRing-PT-015-ReachabilityCardinality-12
FORMULA_NAME TokenRing-PT-015-ReachabilityCardinality-13
FORMULA_NAME TokenRing-PT-015-ReachabilityCardinality-14
FORMULA_NAME TokenRing-PT-015-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1591227380764

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 23:36:23] [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 23:36:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 23:36:23] [INFO ] Load time of PNML (sax parser for PT used): 299 ms
[2020-06-03 23:36:23] [INFO ] Transformed 256 places.
[2020-06-03 23:36:23] [INFO ] Transformed 3616 transitions.
[2020-06-03 23:36:23] [INFO ] Found NUPN structural information;
[2020-06-03 23:36:23] [INFO ] Parsed PT model containing 256 places and 3616 transitions in 378 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 97 ms.
Working with output stream class java.io.PrintStream
FORMULA TokenRing-PT-015-ReachabilityCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-015-ReachabilityCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-015-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-015-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-015-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-015-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-015-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-015-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-015-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TokenRing-PT-015-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 0 resets, run finished after 84 ms. (steps per millisecond=119 ) properties seen :[1, 1, 1, 0, 1, 1]
FORMULA TokenRing-PT-015-ReachabilityCardinality-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TokenRing-PT-015-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TokenRing-PT-015-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TokenRing-PT-015-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA TokenRing-PT-015-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 0 resets, run finished after 41 ms. (steps per millisecond=243 ) properties seen :[0]
// Phase 1: matrix 3616 rows 256 cols
[2020-06-03 23:36:23] [INFO ] Computed 16 place invariants in 34 ms
[2020-06-03 23:36:24] [INFO ] [Real]Absence check using 16 positive place invariants in 86 ms returned sat
[2020-06-03 23:36:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:25] [INFO ] [Real]Absence check using state equation in 1773 ms returned sat
[2020-06-03 23:36:26] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:36:26] [INFO ] [Nat]Absence check using 16 positive place invariants in 36 ms returned sat
[2020-06-03 23:36:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:36:28] [INFO ] [Nat]Absence check using state equation in 1853 ms returned sat
[2020-06-03 23:36:28] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2020-06-03 23:36:28] [INFO ] [Nat]Added 3390 Read/Feed constraints in 500 ms returned sat
[2020-06-03 23:36:29] [INFO ] Computed and/alt/rep : 3601/98340/3601 causal constraints in 682 ms.
[2020-06-03 23:36:31] [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: Broken pipe (=> (> t16 0) (and (or (and (> t185 0) (< o185 o16)) (and (> t443 0) (< o443 o16)) (and (> t468 0) (< o468 o16)) (and (> t963 0) (< o963 o16)) (and (> t1066 0) (< o1066 o16)) (and (> t1236 0) (< o1236 o16)) (and (> t1355 0) (< o1355 o16)) (and (> t1570 0) (< o1570 o16)) (and (> t1668 0) (< o1668 o16)) (and (> t1965 0) (< o1965 o16)) (and (> t2418 0) (< o2418 o16)) (and (> t2442 0) (< o2442 o16)) (and (> t2480 0) (< o2480 o16)) (and (> t2493 0) (< o2493 o16)) (and (> t2781 0) (< o2781 o16))) (or (and (> t161 0) (< o161 o16)) (and (> t418 0) (< o418 o16)) (and (> t915 0) (< o915 o16)) (and (> t967 0) (< o967 o16)) (and (> t994 0) (< o994 o16)) (and (> t1102 0) (< o1102 o16)) (and (> t1660 0) (< o1660 o16)) (and (> t1782 0) (< o1782 o16)) (and (> t1979 0) (< o1979 o16)) (and (> t2001 0) (< o2001 o16)) (and (> t2738 0) (< o2738 o16)) (and (> t2922 0) (< o2922 o16)) (and (> t2925 0) (< o2925 o16)) (and (> t3263 0) (< o3263 o16)) (and (> t3300 0) (< o3300 o16)))))") while checking expression at index 0
Support contains 4 out of 256 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 461 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 256/256 places, 3616/3616 transitions.
Incomplete random walk after 1000000 steps, including 0 resets, run finished after 4823 ms. (steps per millisecond=207 ) properties seen :[0]
Incomplete Best-First random walk after 1000000 steps, including 0 resets, run finished after 4305 ms. (steps per millisecond=232 ) properties seen :[0]
Interrupted probabilistic random walk after 1527179 steps, run timeout after 30001 ms. (steps per millisecond=50 ) properties seen :[0]
Probabilistic random walk after 1527179 steps, saw 245350 distinct states, run finished after 30001 ms. (steps per millisecond=50 ) properties seen :[0]
// Phase 1: matrix 3616 rows 256 cols
[2020-06-03 23:37:10] [INFO ] Computed 16 place invariants in 10 ms
[2020-06-03 23:37:10] [INFO ] [Real]Absence check using 16 positive place invariants in 17 ms returned sat
[2020-06-03 23:37:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:37:12] [INFO ] [Real]Absence check using state equation in 1538 ms returned sat
[2020-06-03 23:37:12] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:37:12] [INFO ] [Nat]Absence check using 16 positive place invariants in 27 ms returned sat
[2020-06-03 23:37:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:37:14] [INFO ] [Nat]Absence check using state equation in 1448 ms returned sat
[2020-06-03 23:37:14] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2020-06-03 23:37:14] [INFO ] [Nat]Added 3390 Read/Feed constraints in 542 ms returned sat
[2020-06-03 23:37:15] [INFO ] Computed and/alt/rep : 3601/98340/3601 causal constraints in 372 ms.
[2020-06-03 23:37:35] [INFO ] Added : 355 causal constraints over 71 iterations in 20592 ms.(timeout) Result :sat
Incomplete Parikh walk after 372900 steps, including 1000 resets, run finished after 2308 ms. (steps per millisecond=161 ) properties seen :[0] could not realise parikh vector
Support contains 4 out of 256 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 280 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 256/256 places, 3616/3616 transitions.
Starting structural reductions, iteration 0 : 256/256 places, 3616/3616 transitions.
Applied a total of 0 rules in 160 ms. Remains 256 /256 variables (removed 0) and now considering 3616/3616 (removed 0) transitions.
// Phase 1: matrix 3616 rows 256 cols
[2020-06-03 23:37:38] [INFO ] Computed 16 place invariants in 10 ms
[2020-06-03 23:37:39] [INFO ] Implicit Places using invariants in 688 ms returned []
// Phase 1: matrix 3616 rows 256 cols
[2020-06-03 23:37:39] [INFO ] Computed 16 place invariants in 8 ms
[2020-06-03 23:37:39] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2020-06-03 23:37:43] [INFO ] Implicit Places using invariants and state equation in 4484 ms returned []
Implicit Place search using SMT with State Equation took 5175 ms to find 0 implicit places.
[2020-06-03 23:37:44] [INFO ] Redundant transitions in 351 ms returned []
// Phase 1: matrix 3616 rows 256 cols
[2020-06-03 23:37:44] [INFO ] Computed 16 place invariants in 8 ms
[2020-06-03 23:37:47] [INFO ] Dead Transitions using invariants and state equation in 3648 ms returned []
Finished structural reductions, in 1 iterations. Remains : 256/256 places, 3616/3616 transitions.
Incomplete random walk after 100000 steps, including 0 resets, run finished after 456 ms. (steps per millisecond=219 ) properties seen :[0]
// Phase 1: matrix 3616 rows 256 cols
[2020-06-03 23:37:48] [INFO ] Computed 16 place invariants in 7 ms
[2020-06-03 23:37:48] [INFO ] [Real]Absence check using 16 positive place invariants in 26 ms returned sat
[2020-06-03 23:37:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:37:49] [INFO ] [Real]Absence check using state equation in 1298 ms returned sat
[2020-06-03 23:37:49] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:37:49] [INFO ] [Nat]Absence check using 16 positive place invariants in 34 ms returned sat
[2020-06-03 23:37:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:37:51] [INFO ] [Nat]Absence check using state equation in 1361 ms returned sat
[2020-06-03 23:37:51] [INFO ] State equation strengthened by 3390 read => feed constraints.
[2020-06-03 23:37:51] [INFO ] [Nat]Added 3390 Read/Feed constraints in 445 ms returned sat
[2020-06-03 23:37:52] [INFO ] Computed and/alt/rep : 3601/98340/3601 causal constraints in 253 ms.
[2020-06-03 23:38:09] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (=> (> t328 0) (and (or (and (> t93 0) (< o93 o328)) (and (> t197 0) (< o197 o328)) (and (> t351 0) (< o351 o328)) (and (> t986 0) (< o986 o328)) (and (> t1079 0) (< o1079 o328)) (and (> t1229 0) (< o1229 o328)) (and (> t1481 0) (< o1481 o328)) (and (> t1808 0) (< o1808 o328)) (and (> t1930 0) (< o1930 o328)) (and (> t2041 0) (< o2041 o328)) (and (> t2223 0) (< o2223 o328)) (and (> t2609 0) (< o2609 o328)) (and (> t3165 0) (< o3165 o328)) (and (> t3185 0) (< o3185 o328)) (and (> t3280 0) (< o3280 o328))) (or (and (> t191 0) (< o191 o328)) (and (> t295 0) (< o295 o328)) (and (> t432 0) (< o432 o328)) (and (> t856 0) (< o856 o328)) (and (> t1314 0) (< o1314 o328)) (and (> t1477 0) (< o1477 o328)) (and (> t1543 0) (< o1543 o328)) (and (> t1549 0) (< o1549 o328)) (and (> t1783 0) (< o1783 o328)) (and (> t1908 0) (< o1908 o328)) (and (> t2143 0) (< o2143 o328)) (and (> t2303 0) (< o2303 o328)) (and (> t2876 0) (< o2876 o328)) (and (> t2900 0) (< o2900 o328)) (and (> t3316 0) (< o3316 o328)))))") while checking expression at index 0
Graph (trivial) has 3496 edges and 256 vertex of which 252 / 256 are part of one of the 16 SCC in 12 ms
Free SCC test removed 236 places
Discarding 12 places :
Also discarding 2656 output transitions
Drop transitions removed 2656 transitions
Graph (complete) has 8 edges and 20 vertex of which 8 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.38 ms
Drop transitions removed 840 transitions
Ensure Unique test removed 112 transitions
Reduce isomorphic transitions removed 952 transitions.
Iterating post reduction 0 with 952 rules applied. Total rules applied 954 place count 8 transition count 8
Applied a total of 954 rules in 60 ms. Remains 8 /256 variables (removed 248) and now considering 8/3616 (removed 3608) transitions.
// Phase 1: matrix 8 rows 8 cols
[2020-06-03 23:38:09] [INFO ] Computed 4 place invariants in 0 ms
[2020-06-03 23:38:09] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2020-06-03 23:38:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:09] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2020-06-03 23:38:09] [INFO ] Solution in real domain found non-integer solution.
[2020-06-03 23:38:09] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2020-06-03 23:38:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-03 23:38:09] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2020-06-03 23:38:09] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints in 1 ms.
[2020-06-03 23:38:09] [INFO ] Added : 0 causal constraints over 0 iterations in 3 ms. Result :sat
Attempting to minimize the solution found.
Minimization took 7 ms.
[2020-06-03 23:38:09] [INFO ] Export to MCC properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2020-06-03 23:38:10] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 36 ms.
[2020-06-03 23:38:10] [INFO ] Flatten gal took : 421 ms
info: Time: 3600 - MCC
vrfy: Checking ReachabilityCardinality @ TokenRing-PT-015 @ 3570 seconds
vrfy: finished
info: timeLeft: 3567
rslt: Output for ReachabilityCardinality @ TokenRing-PT-015

{
"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=ReachabilityCardinality.xml",
"--mcc",
"--donotcomputecapacities",
"--encoder=simplecompressed",
"--check=modelchecking",
"--stubborn=tarjan",
"--stateequation=par",
"--timelimit=3570",
"--localtimelimit=0",
"--json=ReachabilityCardinality.json",
"--jsoninclude=formula,formulastat,net"
],
"starttime": "Wed Jun 3 23:38:11 2020
",
"timelimit": 3570
},
"child": null,
"exit":
{
"error": null,
"localtimelimitreached": true,
"memory": 88220,
"runtime": 3.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "ReachabilityCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"count":
{
"A": 1,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 4,
"adisj": 1,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "A (G ((((p16 <= 0)) OR ((1 <= p137)) OR ((p109 <= 0)) OR ((1 <= p77)))))",
"processed_size": 75,
"rewrites": 2,
"skeleton": "A(G(**))"
},
"net":
{
"arcs": 14464,
"conflict_clusters": 1,
"places": 256,
"places_significant": 240,
"singleton_clusters": 0,
"transitions": 3616
},
"task":
{
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion"
},
"threads": 1,
"type": "dfs"
},
"stateequation":
{
"literals": 4,
"problems": 4
},
"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: 3872/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 8192
lola: finding significant places
lola: 256 places, 3616 transitions, 240 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 ReachabilityCardinality.xml
lola: LP says that atomic proposition is always true: (p137 <= 1)
lola: LP says that atomic proposition is always true: (p77 <= 1)
lola: A (G ((((p16 <= 0)) OR ((1 <= p137)) OR ((p109 <= 0)) OR ((1 <= p77)))))
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 ((((p16 <= 0)) OR ((1 <= p137)) OR ((p109 <= 0)) OR ((1 <= p77)))))
lola: processed formula length: 75
lola: 2 rewrites
lola: closed formula file ReachabilityCardinality.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: 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: local time limit reached - aborting
lola: state equation task get result unparse finished++ id 0
lola: formula 0: (((1 <= p16)) AND ((p137 <= 0)) AND ((1 <= p109)) AND ((p77 <= 0)))
lola: state equation task get result unparse finished id 0
lola: state equation: Generated DNF with 4 literals and 1 conjunctive subformulas
lola: memory consumption: 88220 KB
lola: time consumption: 3 seconds
lola: print data as JSON (--json)
lola: writing JSON to ReachabilityCardinality.json
lola: closed JSON file ReachabilityCardinality.json
lola: state equation: write sara problem file to ReachabilityCardinality-0.sara
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="TokenRing-PT-015"
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 TokenRing-PT-015, 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 r194-csrt-159033390100494"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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