About the Execution of 2020-gold for Kanban-PT-05000
| Execution Summary | |||||
| Max Memory Used (MB) | Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status | 
| 4280.016 | 3600000.00 | 18114.00 | 65808.70 | FTF?????T?T?FT?? | normal | 
Execution Chart
We display below the execution chart for this examination (boot time has been removed).

Trace from the execution
Formatting '/data/fkordon/mcc2021-input.r132-tall-162075428400277.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2021-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 gold2020
    Input is Kanban-PT-05000, examination is LTLCardinality
    Time confinement is 3600 seconds
    Memory confinement is 16384 MBytes
    Number of cores is 4
    Run identifier is r132-tall-162075428400277
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 368K
-rw-r--r-- 1 mcc users  11K May  5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users  97K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users  11K May  5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users  87K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May  6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May  6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K Mar 28 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users  25K Mar 28 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users  16K Mar 28 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 27 06:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users  21K Mar 27 06:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 25 07:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users  18K Mar 25 07:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users    6 May  5 16:51 equiv_col
-rw-r--r-- 1 mcc users    6 May  5 16:51 instance
-rw-r--r-- 1 mcc users    6 May  5 16:51 iscolored
-rw-r--r-- 1 mcc users  14K May  5 16:51 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Kanban-PT-05000-00
FORMULA_NAME Kanban-PT-05000-01
FORMULA_NAME Kanban-PT-05000-02
FORMULA_NAME Kanban-PT-05000-03
FORMULA_NAME Kanban-PT-05000-04
FORMULA_NAME Kanban-PT-05000-05
FORMULA_NAME Kanban-PT-05000-06
FORMULA_NAME Kanban-PT-05000-07
FORMULA_NAME Kanban-PT-05000-08
FORMULA_NAME Kanban-PT-05000-09
FORMULA_NAME Kanban-PT-05000-10
FORMULA_NAME Kanban-PT-05000-11
FORMULA_NAME Kanban-PT-05000-12
FORMULA_NAME Kanban-PT-05000-13
FORMULA_NAME Kanban-PT-05000-14
FORMULA_NAME Kanban-PT-05000-15
=== Now, execution of the tool begins
BK_START 1620926319003
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 17:18:40] [INFO   ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML] 
[2021-05-13 17:18:40] [INFO   ] Parsing pnml file : /home/mcc/execution/model.pnml 
[2021-05-13 17:18:40] [INFO   ] Load time of PNML (sax parser for PT used): 24 ms 
[2021-05-13 17:18:40] [INFO   ] Transformed 16 places. 
[2021-05-13 17:18:40] [INFO   ] Transformed 16 transitions. 
[2021-05-13 17:18:40] [INFO   ] Parsed PT model containing 16 places and 16 transitions in 58 ms. 
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100021  steps, including 0 resets, run finished after 79 ms. (steps per millisecond=1266 ) properties seen :[0, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 1, 1, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 0, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 16 rows 16 cols
[2021-05-13 17:18:40] [INFO   ] Computed 5 place invariants in 3 ms 
[2021-05-13 17:18:40] [INFO   ] [Real]Absence check using  4 positive place invariants in 8 ms returned sat 
[2021-05-13 17:18:40] [INFO   ] [Real]Absence check using  4 positive and 1 generalized place invariants in 1 ms returned sat 
[2021-05-13 17:18:40] [INFO   ] [Real]Adding state equation constraints to refine reachable states. 
[2021-05-13 17:18:40] [INFO   ] [Real]Absence check using state equation in 11 ms returned sat 
[2021-05-13 17:18:40] [INFO   ] Solution in real domain found non-integer solution. 
[2021-05-13 17:18:40] [INFO   ] [Nat]Absence check using  4 positive place invariants in 5 ms returned sat 
[2021-05-13 17:18:40] [INFO   ] [Nat]Absence check using  4 positive and 1 generalized place invariants in 1 ms returned sat 
[2021-05-13 17:18:40] [INFO   ] [Nat]Adding state equation constraints to refine reachable states. 
[2021-05-13 17:18:40] [INFO   ] [Nat]Absence check using state equation in 9 ms returned sat 
[2021-05-13 17:18:40] [INFO   ] Computed and/alt/rep : 15/24/15 causal constraints in 7 ms. 
[2021-05-13 17:18:41] [INFO   ] Added : 14 causal constraints over 4 iterations in 37 ms. Result :sat 
[2021-05-13 17:18:41] [INFO   ] [Real]Absence check using  4 positive place invariants in 1 ms returned sat 
[2021-05-13 17:18:41] [INFO   ] [Real]Absence check using  4 positive and 1 generalized place invariants in 1 ms returned sat 
[2021-05-13 17:18:41] [INFO   ] [Real]Adding state equation constraints to refine reachable states. 
[2021-05-13 17:18:41] [INFO   ] [Real]Absence check using state equation in 7 ms returned sat 
[2021-05-13 17:18:41] [INFO   ] Solution in real domain found non-integer solution. 
[2021-05-13 17:18:41] [INFO   ] [Nat]Absence check using  4 positive place invariants in 2 ms returned sat 
[2021-05-13 17:18:41] [INFO   ] [Nat]Absence check using  4 positive and 1 generalized place invariants in 0 ms returned sat 
[2021-05-13 17:18:41] [INFO   ] [Nat]Adding state equation constraints to refine reachable states. 
[2021-05-13 17:18:41] [INFO   ] [Nat]Absence check using state equation in 7 ms returned sat 
[2021-05-13 17:18:41] [INFO   ] Computed and/alt/rep : 15/24/15 causal constraints in 2 ms. 
[2021-05-13 17:18:41] [INFO   ] Added : 14 causal constraints over 4 iterations in 18 ms. Result :sat 
[2021-05-13 17:18:41] [INFO   ] [Real]Absence check using  4 positive place invariants in 5 ms returned unsat 
[2021-05-13 17:18:41] [INFO   ] [Real]Absence check using  4 positive place invariants in 2 ms returned sat 
[2021-05-13 17:18:41] [INFO   ] [Real]Absence check using  4 positive and 1 generalized place invariants in 1 ms returned sat 
[2021-05-13 17:18:41] [INFO   ] [Real]Adding state equation constraints to refine reachable states. 
[2021-05-13 17:18:41] [INFO   ] [Real]Absence check using state equation in 14 ms returned sat 
[2021-05-13 17:18:41] [INFO   ] Solution in real domain found non-integer solution. 
[2021-05-13 17:18:41] [INFO   ] [Nat]Absence check using  4 positive place invariants in 3 ms returned sat 
[2021-05-13 17:18:41] [INFO   ] [Nat]Absence check using  4 positive and 1 generalized place invariants in 1 ms returned sat 
[2021-05-13 17:18:41] [INFO   ] [Nat]Adding state equation constraints to refine reachable states. 
[2021-05-13 17:18:41] [INFO   ] [Nat]Absence check using state equation in 6 ms returned sat 
[2021-05-13 17:18:41] [INFO   ] Computed and/alt/rep : 15/24/15 causal constraints in 4 ms. 
[2021-05-13 17:18:41] [INFO   ] Added : 14 causal constraints over 4 iterations in 20 ms. Result :sat 
[2021-05-13 17:18:41] [INFO   ] [Real]Absence check using  4 positive place invariants in 2 ms returned sat 
[2021-05-13 17:18:41] [INFO   ] [Real]Absence check using  4 positive and 1 generalized place invariants in 1 ms returned sat 
[2021-05-13 17:18:41] [INFO   ] [Real]Adding state equation constraints to refine reachable states. 
[2021-05-13 17:18:41] [INFO   ] [Real]Absence check using state equation in 6 ms returned sat 
[2021-05-13 17:18:41] [INFO   ] Computed and/alt/rep : 15/24/15 causal constraints in 2 ms. 
[2021-05-13 17:18:41] [INFO   ] Solution in real domain found non-integer solution. 
[2021-05-13 17:18:41] [INFO   ] [Nat]Absence check using  4 positive place invariants in 2 ms returned sat 
[2021-05-13 17:18:41] [INFO   ] [Nat]Absence check using  4 positive and 1 generalized place invariants in 0 ms returned sat 
[2021-05-13 17:18:41] [INFO   ] [Nat]Adding state equation constraints to refine reachable states. 
[2021-05-13 17:18:41] [INFO   ] [Nat]Absence check using state equation in 5 ms returned sat 
[2021-05-13 17:18:41] [INFO   ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms. 
[2021-05-13 17:18:41] [INFO   ] Added : 13 causal constraints over 4 iterations in 15 ms. Result :sat 
[2021-05-13 17:18:41] [INFO   ] [Real]Absence check using  4 positive place invariants in 2 ms returned sat 
[2021-05-13 17:18:41] [INFO   ] [Real]Absence check using  4 positive and 1 generalized place invariants in 1 ms returned sat 
[2021-05-13 17:18:41] [INFO   ] [Real]Adding state equation constraints to refine reachable states. 
[2021-05-13 17:18:41] [INFO   ] [Real]Absence check using state equation in 8 ms returned sat 
[2021-05-13 17:18:41] [INFO   ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms. 
[2021-05-13 17:18:41] [INFO   ] Solution in real domain found non-integer solution. 
[2021-05-13 17:18:41] [INFO   ] [Nat]Absence check using  4 positive place invariants in 3 ms returned sat 
[2021-05-13 17:18:41] [INFO   ] [Nat]Absence check using  4 positive and 1 generalized place invariants in 1 ms returned sat 
[2021-05-13 17:18:41] [INFO   ] [Nat]Adding state equation constraints to refine reachable states. 
[2021-05-13 17:18:41] [INFO   ] [Nat]Absence check using state equation in 6 ms returned sat 
[2021-05-13 17:18:41] [INFO   ] Computed and/alt/rep : 15/24/15 causal constraints in 2 ms. 
[2021-05-13 17:18:41] [INFO   ] Added : 13 causal constraints over 4 iterations in 13 ms. Result :sat 
[2021-05-13 17:18:41] [INFO   ] [Real]Absence check using  4 positive place invariants in 2 ms returned sat 
[2021-05-13 17:18:41] [INFO   ] [Real]Absence check using  4 positive and 1 generalized place invariants in 1 ms returned sat 
[2021-05-13 17:18:41] [INFO   ] [Real]Adding state equation constraints to refine reachable states. 
[2021-05-13 17:18:41] [INFO   ] [Real]Absence check using state equation in 7 ms returned sat 
[2021-05-13 17:18:41] [INFO   ] Solution in real domain found non-integer solution. 
[2021-05-13 17:18:41] [INFO   ] [Nat]Absence check using  4 positive place invariants in 2 ms returned sat 
[2021-05-13 17:18:41] [INFO   ] [Nat]Absence check using  4 positive and 1 generalized place invariants in 1 ms returned sat 
[2021-05-13 17:18:41] [INFO   ] [Nat]Adding state equation constraints to refine reachable states. 
[2021-05-13 17:18:41] [INFO   ] [Nat]Absence check using state equation in 6 ms returned sat 
[2021-05-13 17:18:41] [INFO   ] Computed and/alt/rep : 15/24/15 causal constraints in 1 ms. 
[2021-05-13 17:18:41] [INFO   ] Added : 13 causal constraints over 4 iterations in 11 ms. Result :sat 
[2021-05-13 17:18:41] [INFO   ] [Real]Absence check using  4 positive place invariants in 2 ms returned sat 
[2021-05-13 17:18:41] [INFO   ] [Real]Absence check using  4 positive and 1 generalized place invariants in 1 ms returned sat 
[2021-05-13 17:18:41] [INFO   ] [Real]Adding state equation constraints to refine reachable states. 
[2021-05-13 17:18:41] [INFO   ] [Real]Absence check using state equation in 6 ms returned sat 
[2021-05-13 17:18:41] [INFO   ] Solution in real domain found non-integer solution. 
[2021-05-13 17:18:41] [INFO   ] [Nat]Absence check using  4 positive place invariants in 2 ms returned sat 
[2021-05-13 17:18:41] [INFO   ] [Nat]Absence check using  4 positive and 1 generalized place invariants in 2 ms returned sat 
[2021-05-13 17:18:41] [INFO   ] [Nat]Adding state equation constraints to refine reachable states. 
[2021-05-13 17:18:41] [INFO   ] [Nat]Absence check using state equation in 6 ms returned sat 
[2021-05-13 17:18:41] [INFO   ] Computed and/alt/rep : 15/24/15 causal constraints in 2 ms. 
[2021-05-13 17:18:41] [INFO   ] Added : 13 causal constraints over 4 iterations in 14 ms. Result :sat 
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2021-05-13 17:18:41] [INFO   ] Initial state reduction rules for CTL removed 5 formulas. 
[2021-05-13 17:18:41] [INFO   ] Flatten gal took : 21 ms 
FORMULA Kanban-PT-05000-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-05000-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-05000-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-05000-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Kanban-PT-05000-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 17:18:41] [INFO   ] Flatten gal took : 4 ms 
[2021-05-13 17:18:41] [INFO   ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms. 
[2021-05-13 17:18:41] [INFO   ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms. 
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ Kanban-PT-05000 @ 3570 seconds
FORMULA Kanban-PT-05000-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA Kanban-PT-05000-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 0
rslt: Output for LTLCardinality @ Kanban-PT-05000
{
  "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", 
    "markinglimit": null, 
    "parameters": 
    [
      "--pnmlnet", 
      "model.pnml", 
      "--xmlformula", 
      "--formula=LTLCardinality.xml", 
      "--mcc", 
      "--donotcomputecapacities", 
      "--encoder=simplecompressed", 
      "--check=modelchecking", 
      "--stubborn=deletion", 
      "--stateequation=par", 
      "--timelimit=3570", 
      "--localtimelimit=0", 
      "--preference=force_ltl", 
      "--json=LTLCardinality.json", 
      "--jsoninclude=formula,formulastat,net"
    ], 
    "starttime": "Thu May 13 17:18:42 2021
", 
    "timelimit": 3570
  }, 
  "child": 
  [
    
    {
      "call": 
      {
        "dynamic_timelimit": true, 
        "localtimelimit": 324
      }, 
      "exit": 
      {
        "localtimelimitreached": false
      }, 
      "formula": 
      {
        "count": 
        {
          "A": 0, 
          "E": 0, 
          "F": 1, 
          "G": 1, 
          "U": 0, 
          "X": 2, 
          "aconj": 1, 
          "adisj": 1, 
          "aneg": 0, 
          "comp": 5, 
          "cont": 0, 
          "dl": 0, 
          "fir": 0, 
          "nodl": 0, 
          "place_references": 6, 
          "taut": 0, 
          "tconj": 1, 
          "tdisj": 1, 
          "tneg": 0, 
          "transition_references": 0, 
          "unfir": 0, 
          "visible_places": 3, 
          "visible_transitions": 0
        }, 
        "processed": "X ((X (((1 <= p9) OR  (2 <= p9))) AND G (F (((2 <= p9) OR ((p15 <= p0) AND (p9 <= 0)))))))", 
        "processed_size": 90, 
        "rewrites": 35
      }, 
      "result": 
      {
        "edges": 104975, 
        "markings": 74987, 
        "produced_by": "LTL model checker", 
        "value": false
      }, 
      "task": 
      {
        "buchi": 
        {
          "states": 6
        }, 
        "compoundnumber": 0, 
        "search": 
        {
          "store": 
          {
            "encoder": "simple compression", 
            "type": "prefix"
          }, 
          "stubborn": 
          {
            "type": "no (formula contains X operator)"
          }, 
          "type": "product automaton/dfs"
        }, 
        "type": "LTL", 
        "workflow": "product automaton"
      }
    }, 
    
    {
      "call": 
      {
        "dynamic_timelimit": true, 
        "localtimelimit": 356
      }, 
      "exit": 
      {
        "localtimelimitreached": false
      }, 
      "formula": 
      {
        "count": 
        {
          "A": 0, 
          "E": 0, 
          "F": 2, 
          "G": 1, 
          "U": 0, 
          "X": 3, 
          "aconj": 0, 
          "adisj": 0, 
          "aneg": 0, 
          "comp": 4, 
          "cont": 0, 
          "dl": 0, 
          "fir": 0, 
          "nodl": 0, 
          "place_references": 5, 
          "taut": 0, 
          "tconj": 2, 
          "tdisj": 1, 
          "tneg": 0, 
          "transition_references": 0, 
          "unfir": 0, 
          "visible_places": 5, 
          "visible_transitions": 0
        }, 
        "processed": "X ((X (F ((2 <= p2))) AND ((1 <= p12) OR (X (G ((3 <= p0))) AND F ((p13 <= p8))))))", 
        "processed_size": 83, 
        "rewrites": 35
      }, 
      "result": 
      {
        "edges": 40000, 
        "markings": 40000, 
        "produced_by": "LTL model checker", 
        "value": false
      }, 
      "task": 
      {
        "buchi": 
        {
          "states": 8
        }, 
        "compoundnumber": 1, 
        "search": 
        {
          "store": 
          {
            "encoder": "simple compression", 
            "type": "prefix"
          }, 
          "stubborn": 
          {
            "type": "no (formula contains X operator)"
          }, 
          "type": "product automaton/dfs"
        }, 
        "type": "LTL", 
        "workflow": "product automaton"
      }
    }
  ], 
  "exit": 
  {
    "error": null, 
    "memory": 22152, 
    "runtime": 3570.000000, 
    "signal": null, 
    "timelimitreached": true
  }, 
  "files": 
  {
    "formula": "LTLCardinality.xml", 
    "net": "model.pnml"
  }, 
  "formula": 
  {
    "skeleton": "X((X(**) AND G(F((** OR **))))) : X((X(F(**)) AND (** OR (X(G(**)) AND F(**))))) : ((** U X(**)) AND G((X(X(*)) AND *))) : X(G((F(**) AND (** OR X(**))))) : X((G(*) AND X(**))) : X(X(G((X(**) AND **)))) : X(X((F(G(**)) AND X(X(**))))) : X(X(F((F(*) OR *)))) : X((X(((** OR (G(**) AND F(**))) AND **)) OR **)) : X((** U G((X(F((X(G(*)) R *))) OR **)))) : G(F(((* R *) AND X(G(**)))))"
  }, 
  "net": 
  {
    "arcs": 40, 
    "conflict_clusters": 12, 
    "places": 16, 
    "places_significant": 11, 
    "singleton_clusters": 0, 
    "transitions": 16
  }, 
  "result": 
  {
    "interim_value": "no no unknown unknown unknown unknown unknown unknown unknown unknown unknown ", 
    "preliminary_value": "no no unknown unknown unknown unknown unknown unknown unknown unknown unknown "
  }, 
  "task": 
  {
    "type": "compound"
  }
}
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:   32/268435456 symbol table entries, 0 collisions
lola:   preprocessing... 
lola:   Size  of bit vector: 512
lola:   finding significant places
lola:   16 places, 16 transitions, 11 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 LTLCardinality.xml
lola:   X ((X (((1 <= p9) OR  (2 <= p9))) AND G ((F ((2 <= p9)) OR F (((p15 <= p0) AND (p9 <= 0))))))) : X ((F (X ((2 <= p2))) AND ((1 <= p12) OR (X (G ((3 <= p0))) AND F ((p13 <= p8)))))) : (((p8 <= p3) U X ((p8 <= p3))) AND NOT(F ((X (X ((p13 <= p14))) OR (p13 <= p14))))) : G (X (((1 <= p13) U X ((p1 <= p6))))) : X ((NOT(F ((((1 <= p12)) U (p6 <= p11)))) AND X (((p15 <= p10))))) : X (X (G ((X ((1 <= p15)) AND (p8 <= p2))))) : X (X ((F (G ((1 <= p15))) AND X (X ((p2 <= p5)))))) : X (NOT(G (X ((G ((p12 <= p5)) AND (p9 <= 0)))))) : X ((X (((G ((p8 + 1 <= p5)) U (3 <= p11)) AND (1 <= p2))) OR ((p5 <= p8) AND (3 <= p11)))) : X (((p2 <= 2) U G ((F (X (NOT((X (F ((p3 <= p13))) U (2 <= p1))))) OR (p2 <= p8))))) : F (G (F ((NOT(((p1 <= 0) U (2 <= p5))) AND X (G (((p8 <= p3) AND (2 <= p7))))))))
lola:   rewrite Frontend/Parser/formula_rewrite.k:519
lola:   rewrite Frontend/Parser/formula_rewrite.k:356
lola:   rewrite Frontend/Parser/formula_rewrite.k:332
lola:   rewrite Frontend/Parser/formula_rewrite.k:318
lola:   rewrite Frontend/Parser/formula_rewrite.k:335
lola:   rewrite Frontend/Parser/formula_rewrite.k:335
lola:   rewrite Frontend/Parser/formula_rewrite.k:297
lola:   rewrite Frontend/Parser/formula_rewrite.k:297
lola:   rewrite Frontend/Parser/formula_rewrite.k:353
lola:   rewrite Frontend/Parser/formula_rewrite.k:437
lola:   rewrite Frontend/Parser/formula_rewrite.k:356
lola:   rewrite Frontend/Parser/formula_rewrite.k:353
lola:   rewrite Frontend/Parser/formula_rewrite.k:377
lola:   rewrite Frontend/Parser/formula_rewrite.k:522
lola:   rewrite Frontend/Parser/formula_rewrite.k:434
lola:   rewrite Frontend/Parser/formula_rewrite.k:332
lola:   rewrite Frontend/Parser/formula_rewrite.k:297
lola:   rewrite Frontend/Parser/formula_rewrite.k:353
lola:   rewrite Frontend/Parser/formula_rewrite.k:335
lola:   rewrite Frontend/Parser/formula_rewrite.k:329
lola:   rewrite Frontend/Parser/formula_rewrite.k:315
lola:   rewrite Frontend/Parser/formula_rewrite.k:329
lola:   rewrite Frontend/Parser/formula_rewrite.k:297
lola:   rewrite Frontend/Parser/formula_rewrite.k:297
lola:   rewrite Frontend/Parser/formula_rewrite.k:431
lola:   rewrite Frontend/Parser/formula_rewrite.k:338
lola:   rewrite Frontend/Parser/formula_rewrite.k:335
lola:   rewrite Frontend/Parser/formula_rewrite.k:332
lola:   rewrite Frontend/Parser/formula_rewrite.k:297
lola:   rewrite Frontend/Parser/formula_rewrite.k:297
lola:   rewrite Frontend/Parser/formula_rewrite.k:356
lola:   rewrite Frontend/Parser/formula_rewrite.k:338
lola:   rewrite Frontend/Parser/formula_rewrite.k:297
lola:   rewrite Frontend/Parser/formula_rewrite.k:297
lola:   rewrite Frontend/Parser/formula_rewrite.k:371
lola:   computing a collection of formulas
lola: RUNNING
lola:   subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola:   ========================================
lola:   ...considering subproblem: X ((X (((1 <= p9) OR  (2 <= p9))) AND G (F (((2 <= p9) OR ((p15 <= p0) AND (p9 <= 0)))))))
lola:   ========================================
lola:   SUBTASK
lola:     checking LTL
lola:     transforming LTL-Formula into a Büchi-Automaton
lola:     processed formula: X ((X (((1 <= p9) OR  (2 <= p9))) AND G (F (((2 <= p9) OR ((p15 <= p0) AND (p9 <= 0)))))))
lola:     processed formula length: 90
lola:     35 rewrites
lola:     closed formula file LTLCardinality.xml
lola:     the resulting Büchi automaton has 6 states
lola:   STORE
lola:     using a simple compression encoder (--encoder=simplecompressed)
lola:     using a prefix tree store (--store=prefix)
lola:     Formula contains X operator; stubborn sets not applicable
lola:     Formula contains X operator; stubborn sets not applicable
lola:   SEARCH
lola:   RUNNING
lola:   SUBRESULT
lola:     result: no
lola:     produced by: LTL model checker
lola:     The net does not satisfy the given formula (language of the product automaton is nonempty).
lola:     74987 markings, 104975 edges
lola:   ========================================
lola:   subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola:   ========================================
lola:   ...considering subproblem: X ((X (F ((2 <= p2))) AND ((1 <= p12) OR (X (G ((3 <= p0))) AND F ((p13 <= p8))))))
lola:   ========================================
lola:   SUBTASK
lola:     checking LTL
lola:     transforming LTL-Formula into a Büchi-Automaton
lola:     processed formula: X ((X (F ((2 <= p2))) AND ((1 <= p12) OR (X (G ((3 <= p0))) AND F ((p13 <= p8))))))
lola:     processed formula length: 83
lola:     35 rewrites
lola:     closed formula file LTLCardinality.xml
lola:     the resulting Büchi automaton has 8 states
lola:   STORE
lola:     using a simple compression encoder (--encoder=simplecompressed)
lola:     using a prefix tree store (--store=prefix)
lola:     Formula contains X operator; stubborn sets not applicable
lola:     Formula contains X operator; stubborn sets not applicable
lola:   SEARCH
lola:   RUNNING
lola:   SUBRESULT
lola:     result: no
lola:     produced by: LTL model checker
lola:     The net does not satisfy the given formula (language of the product automaton is nonempty).
lola:     40000 markings, 40000 edges
lola:   ========================================
lola:   subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola:   ========================================
lola:   ...considering subproblem: (((p8 <= p3) U X ((p8 <= p3))) AND G ((X (X ((p14 + 1 <= p13))) AND (p14 + 1 <= p13))))
lola:   ========================================
lola:   SUBTASK
lola:     checking a Boolean combination of formulas
lola:   RUNNING
lola:     subprocess 2 will run for 396 seconds at most (--localtimelimit=0)
lola:     ========================================
lola:     ...considering subproblem: ((p8 <= p3) U X ((p8 <= p3)))
lola:     ========================================
lola:     SUBTASK
lola:       checking LTL
lola:       transforming LTL-Formula into a Büchi-Automaton
lola:       processed formula: ((p8 <= p3) U X ((p8 <= p3)))
lola:       processed formula length: 29
lola:       35 rewrites
lola:       closed formula file LTLCardinality.xml
lola:       the resulting Büchi automaton has 4 states
lola:     STORE
lola:       using a simple compression encoder (--encoder=simplecompressed)
lola:       using a prefix tree store (--store=prefix)
lola:       Formula contains X operator; stubborn sets not applicable
lola:       Formula contains X operator; stubborn sets not applicable
lola:     SEARCH
lola:     RUNNING
lola:     SUBRESULT
lola:       result: yes
lola:       produced by: LTL model checker
lola:       The net satisfies the given formula (language of the product automaton is empty).
lola:       2 markings, 1 edges
lola:     ========================================
lola:     local time limit reached - aborting
lola:     
preliminary result: no no unknown unknown unknown unknown unknown unknown unknown unknown unknown 
lola: caught signal User defined signal 1 - aborting LoLA
lola: memory consumption: 22152 KB
lola: time consumption: 399 seconds
lola:     print data as JSON (--json)
lola:     writing JSON to LTLCardinality.json
lola:     closed JSON file LTLCardinality.json
lola:   time limit reached - aborting
lola:   
preliminary result: no no unknown unknown unknown unknown unknown unknown unknown unknown unknown 
lola:   
preliminary result: no no unknown unknown unknown unknown unknown unknown unknown unknown unknown 
lola: memory consumption: 22152 KB
lola: time consumption: 3570 seconds
lola:   print data as JSON (--json)
lola:   writing JSON to LTLCardinality.json
lola:   closed JSON file LTLCardinality.json
rslt: finished
TIME LIMIT: Killed by timeout after 3600 seconds 
MemTotal:       16427332 kB
MemFree:        16125968 kB
After kill :
MemTotal:       16427332 kB
MemFree:        16126212 kB
--------------------
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="Kanban-PT-05000"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2020"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
	rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo "    Executing tool gold2020"
echo "    Input is Kanban-PT-05000, examination is LTLCardinality"
echo "    Time confinement is $BK_TIME_CONFINEMENT seconds"
echo "    Memory confinement is 16384 MBytes"
echo "    Number of cores is 4"
echo "    Run identifier is r132-tall-162075428400277"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Kanban-PT-05000.tgz
mv Kanban-PT-05000 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
	echo "The expected result is a vector of positive values"
	echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
	echo "here is the order used to build the result vector(from text file)"
	for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
		echo "FORMULA_NAME $x"
	done
elif [ -f "LTLCardinality.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 '
		echo "FORMULA_NAME $x"
	done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
	echo "FORMULA_NAME LTLCardinality"
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 ;

