Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r167-tall-167838853500706.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is FunctionPointer-PT-b128, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-167838853500706
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 828K
-rw-r--r-- 1 mcc users 5.9K Feb 25 11:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K Feb 25 11:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 11:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 11:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.3K Feb 25 11:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Feb 25 11:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 25 11:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K Feb 25 11:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 391K Mar 5 18:22 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 FunctionPointer-PT-b128-CTLFireability-00
FORMULA_NAME FunctionPointer-PT-b128-CTLFireability-01
FORMULA_NAME FunctionPointer-PT-b128-CTLFireability-02
FORMULA_NAME FunctionPointer-PT-b128-CTLFireability-03
FORMULA_NAME FunctionPointer-PT-b128-CTLFireability-04
FORMULA_NAME FunctionPointer-PT-b128-CTLFireability-05
FORMULA_NAME FunctionPointer-PT-b128-CTLFireability-06
FORMULA_NAME FunctionPointer-PT-b128-CTLFireability-07
FORMULA_NAME FunctionPointer-PT-b128-CTLFireability-08
FORMULA_NAME FunctionPointer-PT-b128-CTLFireability-09
FORMULA_NAME FunctionPointer-PT-b128-CTLFireability-10
FORMULA_NAME FunctionPointer-PT-b128-CTLFireability-11
FORMULA_NAME FunctionPointer-PT-b128-CTLFireability-12
FORMULA_NAME FunctionPointer-PT-b128-CTLFireability-13
FORMULA_NAME FunctionPointer-PT-b128-CTLFireability-14
FORMULA_NAME FunctionPointer-PT-b128-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678508418033

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b128
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 04:20:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 04:20:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 04:20:19] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2023-03-11 04:20:19] [INFO ] Transformed 306 places.
[2023-03-11 04:20:19] [INFO ] Transformed 840 transitions.
[2023-03-11 04:20:19] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 151 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b128-CTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 78 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 648/648 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 212 transition count 648
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 23 place count 199 transition count 616
Iterating global reduction 1 with 13 rules applied. Total rules applied 36 place count 199 transition count 616
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 1 with 62 rules applied. Total rules applied 98 place count 199 transition count 554
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 104 place count 193 transition count 542
Iterating global reduction 2 with 6 rules applied. Total rules applied 110 place count 193 transition count 542
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 2 with 32 rules applied. Total rules applied 142 place count 193 transition count 510
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 145 place count 190 transition count 504
Iterating global reduction 3 with 3 rules applied. Total rules applied 148 place count 190 transition count 504
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 149 place count 189 transition count 500
Iterating global reduction 3 with 1 rules applied. Total rules applied 150 place count 189 transition count 500
Applied a total of 150 rules in 60 ms. Remains 189 /222 variables (removed 33) and now considering 500/648 (removed 148) transitions.
[2023-03-11 04:20:19] [INFO ] Flow matrix only has 332 transitions (discarded 168 similar events)
// Phase 1: matrix 332 rows 189 cols
[2023-03-11 04:20:19] [INFO ] Computed 2 place invariants in 14 ms
[2023-03-11 04:20:20] [INFO ] Implicit Places using invariants in 414 ms returned []
[2023-03-11 04:20:20] [INFO ] Flow matrix only has 332 transitions (discarded 168 similar events)
[2023-03-11 04:20:20] [INFO ] Invariant cache hit.
[2023-03-11 04:20:20] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-11 04:20:20] [INFO ] Implicit Places using invariants and state equation in 216 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
[2023-03-11 04:20:20] [INFO ] Flow matrix only has 332 transitions (discarded 168 similar events)
[2023-03-11 04:20:20] [INFO ] Invariant cache hit.
[2023-03-11 04:20:20] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 189/222 places, 500/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 891 ms. Remains : 189/222 places, 500/648 transitions.
Support contains 78 out of 189 places after structural reductions.
[2023-03-11 04:20:20] [INFO ] Flatten gal took : 93 ms
[2023-03-11 04:20:21] [INFO ] Flatten gal took : 92 ms
[2023-03-11 04:20:21] [INFO ] Input system was already deterministic with 500 transitions.
Support contains 69 out of 189 places (down from 78) after GAL structural reductions.
Incomplete random walk after 10045 steps, including 5 resets, run finished after 270 ms. (steps per millisecond=37 ) properties (out of 60) seen :26
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 34) seen :2
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=32 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 32) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 31) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 28) seen :0
Running SMT prover for 28 properties.
[2023-03-11 04:20:21] [INFO ] Flow matrix only has 332 transitions (discarded 168 similar events)
[2023-03-11 04:20:21] [INFO ] Invariant cache hit.
[2023-03-11 04:20:22] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 04:20:22] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 04:20:23] [INFO ] After 625ms SMT Verify possible using state equation in real domain returned unsat :3 sat :3 real:22
[2023-03-11 04:20:23] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-11 04:20:23] [INFO ] After 71ms SMT Verify possible using 61 Read/Feed constraints in real domain returned unsat :3 sat :0 real:25
[2023-03-11 04:20:23] [INFO ] After 1388ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:25
[2023-03-11 04:20:23] [INFO ] [Nat]Absence check using 1 positive place invariants in 13 ms returned sat
[2023-03-11 04:20:23] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 04:20:24] [INFO ] After 454ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :25
[2023-03-11 04:20:24] [INFO ] After 377ms SMT Verify possible using 61 Read/Feed constraints in natural domain returned unsat :3 sat :25
[2023-03-11 04:20:25] [INFO ] After 1007ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :25
Attempting to minimize the solution found.
Minimization took 472 ms.
[2023-03-11 04:20:25] [INFO ] After 2292ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :25
Fused 28 Parikh solutions to 25 different solutions.
Parikh walk visited 0 properties in 519 ms.
Support contains 30 out of 189 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 189/189 places, 500/500 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 179 transition count 472
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 179 transition count 472
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 48 place count 179 transition count 444
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 52 place count 175 transition count 436
Iterating global reduction 1 with 4 rules applied. Total rules applied 56 place count 175 transition count 436
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 58 place count 173 transition count 432
Iterating global reduction 1 with 2 rules applied. Total rules applied 60 place count 173 transition count 432
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 61 place count 172 transition count 428
Iterating global reduction 1 with 1 rules applied. Total rules applied 62 place count 172 transition count 428
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 63 place count 171 transition count 426
Iterating global reduction 1 with 1 rules applied. Total rules applied 64 place count 171 transition count 426
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 1 with 16 rules applied. Total rules applied 80 place count 171 transition count 410
Applied a total of 80 rules in 115 ms. Remains 171 /189 variables (removed 18) and now considering 410/500 (removed 90) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 171/189 places, 410/500 transitions.
Incomplete random walk after 10117 steps, including 7 resets, run finished after 73 ms. (steps per millisecond=138 ) properties (out of 25) seen :5
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=1001 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 20) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 1 ms. (steps per millisecond=1001 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=500 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2023-03-11 04:20:26] [INFO ] Flow matrix only has 281 transitions (discarded 129 similar events)
// Phase 1: matrix 281 rows 171 cols
[2023-03-11 04:20:26] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-11 04:20:26] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 04:20:26] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 04:20:27] [INFO ] After 290ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:14
[2023-03-11 04:20:27] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-11 04:20:27] [INFO ] After 64ms SMT Verify possible using 59 Read/Feed constraints in real domain returned unsat :0 sat :0 real:18
[2023-03-11 04:20:27] [INFO ] After 838ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-03-11 04:20:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 04:20:27] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 04:20:27] [INFO ] After 297ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2023-03-11 04:20:27] [INFO ] After 222ms SMT Verify possible using 59 Read/Feed constraints in natural domain returned unsat :0 sat :18
[2023-03-11 04:20:28] [INFO ] After 590ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 240 ms.
[2023-03-11 04:20:28] [INFO ] After 1252ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Parikh walk visited 0 properties in 298 ms.
Support contains 21 out of 171 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 171/171 places, 410/410 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 169 transition count 406
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 169 transition count 406
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 167 transition count 402
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 167 transition count 402
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 165 transition count 396
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 165 transition count 396
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 163 transition count 390
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 163 transition count 390
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 161 transition count 386
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 161 transition count 386
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 159 transition count 380
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 159 transition count 380
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 157 transition count 376
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 157 transition count 376
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 155 transition count 372
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 155 transition count 372
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 153 transition count 368
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 153 transition count 368
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 152 transition count 366
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 152 transition count 366
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 151 transition count 364
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 151 transition count 364
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 150 transition count 362
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 150 transition count 362
Applied a total of 42 rules in 91 ms. Remains 150 /171 variables (removed 21) and now considering 362/410 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 150/171 places, 362/410 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 18) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-11 04:20:29] [INFO ] Flow matrix only has 246 transitions (discarded 116 similar events)
// Phase 1: matrix 246 rows 150 cols
[2023-03-11 04:20:29] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 04:20:29] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 04:20:29] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 04:20:29] [INFO ] After 324ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-11 04:20:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 04:20:29] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 04:20:29] [INFO ] After 186ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-11 04:20:29] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-11 04:20:29] [INFO ] After 95ms SMT Verify possible using 52 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-11 04:20:30] [INFO ] After 243ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 93 ms.
[2023-03-11 04:20:30] [INFO ] After 684ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 79 ms.
Support contains 13 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 362/362 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 146 transition count 350
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 146 transition count 350
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 12 place count 146 transition count 346
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 144 transition count 342
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 144 transition count 342
Applied a total of 16 rules in 17 ms. Remains 144 /150 variables (removed 6) and now considering 342/362 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 144/150 places, 342/362 transitions.
Incomplete random walk after 10002 steps, including 3 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 548338 steps, run timeout after 3001 ms. (steps per millisecond=182 ) properties seen :{2=1, 5=1, 7=1}
Probabilistic random walk after 548338 steps, saw 360493 distinct states, run finished after 3002 ms. (steps per millisecond=182 ) properties seen :3
Running SMT prover for 5 properties.
[2023-03-11 04:20:33] [INFO ] Flow matrix only has 234 transitions (discarded 108 similar events)
// Phase 1: matrix 234 rows 144 cols
[2023-03-11 04:20:33] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 04:20:33] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 04:20:33] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 04:20:33] [INFO ] After 385ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 04:20:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 04:20:33] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 04:20:34] [INFO ] After 84ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-11 04:20:34] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-11 04:20:34] [INFO ] After 58ms SMT Verify possible using 52 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-11 04:20:34] [INFO ] After 132ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 105 ms.
[2023-03-11 04:20:34] [INFO ] After 393ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 49 ms.
Support contains 10 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 342/342 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 143 transition count 338
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 143 transition count 338
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 142 transition count 336
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 142 transition count 336
Applied a total of 4 rules in 42 ms. Remains 142 /144 variables (removed 2) and now considering 336/342 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 142/144 places, 336/342 transitions.
Incomplete random walk after 10001 steps, including 7 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-11 04:20:34] [INFO ] Flow matrix only has 230 transitions (discarded 106 similar events)
// Phase 1: matrix 230 rows 142 cols
[2023-03-11 04:20:34] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-11 04:20:34] [INFO ] [Real]Absence check using 1 positive place invariants in 24 ms returned sat
[2023-03-11 04:20:34] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 30 ms returned sat
[2023-03-11 04:20:35] [INFO ] After 75ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2023-03-11 04:20:35] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-11 04:20:35] [INFO ] After 17ms SMT Verify possible using 52 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 04:20:35] [INFO ] After 524ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 04:20:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-11 04:20:35] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 04:20:35] [INFO ] After 73ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 04:20:35] [INFO ] After 42ms SMT Verify possible using 52 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 04:20:35] [INFO ] After 108ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-11 04:20:35] [INFO ] After 272ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 18 ms.
Support contains 9 out of 142 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 142/142 places, 336/336 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 141 transition count 334
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 141 transition count 334
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 140 transition count 332
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 140 transition count 332
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 139 transition count 328
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 139 transition count 328
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 138 transition count 326
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 138 transition count 326
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 137 transition count 324
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 137 transition count 324
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 136 transition count 322
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 136 transition count 322
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 135 transition count 320
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 135 transition count 320
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 134 transition count 318
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 134 transition count 318
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 133 transition count 316
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 133 transition count 316
Applied a total of 18 rules in 49 ms. Remains 133 /142 variables (removed 9) and now considering 316/336 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 133/142 places, 316/336 transitions.
Incomplete random walk after 10001 steps, including 9 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-11 04:20:35] [INFO ] Flow matrix only has 216 transitions (discarded 100 similar events)
// Phase 1: matrix 216 rows 133 cols
[2023-03-11 04:20:35] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-11 04:20:35] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 04:20:35] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 04:20:35] [INFO ] After 151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 04:20:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 04:20:35] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 04:20:35] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 04:20:35] [INFO ] State equation strengthened by 49 read => feed constraints.
[2023-03-11 04:20:35] [INFO ] After 33ms SMT Verify possible using 49 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 04:20:35] [INFO ] After 85ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-11 04:20:35] [INFO ] After 217ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 28 ms.
Support contains 8 out of 133 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 133/133 places, 316/316 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 132 transition count 314
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 132 transition count 314
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 131 transition count 312
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 131 transition count 312
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 130 transition count 308
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 130 transition count 308
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 129 transition count 306
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 129 transition count 306
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 128 transition count 304
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 128 transition count 304
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 127 transition count 302
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 127 transition count 302
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 126 transition count 300
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 126 transition count 300
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 125 transition count 298
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 125 transition count 298
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 124 transition count 296
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 124 transition count 296
Applied a total of 18 rules in 19 ms. Remains 124 /133 variables (removed 9) and now considering 296/316 (removed 20) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 124/133 places, 296/316 transitions.
Incomplete random walk after 10001 steps, including 7 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 729384 steps, run timeout after 3001 ms. (steps per millisecond=243 ) properties seen :{}
Probabilistic random walk after 729384 steps, saw 479522 distinct states, run finished after 3001 ms. (steps per millisecond=243 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-11 04:20:38] [INFO ] Flow matrix only has 202 transitions (discarded 94 similar events)
// Phase 1: matrix 202 rows 124 cols
[2023-03-11 04:20:38] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-11 04:20:38] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 04:20:38] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 04:20:39] [INFO ] After 113ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-11 04:20:39] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-11 04:20:39] [INFO ] After 16ms SMT Verify possible using 46 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 04:20:39] [INFO ] After 167ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 04:20:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 04:20:39] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 04:20:39] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 04:20:39] [INFO ] After 31ms SMT Verify possible using 46 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 04:20:39] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-11 04:20:39] [INFO ] After 199ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 14 ms.
Support contains 8 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 296/296 transitions.
Applied a total of 0 rules in 5 ms. Remains 124 /124 variables (removed 0) and now considering 296/296 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 124/124 places, 296/296 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 296/296 transitions.
Applied a total of 0 rules in 5 ms. Remains 124 /124 variables (removed 0) and now considering 296/296 (removed 0) transitions.
[2023-03-11 04:20:39] [INFO ] Flow matrix only has 202 transitions (discarded 94 similar events)
[2023-03-11 04:20:39] [INFO ] Invariant cache hit.
[2023-03-11 04:20:39] [INFO ] Implicit Places using invariants in 129 ms returned []
[2023-03-11 04:20:39] [INFO ] Flow matrix only has 202 transitions (discarded 94 similar events)
[2023-03-11 04:20:39] [INFO ] Invariant cache hit.
[2023-03-11 04:20:39] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-11 04:20:39] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2023-03-11 04:20:39] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-11 04:20:39] [INFO ] Flow matrix only has 202 transitions (discarded 94 similar events)
[2023-03-11 04:20:39] [INFO ] Invariant cache hit.
[2023-03-11 04:20:39] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 471 ms. Remains : 124/124 places, 296/296 transitions.
Graph (trivial) has 169 edges and 124 vertex of which 24 / 124 are part of one of the 8 SCC in 3 ms
Free SCC test removed 16 places
Drop transitions removed 40 transitions
Ensure Unique test removed 78 transitions
Reduce isomorphic transitions removed 118 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 108 transition count 171
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 101 transition count 171
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 15 place count 101 transition count 150
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 57 place count 80 transition count 150
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 64 place count 73 transition count 143
Iterating global reduction 2 with 7 rules applied. Total rules applied 71 place count 73 transition count 143
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 14 rules applied. Total rules applied 85 place count 73 transition count 129
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 115 place count 58 transition count 114
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 120 place count 53 transition count 104
Iterating global reduction 3 with 5 rules applied. Total rules applied 125 place count 53 transition count 104
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 130 place count 48 transition count 94
Iterating global reduction 3 with 5 rules applied. Total rules applied 135 place count 48 transition count 94
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 140 place count 43 transition count 84
Iterating global reduction 3 with 5 rules applied. Total rules applied 145 place count 43 transition count 84
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 150 place count 43 transition count 79
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 158 place count 39 transition count 82
Applied a total of 158 rules in 22 ms. Remains 39 /124 variables (removed 85) and now considering 82/296 (removed 214) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 82 rows 39 cols
[2023-03-11 04:20:39] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-11 04:20:39] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 04:20:39] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 04:20:39] [INFO ] After 32ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-11 04:20:39] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-11 04:20:39] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 04:20:39] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 04:20:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-11 04:20:39] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 04:20:39] [INFO ] After 21ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 04:20:40] [INFO ] After 10ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 04:20:40] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-11 04:20:40] [INFO ] After 94ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Successfully simplified 3 atomic propositions for a total of 14 simplifications.
FORMULA FunctionPointer-PT-b128-CTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 04:20:40] [INFO ] Flatten gal took : 41 ms
[2023-03-11 04:20:40] [INFO ] Flatten gal took : 53 ms
[2023-03-11 04:20:40] [INFO ] Input system was already deterministic with 500 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 500/500 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 171 transition count 438
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 171 transition count 438
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 52 place count 171 transition count 422
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 63 place count 160 transition count 398
Iterating global reduction 1 with 11 rules applied. Total rules applied 74 place count 160 transition count 398
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 80 place count 154 transition count 382
Iterating global reduction 1 with 6 rules applied. Total rules applied 86 place count 154 transition count 382
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 92 place count 148 transition count 358
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 148 transition count 358
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 104 place count 142 transition count 344
Iterating global reduction 1 with 6 rules applied. Total rules applied 110 place count 142 transition count 344
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 115 place count 137 transition count 330
Iterating global reduction 1 with 5 rules applied. Total rules applied 120 place count 137 transition count 330
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 125 place count 132 transition count 316
Iterating global reduction 1 with 5 rules applied. Total rules applied 130 place count 132 transition count 316
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 135 place count 127 transition count 306
Iterating global reduction 1 with 5 rules applied. Total rules applied 140 place count 127 transition count 306
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 145 place count 122 transition count 296
Iterating global reduction 1 with 5 rules applied. Total rules applied 150 place count 122 transition count 296
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 153 place count 119 transition count 290
Iterating global reduction 1 with 3 rules applied. Total rules applied 156 place count 119 transition count 290
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 158 place count 117 transition count 286
Iterating global reduction 1 with 2 rules applied. Total rules applied 160 place count 117 transition count 286
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 162 place count 115 transition count 282
Iterating global reduction 1 with 2 rules applied. Total rules applied 164 place count 115 transition count 282
Applied a total of 164 rules in 37 ms. Remains 115 /189 variables (removed 74) and now considering 282/500 (removed 218) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 115/189 places, 282/500 transitions.
[2023-03-11 04:20:40] [INFO ] Flatten gal took : 37 ms
[2023-03-11 04:20:40] [INFO ] Flatten gal took : 10 ms
[2023-03-11 04:20:40] [INFO ] Input system was already deterministic with 282 transitions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 500/500 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 171 transition count 440
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 171 transition count 440
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 56 place count 171 transition count 420
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 67 place count 160 transition count 396
Iterating global reduction 1 with 11 rules applied. Total rules applied 78 place count 160 transition count 396
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 85 place count 153 transition count 376
Iterating global reduction 1 with 7 rules applied. Total rules applied 92 place count 153 transition count 376
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 98 place count 147 transition count 352
Iterating global reduction 1 with 6 rules applied. Total rules applied 104 place count 147 transition count 352
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 110 place count 141 transition count 340
Iterating global reduction 1 with 6 rules applied. Total rules applied 116 place count 141 transition count 340
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 121 place count 136 transition count 326
Iterating global reduction 1 with 5 rules applied. Total rules applied 126 place count 136 transition count 326
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 131 place count 131 transition count 312
Iterating global reduction 1 with 5 rules applied. Total rules applied 136 place count 131 transition count 312
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 141 place count 126 transition count 302
Iterating global reduction 1 with 5 rules applied. Total rules applied 146 place count 126 transition count 302
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 151 place count 121 transition count 292
Iterating global reduction 1 with 5 rules applied. Total rules applied 156 place count 121 transition count 292
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 158 place count 119 transition count 288
Iterating global reduction 1 with 2 rules applied. Total rules applied 160 place count 119 transition count 288
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 162 place count 117 transition count 284
Iterating global reduction 1 with 2 rules applied. Total rules applied 164 place count 117 transition count 284
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 166 place count 115 transition count 280
Iterating global reduction 1 with 2 rules applied. Total rules applied 168 place count 115 transition count 280
Applied a total of 168 rules in 37 ms. Remains 115 /189 variables (removed 74) and now considering 280/500 (removed 220) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 115/189 places, 280/500 transitions.
[2023-03-11 04:20:40] [INFO ] Flatten gal took : 25 ms
[2023-03-11 04:20:40] [INFO ] Flatten gal took : 9 ms
[2023-03-11 04:20:40] [INFO ] Input system was already deterministic with 280 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 189/189 places, 500/500 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 171 transition count 434
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 171 transition count 434
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 46 place count 171 transition count 424
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 57 place count 160 transition count 402
Iterating global reduction 1 with 11 rules applied. Total rules applied 68 place count 160 transition count 402
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 73 place count 155 transition count 388
Iterating global reduction 1 with 5 rules applied. Total rules applied 78 place count 155 transition count 388
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 83 place count 150 transition count 368
Iterating global reduction 1 with 5 rules applied. Total rules applied 88 place count 150 transition count 368
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 93 place count 145 transition count 358
Iterating global reduction 1 with 5 rules applied. Total rules applied 98 place count 145 transition count 358
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 102 place count 141 transition count 346
Iterating global reduction 1 with 4 rules applied. Total rules applied 106 place count 141 transition count 346
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 110 place count 137 transition count 334
Iterating global reduction 1 with 4 rules applied. Total rules applied 114 place count 137 transition count 334
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 118 place count 133 transition count 326
Iterating global reduction 1 with 4 rules applied. Total rules applied 122 place count 133 transition count 326
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 125 place count 130 transition count 320
Iterating global reduction 1 with 3 rules applied. Total rules applied 128 place count 130 transition count 320
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 130 place count 128 transition count 316
Iterating global reduction 1 with 2 rules applied. Total rules applied 132 place count 128 transition count 316
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 134 place count 126 transition count 312
Iterating global reduction 1 with 2 rules applied. Total rules applied 136 place count 126 transition count 312
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 138 place count 124 transition count 308
Iterating global reduction 1 with 2 rules applied. Total rules applied 140 place count 124 transition count 308
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 146 place count 124 transition count 302
Applied a total of 146 rules in 98 ms. Remains 124 /189 variables (removed 65) and now considering 302/500 (removed 198) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 98 ms. Remains : 124/189 places, 302/500 transitions.
[2023-03-11 04:20:40] [INFO ] Flatten gal took : 22 ms
[2023-03-11 04:20:40] [INFO ] Flatten gal took : 28 ms
[2023-03-11 04:20:40] [INFO ] Input system was already deterministic with 302 transitions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 500/500 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 171 transition count 436
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 171 transition count 436
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 52 place count 171 transition count 420
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 63 place count 160 transition count 396
Iterating global reduction 1 with 11 rules applied. Total rules applied 74 place count 160 transition count 396
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 78 place count 156 transition count 386
Iterating global reduction 1 with 4 rules applied. Total rules applied 82 place count 156 transition count 386
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 86 place count 152 transition count 370
Iterating global reduction 1 with 4 rules applied. Total rules applied 90 place count 152 transition count 370
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 93 place count 149 transition count 364
Iterating global reduction 1 with 3 rules applied. Total rules applied 96 place count 149 transition count 364
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 99 place count 146 transition count 354
Iterating global reduction 1 with 3 rules applied. Total rules applied 102 place count 146 transition count 354
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 105 place count 143 transition count 344
Iterating global reduction 1 with 3 rules applied. Total rules applied 108 place count 143 transition count 344
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 111 place count 140 transition count 338
Iterating global reduction 1 with 3 rules applied. Total rules applied 114 place count 140 transition count 338
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 117 place count 137 transition count 332
Iterating global reduction 1 with 3 rules applied. Total rules applied 120 place count 137 transition count 332
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 122 place count 135 transition count 328
Iterating global reduction 1 with 2 rules applied. Total rules applied 124 place count 135 transition count 328
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 126 place count 133 transition count 324
Iterating global reduction 1 with 2 rules applied. Total rules applied 128 place count 133 transition count 324
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 130 place count 131 transition count 320
Iterating global reduction 1 with 2 rules applied. Total rules applied 132 place count 131 transition count 320
Applied a total of 132 rules in 45 ms. Remains 131 /189 variables (removed 58) and now considering 320/500 (removed 180) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 45 ms. Remains : 131/189 places, 320/500 transitions.
[2023-03-11 04:20:40] [INFO ] Flatten gal took : 9 ms
[2023-03-11 04:20:40] [INFO ] Flatten gal took : 9 ms
[2023-03-11 04:20:40] [INFO ] Input system was already deterministic with 320 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 189/189 places, 500/500 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 170 transition count 430
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 170 transition count 430
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 48 place count 170 transition count 420
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 61 place count 157 transition count 392
Iterating global reduction 1 with 13 rules applied. Total rules applied 74 place count 157 transition count 392
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 81 place count 150 transition count 372
Iterating global reduction 1 with 7 rules applied. Total rules applied 88 place count 150 transition count 372
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 95 place count 143 transition count 344
Iterating global reduction 1 with 7 rules applied. Total rules applied 102 place count 143 transition count 344
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 109 place count 136 transition count 328
Iterating global reduction 1 with 7 rules applied. Total rules applied 116 place count 136 transition count 328
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 123 place count 129 transition count 308
Iterating global reduction 1 with 7 rules applied. Total rules applied 130 place count 129 transition count 308
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 137 place count 122 transition count 288
Iterating global reduction 1 with 7 rules applied. Total rules applied 144 place count 122 transition count 288
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 151 place count 115 transition count 274
Iterating global reduction 1 with 7 rules applied. Total rules applied 158 place count 115 transition count 274
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 165 place count 108 transition count 260
Iterating global reduction 1 with 7 rules applied. Total rules applied 172 place count 108 transition count 260
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 175 place count 105 transition count 254
Iterating global reduction 1 with 3 rules applied. Total rules applied 178 place count 105 transition count 254
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 181 place count 102 transition count 248
Iterating global reduction 1 with 3 rules applied. Total rules applied 184 place count 102 transition count 248
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 187 place count 99 transition count 242
Iterating global reduction 1 with 3 rules applied. Total rules applied 190 place count 99 transition count 242
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 192 place count 99 transition count 240
Applied a total of 192 rules in 71 ms. Remains 99 /189 variables (removed 90) and now considering 240/500 (removed 260) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 71 ms. Remains : 99/189 places, 240/500 transitions.
[2023-03-11 04:20:40] [INFO ] Flatten gal took : 7 ms
[2023-03-11 04:20:40] [INFO ] Flatten gal took : 23 ms
[2023-03-11 04:20:40] [INFO ] Input system was already deterministic with 240 transitions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 500/500 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 170 transition count 434
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 170 transition count 434
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 54 place count 170 transition count 418
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 66 place count 158 transition count 392
Iterating global reduction 1 with 12 rules applied. Total rules applied 78 place count 158 transition count 392
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 84 place count 152 transition count 376
Iterating global reduction 1 with 6 rules applied. Total rules applied 90 place count 152 transition count 376
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 95 place count 147 transition count 356
Iterating global reduction 1 with 5 rules applied. Total rules applied 100 place count 147 transition count 356
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 104 place count 143 transition count 346
Iterating global reduction 1 with 4 rules applied. Total rules applied 108 place count 143 transition count 346
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 112 place count 139 transition count 336
Iterating global reduction 1 with 4 rules applied. Total rules applied 116 place count 139 transition count 336
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 120 place count 135 transition count 326
Iterating global reduction 1 with 4 rules applied. Total rules applied 124 place count 135 transition count 326
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 128 place count 131 transition count 318
Iterating global reduction 1 with 4 rules applied. Total rules applied 132 place count 131 transition count 318
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 136 place count 127 transition count 310
Iterating global reduction 1 with 4 rules applied. Total rules applied 140 place count 127 transition count 310
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 142 place count 125 transition count 306
Iterating global reduction 1 with 2 rules applied. Total rules applied 144 place count 125 transition count 306
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 145 place count 124 transition count 304
Iterating global reduction 1 with 1 rules applied. Total rules applied 146 place count 124 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 147 place count 123 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 148 place count 123 transition count 302
Applied a total of 148 rules in 12 ms. Remains 123 /189 variables (removed 66) and now considering 302/500 (removed 198) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 123/189 places, 302/500 transitions.
[2023-03-11 04:20:40] [INFO ] Flatten gal took : 24 ms
[2023-03-11 04:20:40] [INFO ] Flatten gal took : 9 ms
[2023-03-11 04:20:41] [INFO ] Input system was already deterministic with 302 transitions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 500/500 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 170 transition count 430
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 170 transition count 430
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 48 place count 170 transition count 420
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 61 place count 157 transition count 392
Iterating global reduction 1 with 13 rules applied. Total rules applied 74 place count 157 transition count 392
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 81 place count 150 transition count 372
Iterating global reduction 1 with 7 rules applied. Total rules applied 88 place count 150 transition count 372
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 95 place count 143 transition count 344
Iterating global reduction 1 with 7 rules applied. Total rules applied 102 place count 143 transition count 344
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 109 place count 136 transition count 328
Iterating global reduction 1 with 7 rules applied. Total rules applied 116 place count 136 transition count 328
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 123 place count 129 transition count 308
Iterating global reduction 1 with 7 rules applied. Total rules applied 130 place count 129 transition count 308
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 137 place count 122 transition count 288
Iterating global reduction 1 with 7 rules applied. Total rules applied 144 place count 122 transition count 288
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 151 place count 115 transition count 274
Iterating global reduction 1 with 7 rules applied. Total rules applied 158 place count 115 transition count 274
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 165 place count 108 transition count 260
Iterating global reduction 1 with 7 rules applied. Total rules applied 172 place count 108 transition count 260
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 176 place count 104 transition count 252
Iterating global reduction 1 with 4 rules applied. Total rules applied 180 place count 104 transition count 252
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 183 place count 101 transition count 246
Iterating global reduction 1 with 3 rules applied. Total rules applied 186 place count 101 transition count 246
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 188 place count 99 transition count 242
Iterating global reduction 1 with 2 rules applied. Total rules applied 190 place count 99 transition count 242
Applied a total of 190 rules in 29 ms. Remains 99 /189 variables (removed 90) and now considering 242/500 (removed 258) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 99/189 places, 242/500 transitions.
[2023-03-11 04:20:41] [INFO ] Flatten gal took : 7 ms
[2023-03-11 04:20:41] [INFO ] Flatten gal took : 7 ms
[2023-03-11 04:20:41] [INFO ] Input system was already deterministic with 242 transitions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 500/500 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 170 transition count 430
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 170 transition count 430
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 50 place count 170 transition count 418
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 62 place count 158 transition count 392
Iterating global reduction 1 with 12 rules applied. Total rules applied 74 place count 158 transition count 392
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 80 place count 152 transition count 374
Iterating global reduction 1 with 6 rules applied. Total rules applied 86 place count 152 transition count 374
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 92 place count 146 transition count 350
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 146 transition count 350
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 103 place count 141 transition count 338
Iterating global reduction 1 with 5 rules applied. Total rules applied 108 place count 141 transition count 338
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 113 place count 136 transition count 326
Iterating global reduction 1 with 5 rules applied. Total rules applied 118 place count 136 transition count 326
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 123 place count 131 transition count 314
Iterating global reduction 1 with 5 rules applied. Total rules applied 128 place count 131 transition count 314
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 133 place count 126 transition count 304
Iterating global reduction 1 with 5 rules applied. Total rules applied 138 place count 126 transition count 304
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 143 place count 121 transition count 294
Iterating global reduction 1 with 5 rules applied. Total rules applied 148 place count 121 transition count 294
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 150 place count 119 transition count 290
Iterating global reduction 1 with 2 rules applied. Total rules applied 152 place count 119 transition count 290
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 153 place count 118 transition count 288
Iterating global reduction 1 with 1 rules applied. Total rules applied 154 place count 118 transition count 288
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 155 place count 117 transition count 286
Iterating global reduction 1 with 1 rules applied. Total rules applied 156 place count 117 transition count 286
Applied a total of 156 rules in 43 ms. Remains 117 /189 variables (removed 72) and now considering 286/500 (removed 214) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 44 ms. Remains : 117/189 places, 286/500 transitions.
[2023-03-11 04:20:41] [INFO ] Flatten gal took : 30 ms
[2023-03-11 04:20:41] [INFO ] Flatten gal took : 8 ms
[2023-03-11 04:20:41] [INFO ] Input system was already deterministic with 286 transitions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 500/500 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 169 transition count 428
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 169 transition count 428
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 52 place count 169 transition count 416
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 65 place count 156 transition count 388
Iterating global reduction 1 with 13 rules applied. Total rules applied 78 place count 156 transition count 388
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 85 place count 149 transition count 368
Iterating global reduction 1 with 7 rules applied. Total rules applied 92 place count 149 transition count 368
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 99 place count 142 transition count 340
Iterating global reduction 1 with 7 rules applied. Total rules applied 106 place count 142 transition count 340
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 113 place count 135 transition count 324
Iterating global reduction 1 with 7 rules applied. Total rules applied 120 place count 135 transition count 324
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 127 place count 128 transition count 304
Iterating global reduction 1 with 7 rules applied. Total rules applied 134 place count 128 transition count 304
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 141 place count 121 transition count 284
Iterating global reduction 1 with 7 rules applied. Total rules applied 148 place count 121 transition count 284
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 155 place count 114 transition count 270
Iterating global reduction 1 with 7 rules applied. Total rules applied 162 place count 114 transition count 270
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 169 place count 107 transition count 256
Iterating global reduction 1 with 7 rules applied. Total rules applied 176 place count 107 transition count 256
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 180 place count 103 transition count 248
Iterating global reduction 1 with 4 rules applied. Total rules applied 184 place count 103 transition count 248
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 187 place count 100 transition count 242
Iterating global reduction 1 with 3 rules applied. Total rules applied 190 place count 100 transition count 242
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 193 place count 97 transition count 236
Iterating global reduction 1 with 3 rules applied. Total rules applied 196 place count 97 transition count 236
Applied a total of 196 rules in 57 ms. Remains 97 /189 variables (removed 92) and now considering 236/500 (removed 264) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57 ms. Remains : 97/189 places, 236/500 transitions.
[2023-03-11 04:20:41] [INFO ] Flatten gal took : 6 ms
[2023-03-11 04:20:41] [INFO ] Flatten gal took : 13 ms
[2023-03-11 04:20:41] [INFO ] Input system was already deterministic with 236 transitions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 500/500 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 171 transition count 436
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 171 transition count 436
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 50 place count 171 transition count 422
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 62 place count 159 transition count 396
Iterating global reduction 1 with 12 rules applied. Total rules applied 74 place count 159 transition count 396
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 80 place count 153 transition count 380
Iterating global reduction 1 with 6 rules applied. Total rules applied 86 place count 153 transition count 380
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 91 place count 148 transition count 360
Iterating global reduction 1 with 5 rules applied. Total rules applied 96 place count 148 transition count 360
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 101 place count 143 transition count 348
Iterating global reduction 1 with 5 rules applied. Total rules applied 106 place count 143 transition count 348
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 111 place count 138 transition count 332
Iterating global reduction 1 with 5 rules applied. Total rules applied 116 place count 138 transition count 332
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 121 place count 133 transition count 316
Iterating global reduction 1 with 5 rules applied. Total rules applied 126 place count 133 transition count 316
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 131 place count 128 transition count 306
Iterating global reduction 1 with 5 rules applied. Total rules applied 136 place count 128 transition count 306
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 141 place count 123 transition count 296
Iterating global reduction 1 with 5 rules applied. Total rules applied 146 place count 123 transition count 296
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 149 place count 120 transition count 290
Iterating global reduction 1 with 3 rules applied. Total rules applied 152 place count 120 transition count 290
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 154 place count 118 transition count 286
Iterating global reduction 1 with 2 rules applied. Total rules applied 156 place count 118 transition count 286
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 157 place count 117 transition count 284
Iterating global reduction 1 with 1 rules applied. Total rules applied 158 place count 117 transition count 284
Applied a total of 158 rules in 71 ms. Remains 117 /189 variables (removed 72) and now considering 284/500 (removed 216) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 71 ms. Remains : 117/189 places, 284/500 transitions.
[2023-03-11 04:20:41] [INFO ] Flatten gal took : 25 ms
[2023-03-11 04:20:41] [INFO ] Flatten gal took : 7 ms
[2023-03-11 04:20:41] [INFO ] Input system was already deterministic with 284 transitions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 500/500 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 171 transition count 436
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 171 transition count 436
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 48 place count 171 transition count 424
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 60 place count 159 transition count 398
Iterating global reduction 1 with 12 rules applied. Total rules applied 72 place count 159 transition count 398
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 77 place count 154 transition count 386
Iterating global reduction 1 with 5 rules applied. Total rules applied 82 place count 154 transition count 386
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 87 place count 149 transition count 366
Iterating global reduction 1 with 5 rules applied. Total rules applied 92 place count 149 transition count 366
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 97 place count 144 transition count 354
Iterating global reduction 1 with 5 rules applied. Total rules applied 102 place count 144 transition count 354
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 107 place count 139 transition count 338
Iterating global reduction 1 with 5 rules applied. Total rules applied 112 place count 139 transition count 338
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 117 place count 134 transition count 322
Iterating global reduction 1 with 5 rules applied. Total rules applied 122 place count 134 transition count 322
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 127 place count 129 transition count 312
Iterating global reduction 1 with 5 rules applied. Total rules applied 132 place count 129 transition count 312
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 136 place count 125 transition count 304
Iterating global reduction 1 with 4 rules applied. Total rules applied 140 place count 125 transition count 304
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 143 place count 122 transition count 298
Iterating global reduction 1 with 3 rules applied. Total rules applied 146 place count 122 transition count 298
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 148 place count 120 transition count 294
Iterating global reduction 1 with 2 rules applied. Total rules applied 150 place count 120 transition count 294
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 152 place count 118 transition count 290
Iterating global reduction 1 with 2 rules applied. Total rules applied 154 place count 118 transition count 290
Applied a total of 154 rules in 40 ms. Remains 118 /189 variables (removed 71) and now considering 290/500 (removed 210) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40 ms. Remains : 118/189 places, 290/500 transitions.
[2023-03-11 04:20:41] [INFO ] Flatten gal took : 29 ms
[2023-03-11 04:20:41] [INFO ] Flatten gal took : 19 ms
[2023-03-11 04:20:41] [INFO ] Input system was already deterministic with 290 transitions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 500/500 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 169 transition count 428
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 169 transition count 428
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 52 place count 169 transition count 416
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 65 place count 156 transition count 388
Iterating global reduction 1 with 13 rules applied. Total rules applied 78 place count 156 transition count 388
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 85 place count 149 transition count 368
Iterating global reduction 1 with 7 rules applied. Total rules applied 92 place count 149 transition count 368
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 99 place count 142 transition count 340
Iterating global reduction 1 with 7 rules applied. Total rules applied 106 place count 142 transition count 340
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 113 place count 135 transition count 324
Iterating global reduction 1 with 7 rules applied. Total rules applied 120 place count 135 transition count 324
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 127 place count 128 transition count 304
Iterating global reduction 1 with 7 rules applied. Total rules applied 134 place count 128 transition count 304
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 141 place count 121 transition count 284
Iterating global reduction 1 with 7 rules applied. Total rules applied 148 place count 121 transition count 284
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 155 place count 114 transition count 270
Iterating global reduction 1 with 7 rules applied. Total rules applied 162 place count 114 transition count 270
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 169 place count 107 transition count 256
Iterating global reduction 1 with 7 rules applied. Total rules applied 176 place count 107 transition count 256
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 180 place count 103 transition count 248
Iterating global reduction 1 with 4 rules applied. Total rules applied 184 place count 103 transition count 248
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 187 place count 100 transition count 242
Iterating global reduction 1 with 3 rules applied. Total rules applied 190 place count 100 transition count 242
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 193 place count 97 transition count 236
Iterating global reduction 1 with 3 rules applied. Total rules applied 196 place count 97 transition count 236
Applied a total of 196 rules in 22 ms. Remains 97 /189 variables (removed 92) and now considering 236/500 (removed 264) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22 ms. Remains : 97/189 places, 236/500 transitions.
[2023-03-11 04:20:41] [INFO ] Flatten gal took : 6 ms
[2023-03-11 04:20:41] [INFO ] Flatten gal took : 5 ms
[2023-03-11 04:20:41] [INFO ] Input system was already deterministic with 236 transitions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 500/500 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 175 transition count 450
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 175 transition count 450
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 40 place count 175 transition count 438
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 50 place count 165 transition count 416
Iterating global reduction 1 with 10 rules applied. Total rules applied 60 place count 165 transition count 416
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 65 place count 160 transition count 404
Iterating global reduction 1 with 5 rules applied. Total rules applied 70 place count 160 transition count 404
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 75 place count 155 transition count 384
Iterating global reduction 1 with 5 rules applied. Total rules applied 80 place count 155 transition count 384
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 85 place count 150 transition count 372
Iterating global reduction 1 with 5 rules applied. Total rules applied 90 place count 150 transition count 372
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 95 place count 145 transition count 356
Iterating global reduction 1 with 5 rules applied. Total rules applied 100 place count 145 transition count 356
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 105 place count 140 transition count 340
Iterating global reduction 1 with 5 rules applied. Total rules applied 110 place count 140 transition count 340
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 115 place count 135 transition count 330
Iterating global reduction 1 with 5 rules applied. Total rules applied 120 place count 135 transition count 330
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 125 place count 130 transition count 320
Iterating global reduction 1 with 5 rules applied. Total rules applied 130 place count 130 transition count 320
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 134 place count 126 transition count 312
Iterating global reduction 1 with 4 rules applied. Total rules applied 138 place count 126 transition count 312
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 141 place count 123 transition count 306
Iterating global reduction 1 with 3 rules applied. Total rules applied 144 place count 123 transition count 306
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 146 place count 121 transition count 302
Iterating global reduction 1 with 2 rules applied. Total rules applied 148 place count 121 transition count 302
Applied a total of 148 rules in 52 ms. Remains 121 /189 variables (removed 68) and now considering 302/500 (removed 198) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 53 ms. Remains : 121/189 places, 302/500 transitions.
[2023-03-11 04:20:41] [INFO ] Flatten gal took : 23 ms
[2023-03-11 04:20:41] [INFO ] Flatten gal took : 7 ms
[2023-03-11 04:20:41] [INFO ] Input system was already deterministic with 302 transitions.
Starting structural reductions in LTL mode, iteration 0 : 189/189 places, 500/500 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 170 transition count 434
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 170 transition count 434
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 54 place count 170 transition count 418
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 66 place count 158 transition count 392
Iterating global reduction 1 with 12 rules applied. Total rules applied 78 place count 158 transition count 392
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 84 place count 152 transition count 376
Iterating global reduction 1 with 6 rules applied. Total rules applied 90 place count 152 transition count 376
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 95 place count 147 transition count 356
Iterating global reduction 1 with 5 rules applied. Total rules applied 100 place count 147 transition count 356
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 105 place count 142 transition count 344
Iterating global reduction 1 with 5 rules applied. Total rules applied 110 place count 142 transition count 344
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 114 place count 138 transition count 334
Iterating global reduction 1 with 4 rules applied. Total rules applied 118 place count 138 transition count 334
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 122 place count 134 transition count 324
Iterating global reduction 1 with 4 rules applied. Total rules applied 126 place count 134 transition count 324
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 130 place count 130 transition count 316
Iterating global reduction 1 with 4 rules applied. Total rules applied 134 place count 130 transition count 316
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 138 place count 126 transition count 308
Iterating global reduction 1 with 4 rules applied. Total rules applied 142 place count 126 transition count 308
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 144 place count 124 transition count 304
Iterating global reduction 1 with 2 rules applied. Total rules applied 146 place count 124 transition count 304
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 147 place count 123 transition count 302
Iterating global reduction 1 with 1 rules applied. Total rules applied 148 place count 123 transition count 302
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 149 place count 122 transition count 300
Iterating global reduction 1 with 1 rules applied. Total rules applied 150 place count 122 transition count 300
Applied a total of 150 rules in 41 ms. Remains 122 /189 variables (removed 67) and now considering 300/500 (removed 200) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51 ms. Remains : 122/189 places, 300/500 transitions.
[2023-03-11 04:20:41] [INFO ] Flatten gal took : 7 ms
[2023-03-11 04:20:42] [INFO ] Flatten gal took : 9 ms
[2023-03-11 04:20:42] [INFO ] Input system was already deterministic with 300 transitions.
[2023-03-11 04:20:42] [INFO ] Flatten gal took : 20 ms
[2023-03-11 04:20:42] [INFO ] Flatten gal took : 23 ms
[2023-03-11 04:20:42] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 5 ms.
[2023-03-11 04:20:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 189 places, 500 transitions and 2008 arcs took 2 ms.
Total runtime 22738 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT FunctionPointer-PT-b128
BK_EXAMINATION: CTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
CTLFireability

FORMULA FunctionPointer-PT-b128-CTLFireability-10 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FunctionPointer-PT-b128-CTLFireability-15 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FunctionPointer-PT-b128-CTLFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FunctionPointer-PT-b128-CTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FunctionPointer-PT-b128-CTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FunctionPointer-PT-b128-CTLFireability-06 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FunctionPointer-PT-b128-CTLFireability-04 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FunctionPointer-PT-b128-CTLFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA FunctionPointer-PT-b128-CTLFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678508588847

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/CTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:553
lola: rewrite Frontend/Parser/formula_rewrite.k:96
lola: rewrite Frontend/Parser/formula_rewrite.k:138
lola: rewrite Frontend/Parser/formula_rewrite.k:253
lola: rewrite Frontend/Parser/formula_rewrite.k:96
lola: rewrite Frontend/Parser/formula_rewrite.k:138
lola: rewrite Frontend/Parser/formula_rewrite.k:547
lola: rewrite Frontend/Parser/formula_rewrite.k:454
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: RELEASE
lola: rewrite Frontend/Parser/formula_rewrite.k:98
lola: rewrite Frontend/Parser/formula_rewrite.k:129
lola: rewrite Frontend/Parser/formula_rewrite.k:196
lola: rewrite Frontend/Parser/formula_rewrite.k:147
lola: rewrite Frontend/Parser/formula_rewrite.k:317
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:314
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:328
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:331
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:334
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:397
lola: RELEASE
lola: RELEASE
lola: rewrite Frontend/Parser/formula_rewrite.k:325
lola: rewrite Frontend/Parser/formula_rewrite.k:334
lola: rewrite Frontend/Parser/formula_rewrite.k:322
lola: rewrite Frontend/Parser/formula_rewrite.k:334
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 46 (type EXCL) for 24 FunctionPointer-PT-b128-CTLFireability-10
lola: time limit : 200 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 47 (type FNDP) for 24 FunctionPointer-PT-b128-CTLFireability-10
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: FINISHED task # 47 (type FNDP) for FunctionPointer-PT-b128-CTLFireability-10
lola: result : true
lola: fired transitions : 104
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 46 (type EXCL) for FunctionPointer-PT-b128-CTLFireability-10 (obsolete)
lola: LAUNCH task # 19 (type EXCL) for 18 FunctionPointer-PT-b128-CTLFireability-08
lola: time limit : 211 sec
lola: memory limit: 32 pages
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:815
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:815
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:806
lola: LAUNCH task # 50 (type FNDP) for 33 FunctionPointer-PT-b128-CTLFireability-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: FINISHED task # 50 (type FNDP) for FunctionPointer-PT-b128-CTLFireability-13
lola: result : true
lola: fired transitions : 44
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:813
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:815
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:808
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:811
lola: rewrite Frontend/Parser/formula_rewrite.k:807
lola: rewrite Frontend/Parser/formula_rewrite.k:812
lola: rewrite Frontend/Parser/formula_rewrite.k:809
lola: rewrite Frontend/Parser/formula_rewrite.k:814
lola: rewrite Frontend/Parser/formula_rewrite.k:812
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b128-CTLFireability-10: EF DL true findpath

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b128-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-02: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-05: EG 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-08: CTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-09: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-12: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-13: DISJ 0 1 0 0 3 0 0 1
FunctionPointer-PT-b128-CTLFireability-14: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-15: CTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
19 CTL EXCL 5/276 4/32 FunctionPointer-PT-b128-CTLFireability-08 628728 m, 125745 m/sec, 1441465 t fired, .

Time elapsed: 5 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 14
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b128-CTLFireability-10: EF DL true findpath

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b128-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-02: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-05: EG 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-08: CTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-09: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-12: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-13: DISJ 0 1 0 0 3 0 0 1
FunctionPointer-PT-b128-CTLFireability-14: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-15: CTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
19 CTL EXCL 10/276 8/32 FunctionPointer-PT-b128-CTLFireability-08 1275048 m, 129264 m/sec, 2923272 t fired, .

Time elapsed: 10 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 14
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b128-CTLFireability-10: EF DL true findpath

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b128-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-02: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-05: EG 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-08: CTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-09: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-12: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-13: DISJ 0 1 0 0 3 0 0 1
FunctionPointer-PT-b128-CTLFireability-14: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-15: CTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
19 CTL EXCL 15/276 12/32 FunctionPointer-PT-b128-CTLFireability-08 1919141 m, 128818 m/sec, 4399973 t fired, .

Time elapsed: 15 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 14
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b128-CTLFireability-10: EF DL true findpath

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b128-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-02: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-05: EG 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-08: CTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-09: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-12: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-13: DISJ 0 1 0 0 3 0 0 1
FunctionPointer-PT-b128-CTLFireability-14: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-15: CTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
19 CTL EXCL 20/276 16/32 FunctionPointer-PT-b128-CTLFireability-08 2560476 m, 128267 m/sec, 5870352 t fired, .

Time elapsed: 20 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 14
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b128-CTLFireability-10: EF DL true findpath

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b128-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-02: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-05: EG 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-08: CTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-09: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-12: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-13: DISJ 0 1 0 0 3 0 0 1
FunctionPointer-PT-b128-CTLFireability-14: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-15: CTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
19 CTL EXCL 25/276 20/32 FunctionPointer-PT-b128-CTLFireability-08 3200827 m, 128070 m/sec, 7338472 t fired, .

Time elapsed: 25 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 14
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b128-CTLFireability-10: EF DL true findpath

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b128-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-02: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-05: EG 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-08: CTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-09: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-12: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-13: DISJ 0 1 0 0 3 0 0 1
FunctionPointer-PT-b128-CTLFireability-14: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-15: CTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
19 CTL EXCL 30/276 23/32 FunctionPointer-PT-b128-CTLFireability-08 3838935 m, 127621 m/sec, 8801453 t fired, .

Time elapsed: 30 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 14
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b128-CTLFireability-10: EF DL true findpath

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b128-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-02: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-05: EG 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-08: CTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-09: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-12: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-13: DISJ 0 1 0 0 3 0 0 1
FunctionPointer-PT-b128-CTLFireability-14: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-15: CTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
19 CTL EXCL 35/276 27/32 FunctionPointer-PT-b128-CTLFireability-08 4474702 m, 127153 m/sec, 10259063 t fired, .

Time elapsed: 35 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 14
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b128-CTLFireability-10: EF DL true findpath

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b128-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-02: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-05: EG 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-08: CTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-09: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-12: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-13: DISJ 0 1 0 0 3 0 0 1
FunctionPointer-PT-b128-CTLFireability-14: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-15: CTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
19 CTL EXCL 40/276 31/32 FunctionPointer-PT-b128-CTLFireability-08 5111348 m, 127329 m/sec, 11718691 t fired, .

Time elapsed: 40 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 14
lola: CANCELED task # 19 (type EXCL) for FunctionPointer-PT-b128-CTLFireability-08 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b128-CTLFireability-10: EF DL true findpath

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b128-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-02: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-05: EG 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-08: CTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-b128-CTLFireability-09: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-12: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-13: DISJ 0 1 0 0 3 0 0 1
FunctionPointer-PT-b128-CTLFireability-14: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-15: CTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 45 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 14
lola: LAUNCH task # 44 (type EXCL) for 43 FunctionPointer-PT-b128-CTLFireability-15
lola: time limit : 296 sec
lola: memory limit: 32 pages
lola: FINISHED task # 44 (type EXCL) for FunctionPointer-PT-b128-CTLFireability-15
lola: result : false
lola: markings : 26
lola: fired transitions : 26
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 41 (type EXCL) for 40 FunctionPointer-PT-b128-CTLFireability-14
lola: time limit : 323 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b128-CTLFireability-10: EF DL true findpath
FunctionPointer-PT-b128-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b128-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-02: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-05: EG 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-08: CTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-b128-CTLFireability-09: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-12: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-13: DISJ 0 1 0 0 3 0 0 1
FunctionPointer-PT-b128-CTLFireability-14: CTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
41 CTL EXCL 5/323 7/32 FunctionPointer-PT-b128-CTLFireability-14 1024948 m, 204989 m/sec, 2349871 t fired, .

Time elapsed: 50 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 14
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b128-CTLFireability-10: EF DL true findpath
FunctionPointer-PT-b128-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b128-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-02: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-05: EG 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-08: CTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-b128-CTLFireability-09: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-12: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-13: DISJ 0 1 0 0 3 0 0 1
FunctionPointer-PT-b128-CTLFireability-14: CTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
41 CTL EXCL 10/323 13/32 FunctionPointer-PT-b128-CTLFireability-14 2013329 m, 197676 m/sec, 4615917 t fired, .

Time elapsed: 55 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 14
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b128-CTLFireability-10: EF DL true findpath
FunctionPointer-PT-b128-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b128-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-02: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-05: EG 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-08: CTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-b128-CTLFireability-09: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-12: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-13: DISJ 0 1 0 0 3 0 0 1
FunctionPointer-PT-b128-CTLFireability-14: CTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
41 CTL EXCL 15/323 18/32 FunctionPointer-PT-b128-CTLFireability-14 2994714 m, 196277 m/sec, 6865920 t fired, .

Time elapsed: 60 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 14
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b128-CTLFireability-10: EF DL true findpath
FunctionPointer-PT-b128-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b128-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-02: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-05: EG 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-08: CTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-b128-CTLFireability-09: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-12: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-13: DISJ 0 1 0 0 3 0 0 1
FunctionPointer-PT-b128-CTLFireability-14: CTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
41 CTL EXCL 20/323 24/32 FunctionPointer-PT-b128-CTLFireability-14 3970988 m, 195254 m/sec, 9104206 t fired, .

Time elapsed: 65 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 14
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b128-CTLFireability-10: EF DL true findpath
FunctionPointer-PT-b128-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b128-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-02: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-05: EG 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-08: CTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-b128-CTLFireability-09: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-12: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-13: DISJ 0 1 0 0 3 0 0 1
FunctionPointer-PT-b128-CTLFireability-14: CTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
41 CTL EXCL 25/323 30/32 FunctionPointer-PT-b128-CTLFireability-14 4945075 m, 194817 m/sec, 11337479 t fired, .

Time elapsed: 70 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 14
lola: CANCELED task # 41 (type EXCL) for FunctionPointer-PT-b128-CTLFireability-14 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b128-CTLFireability-10: EF DL true findpath
FunctionPointer-PT-b128-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b128-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-02: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-05: EG 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-08: CTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-b128-CTLFireability-09: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-11: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-12: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-13: DISJ 0 1 0 0 3 0 0 1
FunctionPointer-PT-b128-CTLFireability-14: CTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 75 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 14
lola: LAUNCH task # 36 (type EXCL) for 33 FunctionPointer-PT-b128-CTLFireability-13
lola: time limit : 352 sec
lola: memory limit: 32 pages
lola: FINISHED task # 36 (type EXCL) for FunctionPointer-PT-b128-CTLFireability-13
lola: result : false
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 31 (type EXCL) for 30 FunctionPointer-PT-b128-CTLFireability-12
lola: time limit : 391 sec
lola: memory limit: 32 pages
lola: FINISHED task # 31 (type EXCL) for FunctionPointer-PT-b128-CTLFireability-12
lola: result : true
lola: markings : 27
lola: fired transitions : 82
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 28 (type EXCL) for 27 FunctionPointer-PT-b128-CTLFireability-11
lola: time limit : 440 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b128-CTLFireability-10: EF DL true findpath
FunctionPointer-PT-b128-CTLFireability-12: CTL true CTL model checker
FunctionPointer-PT-b128-CTLFireability-13: DISJ false DISJ
FunctionPointer-PT-b128-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b128-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-02: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-05: EG 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-08: CTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-b128-CTLFireability-09: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-11: CTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-14: CTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
28 CTL EXCL 5/440 7/32 FunctionPointer-PT-b128-CTLFireability-11 1104645 m, 220929 m/sec, 2532592 t fired, .

Time elapsed: 80 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 14
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b128-CTLFireability-10: EF DL true findpath
FunctionPointer-PT-b128-CTLFireability-12: CTL true CTL model checker
FunctionPointer-PT-b128-CTLFireability-13: DISJ false DISJ
FunctionPointer-PT-b128-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b128-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-02: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-05: EG 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-08: CTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-b128-CTLFireability-09: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-11: CTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-14: CTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
28 CTL EXCL 10/440 13/32 FunctionPointer-PT-b128-CTLFireability-11 2175817 m, 214234 m/sec, 4988450 t fired, .

Time elapsed: 85 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 14
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b128-CTLFireability-10: EF DL true findpath
FunctionPointer-PT-b128-CTLFireability-12: CTL true CTL model checker
FunctionPointer-PT-b128-CTLFireability-13: DISJ false DISJ
FunctionPointer-PT-b128-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b128-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-02: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-05: EG 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-08: CTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-b128-CTLFireability-09: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-11: CTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-14: CTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
28 CTL EXCL 15/440 20/32 FunctionPointer-PT-b128-CTLFireability-11 3234066 m, 211649 m/sec, 7414679 t fired, .

Time elapsed: 90 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 14
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b128-CTLFireability-10: EF DL true findpath
FunctionPointer-PT-b128-CTLFireability-12: CTL true CTL model checker
FunctionPointer-PT-b128-CTLFireability-13: DISJ false DISJ
FunctionPointer-PT-b128-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b128-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-02: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-05: EG 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-08: CTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-b128-CTLFireability-09: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-11: CTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-14: CTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
28 CTL EXCL 20/440 26/32 FunctionPointer-PT-b128-CTLFireability-11 4286703 m, 210527 m/sec, 9828042 t fired, .

Time elapsed: 95 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 14
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b128-CTLFireability-10: EF DL true findpath
FunctionPointer-PT-b128-CTLFireability-12: CTL true CTL model checker
FunctionPointer-PT-b128-CTLFireability-13: DISJ false DISJ
FunctionPointer-PT-b128-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b128-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-02: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-05: EG 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-08: CTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-b128-CTLFireability-09: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-11: CTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-14: CTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
28 CTL EXCL 25/440 32/32 FunctionPointer-PT-b128-CTLFireability-11 5330537 m, 208766 m/sec, 12221223 t fired, .

Time elapsed: 100 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 14
lola: CANCELED task # 28 (type EXCL) for FunctionPointer-PT-b128-CTLFireability-11 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b128-CTLFireability-10: EF DL true findpath
FunctionPointer-PT-b128-CTLFireability-12: CTL true CTL model checker
FunctionPointer-PT-b128-CTLFireability-13: DISJ false DISJ
FunctionPointer-PT-b128-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b128-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-02: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-04: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-05: EG 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-06: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-08: CTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-b128-CTLFireability-09: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-11: CTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-b128-CTLFireability-14: CTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 105 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 14
lola: LAUNCH task # 22 (type EXCL) for 21 FunctionPointer-PT-b128-CTLFireability-09
lola: time limit : 499 sec
lola: memory limit: 32 pages
lola: FINISHED task # 22 (type EXCL) for FunctionPointer-PT-b128-CTLFireability-09
lola: result : true
lola: markings : 53
lola: fired transitions : 54
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 16 (type EXCL) for 15 FunctionPointer-PT-b128-CTLFireability-06
lola: time limit : 582 sec
lola: memory limit: 32 pages
lola: FINISHED task # 16 (type EXCL) for FunctionPointer-PT-b128-CTLFireability-06
lola: result : true
lola: markings : 26
lola: fired transitions : 26
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 10 (type EXCL) for 9 FunctionPointer-PT-b128-CTLFireability-04
lola: time limit : 699 sec
lola: memory limit: 32 pages
lola: FINISHED task # 10 (type EXCL) for FunctionPointer-PT-b128-CTLFireability-04
lola: result : false
lola: markings : 269
lola: fired transitions : 400
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 4 (type EXCL) for 3 FunctionPointer-PT-b128-CTLFireability-02
lola: time limit : 873 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b128-CTLFireability-04: CTL false CTL model checker
FunctionPointer-PT-b128-CTLFireability-06: CTL true CTL model checker
FunctionPointer-PT-b128-CTLFireability-09: CTL true CTL model checker
FunctionPointer-PT-b128-CTLFireability-10: EF DL true findpath
FunctionPointer-PT-b128-CTLFireability-12: CTL true CTL model checker
FunctionPointer-PT-b128-CTLFireability-13: DISJ false DISJ
FunctionPointer-PT-b128-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b128-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-02: CTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-05: EG 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-08: CTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-b128-CTLFireability-11: CTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-b128-CTLFireability-14: CTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 CTL EXCL 5/873 10/32 FunctionPointer-PT-b128-CTLFireability-02 1623940 m, 324788 m/sec, 2099233 t fired, .

Time elapsed: 110 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 14
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b128-CTLFireability-04: CTL false CTL model checker
FunctionPointer-PT-b128-CTLFireability-06: CTL true CTL model checker
FunctionPointer-PT-b128-CTLFireability-09: CTL true CTL model checker
FunctionPointer-PT-b128-CTLFireability-10: EF DL true findpath
FunctionPointer-PT-b128-CTLFireability-12: CTL true CTL model checker
FunctionPointer-PT-b128-CTLFireability-13: DISJ false DISJ
FunctionPointer-PT-b128-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b128-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-02: CTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-05: EG 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-08: CTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-b128-CTLFireability-11: CTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-b128-CTLFireability-14: CTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 CTL EXCL 10/873 20/32 FunctionPointer-PT-b128-CTLFireability-02 3187864 m, 312784 m/sec, 4120890 t fired, .

Time elapsed: 115 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 14
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b128-CTLFireability-04: CTL false CTL model checker
FunctionPointer-PT-b128-CTLFireability-06: CTL true CTL model checker
FunctionPointer-PT-b128-CTLFireability-09: CTL true CTL model checker
FunctionPointer-PT-b128-CTLFireability-10: EF DL true findpath
FunctionPointer-PT-b128-CTLFireability-12: CTL true CTL model checker
FunctionPointer-PT-b128-CTLFireability-13: DISJ false DISJ
FunctionPointer-PT-b128-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b128-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-02: CTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-05: EG 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-08: CTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-b128-CTLFireability-11: CTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-b128-CTLFireability-14: CTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 CTL EXCL 15/873 29/32 FunctionPointer-PT-b128-CTLFireability-02 4741792 m, 310785 m/sec, 6129626 t fired, .

Time elapsed: 120 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 14
lola: CANCELED task # 4 (type EXCL) for FunctionPointer-PT-b128-CTLFireability-02 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b128-CTLFireability-04: CTL false CTL model checker
FunctionPointer-PT-b128-CTLFireability-06: CTL true CTL model checker
FunctionPointer-PT-b128-CTLFireability-09: CTL true CTL model checker
FunctionPointer-PT-b128-CTLFireability-10: EF DL true findpath
FunctionPointer-PT-b128-CTLFireability-12: CTL true CTL model checker
FunctionPointer-PT-b128-CTLFireability-13: DISJ false DISJ
FunctionPointer-PT-b128-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b128-CTLFireability-00: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-02: CTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-b128-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-05: EG 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-08: CTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-b128-CTLFireability-11: CTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-b128-CTLFireability-14: CTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 125 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 14
lola: LAUNCH task # 1 (type EXCL) for 0 FunctionPointer-PT-b128-CTLFireability-00
lola: time limit : 1158 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b128-CTLFireability-04: CTL false CTL model checker
FunctionPointer-PT-b128-CTLFireability-06: CTL true CTL model checker
FunctionPointer-PT-b128-CTLFireability-09: CTL true CTL model checker
FunctionPointer-PT-b128-CTLFireability-10: EF DL true findpath
FunctionPointer-PT-b128-CTLFireability-12: CTL true CTL model checker
FunctionPointer-PT-b128-CTLFireability-13: DISJ false DISJ
FunctionPointer-PT-b128-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b128-CTLFireability-00: CTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-02: CTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-b128-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-05: EG 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-08: CTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-b128-CTLFireability-11: CTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-b128-CTLFireability-14: CTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 CTL EXCL 5/1158 9/32 FunctionPointer-PT-b128-CTLFireability-00 1463191 m, 292638 m/sec, 1891438 t fired, .

Time elapsed: 130 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 14
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b128-CTLFireability-04: CTL false CTL model checker
FunctionPointer-PT-b128-CTLFireability-06: CTL true CTL model checker
FunctionPointer-PT-b128-CTLFireability-09: CTL true CTL model checker
FunctionPointer-PT-b128-CTLFireability-10: EF DL true findpath
FunctionPointer-PT-b128-CTLFireability-12: CTL true CTL model checker
FunctionPointer-PT-b128-CTLFireability-13: DISJ false DISJ
FunctionPointer-PT-b128-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b128-CTLFireability-00: CTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-02: CTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-b128-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-05: EG 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-08: CTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-b128-CTLFireability-11: CTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-b128-CTLFireability-14: CTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 CTL EXCL 10/1158 18/32 FunctionPointer-PT-b128-CTLFireability-00 2872645 m, 281890 m/sec, 3713415 t fired, .

Time elapsed: 135 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 14
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b128-CTLFireability-04: CTL false CTL model checker
FunctionPointer-PT-b128-CTLFireability-06: CTL true CTL model checker
FunctionPointer-PT-b128-CTLFireability-09: CTL true CTL model checker
FunctionPointer-PT-b128-CTLFireability-10: EF DL true findpath
FunctionPointer-PT-b128-CTLFireability-12: CTL true CTL model checker
FunctionPointer-PT-b128-CTLFireability-13: DISJ false DISJ
FunctionPointer-PT-b128-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b128-CTLFireability-00: CTL 0 0 1 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-02: CTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-b128-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-05: EG 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-08: CTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-b128-CTLFireability-11: CTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-b128-CTLFireability-14: CTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 CTL EXCL 15/1158 26/32 FunctionPointer-PT-b128-CTLFireability-00 4277050 m, 280881 m/sec, 5528865 t fired, .

Time elapsed: 140 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 14
lola: CANCELED task # 1 (type EXCL) for FunctionPointer-PT-b128-CTLFireability-00 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b128-CTLFireability-04: CTL false CTL model checker
FunctionPointer-PT-b128-CTLFireability-06: CTL true CTL model checker
FunctionPointer-PT-b128-CTLFireability-09: CTL true CTL model checker
FunctionPointer-PT-b128-CTLFireability-10: EF DL true findpath
FunctionPointer-PT-b128-CTLFireability-12: CTL true CTL model checker
FunctionPointer-PT-b128-CTLFireability-13: DISJ false DISJ
FunctionPointer-PT-b128-CTLFireability-15: CTL false CTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
FunctionPointer-PT-b128-CTLFireability-00: CTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-b128-CTLFireability-02: CTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-b128-CTLFireability-03: CTL 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-05: EG 0 1 0 0 1 0 0 0
FunctionPointer-PT-b128-CTLFireability-08: CTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-b128-CTLFireability-11: CTL 0 0 0 0 1 0 1 0
FunctionPointer-PT-b128-CTLFireability-14: CTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 145 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 14
lola: LAUNCH task # 13 (type EXCL) for 12 FunctionPointer-PT-b128-CTLFireability-05
lola: time limit : 1727 sec
lola: memory limit: 32 pages
lola: FINISHED task # 13 (type EXCL) for FunctionPointer-PT-b128-CTLFireability-05
lola: result : true
lola: markings : 27
lola: fired transitions : 27
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 7 (type EXCL) for 6 FunctionPointer-PT-b128-CTLFireability-03
lola: time limit : 3455 sec
lola: memory limit: 32 pages
lola: FINISHED task # 7 (type EXCL) for FunctionPointer-PT-b128-CTLFireability-03
lola: result : false
lola: markings : 27
lola: fired transitions : 55
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 14

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
FunctionPointer-PT-b128-CTLFireability-00: CTL unknown AGGR
FunctionPointer-PT-b128-CTLFireability-02: CTL unknown AGGR
FunctionPointer-PT-b128-CTLFireability-03: CTL false CTL model checker
FunctionPointer-PT-b128-CTLFireability-04: CTL false CTL model checker
FunctionPointer-PT-b128-CTLFireability-05: EG true state space / EG
FunctionPointer-PT-b128-CTLFireability-06: CTL true CTL model checker
FunctionPointer-PT-b128-CTLFireability-08: CTL unknown AGGR
FunctionPointer-PT-b128-CTLFireability-09: CTL true CTL model checker
FunctionPointer-PT-b128-CTLFireability-10: EF DL true findpath
FunctionPointer-PT-b128-CTLFireability-11: CTL unknown AGGR
FunctionPointer-PT-b128-CTLFireability-12: CTL true CTL model checker
FunctionPointer-PT-b128-CTLFireability-13: DISJ false DISJ
FunctionPointer-PT-b128-CTLFireability-14: CTL unknown AGGR
FunctionPointer-PT-b128-CTLFireability-15: CTL false CTL model checker


Time elapsed: 145 secs. Pages in use: 32

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="FunctionPointer-PT-b128"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="lolaxred"
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-5348"
echo " Executing tool lolaxred"
echo " Input is FunctionPointer-PT-b128, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r167-tall-167838853500706"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-b128.tgz
mv FunctionPointer-PT-b128 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;