Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r208-smll-162089471000053.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/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 RobotManipulation-PT-10000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r208-smll-162089471000053
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 19K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 162K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 108K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Mar 28 16:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 28 16:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 28 16:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 28 16:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Mar 27 10:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 15K Mar 27 10:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 25 14:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 25 14:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 22 08:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 6 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 6.3K 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 RobotManipulation-PT-10000-00
FORMULA_NAME RobotManipulation-PT-10000-01
FORMULA_NAME RobotManipulation-PT-10000-02
FORMULA_NAME RobotManipulation-PT-10000-03
FORMULA_NAME RobotManipulation-PT-10000-04
FORMULA_NAME RobotManipulation-PT-10000-05
FORMULA_NAME RobotManipulation-PT-10000-06
FORMULA_NAME RobotManipulation-PT-10000-07
FORMULA_NAME RobotManipulation-PT-10000-08
FORMULA_NAME RobotManipulation-PT-10000-09
FORMULA_NAME RobotManipulation-PT-10000-10
FORMULA_NAME RobotManipulation-PT-10000-11
FORMULA_NAME RobotManipulation-PT-10000-12
FORMULA_NAME RobotManipulation-PT-10000-13
FORMULA_NAME RobotManipulation-PT-10000-14
FORMULA_NAME RobotManipulation-PT-10000-15

=== Now, execution of the tool begins

BK_START 1621033208356

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2021-05-14 23:00:10] [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-14 23:00:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 23:00:11] [INFO ] Load time of PNML (sax parser for PT used): 31 ms
[2021-05-14 23:00:11] [INFO ] Transformed 15 places.
[2021-05-14 23:00:11] [INFO ] Transformed 11 transitions.
[2021-05-14 23:00:11] [INFO ] Parsed PT model containing 15 places and 11 transitions in 88 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100006 steps, including 0 resets, run finished after 73 ms. (steps per millisecond=1369 ) properties seen :[0, 1, 0, 0, 1, 0, 0, 1, 0, 0, 1, 1, 0, 1, 0, 1, 0, 1, 0, 1, 1, 1, 1, 1, 0, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0]
// Phase 1: matrix 11 rows 15 cols
[2021-05-14 23:00:11] [INFO ] Computed 6 place invariants in 4 ms
[2021-05-14 23:00:11] [INFO ] [Real]Absence check using 3 positive place invariants in 21 ms returned sat
[2021-05-14 23:00:11] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned unsat
[2021-05-14 23:00:11] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2021-05-14 23:00:11] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned unsat
[2021-05-14 23:00:11] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned unsat
[2021-05-14 23:00:11] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2021-05-14 23:00:11] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 23:00:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 23:00:11] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2021-05-14 23:00:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 23:00:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2021-05-14 23:00:11] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2021-05-14 23:00:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 23:00:11] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2021-05-14 23:00:11] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 11 ms.
[2021-05-14 23:00:11] [INFO ] Added : 8 causal constraints over 2 iterations in 31 ms. Result :sat
[2021-05-14 23:00:11] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2021-05-14 23:00:11] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 23:00:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 23:00:11] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-14 23:00:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 23:00:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-14 23:00:11] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2021-05-14 23:00:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 23:00:11] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-14 23:00:11] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 6 ms.
[2021-05-14 23:00:11] [INFO ] Added : 8 causal constraints over 2 iterations in 22 ms. Result :sat
[2021-05-14 23:00:11] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
[2021-05-14 23:00:11] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 23:00:11] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 23:00:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 23:00:11] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-14 23:00:11] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 2 ms.
[2021-05-14 23:00:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 23:00:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2021-05-14 23:00:11] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 23:00:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 23:00:11] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2021-05-14 23:00:11] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 3 ms.
[2021-05-14 23:00:11] [INFO ] Added : 8 causal constraints over 2 iterations in 16 ms. Result :sat
[2021-05-14 23:00:11] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 23:00:11] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 23:00:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 23:00:11] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2021-05-14 23:00:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 23:00:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-14 23:00:11] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 23:00:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 23:00:11] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2021-05-14 23:00:11] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 4 ms.
[2021-05-14 23:00:11] [INFO ] Added : 8 causal constraints over 2 iterations in 14 ms. Result :sat
[2021-05-14 23:00:11] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 23:00:11] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 23:00:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 23:00:11] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2021-05-14 23:00:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 23:00:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-14 23:00:11] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2021-05-14 23:00:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 23:00:11] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-14 23:00:11] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 6 ms.
[2021-05-14 23:00:11] [INFO ] Added : 8 causal constraints over 2 iterations in 16 ms. Result :sat
[2021-05-14 23:00:11] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2021-05-14 23:00:11] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 23:00:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 23:00:11] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-14 23:00:11] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 23:00:11] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2021-05-14 23:00:11] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 7 ms returned sat
[2021-05-14 23:00:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 23:00:11] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-14 23:00:11] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 1 ms.
[2021-05-14 23:00:11] [INFO ] Added : 9 causal constraints over 2 iterations in 11 ms. Result :sat
[2021-05-14 23:00:12] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 23:00:12] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 23:00:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 23:00:12] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-14 23:00:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 23:00:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-14 23:00:12] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 23:00:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 23:00:12] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-14 23:00:12] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 2 ms.
[2021-05-14 23:00:12] [INFO ] Added : 8 causal constraints over 2 iterations in 11 ms. Result :sat
[2021-05-14 23:00:12] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 23:00:12] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 23:00:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 23:00:12] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-14 23:00:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 23:00:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-14 23:00:12] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 23:00:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 23:00:12] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2021-05-14 23:00:12] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 2 ms.
[2021-05-14 23:00:12] [INFO ] Added : 8 causal constraints over 2 iterations in 10 ms. Result :sat
[2021-05-14 23:00:12] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned unsat
[2021-05-14 23:00:12] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 23:00:12] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 23:00:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 23:00:12] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2021-05-14 23:00:12] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 3 ms.
[2021-05-14 23:00:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 23:00:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-14 23:00:12] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 23:00:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 23:00:12] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-14 23:00:12] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 2 ms.
[2021-05-14 23:00:12] [INFO ] Added : 8 causal constraints over 2 iterations in 11 ms. Result :sat
[2021-05-14 23:00:12] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 23:00:12] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 23:00:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 23:00:12] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2021-05-14 23:00:12] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 3 ms.
[2021-05-14 23:00:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 23:00:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2021-05-14 23:00:12] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2021-05-14 23:00:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 23:00:12] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-14 23:00:12] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 2 ms.
[2021-05-14 23:00:12] [INFO ] Added : 9 causal constraints over 2 iterations in 11 ms. Result :sat
[2021-05-14 23:00:12] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2021-05-14 23:00:12] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 3 ms returned sat
[2021-05-14 23:00:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 23:00:12] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2021-05-14 23:00:12] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 2 ms.
[2021-05-14 23:00:12] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 23:00:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2021-05-14 23:00:12] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-14 23:00:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 23:00:12] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2021-05-14 23:00:12] [INFO ] Computed and/alt/rep : 10/18/10 causal constraints in 2 ms.
[2021-05-14 23:00:12] [INFO ] Added : 8 causal constraints over 2 iterations in 10 ms. Result :sat
Successfully simplified 5 atomic propositions for a total of 6 simplifications.
[2021-05-14 23:00:12] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2021-05-14 23:00:12] [INFO ] Flatten gal took : 32 ms
FORMULA RobotManipulation-PT-10000-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-10000-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-10000-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-10000-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA RobotManipulation-PT-10000-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2021-05-14 23:00:12] [INFO ] Flatten gal took : 7 ms
[2021-05-14 23:00:12] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2021-05-14 23:00:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 1 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ RobotManipulation-PT-10000 @ 3570 seconds

FORMULA RobotManipulation-PT-10000-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-10000-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-10000-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-10000-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-10000-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-10000-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-10000-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-10000-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-10000-11 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-10000-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA RobotManipulation-PT-10000-12 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2916
rslt: Output for LTLCardinality @ RobotManipulation-PT-10000

{
"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 May 14 23:00:13 2021
",
"timelimit": 3570
},
"child":
[

{
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(1 <= p0)",
"processed_size": 9,
"rewrites": 60
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 1,
"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": "X (F ((3 <= p1)))",
"processed_size": 17,
"rewrites": 60
},
"result":
{
"edges": 20006,
"markings": 20006,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 0,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 356
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 2,
"U": 0,
"X": 5,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 8,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "G ((X ((p8 <= p4)) OR (X (X ((p10 <= p2))) OR (X (X (F ((p10 <= p2)))) AND F (G ((p4 + 1 <= p7)))))))",
"processed_size": 101,
"rewrites": 60
},
"result":
{
"edges": 6461090,
"markings": 3700517,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 1,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "no (formula contains X operator)"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 395
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 2,
"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": "X (X (G ((p3 <= p0))))",
"processed_size": 22,
"rewrites": 60
},
"result":
{
"edges": 320003,
"markings": 220008,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"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": 445
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 1,
"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 (G (((p2 <= p6) OR (1 <= p8))))",
"processed_size": 34,
"rewrites": 60
},
"result":
{
"edges": 140012,
"markings": 120011,
"produced_by": "LTL model checker",
"value": false
},
"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"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 508
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 5,
"G": 1,
"U": 0,
"X": 3,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 6,
"taut": 0,
"tconj": 2,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F ((X (F ((p11 <= p1))) OR (G (F ((X (F ((p4 <= 0))) AND (p4 <= 0)))) AND X (F ((p11 <= p1))))))",
"processed_size": 96,
"rewrites": 60
},
"result":
{
"edges": 20006,
"markings": 20006,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"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": 593
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 593
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "(p8 <= 0)",
"processed_size": 9,
"rewrites": 60
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": true
},
"task":
{
"compoundnumber": 5,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 712
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"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": "((p3 + 1 <= p2) AND (p8 <= 0))",
"processed_size": 30,
"rewrites": 60
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 6,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 890
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 2,
"U": 0,
"X": 1,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "X (G ((G ((p8 <= 0)) OR (p8 <= 0))))",
"processed_size": 36,
"rewrites": 60
},
"result":
{
"edges": 140012,
"markings": 120011,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 7,
"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": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 712
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"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 (F ((1 <= p9)))",
"processed_size": 17,
"rewrites": 60
},
"result":
{
"edges": 80008,
"markings": 80008,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 6,
"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": 889
},
"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": 1,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 1,
"visible_transitions": 0
},
"processed": "G (F ((p8 <= 1)))",
"processed_size": 17,
"rewrites": 60
},
"result":
{
"edges": 419994,
"markings": 379992,
"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": 1186
},
"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": "F (G ((p12 + 1 <= p9)))",
"processed_size": 23,
"rewrites": 60
},
"result":
{
"edges": 100005,
"markings": 100004,
"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": "stabilization",
"workflow": "product automaton"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 1779
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "G ((p9 <= p8))",
"processed_size": 14,
"rewrites": 60
},
"result":
{
"edges": 100013,
"markings": 100012,
"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"
}
}
],
"exit":
{
"error": null,
"memory": 3324,
"runtime": 654.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "G(**) : (X(F(**)) OR **) : G((X(**) OR (X(X(**)) OR (X(X(F(**))) AND F(G(**)))))) : X(X(G(**))) : G(F(**)) : X(G(**)) : F((X(F(**)) OR (G(F((X(F(*)) AND **))) AND X(F(**))))) : ((X(G((G(*) OR *))) AND **) OR **) : F(G(*)) : G((F(G(**)) OR **)) : G(F(*))"
},
"net":
{
"arcs": 34,
"conflict_clusters": 9,
"places": 15,
"places_significant": 9,
"singleton_clusters": 0,
"transitions": 11
},
"result":
{
"preliminary_value": "no no no no no no no no no unknown no ",
"value": "no no no no no no no no no unknown 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: 26/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 480
lola: finding significant places
lola: 15 places, 11 transitions, 9 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: G ((p9 <= p8)) : (X ((F ((1 <= p0)) U ((0 <= 0) U (3 <= p1)))) OR (1 <= p0)) : G ((X ((p8 <= p4)) OR (F (G ((p4 + 1 <= p7))) U X (X ((p10 <= p2)))))) : X (X (G ((p3 <= p0)))) : NOT(F (NOT(G (X (X (X (F (X ((1 <= p9)))))))))) : G (X (G (((p2 <= p6) OR (1 <= p8))))) : F ((G (F (X ((NOT(X (G ((1 <= p4)))) AND (p4 <= 0))))) U X (F ((p11 <= p1))))) : ((NOT(F (X ((F ((1 <= p8)) AND (1 <= p8))))) AND (p8 <= 0)) OR ((p3 + 1 <= p2) AND (p8 <= 0))) : G (NOT(G (F (X ((p9 <= p12)))))) : G ((F (G (F (X (X (F (G ((2 <= p7)))))))) OR (p8 <= p11))) : F (G (((NOT(X ((p8 <= p2))) AND G ((p8 <= p2))) U NOT(F (G ((2 <= p8)))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:100
lola: rewrite Frontend/Parser/formula_rewrite.k:169
lola: rewrite Frontend/Parser/formula_rewrite.k:422
lola: rewrite Frontend/Parser/formula_rewrite.k:428
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
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:347
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:329
lola: rewrite Frontend/Parser/formula_rewrite.k:300
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
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:315
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
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:374
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:425
lola: rewrite Frontend/Parser/formula_rewrite.k:350
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((3 <= p1))) OR (1 <= p0))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 0 will run for 324 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (1 <= p0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (1 <= p0)
lola: processed formula length: 9
lola: 60 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((3 <= p1)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((3 <= p1)))
lola: processed formula length: 17
lola: 60 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 20006 markings, 20006 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 1 will run for 356 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((X ((p8 <= p4)) OR (X (X ((p10 <= p2))) OR (X (X (F ((p10 <= p2)))) AND F (G ((p4 + 1 <= p7)))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((X ((p8 <= p4)) OR (X (X ((p10 <= p2))) OR (X (X (F ((p10 <= p2)))) AND F (G ((p4 + 1 <= p7)))))))
lola: processed formula length: 101
lola: 60 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 2857339 markings, 5045471 edges, 571468 markings/sec, 0 secs
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: 3700517 markings, 6461090 edges
lola: ========================================
lola: subprocess 2 will run for 395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((p3 <= p0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((p3 <= p0))))
lola: processed formula length: 22
lola: 60 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: 220008 markings, 320003 edges
lola: ========================================
lola: subprocess 3 will run for 445 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G (((p2 <= p6) OR (1 <= p8))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G (((p2 <= p6) OR (1 <= p8))))
lola: processed formula length: 34
lola: 60 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: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 120011 markings, 140012 edges
lola: ========================================
lola: subprocess 4 will run for 508 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((X (F ((p11 <= p1))) OR (G (F ((X (F ((p4 <= 0))) AND (p4 <= 0)))) AND X (F ((p11 <= p1))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F ((X (F ((p11 <= p1))) OR (G (F ((X (F ((p4 <= 0))) AND (p4 <= 0)))) AND X (F ((p11 <= p1))))))
lola: processed formula length: 96
lola: 60 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 8 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 20006 markings, 20006 edges
lola: ========================================
lola: subprocess 5 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((X (G ((G ((p8 <= 0)) OR (p8 <= 0)))) AND (p8 <= 0)) OR ((p3 + 1 <= p2) AND (p8 <= 0)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 593 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (p8 <= 0)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (p8 <= 0)
lola: processed formula length: 9
lola: 60 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 6 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: ((p3 + 1 <= p2) AND (p8 <= 0))
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: ((p3 + 1 <= p2) AND (p8 <= 0))
lola: processed formula length: 30
lola: 60 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 2 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: preprocessing
lola: The net violates the given property already in its initial state.
lola: 0 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 890 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((G ((p8 <= 0)) OR (p8 <= 0))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((G ((p8 <= 0)) OR (p8 <= 0))))
lola: processed formula length: 36
lola: 60 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: 120011 markings, 140012 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 712 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((1 <= p9)))
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 ((1 <= p9)))
lola: processed formula length: 17
lola: 60 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: 80008 markings, 80008 edges
lola: ========================================
lola: subprocess 7 will run for 889 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((p8 <= 1)))
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 ((p8 <= 1)))
lola: processed formula length: 17
lola: 60 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: 379992 markings, 419994 edges
lola: ========================================
lola: subprocess 8 will run for 1186 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p12 + 1 <= p9)))
lola: ========================================
lola: SUBTASK
lola: checking stabilization
lola: stabilization not yet implemented, converting to LTL...
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((p12 + 1 <= p9)))
lola: processed formula length: 23
lola: 60 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: 100004 markings, 100005 edges
lola: ========================================
lola: subprocess 9 will run for 1779 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((p9 <= p8))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((p9 <= p8))
lola: processed formula length: 14
lola: 60 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: 100012 markings, 100013 edges
lola: ========================================
lola: subprocess 10 will run for 3559 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G ((F (G ((2 <= p7))) OR (p8 <= p11)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (G ((2 <= p7))) OR (p8 <= p11)))
lola: processed formula length: 38
lola: 60 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: 3380216 markings, 4966785 edges, 676043 markings/sec, 0 secs
lola: 6356185 markings, 9520427 edges, 595194 markings/sec, 5 secs
lola: 9222946 markings, 13894424 edges, 573352 markings/sec, 10 secs
lola: 12063961 markings, 18249242 edges, 568203 markings/sec, 15 secs
lola: 14884056 markings, 22659925 edges, 564019 markings/sec, 20 secs
lola: 17533177 markings, 26768057 edges, 529824 markings/sec, 25 secs
lola: 20114476 markings, 30763055 edges, 516260 markings/sec, 30 secs
lola: 22662698 markings, 34767732 edges, 509644 markings/sec, 35 secs
lola: 25125176 markings, 38575788 edges, 492496 markings/sec, 40 secs
lola: 27505995 markings, 42407154 edges, 476164 markings/sec, 45 secs
lola: 29793037 markings, 46003422 edges, 457408 markings/sec, 50 secs
lola: 32107650 markings, 49635610 edges, 462923 markings/sec, 55 secs
lola: 34390930 markings, 53210208 edges, 456656 markings/sec, 60 secs
lola: 36684353 markings, 56807415 edges, 458685 markings/sec, 65 secs
lola: 38986994 markings, 60417300 edges, 460528 markings/sec, 70 secs
lola: 41273198 markings, 63998558 edges, 457241 markings/sec, 75 secs
lola: 43417927 markings, 67355673 edges, 428946 markings/sec, 80 secs
lola: 45553276 markings, 70703303 edges, 427070 markings/sec, 85 secs
lola: 47684162 markings, 74042598 edges, 426177 markings/sec, 90 secs
lola: 49800978 markings, 77361795 edges, 423363 markings/sec, 95 secs
lola: 51929993 markings, 80701905 edges, 425803 markings/sec, 100 secs
lola: 54085812 markings, 84081838 edges, 431164 markings/sec, 105 secs
lola: 56266085 markings, 87508126 edges, 436055 markings/sec, 110 secs
lola: 58387443 markings, 90822461 edges, 424272 markings/sec, 115 secs
lola: 60527169 markings, 94160132 edges, 427945 markings/sec, 120 secs
lola: 62680933 markings, 97534791 edges, 430753 markings/sec, 125 secs
lola: 64858117 markings, 100942418 edges, 435437 markings/sec, 130 secs
lola: 66990760 markings, 104283282 edges, 426529 markings/sec, 135 secs
lola: 69062422 markings, 107529236 edges, 414332 markings/sec, 140 secs
lola: 71100878 markings, 110721443 edges, 407691 markings/sec, 145 secs
lola: 73127835 markings, 113881323 edges, 405391 markings/sec, 150 secs
lola: 75155765 markings, 117055595 edges, 405586 markings/sec, 155 secs
lola: 77221378 markings, 120281451 edges, 413123 markings/sec, 160 secs
lola: 79233770 markings, 123429773 edges, 402478 markings/sec, 165 secs
lola: 81195998 markings, 126481000 edges, 392446 markings/sec, 170 secs
lola: 83182512 markings, 129584488 edges, 397303 markings/sec, 175 secs
lola: 85213599 markings, 132771375 edges, 406217 markings/sec, 180 secs
lola: 87347105 markings, 136113719 edges, 426701 markings/sec, 185 secs
lola: 89509158 markings, 139499802 edges, 432411 markings/sec, 190 secs
lola: 91624284 markings, 142812084 edges, 423025 markings/sec, 195 secs
lola: 93705289 markings, 146069025 edges, 416201 markings/sec, 200 secs
lola: 95772181 markings, 149307956 edges, 413378 markings/sec, 205 secs
lola: 97779361 markings, 152446651 edges, 401436 markings/sec, 210 secs
lola: 99434077 markings, 155040575 edges, 330943 markings/sec, 215 secs
lola: 100997545 markings, 157485201 edges, 312694 markings/sec, 220 secs
lola: 102089601 markings, 159193808 edges, 218411 markings/sec, 225 secs
lola: 103283378 markings, 161059238 edges, 238755 markings/sec, 230 secs
lola: 105068932 markings, 163861101 edges, 357111 markings/sec, 235 secs
lola: 106713969 markings, 166436311 edges, 329007 markings/sec, 240 secs
lola: 108082849 markings, 168582210 edges, 273776 markings/sec, 245 secs
lola: 109744095 markings, 171182529 edges, 332249 markings/sec, 250 secs
lola: 111277834 markings, 173593284 edges, 306748 markings/sec, 255 secs
lola: 112541970 markings, 175578001 edges, 252827 markings/sec, 260 secs
lola: 113825898 markings, 177591300 edges, 256786 markings/sec, 265 secs
lola: 113952105 markings, 177780454 edges, 25241 markings/sec, 270 secs
lola: 115224591 markings, 179753960 edges, 254497 markings/sec, 275 secs
lola: 116477420 markings, 181711903 edges, 250566 markings/sec, 280 secs
lola: 117005077 markings, 182520596 edges, 105531 markings/sec, 285 secs
lola: 118297258 markings, 184526349 edges, 258436 markings/sec, 290 secs
lola: 119612886 markings, 186586544 edges, 263126 markings/sec, 295 secs
lola: 120983371 markings, 188731069 edges, 274097 markings/sec, 300 secs
lola: 122088785 markings, 190465343 edges, 221083 markings/sec, 305 secs
lola: 122396966 markings, 190948071 edges, 61636 markings/sec, 310 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: G ((F (G ((2 <= p7))) OR (p8 <= p11)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G ((F (G ((2 <= p7))) OR (p8 <= p11)))
lola: processed formula length: 38
lola: 60 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: 3091134 markings, 4561779 edges, 618227 markings/sec, 0 secs
lola: 5996088 markings, 8975826 edges, 580991 markings/sec, 5 secs
lola: 8900377 markings, 13418747 edges, 580858 markings/sec, 10 secs
lola: 11754351 markings, 17742749 edges, 570795 markings/sec, 15 secs
lola: 14600307 markings, 22213634 edges, 569191 markings/sec, 20 secs
lola: 17306661 markings, 26386773 edges, 541271 markings/sec, 25 secs
lola: 19907026 markings, 30435341 edges, 520073 markings/sec, 30 secs
lola: 22453450 markings, 34437432 edges, 509285 markings/sec, 35 secs
lola: 24928253 markings, 38253337 edges, 494961 markings/sec, 40 secs
lola: 27312850 markings, 42104188 edges, 476919 markings/sec, 45 secs
lola: 29608110 markings, 45711065 edges, 459052 markings/sec, 50 secs
lola: 31815852 markings, 49174959 edges, 441548 markings/sec, 55 secs
lola: 33930810 markings, 52489234 edges, 422992 markings/sec, 60 secs
lola: 36033326 markings, 55787327 edges, 420503 markings/sec, 65 secs
lola: 38150434 markings, 59103298 edges, 423422 markings/sec, 70 secs
lola: 40278968 markings, 62441604 edges, 425707 markings/sec, 75 secs
lola: 42386199 markings, 65740479 edges, 421446 markings/sec, 80 secs
lola: 44494878 markings, 69045137 edges, 421736 markings/sec, 85 secs
lola: 46646598 markings, 72420841 edges, 430344 markings/sec, 90 secs
lola: 48759540 markings, 75729703 edges, 422588 markings/sec, 95 secs
lola: 50898836 markings, 79085591 edges, 427859 markings/sec, 100 secs
lola: 53059746 markings, 82471527 edges, 432182 markings/sec, 105 secs
lola: 55229867 markings, 85873949 edges, 434024 markings/sec, 110 secs
lola: 57425552 markings, 89321453 edges, 439137 markings/sec, 115 secs
lola: 59582592 markings, 92687708 edges, 431408 markings/sec, 120 secs
lola: 61743710 markings, 96065848 edges, 432224 markings/sec, 125 secs
lola: 64054664 markings, 99689154 edges, 462191 markings/sec, 130 secs
lola: 66405089 markings, 103365661 edges, 470085 markings/sec, 135 secs
lola: 68699498 markings, 106958949 edges, 458882 markings/sec, 140 secs
lola: 70968180 markings, 110513100 edges, 453736 markings/sec, 145 secs
lola: 73118159 markings, 113865939 edges, 429996 markings/sec, 150 secs
lola: 75214814 markings, 117147502 edges, 419331 markings/sec, 155 secs
lola: 77300121 markings, 120405075 edges, 417061 markings/sec, 160 secs
lola: 79408480 markings, 123693646 edges, 421672 markings/sec, 165 secs
lola: 81529454 markings, 127007401 edges, 424195 markings/sec, 170 secs
lola: 83610772 markings, 130255622 edges, 416264 markings/sec, 175 secs
lola: 85719394 markings, 133563633 edges, 421724 markings/sec, 180 secs
lola: 87799363 markings, 136816795 edges, 415994 markings/sec, 185 secs
lola: 89925274 markings, 140148482 edges, 425182 markings/sec, 190 secs
lola: 92075354 markings, 143521530 edges, 430016 markings/sec, 195 secs
lola: 94169700 markings, 146796160 edges, 418869 markings/sec, 200 secs
lola: 96275685 markings, 150094433 edges, 421197 markings/sec, 205 secs
lola: 98311126 markings, 153280622 edges, 407088 markings/sec, 210 secs
lola: 99666679 markings, 155405906 edges, 271111 markings/sec, 215 secs
lola: 100854537 markings, 157260637 edges, 237572 markings/sec, 220 secs
lola: 102302050 markings, 159528076 edges, 289503 markings/sec, 225 secs
lola: 103712159 markings, 161734282 edges, 282022 markings/sec, 230 secs
lola: 104968201 markings, 163702982 edges, 251208 markings/sec, 235 secs
lola: 106361460 markings, 165886327 edges, 278652 markings/sec, 240 secs
lola: 107781252 markings, 168113765 edges, 283958 markings/sec, 245 secs
lola: 109254547 markings, 170416181 edges, 294659 markings/sec, 250 secs
lola: 111139937 markings, 173376689 edges, 377078 markings/sec, 255 secs
lola: 112468618 markings, 175463196 edges, 265736 markings/sec, 260 secs
lola: 113815745 markings, 177576043 edges, 269425 markings/sec, 265 secs
lola: 114477936 markings, 178585725 edges, 132438 markings/sec, 270 secs
lola: 115906848 markings, 180813643 edges, 285782 markings/sec, 275 secs
lola: 116960148 markings, 182453272 edges, 210660 markings/sec, 280 secs
lola: 117665026 markings, 183537901 edges, 140976 markings/sec, 285 secs
lola: 119123859 markings, 185819066 edges, 291767 markings/sec, 290 secs
lola: 120472527 markings, 187933740 edges, 269734 markings/sec, 295 secs
lola: 121810126 markings, 190027465 edges, 267520 markings/sec, 300 secs
lola: 122198652 markings, 190638649 edges, 77705 markings/sec, 305 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no no no no no no no no unknown no
lola:
preliminary result: no no no no no no no no no unknown no
lola: memory consumption: 3324 KB
lola: time consumption: 654 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="RobotManipulation-PT-10000"
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 RobotManipulation-PT-10000, 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 r208-smll-162089471000053"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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