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.r199-smll-167840346200611.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 HouseConstruction-PT-16000, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r199-smll-167840346200611
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 388K
-rw-r--r-- 1 mcc users 7.3K Feb 25 13:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 25 13:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 25 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 25 13:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.8K Feb 25 13:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 35K Feb 25 13:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 25 13:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Feb 25 13:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 13K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678571204635

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HouseConstruction-PT-16000
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 21:46:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 21:46:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 21:46:47] [INFO ] Load time of PNML (sax parser for PT used): 32 ms
[2023-03-11 21:46:47] [INFO ] Transformed 26 places.
[2023-03-11 21:46:47] [INFO ] Transformed 18 transitions.
[2023-03-11 21:46:47] [INFO ] Parsed PT model containing 26 places and 18 transitions and 51 arcs in 124 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA HouseConstruction-PT-16000-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-16000-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-16000-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HouseConstruction-PT-16000-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA HouseConstruction-PT-16000-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 26 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 26/26 places, 18/18 transitions.
Applied a total of 0 rules in 14 ms. Remains 26 /26 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 26 cols
[2023-03-11 21:46:47] [INFO ] Computed 8 place invariants in 12 ms
[2023-03-11 21:46:47] [INFO ] Implicit Places using invariants in 212 ms returned [3, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 254 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/26 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 269 ms. Remains : 24/26 places, 18/18 transitions.
Support contains 21 out of 24 places after structural reductions.
[2023-03-11 21:46:48] [INFO ] Flatten gal took : 21 ms
[2023-03-11 21:46:48] [INFO ] Flatten gal took : 6 ms
[2023-03-11 21:46:48] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 16001 steps, including 0 resets, run finished after 19 ms. (steps per millisecond=842 ) properties (out of 21) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=30 ) properties (out of 20) seen :13
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=27 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 18 rows 24 cols
[2023-03-11 21:46:48] [INFO ] Computed 6 place invariants in 1 ms
[2023-03-11 21:46:48] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 16 ms returned sat
[2023-03-11 21:46:48] [INFO ] After 36ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2023-03-11 21:46:48] [INFO ] After 46ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 21:46:48] [INFO ] After 145ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-11 21:46:48] [INFO ] [Nat]Absence check using 0 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-11 21:46:48] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2023-03-11 21:46:48] [INFO ] After 55ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-11 21:46:48] [INFO ] After 135ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 4 different solutions.
Finished Parikh walk after 16036 steps, including 0 resets, run visited all 4 properties in 305 ms. (steps per millisecond=52 )
Parikh walk visited 4 properties in 307 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
FORMULA HouseConstruction-PT-16000-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 24 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 24 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
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((p0||F(G(!p0)))))'
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 1 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2023-03-11 21:46:49] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-11 21:46:49] [INFO ] Implicit Places using invariants in 44 ms returned [8, 12]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 49 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 3 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 53 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 265 ms :[false, p0, false]
Running random walk in product with property : HouseConstruction-PT-16000-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(LEQ 3 s8)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 418 ms.
Product exploration explored 100000 steps with 0 reset in 462 ms.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 180 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[p0]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 7 ms. (steps per millisecond=2285 ) properties (out of 1) seen :0
Finished Best-First random walk after 161 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=80 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 170 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[p0]
Stuttering acceptance computed with spot in 33 ms :[p0]
Support contains 1 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Graph (complete) has 22 edges and 21 vertex of which 7 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 12 output transitions
Drop transitions removed 12 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 6 transition count 4
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 5 transition count 4
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 5 transition count 3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 4 transition count 3
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 6 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 8 place count 2 transition count 2
Applied a total of 8 rules in 2711 ms. Remains 2 /21 variables (removed 19) and now considering 2/18 (removed 16) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-11 21:46:53] [INFO ] Computed 0 place invariants in 1 ms
[2023-03-11 21:46:53] [INFO ] Implicit Places using invariants in 24 ms returned []
[2023-03-11 21:46:53] [INFO ] Invariant cache hit.
[2023-03-11 21:46:53] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
[2023-03-11 21:46:53] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 21:46:53] [INFO ] Invariant cache hit.
[2023-03-11 21:46:53] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/21 places, 2/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2784 ms. Remains : 2/21 places, 2/18 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G (NOT p0)))
Knowledge based reduction with 4 factoid took 178 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-16000-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-16000-LTLCardinality-00 finished in 4820 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 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Graph (complete) has 28 edges and 24 vertex of which 12 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.0 ms
Discarding 12 places :
Also discarding 9 output transitions
Drop transitions removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 11 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 10 transition count 7
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 10 transition count 5
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 9 place count 6 transition count 5
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 9 place count 6 transition count 3
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 14 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 14 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 2 transition count 2
Applied a total of 16 rules in 2377 ms. Remains 2 /24 variables (removed 22) and now considering 2/18 (removed 16) transitions.
[2023-03-11 21:46:56] [INFO ] Invariant cache hit.
[2023-03-11 21:46:56] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-11 21:46:56] [INFO ] Invariant cache hit.
[2023-03-11 21:46:56] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2023-03-11 21:46:56] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 21:46:56] [INFO ] Invariant cache hit.
[2023-03-11 21:46:56] [INFO ] Dead Transitions using invariants and state equation in 19 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/24 places, 2/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2456 ms. Remains : 2/24 places, 2/18 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-16000-LTLCardinality-01 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:(LEQ 1 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 39876 steps with 154 reset in 52 ms.
FORMULA HouseConstruction-PT-16000-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-16000-LTLCardinality-01 finished in 2593 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)))'
Support contains 1 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Graph (complete) has 28 edges and 24 vertex of which 2 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.1 ms
Discarding 22 places :
Also discarding 16 output transitions
Drop transitions removed 16 transitions
Applied a total of 1 rules in 2 ms. Remains 2 /24 variables (removed 22) and now considering 2/18 (removed 16) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-11 21:46:56] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 21:46:56] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-11 21:46:56] [INFO ] Invariant cache hit.
[2023-03-11 21:46:56] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-11 21:46:56] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 21:46:56] [INFO ] Invariant cache hit.
[2023-03-11 21:46:56] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/24 places, 2/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65 ms. Remains : 2/24 places, 2/18 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : HouseConstruction-PT-16000-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s1)], nbAcceptance=1, 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 3 reset in 96 ms.
Product exploration explored 100000 steps with 3 reset in 276 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 2 transition count 2
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X (NOT p0)), (F (G p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-16000-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-16000-LTLCardinality-02 finished in 631 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) U X(G(p1)))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 2 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2023-03-11 21:46:57] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-11 21:46:57] [INFO ] Implicit Places using invariants in 37 ms returned [8, 12]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 39 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 42 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 262 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), true, (AND p1 (NOT p0))]
Running random walk in product with property : HouseConstruction-PT-16000-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(LEQ 3 s7), p0:(GT s8 s13)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-16000-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-16000-LTLCardinality-03 finished in 324 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(G(p0))||G(F(p1))||G(p2))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 1 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
[2023-03-11 21:46:57] [INFO ] Invariant cache hit.
[2023-03-11 21:46:57] [INFO ] Implicit Places using invariants in 31 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34 ms. Remains : 22/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : HouseConstruction-PT-16000-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p2:(OR (GT 1 s8) (LEQ 1 s11)), p0:(LEQ 1 s8), p1:(GT 1 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 221 ms.
Product exploration explored 100000 steps with 0 reset in 268 ms.
Computed a total of 22 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p2 (NOT p0) (NOT p1)), (X p2), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X p2)), true, (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p0) (G (NOT p0)))), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p1))
Knowledge based reduction with 11 factoid took 530 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-16000-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-16000-LTLCardinality-04 finished in 1285 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((p0&&F(p1))))'
Support contains 3 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 2 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
[2023-03-11 21:46:58] [INFO ] Invariant cache hit.
[2023-03-11 21:46:58] [INFO ] Implicit Places using invariants in 54 ms returned [8, 12]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 65 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 69 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : HouseConstruction-PT-16000-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(LEQ s19 s10), p0:(LEQ 1 s2)], 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HouseConstruction-PT-16000-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-16000-LTLCardinality-07 finished in 285 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(X(G(p0)))) U (p0&&X(X(X(G(p0))))))))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 1 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
[2023-03-11 21:46:59] [INFO ] Invariant cache hit.
[2023-03-11 21:46:59] [INFO ] Implicit Places using invariants in 46 ms returned [8, 12]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 49 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 309 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HouseConstruction-PT-16000-LTLCardinality-08 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: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(GT s8 s7)], 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 1 ms.
FORMULA HouseConstruction-PT-16000-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HouseConstruction-PT-16000-LTLCardinality-08 finished in 377 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)&&(p1||F(p2)))))'
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 7 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
[2023-03-11 21:46:59] [INFO ] Invariant cache hit.
[2023-03-11 21:46:59] [INFO ] Implicit Places using invariants in 40 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51 ms. Remains : 22/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Running random walk in product with property : HouseConstruction-PT-16000-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s11 s14), p1:(GT s0 s17), p2:(GT 3 s19)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 149 ms.
Product exploration explored 100000 steps with 50000 reset in 128 ms.
Computed a total of 22 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (X p0)), (X (X p2)), (F (OR (G p0) (G (NOT p0)))), (F (G (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 8 factoid took 138 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HouseConstruction-PT-16000-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HouseConstruction-PT-16000-LTLCardinality-11 finished in 679 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(X((X(p0) U p1)))))'
Support contains 1 out of 24 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Graph (complete) has 28 edges and 24 vertex of which 14 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 13 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 12 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 12 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 9 place count 8 transition count 7
Applied a total of 9 rules in 2552 ms. Remains 8 /24 variables (removed 16) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 8 cols
[2023-03-11 21:47:02] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-11 21:47:02] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-11 21:47:02] [INFO ] Invariant cache hit.
[2023-03-11 21:47:02] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
[2023-03-11 21:47:02] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 21:47:02] [INFO ] Invariant cache hit.
[2023-03-11 21:47:02] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/24 places, 7/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2636 ms. Remains : 8/24 places, 7/18 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : HouseConstruction-PT-16000-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(LEQ 1 s7)], 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 7403 reset in 74 ms.
Product exploration explored 100000 steps with 7394 reset in 88 ms.
Computed a total of 8 stabilizing places and 7 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 8 transition count 7
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 143 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 68 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 7 ms. (steps per millisecond=2285 ) properties (out of 1) seen :0
Finished Best-First random walk after 16 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=16 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 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 86 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 162 ms :[(NOT p1), (NOT p1)]
[2023-03-11 21:47:03] [INFO ] Invariant cache hit.
[2023-03-11 21:47:03] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-11 21:47:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 21:47:03] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2023-03-11 21:47:03] [INFO ] Computed and/alt/rep : 6/7/6 causal constraints (skipped 0 transitions) in 2 ms.
[2023-03-11 21:47:03] [INFO ] Added : 4 causal constraints over 1 iterations in 14 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 8 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 7/7 transitions.
Applied a total of 0 rules in 2 ms. Remains 8 /8 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2023-03-11 21:47:03] [INFO ] Invariant cache hit.
[2023-03-11 21:47:03] [INFO ] Implicit Places using invariants in 29 ms returned []
[2023-03-11 21:47:03] [INFO ] Invariant cache hit.
[2023-03-11 21:47:03] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2023-03-11 21:47:03] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 21:47:03] [INFO ] Invariant cache hit.
[2023-03-11 21:47:03] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 96 ms. Remains : 8/8 places, 7/7 transitions.
Computed a total of 8 stabilizing places and 7 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 8 transition count 7
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 161 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 88 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 4 ms. (steps per millisecond=4000 ) properties (out of 1) seen :0
Finished Best-First random walk after 24 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=24 )
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 4 factoid took 219 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 72 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (NOT p1)]
[2023-03-11 21:47:04] [INFO ] Invariant cache hit.
[2023-03-11 21:47:04] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 0 ms returned sat
[2023-03-11 21:47:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 21:47:04] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2023-03-11 21:47:04] [INFO ] Computed and/alt/rep : 6/7/6 causal constraints (skipped 0 transitions) in 1 ms.
[2023-03-11 21:47:04] [INFO ] Added : 4 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 86 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 7363 reset in 76 ms.
Product exploration explored 100000 steps with 7403 reset in 104 ms.
Support contains 1 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 7/7 transitions.
Graph (complete) has 8 edges and 8 vertex of which 7 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 1 place count 6 transition count 3
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 5 rules applied. Total rules applied 6 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 6 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 2 transition count 2
Applied a total of 8 rules in 2302 ms. Remains 2 /8 variables (removed 6) and now considering 2/7 (removed 5) transitions.
// Phase 1: matrix 2 rows 2 cols
[2023-03-11 21:47:07] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 21:47:07] [INFO ] Implicit Places using invariants in 26 ms returned []
[2023-03-11 21:47:07] [INFO ] Invariant cache hit.
[2023-03-11 21:47:07] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-03-11 21:47:07] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 21:47:07] [INFO ] Invariant cache hit.
[2023-03-11 21:47:07] [INFO ] Dead Transitions using invariants and state equation in 17 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2/8 places, 2/7 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2374 ms. Remains : 2/8 places, 2/7 transitions.
Treatment of property HouseConstruction-PT-16000-LTLCardinality-14 finished in 7167 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||(F(p1) U X(G((p1 U p2)))))))'
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 23 transition count 18
Applied a total of 1 rules in 1 ms. Remains 23 /24 variables (removed 1) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2023-03-11 21:47:07] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-11 21:47:07] [INFO ] Implicit Places using invariants in 43 ms returned [8, 12]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 45 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 49 ms. Remains : 21/24 places, 18/18 transitions.
Stuttering acceptance computed with spot in 224 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (NOT p2)]
Running random walk in product with property : HouseConstruction-PT-16000-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(OR p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s10 s6), p1:(LEQ 2 s0), p2:(GT s20 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 987 reset in 302 ms.
Product exploration explored 100000 steps with 1221 reset in 295 ms.
Computed a total of 21 stabilizing places and 18 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 21 transition count 18
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 (NOT p2))), (X p1), (X (OR p1 p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X p1)), (X (X (OR p1 p2))), (F (G p0)), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 644 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p2)]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 3 ms. (steps per millisecond=5333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 18 rows 21 cols
[2023-03-11 21:47:09] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-11 21:47:09] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 21:47:09] [INFO ] [Nat]Absence check using 0 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-11 21:47:09] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 21:47:09] [INFO ] After 53ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-11 21:47:09] [INFO ] After 121ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 31814 steps, including 0 resets, run visited all 4 properties in 465 ms. (steps per millisecond=68 )
Parikh walk visited 4 properties in 464 ms.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 (NOT p2))), (X p1), (X (OR p1 p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X p1)), (X (X (OR p1 p2))), (F (G p0)), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) p1))), (F (AND (NOT p2) (NOT p1))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p2 p1))), (F (AND (NOT p0) (NOT p2) (NOT p1)))]
Knowledge based reduction with 12 factoid took 686 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p2)]
Support contains 5 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Graph (complete) has 22 edges and 21 vertex of which 12 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.0 ms
Discarding 9 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 12 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 11 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 11 transition count 8
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 9 transition count 8
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 8 transition count 8
Applied a total of 8 rules in 10 ms. Remains 8 /21 variables (removed 13) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 8 cols
[2023-03-11 21:47:11] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 21:47:11] [INFO ] Implicit Places using invariants in 44 ms returned []
[2023-03-11 21:47:11] [INFO ] Invariant cache hit.
[2023-03-11 21:47:11] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2023-03-11 21:47:11] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 21:47:11] [INFO ] Invariant cache hit.
[2023-03-11 21:47:11] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/21 places, 8/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 138 ms. Remains : 8/21 places, 8/18 transitions.
Computed a total of 8 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 8 transition count 8
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (OR p2 p1)), (X p1), (X (AND (NOT p2) p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (OR p2 p1))), (X (X p1)), (X (X (AND (NOT p2) p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (G p0)), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 691 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p2)]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 3 ms. (steps per millisecond=5333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-11 21:47:12] [INFO ] Invariant cache hit.
[2023-03-11 21:47:12] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 21:47:12] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 21:47:12] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-11 21:47:12] [INFO ] After 58ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 79229 steps, including 0 resets, run visited all 4 properties in 1190 ms. (steps per millisecond=66 )
Parikh walk visited 4 properties in 1190 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (OR p2 p1)), (X p1), (X (AND (NOT p2) p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (OR p2 p1))), (X (X p1)), (X (X (AND (NOT p2) p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (G p0)), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p1) (NOT p2))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p1 p2))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 16 factoid took 1040 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 225 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 1415 reset in 113 ms.
Product exploration explored 100000 steps with 1591 reset in 134 ms.
Support contains 5 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-11 21:47:15] [INFO ] Invariant cache hit.
[2023-03-11 21:47:15] [INFO ] Implicit Places using invariants in 23 ms returned []
[2023-03-11 21:47:15] [INFO ] Invariant cache hit.
[2023-03-11 21:47:15] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2023-03-11 21:47:15] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 21:47:15] [INFO ] Invariant cache hit.
[2023-03-11 21:47:15] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 82 ms. Remains : 8/8 places, 8/8 transitions.
Treatment of property HouseConstruction-PT-16000-LTLCardinality-15 finished in 8355 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(X((X(p0) U 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((p0||(F(p1) U X(G((p1 U p2)))))))'
Found a Lengthening insensitive property : HouseConstruction-PT-16000-LTLCardinality-15
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (NOT p2)]
Support contains 5 out of 24 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 24/24 places, 18/18 transitions.
Graph (complete) has 28 edges and 24 vertex of which 14 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 7 output transitions
Drop transitions removed 7 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 14 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 13 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 13 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 12 transition count 9
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 7 place count 11 transition count 8
Applied a total of 7 rules in 4 ms. Remains 11 /24 variables (removed 13) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 11 cols
[2023-03-11 21:47:16] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-11 21:47:16] [INFO ] Implicit Places using invariants in 30 ms returned [5, 7, 9]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 31 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 8/24 places, 8/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 37 ms. Remains : 8/24 places, 8/18 transitions.
Running random walk in product with property : HouseConstruction-PT-16000-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(OR p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s6 s4), p1:(LEQ 2 s0), p2:(GT s7 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1153 reset in 113 ms.
Product exploration explored 100000 steps with 1388 reset in 133 ms.
Computed a total of 8 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 8 transition count 8
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 (NOT p2))), (X p1), (X (OR p1 p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X p1)), (X (X (OR p1 p2))), (F (G p0)), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 541 ms. Reduced automaton from 5 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p2)]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 3 ms. (steps per millisecond=5333 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 8 rows 8 cols
[2023-03-11 21:47:17] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-11 21:47:17] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 21:47:17] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 21:47:17] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-11 21:47:17] [INFO ] After 56ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Finished Parikh walk after 16002 steps, including 0 resets, run visited all 4 properties in 231 ms. (steps per millisecond=69 )
Parikh walk visited 4 properties in 231 ms.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND p1 (NOT p2))), (X p1), (X (OR p1 p2)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X p1)), (X (X (OR p1 p2))), (F (G p0)), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(F (NOT (AND (NOT p2) p1))), (F (AND (NOT p2) (NOT p1))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p2 p1))), (F (AND (NOT p0) (NOT p2) (NOT p1)))]
Knowledge based reduction with 12 factoid took 603 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p2)]
Support contains 5 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-11 21:47:18] [INFO ] Invariant cache hit.
[2023-03-11 21:47:18] [INFO ] Implicit Places using invariants in 16 ms returned []
[2023-03-11 21:47:18] [INFO ] Invariant cache hit.
[2023-03-11 21:47:18] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2023-03-11 21:47:18] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-11 21:47:18] [INFO ] Invariant cache hit.
[2023-03-11 21:47:18] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 69 ms. Remains : 8/8 places, 8/8 transitions.
Computed a total of 8 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 8 transition count 8
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (OR p2 p1)), (X p1), (X (AND (NOT p2) p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (OR p2 p1))), (X (X p1)), (X (X (AND (NOT p2) p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (G p0)), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 781 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p2)]
Incomplete random walk after 16001 steps, including 0 resets, run finished after 2 ms. (steps per millisecond=8000 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-11 21:47:19] [INFO ] Invariant cache hit.
[2023-03-11 21:47:19] [INFO ] After 21ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 21:47:19] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 21:47:19] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 9 ms.
[2023-03-11 21:47:19] [INFO ] After 55ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Finished Parikh walk after 16010 steps, including 0 resets, run visited all 4 properties in 236 ms. (steps per millisecond=67 )
Parikh walk visited 4 properties in 236 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X (OR p2 p1)), (X p1), (X (AND (NOT p2) p1)), (X p0), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (OR p2 p1))), (X (X p1)), (X (X (AND (NOT p2) p1))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (F (G p0)), (F (G (NOT p2))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND p1 (NOT p2)))), (F (AND (NOT p1) (NOT p2))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR p1 p2))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 16 factoid took 772 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter insensitive) to 4 states, 11 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 1435 reset in 112 ms.
Product exploration explored 100000 steps with 1404 reset in 134 ms.
Support contains 5 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2023-03-11 21:47:21] [INFO ] Invariant cache hit.
[2023-03-11 21:47:21] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-11 21:47:21] [INFO ] Invariant cache hit.
[2023-03-11 21:47:21] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2023-03-11 21:47:21] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 21:47:21] [INFO ] Invariant cache hit.
[2023-03-11 21:47:21] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 93 ms. Remains : 8/8 places, 8/8 transitions.
Treatment of property HouseConstruction-PT-16000-LTLCardinality-15 finished in 5818 ms.
[2023-03-11 21:47:21] [INFO ] Flatten gal took : 5 ms
[2023-03-11 21:47:21] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-11 21:47:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 24 places, 18 transitions and 47 arcs took 0 ms.
Total runtime 34562 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT HouseConstruction-PT-16000
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLCardinality

FORMULA HouseConstruction-PT-16000-LTLCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678571263980

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: rewrite Frontend/Parser/formula_rewrite.k:433
lola: rewrite Frontend/Parser/formula_rewrite.k:352
lola: rewrite Frontend/Parser/formula_rewrite.k:376
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 4 (type EXCL) for 3 HouseConstruction-PT-16000-LTLCardinality-15
lola: time limit : 1800 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
HouseConstruction-PT-16000-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0
HouseConstruction-PT-16000-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1800 14/32 HouseConstruction-PT-16000-LTLCardinality-15 1989333 m, 397866 m/sec, 5189474 t fired, .

Time elapsed: 5 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
HouseConstruction-PT-16000-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0
HouseConstruction-PT-16000-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/1800 23/32 HouseConstruction-PT-16000-LTLCardinality-15 3431033 m, 288340 m/sec, 9922578 t fired, .

Time elapsed: 10 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
HouseConstruction-PT-16000-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0
HouseConstruction-PT-16000-LTLCardinality-15: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/1800 32/32 HouseConstruction-PT-16000-LTLCardinality-15 4873875 m, 288568 m/sec, 14664997 t fired, .

Time elapsed: 15 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for HouseConstruction-PT-16000-LTLCardinality-15 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
HouseConstruction-PT-16000-LTLCardinality-14: LTL 0 1 0 0 1 0 0 0
HouseConstruction-PT-16000-LTLCardinality-15: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 20 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 1 (type EXCL) for 0 HouseConstruction-PT-16000-LTLCardinality-14
lola: time limit : 3580 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for HouseConstruction-PT-16000-LTLCardinality-14
lola: result : false
lola: markings : 111999
lola: fired transitions : 143997
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open tasks 2

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
HouseConstruction-PT-16000-LTLCardinality-14: LTL false LTL model checker
HouseConstruction-PT-16000-LTLCardinality-15: LTL unknown AGGR


Time elapsed: 20 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="HouseConstruction-PT-16000"
export BK_EXAMINATION="LTLCardinality"
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 HouseConstruction-PT-16000, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r199-smll-167840346200611"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/HouseConstruction-PT-16000.tgz
mv HouseConstruction-PT-16000 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;