Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2020-input.r168-smll-158987806700425.qcow2', fmt=qcow2 size=4294967296 backing_file='/data/fkordon/mcc2020-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itslola
Input is CloudOpsManagement-PT-00640by00320, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-smll-158987806700425
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 212K
-rw-r--r-- 1 mcc users 4.2K Mar 30 01:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 19K Mar 30 01:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 28 16:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 28 16:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.3K Apr 8 14:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 28 14:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 8 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 28 14:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 27 08:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 27 08:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.4K Mar 26 08:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 26 08:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Mar 28 14:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Mar 28 14:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 13 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 17K 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 CloudOpsManagement-PT-00640by00320-00
FORMULA_NAME CloudOpsManagement-PT-00640by00320-01
FORMULA_NAME CloudOpsManagement-PT-00640by00320-02
FORMULA_NAME CloudOpsManagement-PT-00640by00320-03
FORMULA_NAME CloudOpsManagement-PT-00640by00320-04
FORMULA_NAME CloudOpsManagement-PT-00640by00320-05
FORMULA_NAME CloudOpsManagement-PT-00640by00320-06
FORMULA_NAME CloudOpsManagement-PT-00640by00320-07
FORMULA_NAME CloudOpsManagement-PT-00640by00320-08
FORMULA_NAME CloudOpsManagement-PT-00640by00320-09
FORMULA_NAME CloudOpsManagement-PT-00640by00320-10
FORMULA_NAME CloudOpsManagement-PT-00640by00320-11
FORMULA_NAME CloudOpsManagement-PT-00640by00320-12
FORMULA_NAME CloudOpsManagement-PT-00640by00320-13
FORMULA_NAME CloudOpsManagement-PT-00640by00320-14
FORMULA_NAME CloudOpsManagement-PT-00640by00320-15

=== Now, execution of the tool begins

BK_START 1591350281259

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-05 09:44:43] [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]
[2020-06-05 09:44:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-05 09:44:44] [INFO ] Load time of PNML (sax parser for PT used): 37 ms
[2020-06-05 09:44:44] [INFO ] Transformed 27 places.
[2020-06-05 09:44:44] [INFO ] Transformed 29 transitions.
[2020-06-05 09:44:44] [INFO ] Parsed PT model containing 27 places and 29 transitions in 91 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 23 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100036 steps, including 0 resets, run finished after 89 ms. (steps per millisecond=1124 ) properties seen :[0, 1, 0, 0, 0, 0, 1, 1, 1, 1, 1, 1, 1, 0, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 0, 0, 0, 0, 1, 1, 0, 0, 0]
// Phase 1: matrix 29 rows 27 cols
[2020-06-05 09:44:44] [INFO ] Computed 11 place invariants in 4 ms
[2020-06-05 09:44:44] [INFO ] [Real]Absence check using 11 positive place invariants in 31 ms returned sat
[2020-06-05 09:44:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 09:44:44] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2020-06-05 09:44:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 09:44:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 20 ms returned sat
[2020-06-05 09:44:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 09:44:44] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2020-06-05 09:44:44] [INFO ] State equation strengthened by 3 read => feed constraints.
[2020-06-05 09:44:44] [INFO ] [Nat]Added 3 Read/Feed constraints in 3 ms returned sat
[2020-06-05 09:44:44] [INFO ] Deduced a trap composed of 4 places in 43 ms
[2020-06-05 09:44:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2020-06-05 09:44:44] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 6 ms.
[2020-06-05 09:44:44] [INFO ] Added : 26 causal constraints over 6 iterations in 64 ms. Result :sat
[2020-06-05 09:44:44] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2020-06-05 09:44:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 09:44:44] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2020-06-05 09:44:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 09:44:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2020-06-05 09:44:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 09:44:44] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2020-06-05 09:44:44] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 09:44:44] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 4 ms.
[2020-06-05 09:44:44] [INFO ] Added : 25 causal constraints over 6 iterations in 40 ms. Result :sat
[2020-06-05 09:44:44] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2020-06-05 09:44:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 09:44:44] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2020-06-05 09:44:44] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 09:44:44] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2020-06-05 09:44:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 09:44:44] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2020-06-05 09:44:44] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 09:44:44] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 8 ms.
[2020-06-05 09:44:44] [INFO ] Added : 25 causal constraints over 6 iterations in 40 ms. Result :sat
[2020-06-05 09:44:44] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2020-06-05 09:44:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 09:44:45] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2020-06-05 09:44:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 09:44:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2020-06-05 09:44:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 09:44:45] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2020-06-05 09:44:45] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 09:44:45] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 5 ms.
[2020-06-05 09:44:45] [INFO ] Added : 25 causal constraints over 6 iterations in 36 ms. Result :sat
[2020-06-05 09:44:45] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned unsat
[2020-06-05 09:44:45] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2020-06-05 09:44:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 09:44:45] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2020-06-05 09:44:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 09:44:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2020-06-05 09:44:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 09:44:45] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2020-06-05 09:44:45] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 09:44:45] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 4 ms.
[2020-06-05 09:44:45] [INFO ] Added : 25 causal constraints over 6 iterations in 33 ms. Result :sat
[2020-06-05 09:44:45] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2020-06-05 09:44:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 09:44:45] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2020-06-05 09:44:45] [INFO ] [Real]Added 3 Read/Feed constraints in 7 ms returned sat
[2020-06-05 09:44:45] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 4 ms.
[2020-06-05 09:44:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 09:44:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 9 ms returned sat
[2020-06-05 09:44:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 09:44:45] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2020-06-05 09:44:45] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 09:44:45] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 4 ms.
[2020-06-05 09:44:45] [INFO ] Added : 25 causal constraints over 6 iterations in 32 ms. Result :sat
[2020-06-05 09:44:45] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned unsat
[2020-06-05 09:44:45] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned unsat
[2020-06-05 09:44:45] [INFO ] [Real]Absence check using 11 positive place invariants in 2 ms returned unsat
[2020-06-05 09:44:45] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2020-06-05 09:44:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 09:44:45] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2020-06-05 09:44:45] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 09:44:45] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 4 ms.
[2020-06-05 09:44:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 09:44:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2020-06-05 09:44:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 09:44:45] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2020-06-05 09:44:45] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 09:44:45] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2020-06-05 09:44:45] [INFO ] Added : 25 causal constraints over 6 iterations in 29 ms. Result :sat
[2020-06-05 09:44:45] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned unsat
[2020-06-05 09:44:45] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned unsat
[2020-06-05 09:44:45] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned unsat
[2020-06-05 09:44:45] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned unsat
[2020-06-05 09:44:45] [INFO ] [Real]Absence check using 11 positive place invariants in 5 ms returned sat
[2020-06-05 09:44:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 09:44:45] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2020-06-05 09:44:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 09:44:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 12 ms returned sat
[2020-06-05 09:44:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 09:44:45] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2020-06-05 09:44:45] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 09:44:45] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2020-06-05 09:44:45] [INFO ] Added : 25 causal constraints over 5 iterations in 25 ms. Result :sat
[2020-06-05 09:44:45] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2020-06-05 09:44:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 09:44:45] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2020-06-05 09:44:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 09:44:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2020-06-05 09:44:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 09:44:45] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2020-06-05 09:44:45] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 09:44:45] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 5 ms.
[2020-06-05 09:44:45] [INFO ] Added : 22 causal constraints over 5 iterations in 36 ms. Result :sat
[2020-06-05 09:44:45] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2020-06-05 09:44:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 09:44:45] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2020-06-05 09:44:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 09:44:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2020-06-05 09:44:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 09:44:45] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2020-06-05 09:44:45] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 09:44:45] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2020-06-05 09:44:45] [INFO ] Added : 25 causal constraints over 6 iterations in 32 ms. Result :sat
[2020-06-05 09:44:45] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned unsat
[2020-06-05 09:44:45] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2020-06-05 09:44:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 09:44:45] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2020-06-05 09:44:45] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 09:44:45] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2020-06-05 09:44:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 09:44:45] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2020-06-05 09:44:45] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 09:44:45] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2020-06-05 09:44:45] [INFO ] Added : 22 causal constraints over 5 iterations in 33 ms. Result :sat
[2020-06-05 09:44:45] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned unsat
[2020-06-05 09:44:46] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2020-06-05 09:44:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 09:44:46] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2020-06-05 09:44:46] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 09:44:46] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 2 ms.
[2020-06-05 09:44:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 09:44:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 6 ms returned sat
[2020-06-05 09:44:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 09:44:46] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2020-06-05 09:44:46] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 09:44:46] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 4 ms.
[2020-06-05 09:44:46] [INFO ] Added : 25 causal constraints over 6 iterations in 30 ms. Result :sat
[2020-06-05 09:44:46] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2020-06-05 09:44:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 09:44:46] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2020-06-05 09:44:46] [INFO ] [Real]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 09:44:46] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2020-06-05 09:44:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 09:44:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 8 ms returned sat
[2020-06-05 09:44:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 09:44:46] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2020-06-05 09:44:46] [INFO ] [Nat]Added 3 Read/Feed constraints in 1 ms returned sat
[2020-06-05 09:44:46] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 3 ms.
[2020-06-05 09:44:46] [INFO ] Added : 25 causal constraints over 5 iterations in 31 ms. Result :sat
[2020-06-05 09:44:46] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2020-06-05 09:44:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-05 09:44:46] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2020-06-05 09:44:46] [INFO ] Solution in real domain found non-integer solution.
[2020-06-05 09:44:46] [INFO ] [Nat]Absence check using 11 positive place invariants in 7 ms returned sat
[2020-06-05 09:44:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2020-06-05 09:44:46] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2020-06-05 09:44:46] [INFO ] [Nat]Added 3 Read/Feed constraints in 2 ms returned sat
[2020-06-05 09:44:46] [INFO ] Computed and/alt/rep : 26/69/26 causal constraints in 4 ms.
[2020-06-05 09:44:46] [INFO ] Added : 25 causal constraints over 6 iterations in 61 ms. Result :sat
Successfully simplified 10 atomic propositions for a total of 10 simplifications.
[2020-06-05 09:44:46] [INFO ] Initial state reduction rules for CTL removed 4 formulas.
[2020-06-05 09:44:46] [INFO ] Flatten gal took : 55 ms
FORMULA CloudOpsManagement-PT-00640by00320-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-00640by00320-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-00640by00320-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudOpsManagement-PT-00640by00320-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2020-06-05 09:44:46] [INFO ] Flatten gal took : 13 ms
[2020-06-05 09:44:46] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 6 ms.
[2020-06-05 09:44:46] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 2 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ CloudOpsManagement-PT-00640by00320 @ 3570 seconds

FORMULA CloudOpsManagement-PT-00640by00320-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00640by00320-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00640by00320-05 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00640by00320-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00640by00320-08 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00640by00320-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00640by00320-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00640by00320-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00640by00320-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00640by00320-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00640by00320-11 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CloudOpsManagement-PT-00640by00320-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 3176
rslt: Output for LTLCardinality @ CloudOpsManagement-PT-00640by00320

{
"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": "Fri Jun 5 09:44:48 2020
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 297
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 2,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((F (G ((p14 <= p1))) OR X (G ((p6 <= 1)))))",
"processed_size": 46,
"rewrites": 56
},
"result":
{
"edges": 336,
"markings": 332,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"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": 324
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 324
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p18 <= p20)",
"processed_size": 12,
"rewrites": 56
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p25 <= 2)",
"processed_size": 10,
"rewrites": 58
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 5
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "X (F ((G ((p12 <= p24)) OR (p18 <= p20))))",
"processed_size": 42,
"rewrites": 56
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 1,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p2 <= 1)",
"processed_size": 9,
"rewrites": 58
},
"result":
{
"edges": 1281,
"markings": 1281,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 2,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((1 <= p15))",
"processed_size": 14,
"rewrites": 56
},
"result":
{
"edges": 1925,
"markings": 1925,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 396
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((1 <= p21))",
"processed_size": 14,
"rewrites": 56
},
"result":
{
"edges": 1925,
"markings": 1925,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 3,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 0,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (F ((F ((p21 <= 0)) AND F ((p12 <= p5)))))",
"processed_size": 44,
"rewrites": 56
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 4,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": true
},
"task":
{
"compoundnumber": 3,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"aconj": 1,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 3,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (F (((2 <= p10) AND (p24 <= p18))))",
"processed_size": 37,
"rewrites": 56
},
"result":
{
"edges": 3,
"markings": 4,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 4,
"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": 509
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 1,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 2,
"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": "X (X ((F ((p22 <= p18)) U X ((p3 + 1 <= p26)))))",
"processed_size": 48,
"rewrites": 56
},
"result":
{
"edges": 96,
"markings": 57,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 6
},
"compoundnumber": 5,
"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": 673
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G (F ((p25 + 1 <= p14)))",
"processed_size": 24,
"rewrites": 56
},
"result":
{
"edges": 325,
"markings": 325,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 7,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 841
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G ((p11 <= 0))",
"processed_size": 14,
"rewrites": 56
},
"result":
{
"edges": 325,
"markings": 325,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 8,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1121
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((p1 + 1 <= p10))",
"processed_size": 19,
"rewrites": 56
},
"result":
{
"edges": 322,
"markings": 322,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 9,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1682
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 2,
"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": 4,
"visible_transitions": 0
},
"processed": "F (G (((F ((2 <= p4)) AND (2 <= p8)) OR ((p5 <= 2) AND (p5 + 1 <= p10) AND (p8 <= 1)))))",
"processed_size": 88,
"rewrites": 56
},
"result":
{
"edges": 331,
"markings": 329,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 10,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3365
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 3365
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p24 <= p2)",
"processed_size": 11,
"rewrites": 56
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 11,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 11,
"type": "boolean"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p24 <= p2)",
"processed_size": 11,
"rewrites": 56
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 13,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p2 <= 2)",
"processed_size": 9,
"rewrites": 58
},
"result":
{
"edges": 1281,
"markings": 1281,
"produced_by": "state space / EG",
"value": false
},
"task":
{
"compoundnumber": 14,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 4
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 13,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3784,
"runtime": 394.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X((F(G(**)) OR X(G(*)))) : F(G(((F(**) AND *) OR *))) : (X(F((G(**) OR **))) AND (F(**) AND **)) : (G(**) OR (F(**) AND X(G(*)))) : (X(F((F(*) AND F(**)))) OR G(**)) : X(F(**)) : G(*) : X(X((F(**) U X(*)))) : X((F(*) AND (G(**) AND F(**)))) : G(F(*)) : G(**) : (F(**) AND (G((G(**) OR **)) OR **))"
},
"net":
{
"arcs": 94,
"conflict_clusters": 11,
"places": 27,
"places_significant": 16,
"singleton_clusters": 0,
"transitions": 29
},
"result":
{
"preliminary_value": "no no yes no yes yes no yes unknown no no no ",
"value": "no no yes no yes yes no yes unknown no no no "
},
"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: 56/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 864
lola: finding significant places
lola: 27 places, 29 transitions, 16 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 ((F (X (G (X ((p14 <= p1))))) OR NOT(F (X ((2 <= p6)))))) : NOT(F (G (F (((NOT(F ((2 <= p4))) OR (p8 <= 1)) AND ((3 <= p5) OR (p10 <= p5) OR (2 <= p8))))))) : ((F (X ((G ((p12 <= p24)) OR (p18 <= p20)))) AND F ((X (G ((p12 <= p24))) U (3 <= p25)))) AND (p18 <= p20)) : (G ((1 <= p15)) OR (F ((2 <= p2)) AND NOT(F (X ((2 <= p2)))))) : (F (X ((NOT(G ((1 <= p21))) AND F ((p12 <= p5))))) OR G ((1 <= p21))) : X (F (((1 <= 0) U ((2 <= p10) AND (p24 <= p18))))) : NOT(F ((p10 <= p1))) : X (((X ((1 <= p5)) U X (F (((0 <= 0) U (p22 <= p18))))) U NOT(X (X ((p26 <= p3)))))) : X (((NOT(G ((1 <= p25))) AND G ((p18 <= p26))) AND F ((p1 <= p7)))) : F (NOT(X (X (F (G (F (X (G ((p14 <= p25)))))))))) : G ((p11 <= 0)) : (F ((3 <= p2)) AND (G ((G ((3 <= p22)) OR ((p24 <= p2) AND (3 <= p22)))) OR (p24 <= p2)))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
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:434
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:356
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:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:185
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:410
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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:410
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:251
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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 297 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (G ((p14 <= p1))) OR X (G ((p6 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (G ((p14 <= p1))) OR X (G ((p6 <= 1)))))
lola: processed formula length: 46
lola: 56 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 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: add low 25
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: 332 markings, 336 edges
lola: ========================================
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((G ((p12 <= p24)) OR (p18 <= p20)))) AND (F ((3 <= p25)) AND (p18 <= p20)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 1 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p18 <= p20)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p18 <= p20)
lola: processed formula length: 12
lola: 56 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((3 <= p25))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p25 <= 2)
lola: processed formula length: 10
lola: 58 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((G ((p12 <= p24)) OR (p18 <= p20))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((G ((p12 <= p24)) OR (p18 <= p20))))
lola: processed formula length: 42
lola: 56 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 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: 4 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (G ((1 <= p15)) OR (F ((2 <= p2)) AND X (G ((p2 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((2 <= p2))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p2 <= 1)
lola: processed formula length: 9
lola: 58 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 1281 markings, 1281 edges
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((1 <= p15))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p15))
lola: processed formula length: 14
lola: 56 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
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: 1925 markings, 1925 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((F ((p21 <= 0)) AND F ((p12 <= p5))))) OR G ((1 <= p21)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 3 will run for 396 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((1 <= p21))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((1 <= p21))
lola: processed formula length: 14
lola: 56 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
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: 1925 markings, 1925 edges
lola: ========================================
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((F ((p21 <= 0)) AND F ((p12 <= p5)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((F ((p21 <= 0)) AND F ((p12 <= p5)))))
lola: processed formula length: 44
lola: 56 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: 4 markings, 3 edges
lola: ========================================
lola: SUBRESULT
lola: result: yes
lola: The Boolean predicate is true.
lola: ========================================
lola: subprocess 4 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F (((2 <= p10) AND (p24 <= p18))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F (((2 <= p10) AND (p24 <= p18))))
lola: processed formula length: 37
lola: 56 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 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: 4 markings, 3 edges
lola: ========================================
lola: subprocess 5 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X ((F ((p22 <= p18)) U X ((p3 + 1 <= p26)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X ((F ((p22 <= p18)) U X ((p3 + 1 <= p26)))))
lola: processed formula length: 48
lola: 56 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 57 markings, 96 edges
lola: ========================================
lola: subprocess 6 will run for 594 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F ((p25 <= 0)) AND (G ((p18 <= p26)) AND F ((p1 <= p7)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((p25 <= 0)) AND (G ((p18 <= p26)) AND F ((p1 <= p7)))))
lola: processed formula length: 62
lola: 56 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 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: 3166157 markings, 4777560 edges, 633231 markings/sec, 0 secs
lola: 6391447 markings, 9632520 edges, 645058 markings/sec, 5 secs
lola: 9486891 markings, 14289293 edges, 619089 markings/sec, 10 secs
lola: 12645081 markings, 19039015 edges, 631638 markings/sec, 15 secs
lola: 15819415 markings, 23812030 edges, 634867 markings/sec, 20 secs
lola: 18614864 markings, 28014700 edges, 559090 markings/sec, 25 secs
lola: 21551819 markings, 32429605 edges, 587391 markings/sec, 30 secs
lola: 25070764 markings, 37719302 edges, 703789 markings/sec, 35 secs
lola: 28589702 markings, 43008778 edges, 703788 markings/sec, 40 secs
lola: 31776557 markings, 47798744 edges, 637371 markings/sec, 45 secs
lola: 35175763 markings, 52908332 edges, 679841 markings/sec, 50 secs
lola: 38490438 markings, 57890702 edges, 662935 markings/sec, 55 secs
lola: 41823055 markings, 62900022 edges, 666523 markings/sec, 60 secs
lola: 45035895 markings, 67729217 edges, 642568 markings/sec, 65 secs
lola: 48435914 markings, 72840019 edges, 680004 markings/sec, 70 secs
lola: 51701745 markings, 77748836 edges, 653166 markings/sec, 75 secs
lola: 54997455 markings, 82702756 edges, 659142 markings/sec, 80 secs
lola: 58188970 markings, 87499985 edges, 638303 markings/sec, 85 secs
lola: 61325685 markings, 92214948 edges, 627343 markings/sec, 90 secs
lola: 64419647 markings, 96865466 edges, 618792 markings/sec, 95 secs
lola: 67617948 markings, 101672986 edges, 639660 markings/sec, 100 secs
lola: 70832168 markings, 106504377 edges, 642844 markings/sec, 105 secs
lola: 73665947 markings, 110764576 edges, 566756 markings/sec, 110 secs
lola: 74912943 markings, 112638113 edges, 249399 markings/sec, 115 secs
lola: 76938246 markings, 115683604 edges, 405061 markings/sec, 120 secs
lola: 78891294 markings, 118618226 edges, 390610 markings/sec, 125 secs
lola: 81459179 markings, 122478067 edges, 513577 markings/sec, 130 secs
lola: 81559170 markings, 122628263 edges, 19998 markings/sec, 135 secs
lola: 82585216 markings, 124170626 edges, 205209 markings/sec, 140 secs
lola: 84284919 markings, 126725461 edges, 339941 markings/sec, 145 secs
lola: 84909722 markings, 127664560 edges, 124961 markings/sec, 150 secs
lola: 86269003 markings, 129707881 edges, 271856 markings/sec, 155 secs
lola: 87428951 markings, 131451363 edges, 231990 markings/sec, 160 secs
lola: 89134163 markings, 134014634 edges, 341042 markings/sec, 165 secs
lola: 90215392 markings, 135639813 edges, 216246 markings/sec, 170 secs
lola: 91013517 markings, 136839435 edges, 159625 markings/sec, 175 secs
lola: 91274571 markings, 137231783 edges, 52211 markings/sec, 180 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 7 will run for 673 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p25 + 1 <= p14)))
lola: ========================================
lola: SUBTASK
lola: checking fairness
lola: fairness not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((p25 + 1 <= p14)))
lola: processed formula length: 24
lola: 56 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
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: 325 markings, 325 edges
lola: ========================================
lola: subprocess 8 will run for 841 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p11 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p11 <= 0))
lola: processed formula length: 14
lola: 56 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
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: 325 markings, 325 edges
lola: ========================================
lola: subprocess 9 will run for 1121 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p1 + 1 <= p10))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p1 + 1 <= p10))
lola: processed formula length: 19
lola: 56 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
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: 322 markings, 322 edges
lola: ========================================
lola: subprocess 10 will run for 1682 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G (((F ((2 <= p4)) AND (2 <= p8)) OR ((p5 <= 2) AND (p5 + 1 <= p10) AND (p8 <= 1)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G (((F ((2 <= p4)) AND (2 <= p8)) OR ((p5 <= 2) AND (p5 + 1 <= p10) AND (p8 <= 1)))))
lola: processed formula length: 88
lola: 56 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: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: add low 2
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: 329 markings, 331 edges
lola: ========================================
lola: subprocess 11 will run for 3365 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F ((3 <= p2)) AND (G ((G ((3 <= p22)) OR ((p24 <= p2) AND (3 <= p22)))) OR (p24 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 11 will run for 3365 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p24 <= p2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p24 <= p2)
lola: processed formula length: 11
lola: 56 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X ((F ((p25 <= 0)) AND (G ((p18 <= p26)) AND F ((p1 <= p7)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F ((p25 <= 0)) AND (G ((p18 <= p26)) AND F ((p1 <= p7)))))
lola: processed formula length: 62
lola: 56 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 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: 3181684 markings, 4800956 edges, 636337 markings/sec, 0 secs
lola: 6404255 markings, 9651760 edges, 644514 markings/sec, 5 secs
lola: 9525772 markings, 14347748 edges, 624303 markings/sec, 10 secs
lola: 12517630 markings, 18847331 edges, 598372 markings/sec, 15 secs
lola: 15609221 markings, 23495891 edges, 618318 markings/sec, 20 secs
lola: 18592056 markings, 27980297 edges, 596567 markings/sec, 25 secs
lola: 21461052 markings, 32293047 edges, 573799 markings/sec, 30 secs
lola: 24971394 markings, 37569734 edges, 702068 markings/sec, 35 secs
lola: 28432210 markings, 42771833 edges, 692163 markings/sec, 40 secs
lola: 31880893 markings, 47955686 edges, 689737 markings/sec, 45 secs
lola: 35282693 markings, 53069031 edges, 680360 markings/sec, 50 secs
lola: 38604214 markings, 58061595 edges, 664304 markings/sec, 55 secs
lola: 41962633 markings, 63109696 edges, 671684 markings/sec, 60 secs
lola: 45053450 markings, 67755658 edges, 618163 markings/sec, 65 secs
lola: 48494547 markings, 72928206 edges, 688219 markings/sec, 70 secs
lola: 51822616 markings, 77930714 edges, 665614 markings/sec, 75 secs
lola: 55140363 markings, 82917633 edges, 663549 markings/sec, 80 secs
lola: 58357418 markings, 87753209 edges, 643411 markings/sec, 85 secs
lola: 61753666 markings, 92858305 edges, 679250 markings/sec, 90 secs
lola: 65049805 markings, 97812816 edges, 659228 markings/sec, 95 secs
lola: 68231327 markings, 102594933 edges, 636304 markings/sec, 100 secs
lola: 71458817 markings, 107446326 edges, 645498 markings/sec, 105 secs
lola: 74402323 markings, 111872739 edges, 588701 markings/sec, 110 secs
lola: 75053618 markings, 112850663 edges, 130259 markings/sec, 115 secs
lola: 76850518 markings, 115552434 edges, 359380 markings/sec, 120 secs
lola: 78339379 markings, 117788736 edges, 297772 markings/sec, 125 secs
lola: 80850764 markings, 121563576 edges, 502277 markings/sec, 130 secs
lola: 83521021 markings, 125577380 edges, 534051 markings/sec, 135 secs
lola: 83697255 markings, 125842163 edges, 35247 markings/sec, 140 secs
lola: 85636519 markings, 128757234 edges, 387853 markings/sec, 145 secs
lola: 86428248 markings, 129947203 edges, 158346 markings/sec, 150 secs
lola: 88058007 markings, 132396992 edges, 325952 markings/sec, 155 secs
lola: 89309508 markings, 134278066 edges, 250300 markings/sec, 160 secs
lola: 91137430 markings, 137025658 edges, 365584 markings/sec, 165 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (F ((3 <= p2)) AND (G ((G ((3 <= p22)) OR ((p24 <= p2) AND (3 <= p22)))) OR (p24 <= p2)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: (p24 <= p2)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p24 <= p2)
lola: processed formula length: 11
lola: 56 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: preprocessing
lola: The net satisfies the property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F ((3 <= p2))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p2 <= 2)
lola: processed formula length: 9
lola: 58 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: state space / EG
lola: The predicate does not eventually occur.
lola: 1281 markings, 1281 edges
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: ========================================
lola: RESULT
lola:
SUMMARY: no no yes no yes yes no yes unknown no no no
lola:
preliminary result: no no yes no yes yes no yes unknown no no no
lola: memory consumption: 3784 KB
lola: time consumption: 394 seconds
lola: print data as JSON (--json)
lola: writing JSON to LTLCardinality.json
lola: closed JSON file LTLCardinality.json
rslt: finished

--------------------
content from stderr:

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CloudOpsManagement-PT-00640by00320"
export BK_EXAMINATION="LTLCardinality"
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 CloudOpsManagement-PT-00640by00320, 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 r168-smll-158987806700425"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CloudOpsManagement-PT-00640by00320.tgz
mv CloudOpsManagement-PT-00640by00320 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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;