Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2020-input.r184-oct2-158987928600457.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2020-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 itslola
Input is JoinFreeModules-PT-1000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r184-oct2-158987928600457
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.9M
-rw-r--r-- 1 mcc users 3.9K Apr 7 22:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 7 22:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 7 01:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 7 01:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 24 05:37 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.7K Mar 24 05:37 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 14 12:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 28 14:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Apr 14 12:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 28 14:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Apr 6 07:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Apr 6 07:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Apr 5 14:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 5 14:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 6 20:24 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 6 20:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 24 05:37 instance
-rw-r--r-- 1 mcc users 6 Mar 24 05:37 iscolored
-rw-r--r-- 1 mcc users 5.7M Mar 24 05:37 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME JoinFreeModules-PT-1000-00
FORMULA_NAME JoinFreeModules-PT-1000-01
FORMULA_NAME JoinFreeModules-PT-1000-02
FORMULA_NAME JoinFreeModules-PT-1000-03
FORMULA_NAME JoinFreeModules-PT-1000-04
FORMULA_NAME JoinFreeModules-PT-1000-05
FORMULA_NAME JoinFreeModules-PT-1000-06
FORMULA_NAME JoinFreeModules-PT-1000-07
FORMULA_NAME JoinFreeModules-PT-1000-08
FORMULA_NAME JoinFreeModules-PT-1000-09
FORMULA_NAME JoinFreeModules-PT-1000-10
FORMULA_NAME JoinFreeModules-PT-1000-11
FORMULA_NAME JoinFreeModules-PT-1000-12
FORMULA_NAME JoinFreeModules-PT-1000-13
FORMULA_NAME JoinFreeModules-PT-1000-14
FORMULA_NAME JoinFreeModules-PT-1000-15

=== Now, execution of the tool begins

BK_START 1591208675690

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
[2020-06-03 18:24:37] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -z3path, /home/mcc/BenchKit//z3/bin/z3, -yices2path, /home/mcc/BenchKit//yices/bin/yices, -timeout, 3600, -rebuildPNML]
[2020-06-03 18:24:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2020-06-03 18:24:38] [INFO ] Load time of PNML (sax parser for PT used): 336 ms
[2020-06-03 18:24:38] [INFO ] Transformed 5001 places.
[2020-06-03 18:24:38] [INFO ] Transformed 8001 transitions.
[2020-06-03 18:24:38] [INFO ] Parsed PT model containing 5001 places and 8001 transitions in 415 ms.
Reduce places removed 1 places and 0 transitions.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 161 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 100725 steps, including 0 resets, run finished after 3481 ms. (steps per millisecond=28 ) properties seen :[0, 0, 0, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 0, 0, 0, 0]
// Phase 1: matrix 8001 rows 5000 cols
[2020-06-03 18:24:41] [INFO ] Computed 1000 place invariants in 81 ms
[2020-06-03 18:24:42] [INFO ] [Real]Absence check using 1000 positive place invariants in 61 ms returned unsat
[2020-06-03 18:24:45] [INFO ] [Real]Absence check using 1000 positive place invariants in 2627 ms returned sat
[2020-06-03 18:24:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:25:02] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:25:02] [INFO ] [Real]Absence check using state equation in 17069 ms returned (error "Failed to check-sat")
[2020-06-03 18:25:06] [INFO ] [Real]Absence check using 1000 positive place invariants in 2581 ms returned sat
[2020-06-03 18:25:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:25:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (= s1304 (- (+ t2084 (* 4 t2088)) (* 5 t2087)))") while checking expression at index 2
[2020-06-03 18:25:25] [INFO ] [Real]Absence check using 1000 positive place invariants in 1790 ms returned sat
[2020-06-03 18:25:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:25:42] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:25:42] [INFO ] [Real]Absence check using state equation in 17389 ms returned unknown
[2020-06-03 18:25:47] [INFO ] [Real]Absence check using 1000 positive place invariants in 3420 ms returned sat
[2020-06-03 18:25:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:26:02] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:26:02] [INFO ] [Real]Absence check using state equation in 15865 ms returned (error "Failed to check-sat")
[2020-06-03 18:26:06] [INFO ] [Real]Absence check using 1000 positive place invariants in 2748 ms returned sat
[2020-06-03 18:26:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:26:22] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:26:22] [INFO ] [Real]Absence check using state equation in 16931 ms returned (error "Failed to check-sat")
[2020-06-03 18:26:27] [INFO ] [Real]Absence check using 1000 positive place invariants in 4128 ms returned sat
[2020-06-03 18:26:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:26:43] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:26:43] [INFO ] [Real]Absence check using state equation in 15587 ms returned (error "Failed to check-sat")
[2020-06-03 18:26:49] [INFO ] [Real]Absence check using 1000 positive place invariants in 6013 ms returned sat
[2020-06-03 18:26:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:27:03] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:27:03] [INFO ] [Real]Absence check using state equation in 13267 ms returned unknown
[2020-06-03 18:27:06] [INFO ] [Real]Absence check using 1000 positive place invariants in 3253 ms returned sat
[2020-06-03 18:27:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:27:23] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:27:23] [INFO ] [Real]Absence check using state equation in 16101 ms returned (error "Failed to check-sat")
[2020-06-03 18:27:29] [INFO ] [Real]Absence check using 1000 positive place invariants in 5375 ms returned sat
[2020-06-03 18:27:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:27:43] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:27:43] [INFO ] [Real]Absence check using state equation in 13998 ms returned (error "Failed to check-sat")
[2020-06-03 18:27:46] [INFO ] [Real]Absence check using 1000 positive place invariants in 2294 ms returned sat
[2020-06-03 18:27:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:28:03] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:28:03] [INFO ] [Real]Absence check using state equation in 16990 ms returned (error "Failed to check-sat")
[2020-06-03 18:28:10] [INFO ] [Real]Absence check using 1000 positive place invariants in 6244 ms returned sat
[2020-06-03 18:28:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:28:23] [INFO ] [Real]Absence check using state equation in 13071 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 18:28:31] [INFO ] [Real]Absence check using 1000 positive place invariants in 7110 ms returned sat
[2020-06-03 18:28:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:28:43] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:28:43] [INFO ] [Real]Absence check using state equation in 12196 ms returned unknown
[2020-06-03 18:28:50] [INFO ] [Real]Absence check using 1000 positive place invariants in 6762 ms returned sat
[2020-06-03 18:28:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:29:03] [INFO ] [Real]Absence check using state equation in 12598 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 18:29:10] [INFO ] [Real]Absence check using 1000 positive place invariants in 6853 ms returned sat
[2020-06-03 18:29:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:29:23] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:29:23] [INFO ] [Real]Absence check using state equation in 12489 ms returned (error "Failed to check-sat")
[2020-06-03 18:29:30] [INFO ] [Real]Absence check using 1000 positive place invariants in 6425 ms returned sat
[2020-06-03 18:29:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:29:43] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:29:43] [INFO ] [Real]Absence check using state equation in 12944 ms returned (error "Failed to check-sat")
[2020-06-03 18:29:50] [INFO ] [Real]Absence check using 1000 positive place invariants in 6099 ms returned sat
[2020-06-03 18:29:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:30:03] [INFO ] [Real]Absence check using state equation in 13244 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 18:30:10] [INFO ] [Real]Absence check using 1000 positive place invariants in 6674 ms returned sat
[2020-06-03 18:30:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:30:23] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:30:23] [INFO ] [Real]Absence check using state equation in 12672 ms returned unknown
[2020-06-03 18:30:30] [INFO ] [Real]Absence check using 1000 positive place invariants in 6417 ms returned sat
[2020-06-03 18:30:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:30:43] [INFO ] [Real]Absence check using state equation in 12919 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 18:30:51] [INFO ] [Real]Absence check using 1000 positive place invariants in 7363 ms returned sat
[2020-06-03 18:30:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:31:03] [INFO ] [Real]Absence check using state equation in 12037 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 18:31:10] [INFO ] [Real]Absence check using 1000 positive place invariants in 6839 ms returned sat
[2020-06-03 18:31:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:31:23] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream closed (= s476 (- (+ 1 (* 3 t761) t762 t767) (* 2 t763)))") while checking expression at index 20
[2020-06-03 18:31:31] [INFO ] [Real]Absence check using 1000 positive place invariants in 7019 ms returned sat
[2020-06-03 18:31:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:31:43] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:31:43] [INFO ] [Real]Absence check using state equation in 12258 ms returned (error "Failed to check-sat")
[2020-06-03 18:31:50] [INFO ] [Real]Absence check using 1000 positive place invariants in 6194 ms returned sat
[2020-06-03 18:31:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:32:03] [INFO ] [Real]Absence check using state equation in 13118 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 18:32:10] [INFO ] [Real]Absence check using 1000 positive place invariants in 6498 ms returned sat
[2020-06-03 18:32:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:32:23] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:32:23] [INFO ] [Real]Absence check using state equation in 12851 ms returned (error "Failed to check-sat")
[2020-06-03 18:32:30] [INFO ] [Real]Absence check using 1000 positive place invariants in 6155 ms returned sat
[2020-06-03 18:32:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:32:43] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:32:43] [INFO ] [Real]Absence check using state equation in 13185 ms returned (error "Failed to check-sat")
[2020-06-03 18:32:51] [INFO ] [Real]Absence check using 1000 positive place invariants in 7165 ms returned sat
[2020-06-03 18:32:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:33:03] [INFO ] [Real]Absence check using state equation in 12204 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 18:33:11] [INFO ] [Real]Absence check using 1000 positive place invariants in 7038 ms returned sat
[2020-06-03 18:33:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:33:23] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:33:23] [INFO ] [Real]Absence check using state equation in 12328 ms returned (error "Failed to check-sat")
[2020-06-03 18:33:31] [INFO ] [Real]Absence check using 1000 positive place invariants in 6707 ms returned sat
[2020-06-03 18:33:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:33:43] [INFO ] [Real]Absence check using state equation in 12646 ms returned (error "Solver has unexpectedly terminated")
[2020-06-03 18:33:52] [INFO ] [Real]Absence check using 1000 positive place invariants in 8078 ms returned sat
[2020-06-03 18:33:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:34:03] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:34:03] [INFO ] [Real]Absence check using state equation in 11272 ms returned (error "Failed to check-sat")
[2020-06-03 18:34:12] [INFO ] [Real]Absence check using 1000 positive place invariants in 7796 ms returned sat
[2020-06-03 18:34:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:34:23] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:34:23] [INFO ] [Real]Absence check using state equation in 11509 ms returned (error "Failed to check-sat")
[2020-06-03 18:34:28] [INFO ] [Real]Absence check using 1000 positive place invariants in 3998 ms returned sat
[2020-06-03 18:34:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:34:43] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:34:43] [INFO ] [Real]Absence check using state equation in 15258 ms returned unknown
[2020-06-03 18:34:47] [INFO ] [Real]Absence check using 1000 positive place invariants in 3295 ms returned sat
[2020-06-03 18:34:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:35:03] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:35:03] [INFO ] [Real]Absence check using state equation in 16417 ms returned unknown
[2020-06-03 18:35:08] [INFO ] [Real]Absence check using 1000 positive place invariants in 3468 ms returned sat
[2020-06-03 18:35:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:35:23] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:35:23] [INFO ] [Real]Absence check using state equation in 15890 ms returned unknown
[2020-06-03 18:35:25] [INFO ] [Real]Absence check using 1000 positive place invariants in 1722 ms returned sat
[2020-06-03 18:35:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:35:43] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:35:43] [INFO ] [Real]Absence check using state equation in 18006 ms returned (error "Failed to check-sat")
[2020-06-03 18:35:51] [INFO ] [Real]Absence check using 1000 positive place invariants in 6332 ms returned sat
[2020-06-03 18:35:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:36:04] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe (= s525 (- (+ 2 t843 (* 3 t845) (* 2 t847)) (+ (* 3 t841) (* 3 t846))))") while checking expression at index 34
[2020-06-03 18:36:06] [INFO ] [Real]Absence check using 1000 positive place invariants in 2115 ms returned sat
[2020-06-03 18:36:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:36:24] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:36:24] [INFO ] [Real]Absence check using state equation in 17219 ms returned (error "Failed to check-sat")
[2020-06-03 18:36:26] [INFO ] [Real]Absence check using 1000 positive place invariants in 1713 ms returned sat
[2020-06-03 18:36:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2020-06-03 18:36:44] [INFO ] SMT solver returned unknown. Retrying;
[2020-06-03 18:36:44] [INFO ] [Real]Absence check using state equation in 18021 ms returned (error "Failed to check-sat")
Successfully simplified 1 atomic propositions for a total of 1 simplifications.
[2020-06-03 18:36:44] [INFO ] Flatten gal took : 580 ms
[2020-06-03 18:36:45] [INFO ] Flatten gal took : 390 ms
[2020-06-03 18:36:45] [INFO ] Export to MCC properties in file /home/mcc/execution/LTLCardinality.sr.xml took 5 ms.
[2020-06-03 18:36:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml took 55 ms.
info: Time: 3600 - MCC
vrfy: Checking LTLCardinality @ JoinFreeModules-PT-1000 @ 3570 seconds
check_solution: Constraint R1 = 4.65800862865e-310 is above its equality of -2
check_solution: Constraint R2 = 0 is above its equality of -1
check_solution: Constraint R3 = 0 is above its equality of -1000
check_solution: Constraint R6 = 2.12199579146e-314 is above its equality of -2
check_solution: Constraint R7 = 0 is above its equality of -1
check_solution: Constraint R8 = 2.12199579146e-314 is above its equality of -1000
check_solution: Constraint R10 = 2.12199579146e-314 is above its equality of -1000
check_solution: Constraint R11 = 0 is above its equality of -2
check_solution: Constraint R12 = 2.12199579146e-314 is above its equality of -1
check_solution: Constraint R13 = 0 is above its equality of -1000

Seriously low accuracy found ||*|| = 1000 (rel. error 1)
check_solution: Constraint R1 = 0 is above its equality of -2
check_solution: Constraint R2 = 2.12199579146e-314 is above its equality of -1
check_solution: Constraint R3 = 0 is above its equality of -1000
check_solution: Constraint R6 = 2.12199579146e-314 is above its equality of -2
check_solution: Constraint R7 = 0 is above its equality of -1
check_solution: Constraint R8 = 2.12199579146e-314 is above its equality of -1000
check_solution: Constraint R10 = 2.12199579146e-314 is above its equality of -1000
check_solution: Constraint R11 = 0 is above its equality of -2
check_solution: Constraint R12 = 2.12199579146e-314 is above its equality of -1
check_solution: Constraint R13 = 0 is above its equality of -1000

Seriously low accuracy found ||*|| = 1002 (rel. error 374)
check_solution: Variable C5817 = -0.5 is below its lower bound 0
check_solution: Variable C5827 = -0.5 is below its lower bound 0
check_solution: Variable C5837 = -0.5 is below its lower bound 0
check_solution: Variable C5847 = -0.5 is below its lower bound 0
check_solution: Variable C5857 = -0.5 is below its lower bound 0
check_solution: Variable C5867 = -0.5 is below its lower bound 0
check_solution: Variable C5877 = -0.5 is below its lower bound 0
check_solution: Variable C5887 = -0.5 is below its lower bound 0
check_solution: Variable C7117 = -0.5 is below its lower bound 0
check_solution: Variable C7127 = -0.5 is below its lower bound 0

Seriously low accuracy found ||*|| = 1000 (rel. error 2)

FORMULA JoinFreeModules-PT-1000-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-1000-01 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-1000-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-1000-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-1000-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-1000-09 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-1000-10 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-1000-11 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-1000-12 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-1000-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-1000-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-1000-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-1000-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-1000-04 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-1000-07 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA JoinFreeModules-PT-1000-08 CANNOT_COMPUTE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
vrfy: finished
info: timeLeft: 2492
rslt: Output for LTLCardinality @ JoinFreeModules-PT-1000

{
"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": "Wed Jun 3 18:36:46 2020
",
"timelimit": 3570
},
"child":
[

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

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 238
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 1,
"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 ((p2047 <= p4599))",
"processed_size": 20,
"rewrites": 56
},
"result":
{
"edges": 3002,
"markings": 3002,
"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"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 2,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 249
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 2,
"G": 1,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 2,
"comp": 4,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 1,
"tdisj": 2,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "X ((F (G ((3 <= p4480))) OR ((p4480 <= 2) OR (F ((p3033 + 1 <= p1189)) AND X ((p4480 <= 2))))))",
"processed_size": 95,
"rewrites": 56
},
"result":
{
"edges": 4002,
"markings": 4003,
"produced_by": "LTL model checker",
"value": true
},
"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": 272
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 272
},
"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 ((p3732 + 1 <= p2117)))",
"processed_size": 28,
"rewrites": 56
},
"result":
{
"edges": 216,
"markings": 215,
"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": "stabilization",
"workflow": "product automaton"
}
}
],
"exit":
{
"localtimelimitreached": false
},
"result":
{
"produced_by": "boolean",
"value": false
},
"task":
{
"compoundnumber": 5,
"type": "boolean"
}
},

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

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 349
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"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 (G ((3 <= p3590)))",
"processed_size": 20,
"rewrites": 56
},
"result":
{
"edges": 3002,
"markings": 3002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 8,
"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": 398
},
"child":
[

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

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 465
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 0,
"U": 0,
"X": 2,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 5,
"taut": 0,
"tconj": 2,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 5,
"visible_transitions": 0
},
"processed": "X (F ((F ((p575 <= p4200)) AND F ((X ((3 <= p1447)) AND (p4542 <= p1398))))))",
"processed_size": 77,
"rewrites": 56
},
"result":
{
"edges": 6003,
"markings": 6002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 5
},
"compoundnumber": 10,
"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": 9,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 465
},
"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": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "X (F ((p1355 + 1 <= p4662)))",
"processed_size": 28,
"rewrites": 56
},
"result":
{
"edges": 2001,
"markings": 2002,
"produced_by": "LTL model checker",
"value": true
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 10,
"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": 558
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 1,
"X": 2,
"aconj": 0,
"adisj": 1,
"aneg": 1,
"comp": 5,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 9,
"taut": 0,
"tconj": 1,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 7,
"visible_transitions": 0
},
"processed": "(X (((2 <= p3365) AND (p2063 <= p4523) AND (p3247 <= p1009))) U (X (G ((p1755 + 1 <= p1179))) AND (p1179 <= p1755)))",
"processed_size": 116,
"rewrites": 56
},
"result":
{
"edges": 3002,
"markings": 3002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 7
},
"compoundnumber": 11,
"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": 697
},
"child":
[

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 697
},
"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": "(3 <= p4738)",
"processed_size": 12,
"rewrites": 56
},
"result":
{
"edges": 0,
"markings": 0,
"produced_by": "preprocessing",
"value": false
},
"task":
{
"compoundnumber": 12,
"type": "initial_satisfaction",
"workflow": "preprocessing"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 930
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 1,
"U": 0,
"X": 1,
"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": "X (G ((p1240 + 1 <= p1798)))",
"processed_size": 28,
"rewrites": 56
},
"result":
{
"edges": 3002,
"markings": 3002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 3
},
"compoundnumber": 13,
"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": 12,
"type": "boolean"
}
},

{
"call":
{
"dynamic_timelimit": true,
"localtimelimit": 930
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 0,
"U": 0,
"X": 3,
"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 (X (X (F ((p2902 <= 0)))))",
"processed_size": 28,
"rewrites": 56
},
"result":
{
"edges": 3002,
"markings": 3002,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 4
},
"compoundnumber": 13,
"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": 1395
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 1,
"G": 1,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 1,
"aneg": 0,
"comp": 2,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 4,
"visible_transitions": 0
},
"processed": "G (F (((p4802 + 1 <= p2255) OR (p4060 <= p3263))))",
"processed_size": 51,
"rewrites": 56
},
"result":
{
"edges": 214,
"markings": 214,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 2
},
"compoundnumber": 14,
"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": 2790
},
"exit":
{
"localtimelimitreached": false
},
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 3,
"G": 2,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 0,
"comp": 3,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 4,
"taut": 0,
"tconj": 1,
"tdisj": 1,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 3,
"visible_transitions": 0
},
"processed": "F (G ((F ((2 <= p3716)) OR (G ((p711 <= p536)) AND F ((2 <= p3716))))))",
"processed_size": 71,
"rewrites": 56
},
"result":
{
"edges": 426,
"markings": 425,
"produced_by": "LTL model checker",
"value": false
},
"task":
{
"buchi":
{
"states": 8
},
"compoundnumber": 15,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "ltl preserving/insertion"
},
"type": "product automaton/dfs"
},
"type": "LTL",
"workflow": "product automaton"
}
},

{
"child":
[

{
"formula":
{
"count":
{
"A": 0,
"E": 0,
"F": 0,
"G": 0,
"U": 0,
"X": 0,
"aconj": 0,
"adisj": 0,
"aneg": 1,
"comp": 1,
"cont": 0,
"dl": 0,
"fir": 0,
"nodl": 0,
"place_references": 2,
"taut": 0,
"tconj": 0,
"tdisj": 0,
"tneg": 0,
"transition_references": 0,
"unfir": 0,
"visible_places": 2,
"visible_transitions": 0
},
"processed": "(p4060 + 1 <= p2809)",
"processed_size": 20,
"rewrites": 58
},
"result":
{
"edges": 0,
"markings": 1,
"produced_by": "state space / EG",
"value": true
},
"task":
{
"compoundnumber": 17,
"search":
{
"store":
{
"encoder": "simple compression",
"type": "prefix"
},
"stubborn":
{
"type": "reachability preserving/insertion",
"visible": 8
},
"threads": 1,
"type": "dfs"
},
"type": "eventual_occurrence"
}
}
],
"result":
{
"produced_by": "boolean",
"value": null
},
"task":
{
"compoundnumber": 17,
"type": "boolean"
}
}
],
"exit":
{
"error": null,
"memory": 3620,
"runtime": 1078.000000,
"signal": null,
"timelimitreached": false
},
"files":
{
"formula": "LTLCardinality.xml",
"net": "model.pnml"
},
"formula":
{
"skeleton": "X(G(**)) : X((** OR (G(**) AND F(**)))) : (X(**) OR G(F((F(G(*)) OR **)))) : F(G((F(**) OR (G(**) AND F(**))))) : F(G((F(**) AND (X(**) OR **)))) : X((F(G(**)) OR (** OR (F(*) AND X(*))))) : (F(G(*)) AND ((F(**) U **) AND X(F(**)))) : (X(X(G(*))) AND F(**)) : X(G((X(G(*)) OR **))) : X(G(**)) : (X(F((F(**) AND F((X(**) AND **))))) AND F(**)) : X(F(**)) : (X(*) U (X(G(**)) AND **)) : G(F(**)) : (X(G(*)) AND (F((X(*) AND **)) OR **)) : X(X(X(F(**))))"
},
"net":
{
"arcs": 23000,
"conflict_clusters": 4001,
"places": 5000,
"places_significant": 4000,
"singleton_clusters": 0,
"transitions": 8001
},
"result":
{
"preliminary_value": "no no no no unknown yes no unknown unknown no no yes no no no no ",
"value": "no no no no unknown yes no unknown unknown no no yes no no no no "
},
"task":
{
"type": "compound"
}
}
lola: LoLA will run for 3570 seconds at most (--timelimit)
lola: NET
lola: input: PNML file (--pnml)
lola: reading net from model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file model.pnml
lola: 13001/268435456 symbol table entries, 0 collisions
lola: preprocessing...
lola: Size of bit vector: 160000
lola: finding significant places
lola: 5000 places, 8001 transitions, 4000 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 (X ((3 <= p3325))) : X ((G ((2 <= p496)) U (p2027 <= p1680))) : (X ((p2047 <= p4599)) OR G (X (F ((NOT(G (F ((p2558 <= p410)))) OR (1 <= p1533)))))) : G (F (G ((G ((p711 <= p536)) U F ((2 <= p3716)))))) : X (F (G (X ((X (((p117 <= p4413) AND (2 <= p4360))) U (p4443 <= p735)))))) : X (((F (G ((3 <= p4480))) OR (p4480 <= 2)) OR (NOT(G ((p1189 <= p3033))) AND NOT(X ((3 <= p4480)))))) : ((F (G (NOT(F ((p2117 <= p3732))))) AND (F ((p2117 <= p3732)) U (2 <= p2620))) AND X (F ((1 <= p3321)))) : (NOT(X (X (F ((X (X (X ((p1184 <= p3393)))) U (2 <= p2186)))))) AND F ((p2809 <= p4060))) : G (X ((NOT(X (F ((3 <= p4848)))) OR (p4848 <= 2)))) : X (G ((3 <= p3590))) : (F (X ((F ((p575 <= p4200)) AND F ((X ((3 <= p1447)) AND (p4542 <= p1398)))))) AND F ((p2803 <= p1286))) : X (F (((((p995 <= p2965) U (p1355 + 1 <= p4662)) AND (p4662 <= p1355)) U (p1355 + 1 <= p4662)))) : (NOT(X (((p3365 <= 1) OR (p4523 + 1 <= p2063) OR (p1009 + 1 <= p3247)))) U (X (G ((p1755 + 1 <= p1179))) AND (p1179 <= p1755))) : X (X (F (((2 <= p3187) U F (G (F (X (((p4802 + 1 <= p2255) OR (p4060 <= p3263)))))))))) : (NOT(X (F ((p1798 <= p1240)))) AND (F ((NOT(X ((3 <= p4738))) AND (p3299 + 1 <= p3302))) OR (3 <= p4738))) : F (X (X (F (X ((p2902 <= 0))))))
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:431
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:353
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:431
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: rewrite Frontend/Parser/formula_rewrite.k:374
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:437
lola: rewrite Frontend/Parser/formula_rewrite.k:522
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:380
lola: rewrite Frontend/Parser/formula_rewrite.k:329
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:254
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:251
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:332
lola: rewrite Frontend/Parser/formula_rewrite.k:297
lola: rewrite Frontend/Parser/formula_rewrite.k:353
lola: rewrite Frontend/Parser/formula_rewrite.k:356
lola: rewrite Frontend/Parser/formula_rewrite.k:434
lola: rewrite Frontend/Parser/formula_rewrite.k:335
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:371
lola: rewrite Frontend/Parser/formula_rewrite.k:425
lola: rewrite Frontend/Parser/formula_rewrite.k:371
lola: rewrite Frontend/Parser/formula_rewrite.k:377
lola: rewrite Frontend/Parser/formula_rewrite.k:377
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:335
lola: rewrite Frontend/Parser/formula_rewrite.k:297
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:356
lola: rewrite Frontend/Parser/formula_rewrite.k:347
lola: computing a collection of formulas
lola: RUNNING
lola: subprocess 0 will run for 193 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((3 <= p3325)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((3 <= p3325)))
lola: processed formula length: 20
lola: 56 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3002 markings, 3002 edges
lola: ========================================
lola: subprocess 1 will run for 206 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (((p2027 <= p1680) OR (G ((2 <= p496)) AND F ((p2027 <= p1680)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (((p2027 <= p1680) OR (G ((2 <= p496)) AND F ((p2027 <= p1680)))))
lola: processed formula length: 68
lola: 56 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 6 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3002 markings, 3002 edges
lola: ========================================
lola: subprocess 2 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X ((p2047 <= p4599)) OR G (F ((F (G ((p410 + 1 <= p2558))) OR (1 <= p1533)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 2 will run for 221 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F ((F (G ((p410 + 1 <= p2558))) OR (1 <= p1533))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: G (F ((F (G ((p410 + 1 <= p2558))) OR (1 <= p1533))))
lola: processed formula length: 53
lola: 56 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: 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: 215 markings, 216 edges
lola: ========================================
lola: subprocess 3 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((p2047 <= p4599))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((p2047 <= p4599))
lola: processed formula length: 20
lola: 56 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3002 markings, 3002 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 3 will run for 238 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((p4443 <= p735)) AND (X (((p117 <= p4413) AND (2 <= p4360))) OR (p4443 <= p735)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((p4443 <= p735)) AND (X (((p117 <= p4413) AND (2 <= p4360))) OR (p4443 <= p735)))))
lola: processed formula length: 93
lola: 56 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 106102 markings, 150930 edges, 21220 markings/sec, 0 secs
lola: 213331 markings, 303676 edges, 21446 markings/sec, 5 secs
lola: 320021 markings, 456679 edges, 21338 markings/sec, 10 secs
lola: 426198 markings, 608480 edges, 21235 markings/sec, 15 secs
lola: 531432 markings, 758536 edges, 21047 markings/sec, 20 secs
lola: 636562 markings, 908490 edges, 21026 markings/sec, 25 secs
lola: 741343 markings, 1058094 edges, 20956 markings/sec, 30 secs
lola: 846165 markings, 1207738 edges, 20964 markings/sec, 35 secs
lola: 951308 markings, 1357701 edges, 21029 markings/sec, 40 secs
lola: 1056547 markings, 1507768 edges, 21048 markings/sec, 45 secs
lola: 1161611 markings, 1657658 edges, 21013 markings/sec, 50 secs
lola: 1266338 markings, 1807205 edges, 20945 markings/sec, 55 secs
lola: 1371363 markings, 1957257 edges, 21005 markings/sec, 60 secs
lola: 1475007 markings, 2105519 edges, 20729 markings/sec, 65 secs
lola: 1554367 markings, 2219120 edges, 15872 markings/sec, 70 secs
lola: 1642114 markings, 2344372 edges, 17549 markings/sec, 75 secs
lola: 1728601 markings, 2468208 edges, 17297 markings/sec, 80 secs
lola: 1813385 markings, 2589252 edges, 16957 markings/sec, 85 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 4 will run for 249 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X ((F (G ((3 <= p4480))) OR ((p4480 <= 2) OR (F ((p3033 + 1 <= p1189)) AND X ((p4480 <= 2))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X ((F (G ((3 <= p4480))) OR ((p4480 <= 2) OR (F ((p3033 + 1 <= p1189)) AND X ((p4480 <= 2))))))
lola: processed formula length: 95
lola: 56 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: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 4003 markings, 4002 edges
lola: ========================================
lola: subprocess 5 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (F (G ((p3732 + 1 <= p2117))) AND ((F ((p2117 <= p3732)) U (2 <= p2620)) AND X (F ((1 <= p3321)))))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 5 will run for 272 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((p3732 + 1 <= p2117)))
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 ((p3732 + 1 <= p2117)))
lola: processed formula length: 28
lola: 56 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 215 markings, 216 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 6 will run for 299 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (X (G ((p2186 <= 1)))) AND F ((p2809 <= p4060)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 6 will run for 299 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p2809 <= p4060))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p4060 + 1 <= p2809)
lola: processed formula length: 20
lola: 58 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 7 will run for 332 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (G ((p2186 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((p2186 <= 1))))
lola: processed formula length: 24
lola: 56 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 100197 markings, 142037 edges, 20039 markings/sec, 0 secs
lola: 188271 markings, 268806 edges, 17615 markings/sec, 5 secs
lola: 291428 markings, 415630 edges, 20631 markings/sec, 10 secs
lola: 397748 markings, 567986 edges, 21264 markings/sec, 15 secs
lola: 505537 markings, 720687 edges, 21558 markings/sec, 20 secs
lola: 611113 markings, 871731 edges, 21115 markings/sec, 25 secs
lola: 717415 markings, 1024050 edges, 21260 markings/sec, 30 secs
lola: 822309 markings, 1173910 edges, 20979 markings/sec, 35 secs
lola: 926882 markings, 1323210 edges, 20915 markings/sec, 40 secs
lola: 1032059 markings, 1473574 edges, 21035 markings/sec, 45 secs
lola: 1136776 markings, 1623126 edges, 20943 markings/sec, 50 secs
lola: 1241897 markings, 1773381 edges, 21024 markings/sec, 55 secs
lola: 1346390 markings, 1922541 edges, 20899 markings/sec, 60 secs
lola: 1450551 markings, 2071128 edges, 20832 markings/sec, 65 secs
lola: 1554362 markings, 2219088 edges, 20762 markings/sec, 70 secs
lola: 1625487 markings, 2321100 edges, 14225 markings/sec, 75 secs
lola: 1700150 markings, 2427088 edges, 14933 markings/sec, 80 secs
lola: 1788156 markings, 2553152 edges, 17601 markings/sec, 85 secs
lola: 1872429 markings, 2673271 edges, 16855 markings/sec, 90 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: subprocess 7 will run for 321 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((X (G ((p4848 <= 2))) OR (p4848 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X (G ((p4848 <= 2))) OR (p4848 <= 2))))
lola: processed formula length: 46
lola: 56 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 81790 markings, 116175 edges, 16358 markings/sec, 0 secs
lola: 179562 markings, 255812 edges, 19554 markings/sec, 5 secs
lola: 283087 markings, 403277 edges, 20705 markings/sec, 10 secs
lola: 389015 markings, 554956 edges, 21186 markings/sec, 15 secs
lola: 495552 markings, 707688 edges, 21307 markings/sec, 20 secs
lola: 601152 markings, 858140 edges, 21120 markings/sec, 25 secs
lola: 704912 markings, 1006660 edges, 20752 markings/sec, 30 secs
lola: 811634 markings, 1158265 edges, 21344 markings/sec, 35 secs
lola: 918348 markings, 1310530 edges, 21343 markings/sec, 40 secs
lola: 1024616 markings, 1462790 edges, 21254 markings/sec, 45 secs
lola: 1130682 markings, 1614706 edges, 21213 markings/sec, 50 secs
lola: 1238011 markings, 1766926 edges, 21466 markings/sec, 55 secs
lola: 1344484 markings, 1919206 edges, 21295 markings/sec, 60 secs
lola: 1450535 markings, 2071098 edges, 21210 markings/sec, 65 secs
lola: 1556170 markings, 2222251 edges, 21127 markings/sec, 70 secs
lola: 1615391 markings, 2306021 edges, 11844 markings/sec, 75 secs
lola: 1673539 markings, 2389536 edges, 11630 markings/sec, 80 secs
lola: 1743264 markings, 2489399 edges, 13945 markings/sec, 85 secs
lola: 1818260 markings, 2595530 edges, 14999 markings/sec, 90 secs
lola: Child process aborted or communication problem between parent and child process
lola: subprocess 8 will run for 349 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((3 <= p3590)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((3 <= p3590)))
lola: processed formula length: 20
lola: 56 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3002 markings, 3002 edges
lola: ========================================
lola: subprocess 9 will run for 398 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (F ((F ((p575 <= p4200)) AND F ((X ((3 <= p1447)) AND (p4542 <= p1398)))))) AND F ((p2803 <= p1286)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 9 will run for 398 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F ((p2803 <= p1286))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p1286 + 1 <= p2803)
lola: processed formula length: 20
lola: 58 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: subprocess 10 will run for 465 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((F ((p575 <= p4200)) AND F ((X ((3 <= p1447)) AND (p4542 <= p1398))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((F ((p575 <= p4200)) AND F ((X ((3 <= p1447)) AND (p4542 <= p1398))))))
lola: processed formula length: 77
lola: 56 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 5 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 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: 6002 markings, 6003 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 10 will run for 465 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (F ((p1355 + 1 <= p4662)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (F ((p1355 + 1 <= p4662)))
lola: processed formula length: 28
lola: 56 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: LTL model checker
lola: The net satisfies the given formula (language of the product automaton is empty).
lola: 2002 markings, 2001 edges
lola: ========================================
lola: subprocess 11 will run for 558 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (((2 <= p3365) AND (p2063 <= p4523) AND (p3247 <= p1009))) U (X (G ((p1755 + 1 <= p1179))) AND (p1179 <= p1755)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: (X (((2 <= p3365) AND (p2063 <= p4523) AND (p3247 <= p1009))) U (X (G ((p1755 + 1 <= p1179))) AND (p1179 <= p1755)))
lola: processed formula length: 116
lola: 56 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: 3002 markings, 3002 edges
lola: ========================================
lola: subprocess 12 will run for 697 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (X (G ((p1240 + 1 <= p1798))) AND (F ((X ((p4738 <= 2)) AND (p3299 + 1 <= p3302))) OR (3 <= p4738)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: subprocess 12 will run for 697 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: (3 <= p4738)
lola: ========================================
lola: SUBTASK
lola: checking initial satisfaction
lola: processed formula: (3 <= p4738)
lola: processed formula length: 12
lola: 56 rewrites
lola: closed formula file LTLCardinality.xml
lola: processed formula with 1 atomic propositions
lola: RUNNING
lola: SUBRESULT
lola: result: 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 13 will run for 930 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (G ((p1240 + 1 <= p1798)))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((p1240 + 1 <= p1798)))
lola: processed formula length: 28
lola: 56 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3002 markings, 3002 edges
lola: ========================================
lola: SUBRESULT
lola: result: no
lola: The Boolean predicate is false.
lola: ========================================
lola: subprocess 13 will run for 930 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: X (X (X (F ((p2902 <= 0)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (X (F ((p2902 <= 0)))))
lola: processed formula length: 28
lola: 56 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 3002 markings, 3002 edges
lola: ========================================
lola: subprocess 14 will run for 1395 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: G (F (((p4802 + 1 <= p2255) OR (p4060 <= p3263))))
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 (((p4802 + 1 <= p2255) OR (p4060 <= p3263))))
lola: processed formula length: 51
lola: 56 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 2 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: using ltl preserving stubborn set method with deletion algorithm (--stubborn=deletion)
lola: using ltl preserving stubborn set method with insertion algorithm(--stubborn=tarjan)
lola: SEARCH
lola: RUNNING
lola: SUBRESULT
lola: result: no
lola: produced by: LTL model checker
lola: The net does not satisfy the given formula (language of the product automaton is nonempty).
lola: 214 markings, 214 edges
lola: ========================================
lola: subprocess 15 will run for 2790 seconds at most (--localtimelimit=0)
lola: ========================================
lola: ...considering subproblem: F (G ((F ((2 <= p3716)) OR (G ((p711 <= p536)) AND F ((2 <= p3716))))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((2 <= p3716)) OR (G ((p711 <= p536)) AND F ((2 <= p3716))))))
lola: processed formula length: 71
lola: 56 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: 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: 425 markings, 426 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: F (G ((F ((p4443 <= p735)) AND (X (((p117 <= p4413) AND (2 <= p4360))) OR (p4443 <= p735)))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: F (G ((F ((p4443 <= p735)) AND (X (((p117 <= p4413) AND (2 <= p4360))) OR (p4443 <= p735)))))
lola: processed formula length: 93
lola: 56 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 3 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 100802 markings, 142701 edges, 20160 markings/sec, 0 secs
lola: 204057 markings, 290716 edges, 20651 markings/sec, 5 secs
lola: 306628 markings, 437742 edges, 20514 markings/sec, 10 secs
lola: 411580 markings, 587699 edges, 20990 markings/sec, 15 secs
lola: 516436 markings, 737493 edges, 20971 markings/sec, 20 secs
lola: 620712 markings, 886273 edges, 20855 markings/sec, 25 secs
lola: 713746 markings, 1018544 edges, 18607 markings/sec, 30 secs
lola: 819532 markings, 1169152 edges, 21157 markings/sec, 35 secs
lola: 923864 markings, 1318305 edges, 20866 markings/sec, 40 secs
lola: 1028742 markings, 1468008 edges, 20976 markings/sec, 45 secs
lola: 1134330 markings, 1618844 edges, 21118 markings/sec, 50 secs
lola: 1239916 markings, 1769915 edges, 21117 markings/sec, 55 secs
lola: 1345701 markings, 1921334 edges, 21157 markings/sec, 60 secs
lola: 1451583 markings, 2072931 edges, 21176 markings/sec, 65 secs
lola: 1557781 markings, 2224173 edges, 21240 markings/sec, 70 secs
lola: 1636041 markings, 2335313 edges, 15652 markings/sec, 75 secs
lola: 1718078 markings, 2453219 edges, 16407 markings/sec, 80 secs
lola: 1801715 markings, 2572693 edges, 16727 markings/sec, 85 secs
lola: 1869152 markings, 2668870 edges, 13487 markings/sec, 90 secs
lola: Child process aborted or communication problem between parent and child process
lola: ========================================
lola: ...considering subproblem: (X (X (G ((p2186 <= 1)))) AND F ((p2809 <= p4060)))
lola: ========================================
lola: SUBTASK
lola: checking a Boolean combination of formulas
lola: RUNNING
lola: ========================================
lola: ...considering subproblem: F ((p2809 <= p4060))
lola: ========================================
lola: SUBTASK
lola: checking eventual occurrence
lola: rewrite Frontend/Parser/formula_rewrite.k:750
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: processed formula: (p4060 + 1 <= p2809)
lola: processed formula length: 20
lola: 58 rewrites
lola: closed formula file LTLCardinality.xml
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: SEARCH (state space / EG)
lola: state space: using search routine for EG formula (--search=depth)
lola: state space: using EG preserving stubborn set method (--stubborn=tarjan)
lola: RUNNING
lola: SUBRESULT
lola: result: yes
lola: produced by: state space / EG
lola: The predicate eventually occurs.
lola: 1 markings, 0 edges
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (X (G ((p2186 <= 1))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (X (G ((p2186 <= 1))))
lola: processed formula length: 24
lola: 56 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 85378 markings, 121239 edges, 17076 markings/sec, 0 secs
lola: 185308 markings, 263622 edges, 19986 markings/sec, 5 secs
lola: 290542 markings, 414077 edges, 21047 markings/sec, 10 secs
lola: 396576 markings, 565935 edges, 21207 markings/sec, 15 secs
lola: 502696 markings, 717846 edges, 21224 markings/sec, 20 secs
lola: 608826 markings, 868802 edges, 21226 markings/sec, 25 secs
lola: 714881 markings, 1019678 edges, 21211 markings/sec, 30 secs
lola: 820549 markings, 1170831 edges, 21134 markings/sec, 35 secs
lola: 926721 markings, 1322928 edges, 21234 markings/sec, 40 secs
lola: 1032698 markings, 1474691 edges, 21195 markings/sec, 45 secs
lola: 1138190 markings, 1625273 edges, 21098 markings/sec, 50 secs
lola: 1245201 markings, 1777104 edges, 21402 markings/sec, 55 secs
lola: 1350675 markings, 1927794 edges, 21095 markings/sec, 60 secs
lola: 1455429 markings, 2077408 edges, 20951 markings/sec, 65 secs
lola: 1560577 markings, 2227727 edges, 21030 markings/sec, 70 secs
lola: 1638895 markings, 2340096 edges, 15664 markings/sec, 75 secs
lola: 1719132 markings, 2454269 edges, 16047 markings/sec, 80 secs
lola: 1805801 markings, 2578222 edges, 17334 markings/sec, 85 secs
lola: 1872097 markings, 2672938 edges, 13259 markings/sec, 90 secs
lola: Child process aborted or communication problem between parent and child process
lola: SUBRESULT
lola: result: unknown
lola: The Boolean predicate may be true or false.
lola: ========================================
lola: ========================================
lola: ...considering subproblem: X (G ((X (G ((p4848 <= 2))) OR (p4848 <= 2))))
lola: ========================================
lola: SUBTASK
lola: checking LTL
lola: transforming LTL-Formula into a Büchi-Automaton
lola: processed formula: X (G ((X (G ((p4848 <= 2))) OR (p4848 <= 2))))
lola: processed formula length: 46
lola: 56 rewrites
lola: closed formula file LTLCardinality.xml
lola: the resulting Büchi automaton has 4 states
lola: STORE
lola: using a simple compression encoder (--encoder=simplecompressed)
lola: using a prefix tree store (--store=prefix)
lola: Formula contains X operator; stubborn sets not applicable
lola: Formula contains X operator; stubborn sets not applicable
lola: SEARCH
lola: RUNNING
lola: 76806 markings, 109682 edges, 15361 markings/sec, 0 secs
lola: 141246 markings, 201012 edges, 12888 markings/sec, 5 secs
lola: 221761 markings, 316185 edges, 16103 markings/sec, 10 secs
lola: 318958 markings, 454817 edges, 19439 markings/sec, 15 secs
lola: 422626 markings, 602536 edges, 20734 markings/sec, 20 secs
lola: 525974 markings, 750090 edges, 20670 markings/sec, 25 secs
lola: 630893 markings, 899834 edges, 20984 markings/sec, 30 secs
lola: 735532 markings, 1049294 edges, 20928 markings/sec, 35 secs
lola: 841146 markings, 1200133 edges, 21123 markings/sec, 40 secs
lola: 946141 markings, 1350179 edges, 20999 markings/sec, 45 secs
lola: 1051956 markings, 1501650 edges, 21163 markings/sec, 50 secs
lola: 1156764 markings, 1651362 edges, 20962 markings/sec, 55 secs
lola: 1262245 markings, 1802249 edges, 21096 markings/sec, 60 secs
lola: 1366711 markings, 1951369 edges, 20893 markings/sec, 65 secs
lola: 1471950 markings, 2101828 edges, 21048 markings/sec, 70 secs
lola: 1572565 markings, 2244930 edges, 20123 markings/sec, 75 secs
lola: 1648025 markings, 2353277 edges, 15092 markings/sec, 80 secs
lola: 1725427 markings, 2463657 edges, 15480 markings/sec, 85 secs
lola: 1791497 markings, 2557682 edges, 13214 markings/sec, 90 secs
lola: 1850926 markings, 2642804 edges, 11886 markings/sec, 95 secs
lola: Child process aborted or communication problem between parent and child process
lola: RESULT
lola:
SUMMARY: no no no no unknown yes no unknown unknown no no yes no no no no
lola:
preliminary result: no no no no unknown yes no unknown unknown no no yes no no no no
lola: memory consumption: 3620 KB
lola: time consumption: 1078 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="JoinFreeModules-PT-1000"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itslola"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itslola"
echo " Input is JoinFreeModules-PT-1000, 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 r184-oct2-158987928600457"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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