Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2021-input.r056-oct2-162038334400017.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2021-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool gold2020
Input is CircadianClock-PT-010000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r056-oct2-162038334400017
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 388K
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 153K May 10 09:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 10 09:42 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Mar 28 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Mar 23 03:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 17K Mar 23 03:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Mar 22 12:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 22 12:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 22 09:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 09:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 7 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 11K 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 CircadianClock-PT-010000-00
FORMULA_NAME CircadianClock-PT-010000-01
FORMULA_NAME CircadianClock-PT-010000-02
FORMULA_NAME CircadianClock-PT-010000-03
FORMULA_NAME CircadianClock-PT-010000-04
FORMULA_NAME CircadianClock-PT-010000-05
FORMULA_NAME CircadianClock-PT-010000-06
FORMULA_NAME CircadianClock-PT-010000-07
FORMULA_NAME CircadianClock-PT-010000-08
FORMULA_NAME CircadianClock-PT-010000-09
FORMULA_NAME CircadianClock-PT-010000-10
FORMULA_NAME CircadianClock-PT-010000-11
FORMULA_NAME CircadianClock-PT-010000-12
FORMULA_NAME CircadianClock-PT-010000-13
FORMULA_NAME CircadianClock-PT-010000-14
FORMULA_NAME CircadianClock-PT-010000-15

=== Now, execution of the tool begins

BK_START 1620896328939

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-13 08:58:51] [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 08:58:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-13 08:58:51] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2021-05-13 08:58:51] [INFO ] Transformed 14 places.
[2021-05-13 08:58:51] [INFO ] Transformed 16 transitions.
[2021-05-13 08:58:51] [INFO ] Parsed PT model containing 14 places and 16 transitions in 57 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100010 steps, including 0 resets, run finished after 71 ms. (steps per millisecond=1408 ) properties seen :[0, 0, 0, 1, 0, 1, 1, 0, 0, 0, 1, 1, 0, 1, 0, 0, 1, 0, 1, 0, 1, 1, 0, 1, 0, 1, 0, 0, 1, 1, 0, 1, 1, 0, 0, 1, 1]
[2021-05-13 08:58:51] [INFO ] Flow matrix only has 14 transitions (discarded 2 similar events)
// Phase 1: matrix 14 rows 14 cols
[2021-05-13 08:58:51] [INFO ] Computed 7 place invariants in 3 ms
[2021-05-13 08:58:51] [INFO ] [Real]Absence check using 7 positive place invariants in 14 ms returned sat
[2021-05-13 08:58:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 08:58:51] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2021-05-13 08:58:51] [INFO ] State equation strengthened by 4 read => feed constraints.
[2021-05-13 08:58:51] [INFO ] [Real]Added 4 Read/Feed constraints in 7 ms returned sat
[2021-05-13 08:58:51] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 08:58:51] [INFO ] [Nat]Absence check using 7 positive place invariants in 12 ms returned sat
[2021-05-13 08:58:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 08:58:52] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2021-05-13 08:58:52] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2021-05-13 08:58:52] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 2 ms.
[2021-05-13 08:58:52] [INFO ] Added : 10 causal constraints over 2 iterations in 59 ms. Result :sat
[2021-05-13 08:58:52] [INFO ] [Real]Absence check using 7 positive place invariants in 15 ms returned sat
[2021-05-13 08:58:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 08:58:52] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-13 08:58:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 08:58:52] [INFO ] [Nat]Absence check using 7 positive place invariants in 25 ms returned sat
[2021-05-13 08:58:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 08:58:52] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-13 08:58:52] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2021-05-13 08:58:52] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 1 ms.
[2021-05-13 08:58:52] [INFO ] Added : 7 causal constraints over 2 iterations in 10 ms. Result :sat
[2021-05-13 08:58:52] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 08:58:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 08:58:52] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2021-05-13 08:58:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 08:58:52] [INFO ] [Nat]Absence check using 7 positive place invariants in 41 ms returned sat
[2021-05-13 08:58:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 08:58:52] [INFO ] [Nat]Absence check using state equation in 137 ms returned sat
[2021-05-13 08:58:52] [INFO ] [Nat]Added 4 Read/Feed constraints in 3 ms returned sat
[2021-05-13 08:58:52] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 3 ms.
[2021-05-13 08:58:52] [INFO ] Added : 10 causal constraints over 2 iterations in 10 ms. Result :sat
[2021-05-13 08:58:52] [INFO ] [Real]Absence check using 7 positive place invariants in 41 ms returned sat
[2021-05-13 08:58:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 08:58:52] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2021-05-13 08:58:52] [INFO ] [Real]Added 4 Read/Feed constraints in 2 ms returned sat
[2021-05-13 08:58:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 08:58:52] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2021-05-13 08:58:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 08:58:52] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2021-05-13 08:58:52] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2021-05-13 08:58:52] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 7 ms.
[2021-05-13 08:58:52] [INFO ] Added : 11 causal constraints over 3 iterations in 46 ms. Result :sat
[2021-05-13 08:58:52] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 08:58:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 08:58:52] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 08:58:52] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 08:58:52] [INFO ] [Nat]Absence check using 7 positive place invariants in 54 ms returned sat
[2021-05-13 08:58:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 08:58:52] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2021-05-13 08:58:52] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2021-05-13 08:58:52] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 3 ms.
[2021-05-13 08:58:52] [INFO ] Added : 11 causal constraints over 3 iterations in 13 ms. Result :sat
[2021-05-13 08:58:52] [INFO ] [Real]Absence check using 7 positive place invariants in 38 ms returned unsat
[2021-05-13 08:58:52] [INFO ] [Real]Absence check using 7 positive place invariants in 24 ms returned unsat
[2021-05-13 08:58:52] [INFO ] [Real]Absence check using 7 positive place invariants in 5 ms returned unsat
[2021-05-13 08:58:52] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 08:58:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 08:58:53] [INFO ] [Real]Absence check using state equation in 124 ms returned sat
[2021-05-13 08:58:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 08:58:53] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 08:58:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 08:58:53] [INFO ] [Nat]Absence check using state equation in 6 ms returned sat
[2021-05-13 08:58:53] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2021-05-13 08:58:53] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 2 ms.
[2021-05-13 08:58:53] [INFO ] Added : 11 causal constraints over 3 iterations in 15 ms. Result :sat
[2021-05-13 08:58:53] [INFO ] [Real]Absence check using 7 positive place invariants in 54 ms returned sat
[2021-05-13 08:58:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 08:58:53] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-13 08:58:53] [INFO ] [Real]Added 4 Read/Feed constraints in 0 ms returned sat
[2021-05-13 08:58:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 08:58:53] [INFO ] [Nat]Absence check using 7 positive place invariants in 17 ms returned sat
[2021-05-13 08:58:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 08:58:53] [INFO ] [Nat]Absence check using state equation in 23 ms returned sat
[2021-05-13 08:58:53] [INFO ] [Nat]Added 4 Read/Feed constraints in 19 ms returned sat
[2021-05-13 08:58:53] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 1 ms.
[2021-05-13 08:58:53] [INFO ] Added : 10 causal constraints over 2 iterations in 40 ms. Result :sat
[2021-05-13 08:58:53] [INFO ] [Real]Absence check using 7 positive place invariants in 41 ms returned sat
[2021-05-13 08:58:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 08:58:53] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2021-05-13 08:58:53] [INFO ] [Real]Added 4 Read/Feed constraints in 7 ms returned sat
[2021-05-13 08:58:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 08:58:53] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 08:58:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 08:58:53] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2021-05-13 08:58:53] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2021-05-13 08:58:53] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 1 ms.
[2021-05-13 08:58:53] [INFO ] Added : 10 causal constraints over 2 iterations in 7 ms. Result :sat
[2021-05-13 08:58:53] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 08:58:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 08:58:53] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 08:58:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 08:58:53] [INFO ] [Nat]Absence check using 7 positive place invariants in 37 ms returned sat
[2021-05-13 08:58:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 08:58:53] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2021-05-13 08:58:53] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2021-05-13 08:58:53] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 4 ms.
[2021-05-13 08:58:53] [INFO ] Added : 10 causal constraints over 2 iterations in 11 ms. Result :sat
[2021-05-13 08:58:53] [INFO ] [Real]Absence check using 7 positive place invariants in 15 ms returned sat
[2021-05-13 08:58:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 08:58:53] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2021-05-13 08:58:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 08:58:53] [INFO ] [Nat]Absence check using 7 positive place invariants in 7 ms returned sat
[2021-05-13 08:58:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 08:58:53] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-13 08:58:53] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2021-05-13 08:58:53] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 1 ms.
[2021-05-13 08:58:53] [INFO ] Added : 10 causal constraints over 2 iterations in 9 ms. Result :sat
[2021-05-13 08:58:53] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-13 08:58:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 08:58:53] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2021-05-13 08:58:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 08:58:53] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2021-05-13 08:58:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 08:58:53] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 08:58:53] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2021-05-13 08:58:53] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 2 ms.
[2021-05-13 08:58:53] [INFO ] Added : 10 causal constraints over 2 iterations in 8 ms. Result :sat
[2021-05-13 08:58:53] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned unsat
[2021-05-13 08:58:53] [INFO ] [Real]Absence check using 7 positive place invariants in 28 ms returned sat
[2021-05-13 08:58:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 08:58:53] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2021-05-13 08:58:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 08:58:53] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 08:58:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 08:58:53] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2021-05-13 08:58:53] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2021-05-13 08:58:53] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 1 ms.
[2021-05-13 08:58:53] [INFO ] Added : 11 causal constraints over 3 iterations in 7 ms. Result :sat
[2021-05-13 08:58:53] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned unsat
[2021-05-13 08:58:53] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 08:58:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 08:58:53] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-13 08:58:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 08:58:53] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2021-05-13 08:58:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 08:58:53] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2021-05-13 08:58:53] [INFO ] [Nat]Added 4 Read/Feed constraints in 1 ms returned sat
[2021-05-13 08:58:53] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 1 ms.
[2021-05-13 08:58:53] [INFO ] Added : 9 causal constraints over 2 iterations in 5 ms. Result :sat
[2021-05-13 08:58:53] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2021-05-13 08:58:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-13 08:58:53] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2021-05-13 08:58:53] [INFO ] [Real]Added 4 Read/Feed constraints in 1 ms returned sat
[2021-05-13 08:58:53] [INFO ] Solution in real domain found non-integer solution.
[2021-05-13 08:58:53] [INFO ] [Nat]Absence check using 7 positive place invariants in 28 ms returned sat
[2021-05-13 08:58:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-13 08:58:53] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2021-05-13 08:58:53] [INFO ] [Nat]Added 4 Read/Feed constraints in 2 ms returned sat
[2021-05-13 08:58:53] [INFO ] Computed and/alt/rep : 12/23/12 causal constraints in 1 ms.
[2021-05-13 08:58:53] [INFO ] Added : 10 causal constraints over 2 iterations in 8 ms. Result :sat
Successfully simplified 5 atomic propositions for a total of 8 simplifications.
[2021-05-13 08:58:54] [INFO ] Initial state reduction rules for CTL removed 9 formulas.
[2021-05-13 08:58:54] [INFO ] Flatten gal took : 23 ms
FORMULA CircadianClock-PT-010000-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircadianClock-PT-010000-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircadianClock-PT-010000-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircadianClock-PT-010000-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircadianClock-PT-010000-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircadianClock-PT-010000-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircadianClock-PT-010000-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircadianClock-PT-010000-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircadianClock-PT-010000-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-13 08:58:54] [INFO ] Flatten gal took : 4 ms
[2021-05-13 08:58:54] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2021-05-13 08:58:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 0 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ CircadianClock-PT-010000 @ 3570 seconds

FORMULA CircadianClock-PT-010000-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-010000-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-010000-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-010000-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-010000-00 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-010000-07 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CircadianClock-PT-010000-02 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2476
rslt: Output for LTLCardinality @ CircadianClock-PT-010000

{
"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 08:58:54 2021
",
"timelimit": 3570
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 566
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X (F ((F ((p10 <= p11)) AND X ((p11 <= p3)))))",
"processed_size": 46,
"rewrites": 51
},
"result":
{
"edges": 40002,
"markings": 40002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 679
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 7,
"U": 1,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 8,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 3,
"tdisj": 3,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "G ((F ((F (G ((3 <= p8))) AND G ((X ((1 <= p5)) OR G ((3 <= p8)))))) AND ((X ((p0 <= p8)) U (1 <= p5)) OR (F (G ((3 <= p8))) AND G ((X ((1 <= p5)) OR G ((3 <= p8))))))))",
"processed_size": 169,
"rewrites": 51
},
"result":
{
"edges": 4231782,
"markings": 1040400,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 44
},
"compoundnumber": 2,
"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": 1076
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 4,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 3,
"comp": 3,
"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": "X (G ((G ((p4 + 1 <= p10)) AND (F (G ((p9 + 1 <= p1))) OR G ((p4 + 1 <= p10))))))",
"processed_size": 81,
"rewrites": 51
},
"result":
{
"edges": 40002,
"markings": 40002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"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": 1615
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"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": 2,
"visible_transitions": 0
},
"processed": "G (F (((p7 <= 2) AND (p9 + 1 <= p7))))",
"processed_size": 38,
"rewrites": 51
},
"result":
{
"edges": 50002,
"markings": 50002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 5,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "fairness",
"workflow": "product automaton"
}
}
],
"exit":
{
"error": null,
"memory": 3180,
"runtime": 1094.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "((F(**) AND **) U (X(G(**)) OR F(**))) : G((F((F(G(*)) OR (G(**) AND F(G(*))))) AND (** OR (F(G(*)) OR (G(**) AND F(G(*))))))) : X(F((F(**) AND X(**)))) : G((F((F(G(**)) AND G((X(**) OR G(**))))) AND ((X(**) U **) OR (F(G(**)) AND G((X(**) OR G(**))))))) : ((X((G(**) OR G(**))) OR **) U G(*)) : X(G((G(*) AND (F(G(*)) OR G(*))))) : G(F(*))"
},
"net":
{
"arcs": 58,
"conflict_clusters": 2,
"places": 14,
"places_significant": 7,
"singleton_clusters": 0,
"transitions": 16
},
"result":
{
"preliminary_value": "unknown unknown no no unknown no no ",
"value": "unknown unknown no no unknown 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: 30/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 448
lola: finding significant places
lola: 14 places, 16 transitions, 7 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: ((F ((2 <= p1)) AND (p5 <= p2)) U (X (G ((p5 <= p2))) OR ((p1 <= p13) U F ((2 <= p1))))) : G (((p8 <= p0) U (G ((p8 <= p0)) U F (NOT(X (F ((p4 <= p8)))))))) : F (X (NOT(G ((NOT(F ((p10 <= p11))) OR NOT(X ((p11 <= p3)))))))) : G (((X ((p0 <= p8)) U (1 <= p5)) U G ((X ((1 <= p5)) U G ((3 <= p8)))))) : (((G (X (G ((p0 <= p13)))) OR X (G ((p0 <= p13)))) OR (p0 <= p13)) U G (NOT(F ((p0 <= p13))))) : NOT(X (F ((G (F ((p1 <= p9))) U ((NOT(X ((p10 <= p5))) AND (p13 <= 0)) U F ((p10 <= p4))))))) : G (NOT(G (G (((3 <= p7) OR (p7 <= p9))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:422
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:528
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:318
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:315
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:350
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 509 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((F ((2 <= p1)) AND (p5 <= p2)) U (X (G ((p5 <= p2))) OR F ((2 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((F ((2 <= p1)) AND (p5 <= p2)) U (X (G ((p5 <= p2))) OR F ((2 <= p1))))
lola: processed formula length: 72
lola: 51 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 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: 3690467 markings, 7341013 edges, 738093 markings/sec, 0 secs
lola: 7107189 markings, 14171211 edges, 683344 markings/sec, 5 secs
lola: 10745194 markings, 21445044 edges, 727601 markings/sec, 10 secs
lola: 14264164 markings, 28481778 edges, 703794 markings/sec, 15 secs
lola: 17828154 markings, 35613584 edges, 712798 markings/sec, 20 secs
lola: 21471810 markings, 42904357 edges, 728731 markings/sec, 25 secs
lola: 24752712 markings, 49466416 edges, 656180 markings/sec, 30 secs
lola: 28171965 markings, 56304487 edges, 683851 markings/sec, 35 secs
lola: 31728382 markings, 63413559 edges, 711283 markings/sec, 40 secs
lola: 35268918 markings, 70494990 edges, 708107 markings/sec, 45 secs
lola: 38672813 markings, 77306504 edges, 680779 markings/sec, 50 secs
lola: 42305053 markings, 84563044 edges, 726448 markings/sec, 55 secs
lola: 45904691 markings, 91761775 edges, 719928 markings/sec, 60 secs
lola: 49439902 markings, 98837309 edges, 707042 markings/sec, 65 secs
lola: 52925952 markings, 105805208 edges, 697210 markings/sec, 70 secs
lola: 56369083 markings, 112695277 edges, 688626 markings/sec, 75 secs
lola: 59847716 markings, 119650154 edges, 695727 markings/sec, 80 secs
lola: 63552023 markings, 127062890 edges, 740861 markings/sec, 85 secs
lola: 67263025 markings, 134483105 edges, 742200 markings/sec, 90 secs
lola: 70899306 markings, 141759931 edges, 727256 markings/sec, 95 secs
lola: 74508466 markings, 148971672 edges, 721832 markings/sec, 100 secs
lola: 78094769 markings, 156150403 edges, 717261 markings/sec, 105 secs
lola: 81751989 markings, 163461877 edges, 731444 markings/sec, 110 secs
lola: 85155681 markings, 170273348 edges, 680738 markings/sec, 115 secs
lola: 87314087 markings, 174610548 edges, 431681 markings/sec, 120 secs
lola: 90032742 markings, 180023722 edges, 543731 markings/sec, 125 secs
lola: 92980249 markings, 185925200 edges, 589501 markings/sec, 130 secs
lola: 96180659 markings, 192325077 edges, 640082 markings/sec, 135 secs
lola: 99390514 markings, 198736578 edges, 641971 markings/sec, 140 secs
lola: 100768381 markings, 201818624 edges, 275573 markings/sec, 145 secs
lola: 101858260 markings, 204534055 edges, 217976 markings/sec, 150 secs
lola: 103320479 markings, 208187401 edges, 292444 markings/sec, 155 secs
lola: 104596526 markings, 211383570 edges, 255209 markings/sec, 160 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 1 will run for 566 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((F ((p10 <= p11)) AND X ((p11 <= p3)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((F ((p10 <= p11)) AND X ((p11 <= p3)))))
lola: processed formula length: 46
lola: 51 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 40002 markings, 40002 edges
lola: ========================================
lola: subprocess 2 will run for 679 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((F (G ((3 <= p8))) AND G ((X ((1 <= p5)) OR G ((3 <= p8)))))) AND ((X ((p0 <= p8)) U (1 <= p5)) OR (F (G ((3 <= p8))) AND G ((X ((1 <= p5)) OR G ((3 <= p8))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((F (G ((3 <= p8))) AND G ((X ((1 <= p5)) OR G ((3 <= p8)))))) AND ((X ((p0 <= p8)) U (1 <= p5)) OR (F (G ((3 <= p8))) AND G ((X ((1 <= p5)) OR G ((3 <= p8))))))))
lola: processed formula length: 169
lola: 51 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 44 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 15
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: 1040400 markings, 4231782 edges
lola: ========================================
lola: subprocess 3 will run for 848 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X ((G ((p0 <= p13)) OR G ((p0 <= p13)))) OR (p0 <= p13)) U G ((p13 + 1 <= p0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((X ((G ((p0 <= p13)) OR G ((p0 <= p13)))) OR (p0 <= p13)) U G ((p13 + 1 <= p0)))
lola: processed formula length: 81
lola: 51 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 10 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: 3886494 markings, 7729287 edges, 777299 markings/sec, 0 secs
lola: 7611666 markings, 15182799 edges, 745034 markings/sec, 5 secs
lola: 11390662 markings, 22741416 edges, 755799 markings/sec, 10 secs
lola: 15077095 markings, 30109348 edges, 737287 markings/sec, 15 secs
lola: 18749324 markings, 37457033 edges, 734446 markings/sec, 20 secs
lola: 22486414 markings, 44928118 edges, 747418 markings/sec, 25 secs
lola: 26102518 markings, 52156424 edges, 723221 markings/sec, 30 secs
lola: 29747626 markings, 59451390 edges, 729022 markings/sec, 35 secs
lola: 33281946 markings, 66516928 edges, 706864 markings/sec, 40 secs
lola: 36906250 markings, 73766904 edges, 724861 markings/sec, 45 secs
lola: 40470123 markings, 80898346 edges, 712775 markings/sec, 50 secs
lola: 44174836 markings, 88311454 edges, 740943 markings/sec, 55 secs
lola: 47765725 markings, 95484786 edges, 718178 markings/sec, 60 secs
lola: 51391116 markings, 102740777 edges, 725078 markings/sec, 65 secs
lola: 54986793 markings, 109927630 edges, 719135 markings/sec, 70 secs
lola: 58430673 markings, 116819097 edges, 688776 markings/sec, 75 secs
lola: 62124502 markings, 124203811 edges, 738766 markings/sec, 80 secs
lola: 65963273 markings, 131883158 edges, 767754 markings/sec, 85 secs
lola: 69695621 markings, 139353378 edges, 746470 markings/sec, 90 secs
lola: 73457874 markings, 146878884 edges, 752451 markings/sec, 95 secs
lola: 77175489 markings, 154312609 edges, 743523 markings/sec, 100 secs
lola: 80898142 markings, 161760268 edges, 744531 markings/sec, 105 secs
lola: 84464316 markings, 168887324 edges, 713235 markings/sec, 110 secs
lola: 87160433 markings, 174283752 edges, 539223 markings/sec, 115 secs
lola: 89233395 markings, 178425725 edges, 414592 markings/sec, 120 secs
lola: 91896019 markings, 183753465 edges, 532525 markings/sec, 125 secs
lola: 95314945 markings, 190590069 edges, 683785 markings/sec, 130 secs
lola: 98410106 markings, 196775395 edges, 619032 markings/sec, 135 secs
lola: 100277744 markings, 200582828 edges, 373528 markings/sec, 140 secs
lola: 101310124 markings, 203175676 edges, 206476 markings/sec, 145 secs
lola: 102791302 markings, 206877520 edges, 296236 markings/sec, 150 secs
lola: 103798138 markings, 209384806 edges, 201367 markings/sec, 155 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 1076 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((G ((p4 + 1 <= p10)) AND (F (G ((p9 + 1 <= p1))) OR G ((p4 + 1 <= p10))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G ((p4 + 1 <= p10)) AND (F (G ((p9 + 1 <= p1))) OR G ((p4 + 1 <= p10))))))
lola: processed formula length: 81
lola: 51 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 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: 40002 markings, 40002 edges
lola: subprocess 5 will run for 1615 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((p7 <= 2) AND (p9 + 1 <= p7))))
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 (((p7 <= 2) AND (p9 + 1 <= p7))))
lola: processed formula length: 38
lola: 51 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: ========================================
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: 50002 markings, 50002 edges
lola: ========================================
lola: subprocess 6 will run for 3230 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F ((F (G ((p8 + 1 <= p4))) OR (G ((p8 <= p0)) AND F (G ((p8 + 1 <= p4)))))) AND ((p8 <= p0) OR (F (G ((p8 + 1 <= p4))) OR (G ((p8 <= p0)) AND F (G ((p8 + 1 <= p4))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((F (G ((p8 + 1 <= p4))) OR (G ((p8 <= p0)) AND F (G ((p8 + 1 <= p4)))))) AND ((p8 <= p0) OR (F (G ((p8 + 1 <= p4))) OR (G ((p8 <= p0)) AND F (G ((p8 + 1 <= p4))))))))
lola: processed formula length: 173
lola: 51 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 19 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: 3105613 markings, 6166681 edges, 621123 markings/sec, 0 secs
lola: 6187982 markings, 12333632 edges, 616474 markings/sec, 5 secs
lola: 9249464 markings, 18457924 edges, 612296 markings/sec, 10 secs
lola: 12194040 markings, 24345862 edges, 588915 markings/sec, 15 secs
lola: 15183788 markings, 30320602 edges, 597950 markings/sec, 20 secs
lola: 18112869 markings, 36185578 edges, 585816 markings/sec, 25 secs
lola: 20929779 markings, 41818288 edges, 563382 markings/sec, 30 secs
lola: 23923982 markings, 47800747 edges, 598841 markings/sec, 35 secs
lola: 26852886 markings, 53666907 edges, 585781 markings/sec, 40 secs
lola: 29815178 markings, 59589644 edges, 592458 markings/sec, 45 secs
lola: 32725893 markings, 65406037 edges, 582143 markings/sec, 50 secs
lola: 35628866 markings, 71214813 edges, 580595 markings/sec, 55 secs
lola: 38414814 markings, 76790569 edges, 557190 markings/sec, 60 secs
lola: 41337809 markings, 82634001 edges, 584599 markings/sec, 65 secs
lola: 44175525 markings, 88312144 edges, 567543 markings/sec, 70 secs
lola: 47043587 markings, 94040635 edges, 573612 markings/sec, 75 secs
lola: 49894127 markings, 99749881 edges, 570108 markings/sec, 80 secs
lola: 52776633 markings, 105514542 edges, 576501 markings/sec, 85 secs
lola: 55589948 markings, 111137062 edges, 562663 markings/sec, 90 secs
lola: 58413884 markings, 116788727 edges, 564787 markings/sec, 95 secs
lola: 61333186 markings, 122626486 edges, 583860 markings/sec, 100 secs
lola: 64335585 markings, 128633535 edges, 600480 markings/sec, 105 secs
lola: 67268354 markings, 134491694 edges, 586554 markings/sec, 110 secs
lola: 70239022 markings, 140439550 edges, 594134 markings/sec, 115 secs
lola: 73161650 markings, 146282615 edges, 584526 markings/sec, 120 secs
lola: 76150912 markings, 152258925 edges, 597852 markings/sec, 125 secs
lola: 79063000 markings, 158084850 edges, 582418 markings/sec, 130 secs
lola: 82118088 markings, 164200154 edges, 611018 markings/sec, 135 secs
lola: 83389461 markings, 166734209 edges, 254275 markings/sec, 140 secs
lola: 84066305 markings, 168088905 edges, 135369 markings/sec, 145 secs
lola: 86096849 markings, 172156238 edges, 406109 markings/sec, 150 secs
lola: 88493450 markings, 176945925 edges, 479320 markings/sec, 155 secs
lola: 90891737 markings, 181740666 edges, 479657 markings/sec, 160 secs
lola: 93350168 markings, 186655834 edges, 491686 markings/sec, 165 secs
lola: 96154707 markings, 192269308 edges, 560908 markings/sec, 170 secs
lola: 96169985 markings, 192295141 edges, 3056 markings/sec, 175 secs
lola: 97466712 markings, 194891323 edges, 259345 markings/sec, 180 secs
lola: 99173694 markings, 198306118 edges, 341396 markings/sec, 185 secs
lola: 100390223 markings, 200875285 edges, 243306 markings/sec, 190 secs
lola: 101787862 markings, 204366780 edges, 279528 markings/sec, 195 secs
lola: 102668353 markings, 206568915 edges, 176098 markings/sec, 200 secs
lola: 103525341 markings, 208707042 edges, 171398 markings/sec, 205 secs
lola: 104110004 markings, 210175810 edges, 116933 markings/sec, 210 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: ((F ((2 <= p1)) AND (p5 <= p2)) U (X (G ((p5 <= p2))) OR F ((2 <= p1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((F ((2 <= p1)) AND (p5 <= p2)) U (X (G ((p5 <= p2))) OR F ((2 <= p1))))
lola: processed formula length: 72
lola: 51 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 7 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: 3642675 markings, 7237840 edges, 728535 markings/sec, 0 secs
lola: 7328795 markings, 14616019 edges, 737224 markings/sec, 5 secs
lola: 10996231 markings, 21947881 edges, 733487 markings/sec, 10 secs
lola: 14587488 markings, 29131734 edges, 718251 markings/sec, 15 secs
lola: 18126736 markings, 36209301 edges, 707850 markings/sec, 20 secs
lola: 21795456 markings, 43548716 edges, 733744 markings/sec, 25 secs
lola: 25405645 markings, 50765664 edges, 722038 markings/sec, 30 secs
lola: 28971703 markings, 57903659 edges, 713212 markings/sec, 35 secs
lola: 32564526 markings, 65081949 edges, 718565 markings/sec, 40 secs
lola: 36093236 markings, 72147903 edges, 705742 markings/sec, 45 secs
lola: 39660827 markings, 79276767 edges, 713518 markings/sec, 50 secs
lola: 43195340 markings, 86351811 edges, 706903 markings/sec, 55 secs
lola: 46749281 markings, 93455503 edges, 710788 markings/sec, 60 secs
lola: 50288531 markings, 100533079 edges, 707850 markings/sec, 65 secs
lola: 53861048 markings, 107679118 edges, 714503 markings/sec, 70 secs
lola: 57394841 markings, 114751654 edges, 706759 markings/sec, 75 secs
lola: 60951852 markings, 121862507 edges, 711402 markings/sec, 80 secs
lola: 64625610 markings, 129205293 edges, 734752 markings/sec, 85 secs
lola: 68192263 markings, 136343380 edges, 713331 markings/sec, 90 secs
lola: 71807567 markings, 143569110 edges, 723061 markings/sec, 95 secs
lola: 75368848 markings, 150692775 edges, 712256 markings/sec, 100 secs
lola: 78876133 markings, 157714454 edges, 701457 markings/sec, 105 secs
lola: 82489402 markings, 164934079 edges, 722654 markings/sec, 110 secs
lola: 85805605 markings, 171569361 edges, 663241 markings/sec, 115 secs
lola: 88916452 markings, 177796557 edges, 622169 markings/sec, 120 secs
lola: 92172289 markings, 184302256 edges, 651167 markings/sec, 125 secs
lola: 95479636 markings, 190923951 edges, 661469 markings/sec, 130 secs
lola: 98682075 markings, 197326868 edges, 640488 markings/sec, 135 secs
lola: 100638413 markings, 201483659 edges, 391268 markings/sec, 140 secs
lola: 101303843 markings, 203150549 edges, 133086 markings/sec, 145 secs
lola: 101668172 markings, 204067922 edges, 72866 markings/sec, 150 secs
lola: 102004036 markings, 204901426 edges, 67173 markings/sec, 155 secs
lola: 102271056 markings, 205577040 edges, 53404 markings/sec, 160 secs
lola: 103066522 markings, 207561528 edges, 159093 markings/sec, 165 secs
lola: 104276998 markings, 210583882 edges, 242095 markings/sec, 170 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: ((X ((G ((p0 <= p13)) OR G ((p0 <= p13)))) OR (p0 <= p13)) U G ((p13 + 1 <= p0)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: ((X ((G ((p0 <= p13)) OR G ((p0 <= p13)))) OR (p0 <= p13)) U G ((p13 + 1 <= p0)))
lola: processed formula length: 81
lola: 51 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 10 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: 3821013 markings, 7592848 edges, 764203 markings/sec, 0 secs
lola: 7570363 markings, 15100711 edges, 749870 markings/sec, 5 secs
lola: 11400346 markings, 22752047 edges, 765997 markings/sec, 10 secs
lola: 15126529 markings, 30208828 edges, 745237 markings/sec, 15 secs
lola: 18736938 markings, 37429739 edges, 722082 markings/sec, 20 secs
lola: 22496733 markings, 44950099 edges, 751959 markings/sec, 25 secs
lola: 26285463 markings, 52525075 edges, 757746 markings/sec, 30 secs
lola: 30010314 markings, 59979441 edges, 744970 markings/sec, 35 secs
lola: 33732495 markings, 67425798 edges, 744436 markings/sec, 40 secs
lola: 37419900 markings, 74795504 edges, 737481 markings/sec, 45 secs
lola: 41167466 markings, 82290338 edges, 749513 markings/sec, 50 secs
lola: 44861550 markings, 89678269 edges, 738817 markings/sec, 55 secs
lola: 48528932 markings, 97014368 edges, 733476 markings/sec, 60 secs
lola: 52227813 markings, 104410827 edges, 739776 markings/sec, 65 secs
lola: 55806274 markings, 111566030 edges, 715692 markings/sec, 70 secs
lola: 59414066 markings, 118789228 edges, 721558 markings/sec, 75 secs
lola: 63258931 markings, 126478410 edges, 768973 markings/sec, 80 secs
lola: 66975455 markings, 133913017 edges, 743305 markings/sec, 85 secs
lola: 70663371 markings, 141283961 edges, 737583 markings/sec, 90 secs
lola: 74347326 markings, 148648468 edges, 736791 markings/sec, 95 secs
lola: 78012758 markings, 155984374 edges, 733086 markings/sec, 100 secs
lola: 81703854 markings, 163366100 edges, 738219 markings/sec, 105 secs
lola: 84851782 markings, 169662613 edges, 629586 markings/sec, 110 secs
lola: 88075281 markings, 176113107 edges, 644700 markings/sec, 115 secs
lola: 91346561 markings, 182650252 edges, 654256 markings/sec, 120 secs
lola: 94656090 markings, 189273540 edges, 661906 markings/sec, 125 secs
lola: 98046568 markings, 196051267 edges, 678096 markings/sec, 130 secs
lola: 100223759 markings, 200450051 edges, 435438 markings/sec, 135 secs
lola: 101448845 markings, 203520581 edges, 245017 markings/sec, 140 secs
lola: 102873549 markings, 207079803 edges, 284941 markings/sec, 145 secs
lola: 103977442 markings, 209834192 edges, 220779 markings/sec, 150 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: G ((F ((F (G ((p8 + 1 <= p4))) OR (G ((p8 <= p0)) AND F (G ((p8 + 1 <= p4)))))) AND ((p8 <= p0) OR (F (G ((p8 + 1 <= p4))) OR (G ((p8 <= p0)) AND F (G ((p8 + 1 <= p4))))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F ((F (G ((p8 + 1 <= p4))) OR (G ((p8 <= p0)) AND F (G ((p8 + 1 <= p4)))))) AND ((p8 <= p0) OR (F (G ((p8 + 1 <= p4))) OR (G ((p8 <= p0)) AND F (G ((p8 + 1 <= p4))))))))
lola: processed formula length: 173
lola: 51 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 19 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: 2963849 markings, 5881396 edges, 592770 markings/sec, 0 secs
lola: 5911109 markings, 11781989 edges, 589452 markings/sec, 5 secs
lola: 8867437 markings, 17691862 edges, 591266 markings/sec, 10 secs
lola: 11886851 markings, 23729955 edges, 603883 markings/sec, 15 secs
lola: 14838447 markings, 29630665 edges, 590319 markings/sec, 20 secs
lola: 17727598 markings, 35411903 edges, 577830 markings/sec, 25 secs
lola: 20712590 markings, 41385689 edges, 596998 markings/sec, 30 secs
lola: 23640064 markings, 47233601 edges, 585495 markings/sec, 35 secs
lola: 26570881 markings, 53101310 edges, 586163 markings/sec, 40 secs
lola: 29444096 markings, 58840810 edges, 574643 markings/sec, 45 secs
lola: 32347127 markings, 64649760 edges, 580606 markings/sec, 50 secs
lola: 35205574 markings, 70364956 edges, 571689 markings/sec, 55 secs
lola: 38042349 markings, 76038819 edges, 567355 markings/sec, 60 secs
lola: 40947211 markings, 81849582 edges, 580972 markings/sec, 65 secs
lola: 43864284 markings, 87680855 edges, 583415 markings/sec, 70 secs
lola: 46761766 markings, 93478772 edges, 579496 markings/sec, 75 secs
lola: 49623618 markings, 99201052 edges, 572370 markings/sec, 80 secs
lola: 52513681 markings, 104988415 edges, 578013 markings/sec, 85 secs
lola: 55382353 markings, 110720652 edges, 573734 markings/sec, 90 secs
lola: 58150849 markings, 116259634 edges, 553699 markings/sec, 95 secs
lola: 61050987 markings, 122059904 edges, 580028 markings/sec, 100 secs
lola: 63948884 markings, 127853450 edges, 579579 markings/sec, 105 secs
lola: 66787800 markings, 133530057 edges, 567783 markings/sec, 110 secs
lola: 69691272 markings, 139340328 edges, 580694 markings/sec, 115 secs
lola: 72574402 markings, 145109574 edges, 576626 markings/sec, 120 secs
lola: 75492027 markings, 150942304 edges, 583525 markings/sec, 125 secs
lola: 78356693 markings, 156676159 edges, 572933 markings/sec, 130 secs
lola: 81330171 markings, 162616442 edges, 594696 markings/sec, 135 secs
lola: 84017778 markings, 167999402 edges, 537521 markings/sec, 140 secs
lola: 86458369 markings, 172880962 edges, 488118 markings/sec, 145 secs
lola: 89090616 markings, 178137698 edges, 526449 markings/sec, 150 secs
lola: 91795158 markings, 183550882 edges, 540908 markings/sec, 155 secs
lola: 93263766 markings, 186487749 edges, 293722 markings/sec, 160 secs
lola: 95968125 markings, 191892513 edges, 540872 markings/sec, 165 secs
lola: 98801677 markings, 197566488 edges, 566710 markings/sec, 170 secs
lola: 100097948 markings, 200132950 edges, 259254 markings/sec, 175 secs
lola: 101346316 markings, 203260506 edges, 249674 markings/sec, 180 secs
lola: 102666465 markings, 206561366 edges, 264030 markings/sec, 185 secs
lola: 103842778 markings, 209496852 edges, 235263 markings/sec, 190 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: unknown unknown no no unknown no no
lola:
preliminary result: unknown unknown no no unknown no no
lola: memory consumption: 3180 KB
lola: time consumption: 1094 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="CircadianClock-PT-010000"
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 CircadianClock-PT-010000, 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 r056-oct2-162038334400017"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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