fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r263-smll-167863538100308
Last Updated
May 14, 2023

About the Execution of LoLa+red for NoC3x3-PT-6A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1224.020 450222.00 482998.00 1702.90 FFFFT?FF?FFFTTFF normal

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.r263-smll-167863538100308.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 NoC3x3-PT-6A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-smll-167863538100308
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 736K
-rw-r--r-- 1 mcc users 7.5K Feb 26 10:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 10:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 09:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 09:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 10:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 26 10:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 10:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 10:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 16:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 297K Mar 5 18:23 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 NoC3x3-PT-6A-LTLFireability-00
FORMULA_NAME NoC3x3-PT-6A-LTLFireability-01
FORMULA_NAME NoC3x3-PT-6A-LTLFireability-02
FORMULA_NAME NoC3x3-PT-6A-LTLFireability-03
FORMULA_NAME NoC3x3-PT-6A-LTLFireability-04
FORMULA_NAME NoC3x3-PT-6A-LTLFireability-05
FORMULA_NAME NoC3x3-PT-6A-LTLFireability-06
FORMULA_NAME NoC3x3-PT-6A-LTLFireability-07
FORMULA_NAME NoC3x3-PT-6A-LTLFireability-08
FORMULA_NAME NoC3x3-PT-6A-LTLFireability-09
FORMULA_NAME NoC3x3-PT-6A-LTLFireability-10
FORMULA_NAME NoC3x3-PT-6A-LTLFireability-11
FORMULA_NAME NoC3x3-PT-6A-LTLFireability-12
FORMULA_NAME NoC3x3-PT-6A-LTLFireability-13
FORMULA_NAME NoC3x3-PT-6A-LTLFireability-14
FORMULA_NAME NoC3x3-PT-6A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678763751827

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-6A
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 03:15:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-14 03:15:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 03:15:55] [INFO ] Load time of PNML (sax parser for PT used): 241 ms
[2023-03-14 03:15:55] [INFO ] Transformed 512 places.
[2023-03-14 03:15:55] [INFO ] Transformed 1117 transitions.
[2023-03-14 03:15:55] [INFO ] Found NUPN structural information;
[2023-03-14 03:15:55] [INFO ] Parsed PT model containing 512 places and 1117 transitions and 4279 arcs in 433 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA NoC3x3-PT-6A-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6A-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6A-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6A-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6A-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 512 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 512/512 places, 1117/1117 transitions.
Discarding 71 places :
Symmetric choice reduction at 0 with 71 rule applications. Total rules 71 place count 441 transition count 828
Iterating global reduction 0 with 71 rules applied. Total rules applied 142 place count 441 transition count 828
Applied a total of 142 rules in 143 ms. Remains 441 /512 variables (removed 71) and now considering 828/1117 (removed 289) transitions.
[2023-03-14 03:15:56] [INFO ] Flow matrix only has 823 transitions (discarded 5 similar events)
// Phase 1: matrix 823 rows 441 cols
[2023-03-14 03:15:56] [INFO ] Computed 66 place invariants in 43 ms
[2023-03-14 03:15:57] [INFO ] Implicit Places using invariants in 992 ms returned [11, 46, 95, 133, 283, 334, 371, 423]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1066 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 433/512 places, 828/1117 transitions.
Applied a total of 0 rules in 15 ms. Remains 433 /433 variables (removed 0) and now considering 828/828 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1227 ms. Remains : 433/512 places, 828/1117 transitions.
Support contains 41 out of 433 places after structural reductions.
[2023-03-14 03:15:58] [INFO ] Flatten gal took : 207 ms
[2023-03-14 03:15:58] [INFO ] Flatten gal took : 130 ms
[2023-03-14 03:15:58] [INFO ] Input system was already deterministic with 828 transitions.
Incomplete random walk after 10000 steps, including 25 resets, run finished after 517 ms. (steps per millisecond=19 ) properties (out of 22) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-14 03:15:59] [INFO ] Flow matrix only has 823 transitions (discarded 5 similar events)
// Phase 1: matrix 823 rows 433 cols
[2023-03-14 03:15:59] [INFO ] Computed 58 place invariants in 10 ms
[2023-03-14 03:15:59] [INFO ] [Real]Absence check using 58 positive place invariants in 31 ms returned sat
[2023-03-14 03:15:59] [INFO ] After 769ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 03:15:59] [INFO ] [Nat]Absence check using 58 positive place invariants in 25 ms returned sat
[2023-03-14 03:16:00] [INFO ] After 549ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 03:16:00] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-14 03:16:00] [INFO ] After 148ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 03:16:00] [INFO ] After 261ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 130 ms.
[2023-03-14 03:16:00] [INFO ] After 1138ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 828/828 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 425 transition count 795
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 425 transition count 795
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 54 place count 406 transition count 776
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 60 place count 403 transition count 801
Free-agglomeration rule applied 25 times.
Iterating global reduction 0 with 25 rules applied. Total rules applied 85 place count 403 transition count 776
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 110 place count 378 transition count 776
Applied a total of 110 rules in 160 ms. Remains 378 /433 variables (removed 55) and now considering 776/828 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 378/433 places, 776/828 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 438069 steps, run timeout after 3001 ms. (steps per millisecond=145 ) properties seen :{}
Probabilistic random walk after 438069 steps, saw 297662 distinct states, run finished after 3002 ms. (steps per millisecond=145 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 03:16:04] [INFO ] Flow matrix only has 775 transitions (discarded 1 similar events)
// Phase 1: matrix 775 rows 378 cols
[2023-03-14 03:16:04] [INFO ] Computed 58 place invariants in 5 ms
[2023-03-14 03:16:04] [INFO ] [Real]Absence check using 58 positive place invariants in 15 ms returned sat
[2023-03-14 03:16:04] [INFO ] After 503ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 03:16:04] [INFO ] [Nat]Absence check using 58 positive place invariants in 32 ms returned sat
[2023-03-14 03:16:05] [INFO ] After 566ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 03:16:05] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-14 03:16:05] [INFO ] After 159ms SMT Verify possible using 41 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 03:16:05] [INFO ] After 376ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 97 ms.
[2023-03-14 03:16:05] [INFO ] After 1202ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 378 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 776/776 transitions.
Applied a total of 0 rules in 48 ms. Remains 378 /378 variables (removed 0) and now considering 776/776 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 378/378 places, 776/776 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 776/776 transitions.
Applied a total of 0 rules in 36 ms. Remains 378 /378 variables (removed 0) and now considering 776/776 (removed 0) transitions.
[2023-03-14 03:16:06] [INFO ] Flow matrix only has 775 transitions (discarded 1 similar events)
[2023-03-14 03:16:06] [INFO ] Invariant cache hit.
[2023-03-14 03:16:06] [INFO ] Implicit Places using invariants in 470 ms returned [166]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 473 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 377/378 places, 776/776 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 373 transition count 772
Applied a total of 8 rules in 46 ms. Remains 373 /377 variables (removed 4) and now considering 772/776 (removed 4) transitions.
[2023-03-14 03:16:06] [INFO ] Flow matrix only has 771 transitions (discarded 1 similar events)
// Phase 1: matrix 771 rows 373 cols
[2023-03-14 03:16:06] [INFO ] Computed 57 place invariants in 7 ms
[2023-03-14 03:16:07] [INFO ] Implicit Places using invariants in 590 ms returned []
[2023-03-14 03:16:07] [INFO ] Flow matrix only has 771 transitions (discarded 1 similar events)
[2023-03-14 03:16:07] [INFO ] Invariant cache hit.
[2023-03-14 03:16:07] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-14 03:16:08] [INFO ] Implicit Places using invariants and state equation in 1198 ms returned []
Implicit Place search using SMT with State Equation took 1799 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 373/378 places, 772/776 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2357 ms. Remains : 373/378 places, 772/776 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 479007 steps, run timeout after 3001 ms. (steps per millisecond=159 ) properties seen :{}
Probabilistic random walk after 479007 steps, saw 375669 distinct states, run finished after 3004 ms. (steps per millisecond=159 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 03:16:11] [INFO ] Flow matrix only has 771 transitions (discarded 1 similar events)
[2023-03-14 03:16:11] [INFO ] Invariant cache hit.
[2023-03-14 03:16:11] [INFO ] [Real]Absence check using 57 positive place invariants in 19 ms returned sat
[2023-03-14 03:16:11] [INFO ] After 491ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 03:16:12] [INFO ] [Nat]Absence check using 57 positive place invariants in 27 ms returned sat
[2023-03-14 03:16:12] [INFO ] After 495ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 03:16:12] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-14 03:16:12] [INFO ] After 194ms SMT Verify possible using 41 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 03:16:12] [INFO ] After 351ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-14 03:16:13] [INFO ] After 1073ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 373 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 373/373 places, 772/772 transitions.
Applied a total of 0 rules in 34 ms. Remains 373 /373 variables (removed 0) and now considering 772/772 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 373/373 places, 772/772 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 373/373 places, 772/772 transitions.
Applied a total of 0 rules in 30 ms. Remains 373 /373 variables (removed 0) and now considering 772/772 (removed 0) transitions.
[2023-03-14 03:16:13] [INFO ] Flow matrix only has 771 transitions (discarded 1 similar events)
[2023-03-14 03:16:13] [INFO ] Invariant cache hit.
[2023-03-14 03:16:13] [INFO ] Implicit Places using invariants in 603 ms returned []
[2023-03-14 03:16:13] [INFO ] Flow matrix only has 771 transitions (discarded 1 similar events)
[2023-03-14 03:16:13] [INFO ] Invariant cache hit.
[2023-03-14 03:16:14] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-14 03:16:14] [INFO ] Implicit Places using invariants and state equation in 1254 ms returned []
Implicit Place search using SMT with State Equation took 1861 ms to find 0 implicit places.
[2023-03-14 03:16:15] [INFO ] Redundant transitions in 85 ms returned []
[2023-03-14 03:16:15] [INFO ] Flow matrix only has 771 transitions (discarded 1 similar events)
[2023-03-14 03:16:15] [INFO ] Invariant cache hit.
[2023-03-14 03:16:16] [INFO ] Dead Transitions using invariants and state equation in 1002 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2990 ms. Remains : 373/373 places, 772/772 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 373 transition count 771
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 6 place count 373 transition count 771
Applied a total of 6 rules in 65 ms. Remains 373 /373 variables (removed 0) and now considering 771/772 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 771 rows 373 cols
[2023-03-14 03:16:16] [INFO ] Computed 57 place invariants in 6 ms
[2023-03-14 03:16:16] [INFO ] [Real]Absence check using 57 positive place invariants in 25 ms returned sat
[2023-03-14 03:16:16] [INFO ] After 612ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 03:16:16] [INFO ] [Nat]Absence check using 57 positive place invariants in 27 ms returned sat
[2023-03-14 03:16:17] [INFO ] After 528ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 03:16:17] [INFO ] After 671ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 100 ms.
[2023-03-14 03:16:17] [INFO ] After 917ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Computed a total of 2 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 433/433 places, 828/828 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 423 transition count 787
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 423 transition count 787
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 60 place count 403 transition count 767
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 66 place count 400 transition count 792
Applied a total of 66 rules in 95 ms. Remains 400 /433 variables (removed 33) and now considering 792/828 (removed 36) transitions.
// Phase 1: matrix 792 rows 400 cols
[2023-03-14 03:16:18] [INFO ] Computed 58 place invariants in 6 ms
[2023-03-14 03:16:18] [INFO ] Implicit Places using invariants in 431 ms returned []
[2023-03-14 03:16:18] [INFO ] Invariant cache hit.
[2023-03-14 03:16:19] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-14 03:16:19] [INFO ] Implicit Places using invariants and state equation in 1142 ms returned []
Implicit Place search using SMT with State Equation took 1581 ms to find 0 implicit places.
[2023-03-14 03:16:19] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-14 03:16:19] [INFO ] Invariant cache hit.
[2023-03-14 03:16:20] [INFO ] Dead Transitions using invariants and state equation in 761 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 400/433 places, 792/828 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2470 ms. Remains : 400/433 places, 792/828 transitions.
Stuttering acceptance computed with spot in 270 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-6A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s171 1) (EQ s209 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 370 steps with 1 reset in 10 ms.
FORMULA NoC3x3-PT-6A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6A-LTLFireability-00 finished in 2845 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U X(p1)))||F(G(p2))))'
Support contains 6 out of 433 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 828/828 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 424 transition count 791
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 424 transition count 791
Applied a total of 18 rules in 20 ms. Remains 424 /433 variables (removed 9) and now considering 791/828 (removed 37) transitions.
[2023-03-14 03:16:21] [INFO ] Flow matrix only has 790 transitions (discarded 1 similar events)
// Phase 1: matrix 790 rows 424 cols
[2023-03-14 03:16:21] [INFO ] Computed 58 place invariants in 5 ms
[2023-03-14 03:16:21] [INFO ] Implicit Places using invariants in 526 ms returned [184]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 529 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 423/433 places, 791/828 transitions.
Applied a total of 0 rules in 9 ms. Remains 423 /423 variables (removed 0) and now considering 791/791 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 559 ms. Remains : 423/433 places, 791/828 transitions.
Stuttering acceptance computed with spot in 308 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : NoC3x3-PT-6A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s9 1) (EQ s127 1)), p2:(OR (AND (EQ s8 1) (EQ s14 1)) (AND (EQ s168 1) (EQ s191 1))), p1:(AND (EQ s168 1) (EQ s191 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 240 steps with 0 reset in 5 ms.
FORMULA NoC3x3-PT-6A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6A-LTLFireability-01 finished in 920 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 828/828 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 423 transition count 787
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 423 transition count 787
Applied a total of 20 rules in 22 ms. Remains 423 /433 variables (removed 10) and now considering 787/828 (removed 41) transitions.
// Phase 1: matrix 787 rows 423 cols
[2023-03-14 03:16:21] [INFO ] Computed 58 place invariants in 6 ms
[2023-03-14 03:16:22] [INFO ] Implicit Places using invariants in 483 ms returned [183]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 492 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 422/433 places, 787/828 transitions.
Applied a total of 0 rules in 8 ms. Remains 422 /422 variables (removed 0) and now considering 787/787 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 525 ms. Remains : 422/433 places, 787/828 transitions.
Stuttering acceptance computed with spot in 221 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-6A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (EQ s79 1) (EQ s90 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-6A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6A-LTLFireability-02 finished in 771 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&F((!p1 U (p2||G(!p1))))))'
Support contains 4 out of 433 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 828/828 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 425 transition count 792
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 425 transition count 792
Applied a total of 16 rules in 19 ms. Remains 425 /433 variables (removed 8) and now considering 792/828 (removed 36) transitions.
// Phase 1: matrix 792 rows 425 cols
[2023-03-14 03:16:22] [INFO ] Computed 58 place invariants in 5 ms
[2023-03-14 03:16:23] [INFO ] Implicit Places using invariants in 473 ms returned [184]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 475 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 424/433 places, 792/828 transitions.
Applied a total of 0 rules in 9 ms. Remains 424 /424 variables (removed 0) and now considering 792/792 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 506 ms. Remains : 424/433 places, 792/828 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND (NOT p2) p1)]
Running random walk in product with property : NoC3x3-PT-6A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (NOT (AND (EQ s270 1) (EQ s412 1))) (NOT (AND (EQ s119 1) (EQ s129 1)))), p0:(OR (EQ s270 0) (EQ s412 0)), p1:(AND (EQ s119 1) (EQ s129 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2046 ms.
Product exploration explored 100000 steps with 50000 reset in 1649 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 7 factoid took 132 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-6A-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-6A-LTLFireability-04 finished in 4557 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 5 out of 433 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 433/433 places, 828/828 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 424 transition count 794
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 424 transition count 794
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 58 place count 404 transition count 774
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 64 place count 401 transition count 799
Applied a total of 64 rules in 44 ms. Remains 401 /433 variables (removed 32) and now considering 799/828 (removed 29) transitions.
[2023-03-14 03:16:27] [INFO ] Flow matrix only has 797 transitions (discarded 2 similar events)
// Phase 1: matrix 797 rows 401 cols
[2023-03-14 03:16:27] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-14 03:16:27] [INFO ] Implicit Places using invariants in 441 ms returned [173]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 444 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 400/433 places, 799/828 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 397 transition count 796
Applied a total of 6 rules in 30 ms. Remains 397 /400 variables (removed 3) and now considering 796/799 (removed 3) transitions.
[2023-03-14 03:16:27] [INFO ] Flow matrix only has 794 transitions (discarded 2 similar events)
// Phase 1: matrix 794 rows 397 cols
[2023-03-14 03:16:27] [INFO ] Computed 57 place invariants in 4 ms
[2023-03-14 03:16:28] [INFO ] Implicit Places using invariants in 408 ms returned []
[2023-03-14 03:16:28] [INFO ] Flow matrix only has 794 transitions (discarded 2 similar events)
[2023-03-14 03:16:28] [INFO ] Invariant cache hit.
[2023-03-14 03:16:28] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-14 03:16:29] [INFO ] Implicit Places using invariants and state equation in 1219 ms returned []
Implicit Place search using SMT with State Equation took 1636 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 397/433 places, 796/828 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2155 ms. Remains : 397/433 places, 796/828 transitions.
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-6A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s25 1) (NEQ s173 1)), p1:(OR (EQ s17 1) (AND (EQ s164 1) (EQ s181 1)))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 303 reset in 752 ms.
Product exploration explored 100000 steps with 306 reset in 590 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 7 factoid took 564 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 32 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-14 03:16:31] [INFO ] Flow matrix only has 794 transitions (discarded 2 similar events)
[2023-03-14 03:16:31] [INFO ] Invariant cache hit.
[2023-03-14 03:16:31] [INFO ] [Real]Absence check using 57 positive place invariants in 28 ms returned sat
[2023-03-14 03:16:32] [INFO ] After 657ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 03:16:32] [INFO ] [Nat]Absence check using 57 positive place invariants in 28 ms returned sat
[2023-03-14 03:16:32] [INFO ] After 535ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 03:16:32] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-14 03:16:33] [INFO ] After 163ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 03:16:33] [INFO ] After 342ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 182 ms.
[2023-03-14 03:16:33] [INFO ] After 1223ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 397 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 397/397 places, 796/796 transitions.
Free-agglomeration rule applied 23 times.
Iterating global reduction 0 with 23 rules applied. Total rules applied 23 place count 397 transition count 773
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 46 place count 374 transition count 773
Applied a total of 46 rules in 52 ms. Remains 374 /397 variables (removed 23) and now considering 773/796 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 374/397 places, 773/796 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 432225 steps, run timeout after 3001 ms. (steps per millisecond=144 ) properties seen :{}
Probabilistic random walk after 432225 steps, saw 278738 distinct states, run finished after 3001 ms. (steps per millisecond=144 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 03:16:36] [INFO ] Flow matrix only has 771 transitions (discarded 2 similar events)
// Phase 1: matrix 771 rows 374 cols
[2023-03-14 03:16:36] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-14 03:16:36] [INFO ] [Real]Absence check using 57 positive place invariants in 17 ms returned sat
[2023-03-14 03:16:37] [INFO ] After 411ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 03:16:37] [INFO ] [Nat]Absence check using 57 positive place invariants in 27 ms returned sat
[2023-03-14 03:16:37] [INFO ] After 501ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 03:16:37] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-14 03:16:37] [INFO ] After 131ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 03:16:38] [INFO ] After 284ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 190 ms.
[2023-03-14 03:16:38] [INFO ] After 1127ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 5 out of 374 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 374/374 places, 773/773 transitions.
Applied a total of 0 rules in 21 ms. Remains 374 /374 variables (removed 0) and now considering 773/773 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 374/374 places, 773/773 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 374/374 places, 773/773 transitions.
Applied a total of 0 rules in 20 ms. Remains 374 /374 variables (removed 0) and now considering 773/773 (removed 0) transitions.
[2023-03-14 03:16:38] [INFO ] Flow matrix only has 771 transitions (discarded 2 similar events)
[2023-03-14 03:16:38] [INFO ] Invariant cache hit.
[2023-03-14 03:16:38] [INFO ] Implicit Places using invariants in 487 ms returned []
[2023-03-14 03:16:38] [INFO ] Flow matrix only has 771 transitions (discarded 2 similar events)
[2023-03-14 03:16:38] [INFO ] Invariant cache hit.
[2023-03-14 03:16:39] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-14 03:16:39] [INFO ] Implicit Places using invariants and state equation in 827 ms returned []
Implicit Place search using SMT with State Equation took 1331 ms to find 0 implicit places.
[2023-03-14 03:16:39] [INFO ] Redundant transitions in 12 ms returned []
[2023-03-14 03:16:39] [INFO ] Flow matrix only has 771 transitions (discarded 2 similar events)
[2023-03-14 03:16:39] [INFO ] Invariant cache hit.
[2023-03-14 03:16:40] [INFO ] Dead Transitions using invariants and state equation in 632 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2018 ms. Remains : 374/374 places, 773/773 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 374 transition count 771
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 374 transition count 771
Applied a total of 7 rules in 45 ms. Remains 374 /374 variables (removed 0) and now considering 771/773 (removed 2) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 771 rows 374 cols
[2023-03-14 03:16:40] [INFO ] Computed 57 place invariants in 4 ms
[2023-03-14 03:16:40] [INFO ] [Real]Absence check using 57 positive place invariants in 27 ms returned sat
[2023-03-14 03:16:40] [INFO ] After 631ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 03:16:41] [INFO ] [Nat]Absence check using 57 positive place invariants in 26 ms returned sat
[2023-03-14 03:16:41] [INFO ] After 481ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 03:16:41] [INFO ] After 572ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 69 ms.
[2023-03-14 03:16:41] [INFO ] After 790ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 685 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1))]
Support contains 5 out of 397 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 397/397 places, 796/796 transitions.
Applied a total of 0 rules in 21 ms. Remains 397 /397 variables (removed 0) and now considering 796/796 (removed 0) transitions.
[2023-03-14 03:16:42] [INFO ] Flow matrix only has 794 transitions (discarded 2 similar events)
// Phase 1: matrix 794 rows 397 cols
[2023-03-14 03:16:42] [INFO ] Computed 57 place invariants in 5 ms
[2023-03-14 03:16:43] [INFO ] Implicit Places using invariants in 559 ms returned []
[2023-03-14 03:16:43] [INFO ] Flow matrix only has 794 transitions (discarded 2 similar events)
[2023-03-14 03:16:43] [INFO ] Invariant cache hit.
[2023-03-14 03:16:43] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-14 03:16:44] [INFO ] Implicit Places using invariants and state equation in 1187 ms returned []
Implicit Place search using SMT with State Equation took 1756 ms to find 0 implicit places.
[2023-03-14 03:16:44] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-14 03:16:44] [INFO ] Flow matrix only has 794 transitions (discarded 2 similar events)
[2023-03-14 03:16:44] [INFO ] Invariant cache hit.
[2023-03-14 03:16:45] [INFO ] Dead Transitions using invariants and state equation in 858 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2668 ms. Remains : 397/397 places, 796/796 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 7 factoid took 504 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 32 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-14 03:16:45] [INFO ] Flow matrix only has 794 transitions (discarded 2 similar events)
[2023-03-14 03:16:45] [INFO ] Invariant cache hit.
[2023-03-14 03:16:46] [INFO ] [Real]Absence check using 57 positive place invariants in 27 ms returned sat
[2023-03-14 03:16:46] [INFO ] After 637ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 03:16:46] [INFO ] [Nat]Absence check using 57 positive place invariants in 26 ms returned sat
[2023-03-14 03:16:47] [INFO ] After 527ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 03:16:47] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-14 03:16:47] [INFO ] After 173ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 03:16:47] [INFO ] After 349ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 180 ms.
[2023-03-14 03:16:47] [INFO ] After 1214ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 5 out of 397 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 397/397 places, 796/796 transitions.
Free-agglomeration rule applied 23 times.
Iterating global reduction 0 with 23 rules applied. Total rules applied 23 place count 397 transition count 773
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 46 place count 374 transition count 773
Applied a total of 46 rules in 43 ms. Remains 374 /397 variables (removed 23) and now considering 773/796 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 374/397 places, 773/796 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 445875 steps, run timeout after 3001 ms. (steps per millisecond=148 ) properties seen :{}
Probabilistic random walk after 445875 steps, saw 279321 distinct states, run finished after 3004 ms. (steps per millisecond=148 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-14 03:16:50] [INFO ] Flow matrix only has 771 transitions (discarded 2 similar events)
// Phase 1: matrix 771 rows 374 cols
[2023-03-14 03:16:50] [INFO ] Computed 57 place invariants in 4 ms
[2023-03-14 03:16:51] [INFO ] [Real]Absence check using 57 positive place invariants in 25 ms returned sat
[2023-03-14 03:16:51] [INFO ] After 556ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 03:16:51] [INFO ] [Nat]Absence check using 57 positive place invariants in 23 ms returned sat
[2023-03-14 03:16:52] [INFO ] After 386ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 03:16:52] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-14 03:16:52] [INFO ] After 121ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-14 03:16:52] [INFO ] After 261ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 176 ms.
[2023-03-14 03:16:52] [INFO ] After 954ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 5 out of 374 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 374/374 places, 773/773 transitions.
Applied a total of 0 rules in 18 ms. Remains 374 /374 variables (removed 0) and now considering 773/773 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 374/374 places, 773/773 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 374/374 places, 773/773 transitions.
Applied a total of 0 rules in 18 ms. Remains 374 /374 variables (removed 0) and now considering 773/773 (removed 0) transitions.
[2023-03-14 03:16:52] [INFO ] Flow matrix only has 771 transitions (discarded 2 similar events)
[2023-03-14 03:16:52] [INFO ] Invariant cache hit.
[2023-03-14 03:16:53] [INFO ] Implicit Places using invariants in 511 ms returned []
[2023-03-14 03:16:53] [INFO ] Flow matrix only has 771 transitions (discarded 2 similar events)
[2023-03-14 03:16:53] [INFO ] Invariant cache hit.
[2023-03-14 03:16:53] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-14 03:16:54] [INFO ] Implicit Places using invariants and state equation in 1089 ms returned []
Implicit Place search using SMT with State Equation took 1602 ms to find 0 implicit places.
[2023-03-14 03:16:54] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-14 03:16:54] [INFO ] Flow matrix only has 771 transitions (discarded 2 similar events)
[2023-03-14 03:16:54] [INFO ] Invariant cache hit.
[2023-03-14 03:16:55] [INFO ] Dead Transitions using invariants and state equation in 842 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2493 ms. Remains : 374/374 places, 773/773 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 374 transition count 771
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 374 transition count 771
Applied a total of 7 rules in 22 ms. Remains 374 /374 variables (removed 0) and now considering 771/773 (removed 2) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 771 rows 374 cols
[2023-03-14 03:16:55] [INFO ] Computed 57 place invariants in 2 ms
[2023-03-14 03:16:55] [INFO ] [Real]Absence check using 57 positive place invariants in 15 ms returned sat
[2023-03-14 03:16:55] [INFO ] After 373ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-14 03:16:55] [INFO ] [Nat]Absence check using 57 positive place invariants in 25 ms returned sat
[2023-03-14 03:16:55] [INFO ] After 363ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-14 03:16:55] [INFO ] After 430ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-14 03:16:56] [INFO ] After 594ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 508 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 52 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 311 reset in 759 ms.
Product exploration explored 100000 steps with 306 reset in 841 ms.
Support contains 5 out of 397 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 397/397 places, 796/796 transitions.
Applied a total of 0 rules in 24 ms. Remains 397 /397 variables (removed 0) and now considering 796/796 (removed 0) transitions.
[2023-03-14 03:16:58] [INFO ] Flow matrix only has 794 transitions (discarded 2 similar events)
// Phase 1: matrix 794 rows 397 cols
[2023-03-14 03:16:58] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-14 03:16:58] [INFO ] Implicit Places using invariants in 502 ms returned []
[2023-03-14 03:16:58] [INFO ] Flow matrix only has 794 transitions (discarded 2 similar events)
[2023-03-14 03:16:58] [INFO ] Invariant cache hit.
[2023-03-14 03:16:59] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-14 03:17:00] [INFO ] Implicit Places using invariants and state equation in 1163 ms returned []
Implicit Place search using SMT with State Equation took 1675 ms to find 0 implicit places.
[2023-03-14 03:17:00] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-14 03:17:00] [INFO ] Flow matrix only has 794 transitions (discarded 2 similar events)
[2023-03-14 03:17:00] [INFO ] Invariant cache hit.
[2023-03-14 03:17:00] [INFO ] Dead Transitions using invariants and state equation in 941 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2677 ms. Remains : 397/397 places, 796/796 transitions.
Treatment of property NoC3x3-PT-6A-LTLFireability-05 finished in 33924 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p0&&F(p1)))&&X(X(G(p1))))))'
Support contains 4 out of 433 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 828/828 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 425 transition count 796
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 425 transition count 796
Applied a total of 16 rules in 11 ms. Remains 425 /433 variables (removed 8) and now considering 796/828 (removed 32) transitions.
// Phase 1: matrix 796 rows 425 cols
[2023-03-14 03:17:01] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-14 03:17:01] [INFO ] Implicit Places using invariants in 274 ms returned [184]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 276 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 424/433 places, 796/828 transitions.
Applied a total of 0 rules in 5 ms. Remains 424 /424 variables (removed 0) and now considering 796/796 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 294 ms. Remains : 424/433 places, 796/828 transitions.
Stuttering acceptance computed with spot in 319 ms :[(OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-6A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 6}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 1}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=2, aps=[p0:(OR (EQ s372 0) (EQ s400 0)), p1:(OR (EQ s10 0) (EQ s33 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1606 steps with 4 reset in 17 ms.
FORMULA NoC3x3-PT-6A-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6A-LTLFireability-06 finished in 654 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 828/828 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 423 transition count 787
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 423 transition count 787
Applied a total of 20 rules in 18 ms. Remains 423 /433 variables (removed 10) and now considering 787/828 (removed 41) transitions.
// Phase 1: matrix 787 rows 423 cols
[2023-03-14 03:17:01] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-14 03:17:02] [INFO ] Implicit Places using invariants in 607 ms returned [183]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 610 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 422/433 places, 787/828 transitions.
Applied a total of 0 rules in 8 ms. Remains 422 /422 variables (removed 0) and now considering 787/787 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 637 ms. Remains : 422/433 places, 787/828 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-6A-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s257 1) (EQ s295 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-6A-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6A-LTLFireability-07 finished in 775 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 433/433 places, 828/828 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 431 transition count 827
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 422 transition count 789
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 422 transition count 789
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 1 with 48 rules applied. Total rules applied 67 place count 398 transition count 765
Applied a total of 67 rules in 47 ms. Remains 398 /433 variables (removed 35) and now considering 765/828 (removed 63) transitions.
// Phase 1: matrix 765 rows 398 cols
[2023-03-14 03:17:02] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-14 03:17:03] [INFO ] Implicit Places using invariants in 550 ms returned []
[2023-03-14 03:17:03] [INFO ] Invariant cache hit.
[2023-03-14 03:17:03] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-14 03:17:04] [INFO ] Implicit Places using invariants and state equation in 1124 ms returned []
Implicit Place search using SMT with State Equation took 1677 ms to find 0 implicit places.
[2023-03-14 03:17:04] [INFO ] Redundant transitions in 19 ms returned []
[2023-03-14 03:17:04] [INFO ] Invariant cache hit.
[2023-03-14 03:17:05] [INFO ] Dead Transitions using invariants and state equation in 784 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 398/433 places, 765/828 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2538 ms. Remains : 398/433 places, 765/828 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-6A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s324 1) (NEQ s370 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 402 reset in 440 ms.
Product exploration explored 100000 steps with 398 reset in 473 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
Finished random walk after 331 steps, including 1 resets, run visited all 1 properties in 3 ms. (steps per millisecond=110 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 182 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 398 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 398/398 places, 765/765 transitions.
Applied a total of 0 rules in 15 ms. Remains 398 /398 variables (removed 0) and now considering 765/765 (removed 0) transitions.
[2023-03-14 03:17:06] [INFO ] Invariant cache hit.
[2023-03-14 03:17:07] [INFO ] Implicit Places using invariants in 554 ms returned []
[2023-03-14 03:17:07] [INFO ] Invariant cache hit.
[2023-03-14 03:17:07] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-14 03:17:08] [INFO ] Implicit Places using invariants and state equation in 1099 ms returned []
Implicit Place search using SMT with State Equation took 1656 ms to find 0 implicit places.
[2023-03-14 03:17:08] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-14 03:17:08] [INFO ] Invariant cache hit.
[2023-03-14 03:17:09] [INFO ] Dead Transitions using invariants and state equation in 904 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2608 ms. Remains : 398/398 places, 765/765 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 168 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0)]
Finished random walk after 83 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=27 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 186 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 394 reset in 638 ms.
Product exploration explored 100000 steps with 396 reset in 692 ms.
Support contains 2 out of 398 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 398/398 places, 765/765 transitions.
Applied a total of 0 rules in 9 ms. Remains 398 /398 variables (removed 0) and now considering 765/765 (removed 0) transitions.
[2023-03-14 03:17:11] [INFO ] Invariant cache hit.
[2023-03-14 03:17:11] [INFO ] Implicit Places using invariants in 319 ms returned []
[2023-03-14 03:17:11] [INFO ] Invariant cache hit.
[2023-03-14 03:17:12] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-14 03:17:13] [INFO ] Implicit Places using invariants and state equation in 1171 ms returned []
Implicit Place search using SMT with State Equation took 1492 ms to find 0 implicit places.
[2023-03-14 03:17:13] [INFO ] Redundant transitions in 21 ms returned []
[2023-03-14 03:17:13] [INFO ] Invariant cache hit.
[2023-03-14 03:17:13] [INFO ] Dead Transitions using invariants and state equation in 895 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2428 ms. Remains : 398/398 places, 765/765 transitions.
Treatment of property NoC3x3-PT-6A-LTLFireability-08 finished in 11458 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((F(p0)&&X(p1)))||G(p2))))'
Support contains 6 out of 433 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 433/433 places, 828/828 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 424 transition count 792
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 424 transition count 792
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 56 place count 405 transition count 773
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 402 transition count 798
Applied a total of 62 rules in 55 ms. Remains 402 /433 variables (removed 31) and now considering 798/828 (removed 30) transitions.
[2023-03-14 03:17:14] [INFO ] Flow matrix only has 797 transitions (discarded 1 similar events)
// Phase 1: matrix 797 rows 402 cols
[2023-03-14 03:17:14] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-14 03:17:14] [INFO ] Implicit Places using invariants in 539 ms returned [172]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 541 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 401/433 places, 798/828 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 397 transition count 794
Applied a total of 8 rules in 28 ms. Remains 397 /401 variables (removed 4) and now considering 794/798 (removed 4) transitions.
[2023-03-14 03:17:14] [INFO ] Flow matrix only has 793 transitions (discarded 1 similar events)
// Phase 1: matrix 793 rows 397 cols
[2023-03-14 03:17:14] [INFO ] Computed 57 place invariants in 4 ms
[2023-03-14 03:17:15] [INFO ] Implicit Places using invariants in 522 ms returned []
[2023-03-14 03:17:15] [INFO ] Flow matrix only has 793 transitions (discarded 1 similar events)
[2023-03-14 03:17:15] [INFO ] Invariant cache hit.
[2023-03-14 03:17:15] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-14 03:17:16] [INFO ] Implicit Places using invariants and state equation in 1248 ms returned []
Implicit Place search using SMT with State Equation took 1783 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 397/433 places, 794/828 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2407 ms. Remains : 397/433 places, 794/828 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-6A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p2 p1), acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p2:(AND (EQ s116 1) (EQ s146 1) (OR (EQ s147 0) (EQ s216 0))), p1:(AND (EQ s163 1) (EQ s262 1)), p0:(AND (EQ s116 1) (EQ s146 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 327 steps with 0 reset in 3 ms.
FORMULA NoC3x3-PT-6A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6A-LTLFireability-10 finished in 2563 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 433 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 433/433 places, 828/828 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 423 transition count 787
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 423 transition count 787
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 60 place count 403 transition count 767
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 66 place count 400 transition count 792
Applied a total of 66 rules in 55 ms. Remains 400 /433 variables (removed 33) and now considering 792/828 (removed 36) transitions.
// Phase 1: matrix 792 rows 400 cols
[2023-03-14 03:17:16] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-14 03:17:17] [INFO ] Implicit Places using invariants in 597 ms returned [171]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 599 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 399/433 places, 792/828 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 395 transition count 788
Applied a total of 8 rules in 30 ms. Remains 395 /399 variables (removed 4) and now considering 788/792 (removed 4) transitions.
// Phase 1: matrix 788 rows 395 cols
[2023-03-14 03:17:17] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-14 03:17:17] [INFO ] Implicit Places using invariants in 582 ms returned []
[2023-03-14 03:17:17] [INFO ] Invariant cache hit.
[2023-03-14 03:17:18] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-14 03:17:19] [INFO ] Implicit Places using invariants and state equation in 1199 ms returned []
Implicit Place search using SMT with State Equation took 1783 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 395/433 places, 788/828 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2468 ms. Remains : 395/433 places, 788/828 transitions.
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-6A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s258 1), p1:(AND (EQ s323 1) (EQ s364 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 169 steps with 0 reset in 3 ms.
FORMULA NoC3x3-PT-6A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6A-LTLFireability-11 finished in 2551 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||(p1 U p2)))))'
Support contains 5 out of 433 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 828/828 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 425 transition count 795
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 425 transition count 795
Applied a total of 16 rules in 18 ms. Remains 425 /433 variables (removed 8) and now considering 795/828 (removed 33) transitions.
[2023-03-14 03:17:19] [INFO ] Flow matrix only has 794 transitions (discarded 1 similar events)
// Phase 1: matrix 794 rows 425 cols
[2023-03-14 03:17:19] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-14 03:17:19] [INFO ] Implicit Places using invariants in 600 ms returned [185]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 603 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 424/433 places, 795/828 transitions.
Applied a total of 0 rules in 8 ms. Remains 424 /424 variables (removed 0) and now considering 795/795 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 630 ms. Remains : 424/433 places, 795/828 transitions.
Stuttering acceptance computed with spot in 356 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-6A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=4, aps=[p2:(AND (EQ s175 1) (EQ s225 1) (EQ s61 1) (EQ s87 1)), p1:(AND (EQ s175 1) (EQ s225 1)), p0:(EQ s326 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-6A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6A-LTLFireability-15 finished in 1014 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-14 03:17:20] [INFO ] Flatten gal took : 93 ms
[2023-03-14 03:17:20] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-14 03:17:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 433 places, 828 transitions and 3121 arcs took 15 ms.
Total runtime 85262 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT NoC3x3-PT-6A
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

BK_STOP 1678764202049

--------------------
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 LTLFireability -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/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 1.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 NoC3x3-PT-6A-LTLFireability-05
lola: time limit : 1799 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 4/1799 1/32 NoC3x3-PT-6A-LTLFireability-05 115701 m, 23140 m/sec, 238276 t fired, .

Time elapsed: 5 secs. Pages in use: 1
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 9/1799 2/32 NoC3x3-PT-6A-LTLFireability-05 245577 m, 25975 m/sec, 528870 t fired, .

Time elapsed: 10 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 14/1799 3/32 NoC3x3-PT-6A-LTLFireability-05 372213 m, 25327 m/sec, 841783 t fired, .

Time elapsed: 15 secs. Pages in use: 3
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 19/1799 4/32 NoC3x3-PT-6A-LTLFireability-05 486416 m, 22840 m/sec, 1132088 t fired, .

Time elapsed: 20 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 24/1799 5/32 NoC3x3-PT-6A-LTLFireability-05 611388 m, 24994 m/sec, 1439215 t fired, .

Time elapsed: 25 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 29/1799 6/32 NoC3x3-PT-6A-LTLFireability-05 748728 m, 27468 m/sec, 1746009 t fired, .

Time elapsed: 30 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 34/1799 7/32 NoC3x3-PT-6A-LTLFireability-05 884716 m, 27197 m/sec, 2054918 t fired, .

Time elapsed: 35 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 39/1799 8/32 NoC3x3-PT-6A-LTLFireability-05 1029038 m, 28864 m/sec, 2394683 t fired, .

Time elapsed: 40 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 44/1799 9/32 NoC3x3-PT-6A-LTLFireability-05 1173924 m, 28977 m/sec, 2686389 t fired, .

Time elapsed: 45 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 49/1799 10/32 NoC3x3-PT-6A-LTLFireability-05 1306370 m, 26489 m/sec, 2974274 t fired, .

Time elapsed: 50 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 54/1799 11/32 NoC3x3-PT-6A-LTLFireability-05 1440986 m, 26923 m/sec, 3246565 t fired, .

Time elapsed: 55 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 59/1799 12/32 NoC3x3-PT-6A-LTLFireability-05 1568244 m, 25451 m/sec, 3565133 t fired, .

Time elapsed: 60 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 64/1799 13/32 NoC3x3-PT-6A-LTLFireability-05 1691540 m, 24659 m/sec, 3908944 t fired, .

Time elapsed: 65 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 69/1799 14/32 NoC3x3-PT-6A-LTLFireability-05 1821185 m, 25929 m/sec, 4200632 t fired, .

Time elapsed: 70 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 74/1799 15/32 NoC3x3-PT-6A-LTLFireability-05 1943764 m, 24515 m/sec, 4499035 t fired, .

Time elapsed: 75 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 79/1799 16/32 NoC3x3-PT-6A-LTLFireability-05 2064197 m, 24086 m/sec, 4823244 t fired, .

Time elapsed: 80 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 84/1799 16/32 NoC3x3-PT-6A-LTLFireability-05 2191320 m, 25424 m/sec, 5149913 t fired, .

Time elapsed: 85 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 89/1799 17/32 NoC3x3-PT-6A-LTLFireability-05 2322573 m, 26250 m/sec, 5470834 t fired, .

Time elapsed: 90 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 94/1799 18/32 NoC3x3-PT-6A-LTLFireability-05 2460457 m, 27576 m/sec, 5808792 t fired, .

Time elapsed: 95 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 99/1799 19/32 NoC3x3-PT-6A-LTLFireability-05 2599004 m, 27709 m/sec, 6085484 t fired, .

Time elapsed: 100 secs. Pages in use: 19
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 104/1799 20/32 NoC3x3-PT-6A-LTLFireability-05 2735631 m, 27325 m/sec, 6386138 t fired, .

Time elapsed: 105 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 109/1799 21/32 NoC3x3-PT-6A-LTLFireability-05 2869147 m, 26703 m/sec, 6708821 t fired, .

Time elapsed: 110 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 114/1799 22/32 NoC3x3-PT-6A-LTLFireability-05 3010997 m, 28370 m/sec, 7029338 t fired, .

Time elapsed: 115 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 119/1799 23/32 NoC3x3-PT-6A-LTLFireability-05 3156390 m, 29078 m/sec, 7345209 t fired, .

Time elapsed: 120 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 124/1799 24/32 NoC3x3-PT-6A-LTLFireability-05 3303731 m, 29468 m/sec, 7684669 t fired, .

Time elapsed: 125 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 129/1799 25/32 NoC3x3-PT-6A-LTLFireability-05 3445030 m, 28259 m/sec, 7964773 t fired, .

Time elapsed: 130 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 134/1799 26/32 NoC3x3-PT-6A-LTLFireability-05 3581617 m, 27317 m/sec, 8290219 t fired, .

Time elapsed: 135 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 139/1799 27/32 NoC3x3-PT-6A-LTLFireability-05 3708694 m, 25415 m/sec, 8558313 t fired, .

Time elapsed: 140 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 144/1799 28/32 NoC3x3-PT-6A-LTLFireability-05 3835725 m, 25406 m/sec, 8829718 t fired, .

Time elapsed: 145 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 149/1799 29/32 NoC3x3-PT-6A-LTLFireability-05 3971792 m, 27213 m/sec, 9103130 t fired, .

Time elapsed: 150 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 154/1799 30/32 NoC3x3-PT-6A-LTLFireability-05 4094776 m, 24596 m/sec, 9456274 t fired, .

Time elapsed: 155 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 159/1799 31/32 NoC3x3-PT-6A-LTLFireability-05 4217473 m, 24539 m/sec, 9793383 t fired, .

Time elapsed: 160 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 164/1799 32/32 NoC3x3-PT-6A-LTLFireability-05 4342757 m, 25056 m/sec, 10134500 t fired, .

Time elapsed: 165 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 169/1799 32/32 NoC3x3-PT-6A-LTLFireability-05 4467542 m, 24957 m/sec, 10411868 t fired, .

Time elapsed: 170 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for NoC3x3-PT-6A-LTLFireability-05 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 1 0 0 1 0 0 0

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

Time elapsed: 175 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 4 (type EXCL) for 3 NoC3x3-PT-6A-LTLFireability-08
lola: time limit : 3425 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/3425 1/32 NoC3x3-PT-6A-LTLFireability-08 122911 m, 24582 m/sec, 242747 t fired, .

Time elapsed: 180 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/3425 2/32 NoC3x3-PT-6A-LTLFireability-08 261214 m, 27660 m/sec, 545462 t fired, .

Time elapsed: 185 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/3425 3/32 NoC3x3-PT-6A-LTLFireability-08 391888 m, 26134 m/sec, 819016 t fired, .

Time elapsed: 190 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/3425 4/32 NoC3x3-PT-6A-LTLFireability-08 525818 m, 26786 m/sec, 1151145 t fired, .

Time elapsed: 195 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/3425 5/32 NoC3x3-PT-6A-LTLFireability-08 663891 m, 27614 m/sec, 1460800 t fired, .

Time elapsed: 200 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/3425 6/32 NoC3x3-PT-6A-LTLFireability-08 803228 m, 27867 m/sec, 1764134 t fired, .

Time elapsed: 205 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 35/3425 7/32 NoC3x3-PT-6A-LTLFireability-08 944581 m, 28270 m/sec, 2111218 t fired, .

Time elapsed: 210 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 40/3425 8/32 NoC3x3-PT-6A-LTLFireability-08 1089110 m, 28905 m/sec, 2460568 t fired, .

Time elapsed: 215 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 45/3425 9/32 NoC3x3-PT-6A-LTLFireability-08 1228405 m, 27859 m/sec, 2826735 t fired, .

Time elapsed: 220 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 50/3425 10/32 NoC3x3-PT-6A-LTLFireability-08 1375081 m, 29335 m/sec, 3210259 t fired, .

Time elapsed: 225 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 55/3425 11/32 NoC3x3-PT-6A-LTLFireability-08 1516477 m, 28279 m/sec, 3600239 t fired, .

Time elapsed: 230 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 60/3425 12/32 NoC3x3-PT-6A-LTLFireability-08 1672536 m, 31211 m/sec, 4019006 t fired, .

Time elapsed: 235 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 65/3425 13/32 NoC3x3-PT-6A-LTLFireability-08 1798953 m, 25283 m/sec, 4464330 t fired, .

Time elapsed: 240 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 70/3425 13/32 NoC3x3-PT-6A-LTLFireability-08 1924232 m, 25055 m/sec, 4748545 t fired, .

Time elapsed: 245 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 75/3425 14/32 NoC3x3-PT-6A-LTLFireability-08 2061345 m, 27422 m/sec, 5046411 t fired, .

Time elapsed: 250 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 80/3425 15/32 NoC3x3-PT-6A-LTLFireability-08 2183397 m, 24410 m/sec, 5343852 t fired, .

Time elapsed: 255 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 85/3425 16/32 NoC3x3-PT-6A-LTLFireability-08 2312048 m, 25730 m/sec, 5610024 t fired, .

Time elapsed: 260 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 90/3425 17/32 NoC3x3-PT-6A-LTLFireability-08 2435156 m, 24621 m/sec, 5943770 t fired, .

Time elapsed: 265 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 95/3425 18/32 NoC3x3-PT-6A-LTLFireability-08 2555563 m, 24081 m/sec, 6278571 t fired, .

Time elapsed: 270 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 100/3425 18/32 NoC3x3-PT-6A-LTLFireability-08 2682510 m, 25389 m/sec, 6619115 t fired, .

Time elapsed: 275 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 105/3425 19/32 NoC3x3-PT-6A-LTLFireability-08 2813839 m, 26265 m/sec, 6956943 t fired, .

Time elapsed: 280 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 110/3425 20/32 NoC3x3-PT-6A-LTLFireability-08 2948405 m, 26913 m/sec, 7245429 t fired, .

Time elapsed: 285 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 115/3425 21/32 NoC3x3-PT-6A-LTLFireability-08 3074958 m, 25310 m/sec, 7576444 t fired, .

Time elapsed: 290 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 120/3425 22/32 NoC3x3-PT-6A-LTLFireability-08 3196513 m, 24311 m/sec, 7872685 t fired, .

Time elapsed: 295 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 125/3425 23/32 NoC3x3-PT-6A-LTLFireability-08 3323356 m, 25368 m/sec, 8210232 t fired, .

Time elapsed: 300 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 130/3425 24/32 NoC3x3-PT-6A-LTLFireability-08 3455314 m, 26391 m/sec, 8566663 t fired, .

Time elapsed: 305 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 135/3425 24/32 NoC3x3-PT-6A-LTLFireability-08 3590934 m, 27124 m/sec, 8916199 t fired, .

Time elapsed: 310 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 140/3425 25/32 NoC3x3-PT-6A-LTLFireability-08 3720338 m, 25880 m/sec, 9260005 t fired, .

Time elapsed: 315 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 145/3425 26/32 NoC3x3-PT-6A-LTLFireability-08 3846853 m, 25303 m/sec, 9607898 t fired, .

Time elapsed: 320 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 150/3425 27/32 NoC3x3-PT-6A-LTLFireability-08 3975093 m, 25648 m/sec, 9950141 t fired, .

Time elapsed: 325 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 155/3425 28/32 NoC3x3-PT-6A-LTLFireability-08 4105308 m, 26043 m/sec, 10275088 t fired, .

Time elapsed: 330 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 160/3425 29/32 NoC3x3-PT-6A-LTLFireability-08 4231125 m, 25163 m/sec, 10626389 t fired, .

Time elapsed: 335 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 165/3425 30/32 NoC3x3-PT-6A-LTLFireability-08 4358511 m, 25477 m/sec, 10952490 t fired, .

Time elapsed: 340 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 170/3425 30/32 NoC3x3-PT-6A-LTLFireability-08 4488517 m, 26001 m/sec, 11308149 t fired, .

Time elapsed: 345 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 175/3425 31/32 NoC3x3-PT-6A-LTLFireability-08 4612910 m, 24878 m/sec, 11643213 t fired, .

Time elapsed: 350 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 180/3425 32/32 NoC3x3-PT-6A-LTLFireability-08 4736052 m, 24628 m/sec, 12016522 t fired, .

Time elapsed: 355 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for NoC3x3-PT-6A-LTLFireability-08 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
NoC3x3-PT-6A-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
NoC3x3-PT-6A-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 361 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: Portfolio finished: no open tasks 2

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
NoC3x3-PT-6A-LTLFireability-05: LTL unknown AGGR
NoC3x3-PT-6A-LTLFireability-08: LTL unknown AGGR


Time elapsed: 361 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="NoC3x3-PT-6A"
export BK_EXAMINATION="LTLFireability"
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 NoC3x3-PT-6A, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r263-smll-167863538100308"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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