About the Execution of LoLa+red for CloudDeployment-PT-7b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 849.771 | 682197.00 | 757216.00 | 4327.50 | TFT?TFFTFFFFTTFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r071-smll-167814398000451.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 CloudDeployment-PT-7b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r071-smll-167814398000451
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 21M
-rw-r--r-- 1 mcc users 8.7K Feb 25 14:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Feb 25 14:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 15:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 15:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 14:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K Feb 25 14:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 14:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 14:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 20M 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 CloudDeployment-PT-7b-LTLCardinality-00
FORMULA_NAME CloudDeployment-PT-7b-LTLCardinality-01
FORMULA_NAME CloudDeployment-PT-7b-LTLCardinality-02
FORMULA_NAME CloudDeployment-PT-7b-LTLCardinality-03
FORMULA_NAME CloudDeployment-PT-7b-LTLCardinality-04
FORMULA_NAME CloudDeployment-PT-7b-LTLCardinality-05
FORMULA_NAME CloudDeployment-PT-7b-LTLCardinality-06
FORMULA_NAME CloudDeployment-PT-7b-LTLCardinality-07
FORMULA_NAME CloudDeployment-PT-7b-LTLCardinality-08
FORMULA_NAME CloudDeployment-PT-7b-LTLCardinality-09
FORMULA_NAME CloudDeployment-PT-7b-LTLCardinality-10
FORMULA_NAME CloudDeployment-PT-7b-LTLCardinality-11
FORMULA_NAME CloudDeployment-PT-7b-LTLCardinality-12
FORMULA_NAME CloudDeployment-PT-7b-LTLCardinality-13
FORMULA_NAME CloudDeployment-PT-7b-LTLCardinality-14
FORMULA_NAME CloudDeployment-PT-7b-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678291663951
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=CloudDeployment-PT-7b
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-08 16:07:47] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 16:07:47] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 16:07:49] [INFO ] Load time of PNML (sax parser for PT used): 1429 ms
[2023-03-08 16:07:49] [INFO ] Transformed 2271 places.
[2023-03-08 16:07:49] [INFO ] Transformed 19752 transitions.
[2023-03-08 16:07:49] [INFO ] Found NUPN structural information;
[2023-03-08 16:07:49] [INFO ] Parsed PT model containing 2271 places and 19752 transitions and 389666 arcs in 1780 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA CloudDeployment-PT-7b-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-7b-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-7b-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-7b-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-7b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-7b-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-7b-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CloudDeployment-PT-7b-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 2271 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2271/2271 places, 19752/19752 transitions.
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 2263 transition count 19752
Discarding 649 places :
Symmetric choice reduction at 1 with 649 rule applications. Total rules 657 place count 1614 transition count 2734
Iterating global reduction 1 with 649 rules applied. Total rules applied 1306 place count 1614 transition count 2734
Discarding 255 places :
Symmetric choice reduction at 1 with 255 rule applications. Total rules 1561 place count 1359 transition count 2479
Iterating global reduction 1 with 255 rules applied. Total rules applied 1816 place count 1359 transition count 2479
Ensure Unique test removed 37 transitions
Reduce isomorphic transitions removed 37 transitions.
Iterating post reduction 1 with 37 rules applied. Total rules applied 1853 place count 1359 transition count 2442
Discarding 25 places :
Symmetric choice reduction at 2 with 25 rule applications. Total rules 1878 place count 1334 transition count 2417
Iterating global reduction 2 with 25 rules applied. Total rules applied 1903 place count 1334 transition count 2417
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 1906 place count 1331 transition count 2414
Iterating global reduction 2 with 3 rules applied. Total rules applied 1909 place count 1331 transition count 2414
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1911 place count 1329 transition count 2412
Iterating global reduction 2 with 2 rules applied. Total rules applied 1913 place count 1329 transition count 2412
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 1914 place count 1328 transition count 2411
Iterating global reduction 2 with 1 rules applied. Total rules applied 1915 place count 1328 transition count 2411
Applied a total of 1915 rules in 5433 ms. Remains 1328 /2271 variables (removed 943) and now considering 2411/19752 (removed 17341) transitions.
// Phase 1: matrix 2411 rows 1328 cols
[2023-03-08 16:07:55] [INFO ] Computed 21 place invariants in 79 ms
[2023-03-08 16:07:56] [INFO ] Implicit Places using invariants in 976 ms returned []
[2023-03-08 16:07:56] [INFO ] Invariant cache hit.
[2023-03-08 16:07:57] [INFO ] Implicit Places using invariants and state equation in 1318 ms returned []
Implicit Place search using SMT with State Equation took 2337 ms to find 0 implicit places.
[2023-03-08 16:07:57] [INFO ] Invariant cache hit.
[2023-03-08 16:07:59] [INFO ] Dead Transitions using invariants and state equation in 2167 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1328/2271 places, 2411/19752 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9941 ms. Remains : 1328/2271 places, 2411/19752 transitions.
Support contains 34 out of 1328 places after structural reductions.
[2023-03-08 16:08:00] [INFO ] Flatten gal took : 311 ms
[2023-03-08 16:08:00] [INFO ] Flatten gal took : 179 ms
[2023-03-08 16:08:01] [INFO ] Input system was already deterministic with 2411 transitions.
Incomplete random walk after 10000 steps, including 45 resets, run finished after 820 ms. (steps per millisecond=12 ) properties (out of 18) seen :8
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 9) seen :1
Running SMT prover for 8 properties.
[2023-03-08 16:08:02] [INFO ] Invariant cache hit.
[2023-03-08 16:08:03] [INFO ] After 645ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-08 16:08:03] [INFO ] [Nat]Absence check using 0 positive and 21 generalized place invariants in 17 ms returned sat
[2023-03-08 16:08:06] [INFO ] After 2028ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-08 16:08:07] [INFO ] After 3907ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 903 ms.
[2023-03-08 16:08:08] [INFO ] After 5602ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 6 properties in 369 ms.
Support contains 4 out of 1328 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1328/1328 places, 2411/2411 transitions.
Graph (trivial) has 1372 edges and 1328 vertex of which 492 / 1328 are part of one of the 56 SCC in 24 ms
Free SCC test removed 436 places
Drop transitions removed 555 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 556 transitions.
Graph (complete) has 3938 edges and 892 vertex of which 869 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.19 ms
Discarding 23 places :
Also discarding 0 output transitions
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions removed 359 transitions
Trivial Post-agglo rules discarded 359 transitions
Performed 359 trivial Post agglomeration. Transition count delta: 359
Iterating post reduction 0 with 387 rules applied. Total rules applied 389 place count 869 transition count 1468
Reduce places removed 359 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 360 rules applied. Total rules applied 749 place count 510 transition count 1467
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 750 place count 509 transition count 1467
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 75 Pre rules applied. Total rules applied 750 place count 509 transition count 1392
Deduced a syphon composed of 75 places in 2 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 150 rules applied. Total rules applied 900 place count 434 transition count 1392
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 916 place count 418 transition count 1376
Iterating global reduction 3 with 16 rules applied. Total rules applied 932 place count 418 transition count 1376
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 934 place count 418 transition count 1374
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 934 place count 418 transition count 1364
Deduced a syphon composed of 10 places in 3 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 954 place count 408 transition count 1364
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 955 place count 407 transition count 1363
Iterating global reduction 4 with 1 rules applied. Total rules applied 956 place count 407 transition count 1363
Performed 117 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 117 places in 3 ms
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 4 with 234 rules applied. Total rules applied 1190 place count 290 transition count 1244
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1191 place count 290 transition count 1243
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: -321
Deduced a syphon composed of 42 places in 3 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 5 with 84 rules applied. Total rules applied 1275 place count 248 transition count 1564
Drop transitions removed 21 transitions
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 56 transitions.
Iterating post reduction 5 with 56 rules applied. Total rules applied 1331 place count 248 transition count 1508
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -84
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 1345 place count 241 transition count 1592
Drop transitions removed 279 transitions
Redundant transition composition rules discarded 279 transitions
Iterating global reduction 6 with 279 rules applied. Total rules applied 1624 place count 241 transition count 1313
Free-agglomeration rule applied 69 times with reduction of 42 identical transitions.
Iterating global reduction 6 with 69 rules applied. Total rules applied 1693 place count 241 transition count 1202
Reduce places removed 69 places and 0 transitions.
Drop transitions removed 187 transitions
Ensure Unique test removed 84 transitions
Reduce isomorphic transitions removed 271 transitions.
Graph (complete) has 1598 edges and 172 vertex of which 171 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 6 with 341 rules applied. Total rules applied 2034 place count 171 transition count 931
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2035 place count 171 transition count 930
Discarding 5 places :
Symmetric choice reduction at 8 with 5 rule applications. Total rules 2040 place count 166 transition count 890
Iterating global reduction 8 with 5 rules applied. Total rules applied 2045 place count 166 transition count 890
Drop transitions removed 126 transitions
Redundant transition composition rules discarded 126 transitions
Iterating global reduction 8 with 126 rules applied. Total rules applied 2171 place count 166 transition count 764
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 2172 place count 165 transition count 763
Applied a total of 2172 rules in 810 ms. Remains 165 /1328 variables (removed 1163) and now considering 763/2411 (removed 1648) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 810 ms. Remains : 165/1328 places, 763/2411 transitions.
Finished random walk after 1513 steps, including 17 resets, run visited all 2 properties in 20 ms. (steps per millisecond=75 )
Computed a total of 196 stabilizing places and 868 stable transitions
Graph (complete) has 4700 edges and 1328 vertex of which 1305 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.28 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' '!(((p0&&(p1 U G((p2 U X(X(X(p3))))))) U X(G(p4))))'
Support contains 10 out of 1328 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1328/1328 places, 2411/2411 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1315 transition count 2398
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1315 transition count 2398
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 27 place count 1315 transition count 2397
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 29 place count 1313 transition count 2395
Iterating global reduction 1 with 2 rules applied. Total rules applied 31 place count 1313 transition count 2395
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 32 place count 1313 transition count 2394
Applied a total of 32 rules in 346 ms. Remains 1313 /1328 variables (removed 15) and now considering 2394/2411 (removed 17) transitions.
// Phase 1: matrix 2394 rows 1313 cols
[2023-03-08 16:08:10] [INFO ] Computed 21 place invariants in 20 ms
[2023-03-08 16:08:11] [INFO ] Implicit Places using invariants in 619 ms returned []
[2023-03-08 16:08:11] [INFO ] Invariant cache hit.
[2023-03-08 16:08:12] [INFO ] Implicit Places using invariants and state equation in 1003 ms returned []
Implicit Place search using SMT with State Equation took 1625 ms to find 0 implicit places.
[2023-03-08 16:08:12] [INFO ] Invariant cache hit.
[2023-03-08 16:08:15] [INFO ] Dead Transitions using invariants and state equation in 2645 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1313/1328 places, 2394/2411 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4624 ms. Remains : 1313/1328 places, 2394/2411 transitions.
Stuttering acceptance computed with spot in 3205 ms :[(NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), true, (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Running random walk in product with property : CloudDeployment-PT-7b-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p4, acceptance={} source=0 dest: 0}, { cond=(NOT p4), acceptance={} source=0 dest: 8}], [{ cond=(NOT p4), acceptance={} source=1 dest: 9}, { cond=p4, acceptance={} source=1 dest: 10}], [{ cond=(AND (NOT p2) p4), acceptance={} source=2 dest: 1}, { cond=p4, acceptance={} source=2 dest: 2}, { cond=(AND p2 p4), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p2) (NOT p4)), acceptance={} source=2 dest: 12}, { cond=(NOT p4), acceptance={} source=2 dest: 13}, { cond=(AND p2 (NOT p4)), acceptance={} source=2 dest: 14}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p4), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p4)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1), acceptance={} source=3 dest: 5}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=3 dest: 6}, { cond=(AND p0 p2 p1), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p4)), acceptance={} source=4 dest: 15}, { cond=(AND (NOT p1) (NOT p4)), acceptance={} source=4 dest: 16}, { cond=(AND (NOT p2) (NOT p1) p4), acceptance={} source=4 dest: 17}, { cond=(AND (NOT p1) p4), acceptance={} source=4 dest: 18}, { cond=(AND (NOT p2) p1 (NOT p4)), acceptance={} source=4 dest: 19}, { cond=(AND p1 (NOT p4)), acceptance={} source=4 dest: 20}, { cond=(AND (NOT p2) p1 p4), acceptance={} source=4 dest: 21}, { cond=(AND p1 p4), acceptance={} source=4 dest: 22}, { cond=(AND p2 (NOT p1) (NOT p4)), acceptance={} source=4 dest: 23}, { cond=(AND p2 (NOT p1) p4), acceptance={} source=4 dest: 24}, { cond=(AND p2 p1 (NOT p4)), acceptance={} source=4 dest: 25}, { cond=(AND p2 p1 p4), acceptance={} source=4 dest: 26}], [{ cond=(AND (NOT p2) (NOT p1) p4), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) p4), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p1 p4), acceptance={} source=5 dest: 4}, { cond=(AND p1 p4), acceptance={} source=5 dest: 5}, { cond=(AND p2 (NOT p1) p4), acceptance={} source=5 dest: 6}, { cond=(AND p2 p1 p4), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p2) (NOT p1) (NOT p4)), acceptance={} source=5 dest: 12}, { cond=(AND (NOT p1) (NOT p4)), acceptance={} source=5 dest: 13}, { cond=(AND p2 (NOT p1) (NOT p4)), acceptance={} source=5 dest: 14}, { cond=(AND (NOT p2) p1 (NOT p4)), acceptance={} source=5 dest: 27}, { cond=(AND p1 (NOT p4)), acceptance={} source=5 dest: 28}, { cond=(AND p2 p1 (NOT p4)), acceptance={} source=5 dest: 29}], [{ cond=(AND (NOT p2) (NOT p4)), acceptance={} source=6 dest: 15}, { cond=(AND (NOT p2) p4), acceptance={} source=6 dest: 17}, { cond=(AND p2 (NOT p4)), acceptance={} source=6 dest: 23}, { cond=(AND p2 p4), acceptance={} source=6 dest: 24}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p4)), acceptance={} source=7 dest: 15}, { cond=(AND (NOT p2) (NOT p1) p4), acceptance={} source=7 dest: 17}, { cond=(AND (NOT p2) p1 (NOT p4)), acceptance={} source=7 dest: 19}, { cond=(AND (NOT p2) p1 p4), acceptance={} source=7 dest: 21}, { cond=(AND p2 (NOT p1) (NOT p4)), acceptance={} source=7 dest: 23}, { cond=(AND p2 (NOT p1) p4), acceptance={} source=7 dest: 24}, { cond=(AND p2 p1 (NOT p4)), acceptance={} source=7 dest: 25}, { cond=(AND p2 p1 p4), acceptance={} source=7 dest: 26}], [{ cond=true, acceptance={0} source=8 dest: 8}], [{ cond=true, acceptance={} source=9 dest: 11}], [{ cond=(NOT p4), acceptance={} source=10 dest: 11}, { cond=p4, acceptance={} source=10 dest: 30}], [{ cond=(NOT p3), acceptance={} source=11 dest: 8}], [{ cond=true, acceptance={} source=12 dest: 9}], [{ cond=(NOT p2), acceptance={} source=13 dest: 12}, { cond=true, acceptance={} source=13 dest: 13}, { cond=p2, acceptance={} source=13 dest: 14}], [{ cond=(NOT p2), acceptance={} source=14 dest: 15}, { cond=p2, acceptance={} source=14 dest: 23}], [{ cond=true, acceptance={} source=15 dest: 31}], [{ cond=(NOT p2), acceptance={} source=16 dest: 32}, { cond=true, acceptance={} source=16 dest: 33}, { cond=p2, acceptance={} source=16 dest: 34}], [{ cond=(NOT p4), acceptance={} source=17 dest: 31}], [{ cond=(AND (NOT p2) (NOT p4)), acceptance={} source=18 dest: 32}, { cond=(NOT p4), acceptance={} source=18 dest: 33}, { cond=(AND p2 (NOT p4)), acceptance={} source=18 dest: 34}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=19 dest: 35}, { cond=(NOT p1), acceptance={} source=19 dest: 36}, { cond=(AND (NOT p2) p1), acceptance={0} source=19 dest: 37}, { cond=p1, acceptance={} source=19 dest: 38}, { cond=(AND p2 (NOT p1)), acceptance={} source=19 dest: 39}, { cond=(AND p2 p1), acceptance={0} source=19 dest: 40}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=20 dest: 32}, { cond=(NOT p1), acceptance={} source=20 dest: 33}, { cond=(AND p2 (NOT p1)), acceptance={} source=20 dest: 34}, { cond=(AND (NOT p2) p1), acceptance={0} source=20 dest: 41}, { cond=p1, acceptance={} source=20 dest: 42}, { cond=(AND p2 p1), acceptance={0} source=20 dest: 43}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p4)), acceptance={} source=21 dest: 35}, { cond=(AND (NOT p1) (NOT p4)), acceptance={} source=21 dest: 36}, { cond=(AND (NOT p2) p1 (NOT p4)), acceptance={} source=21 dest: 37}, { cond=(AND p1 (NOT p4)), acceptance={} source=21 dest: 38}, { cond=(AND p2 (NOT p1) (NOT p4)), acceptance={} source=21 dest: 39}, { cond=(AND p2 p1 (NOT p4)), acceptance={} source=21 dest: 40}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p4)), acceptance={} source=22 dest: 32}, { cond=(AND (NOT p1) (NOT p4)), acceptance={} source=22 dest: 33}, { cond=(AND p2 (NOT p1) (NOT p4)), acceptance={} source=22 dest: 34}, { cond=(AND (NOT p2) p1 (NOT p4)), acceptance={} source=22 dest: 41}, { cond=(AND p1 (NOT p4)), acceptance={} source=22 dest: 42}, { cond=(AND p2 p1 (NOT p4)), acceptance={} source=22 dest: 43}], [{ cond=(NOT p2), acceptance={} source=23 dest: 35}, { cond=p2, acceptance={} source=23 dest: 39}], [{ cond=(AND (NOT p2) (NOT p4)), acceptance={} source=24 dest: 35}, { cond=(AND p2 (NOT p4)), acceptance={} source=24 dest: 39}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=25 dest: 35}, { cond=(AND (NOT p2) p1), acceptance={0} source=25 dest: 37}, { cond=(AND p2 (NOT p1)), acceptance={} source=25 dest: 39}, { cond=(AND p2 p1), acceptance={0} source=25 dest: 40}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p4)), acceptance={} source=26 dest: 35}, { cond=(AND (NOT p2) p1 (NOT p4)), acceptance={} source=26 dest: 37}, { cond=(AND p2 (NOT p1) (NOT p4)), acceptance={} source=26 dest: 39}, { cond=(AND p2 p1 (NOT p4)), acceptance={} source=26 dest: 40}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=27 dest: 15}, { cond=(NOT p1), acceptance={} source=27 dest: 16}, { cond=(AND (NOT p2) p1), acceptance={0} source=27 dest: 19}, { cond=p1, acceptance={} source=27 dest: 20}, { cond=(AND p2 (NOT p1)), acceptance={} source=27 dest: 23}, { cond=(AND p2 p1), acceptance={0} source=27 dest: 25}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=28 dest: 12}, { cond=(NOT p1), acceptance={} source=28 dest: 13}, { cond=(AND p2 (NOT p1)), acceptance={} source=28 dest: 14}, { cond=(AND (NOT p2) p1), acceptance={0} source=28 dest: 27}, { cond=p1, acceptance={} source=28 dest: 28}, { cond=(AND p2 p1), acceptance={0} source=28 dest: 29}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=29 dest: 15}, { cond=(AND (NOT p2) p1), acceptance={0} source=29 dest: 19}, { cond=(AND p2 (NOT p1)), acceptance={} source=29 dest: 23}, { cond=(AND p2 p1), acceptance={0} source=29 dest: 25}], [{ cond=(AND p4 (NOT p3)), acceptance={} source=30 dest: 0}, { cond=(AND (NOT p4) (NOT p3)), acceptance={} source=30 dest: 8}], [{ cond=(NOT p3), acceptance={} source=31 dest: 11}], [{ cond=(NOT p3), acceptance={} source=32 dest: 9}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=33 dest: 12}, { cond=(NOT p3), acceptance={} source=33 dest: 13}, { cond=(AND p2 (NOT p3)), acceptance={} source=33 dest: 14}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=34 dest: 15}, { cond=(AND p2 (NOT p3)), acceptance={} source=34 dest: 23}], [{ cond=(NOT p3), acceptance={} source=35 dest: 31}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=36 dest: 32}, { cond=(NOT p3), acceptance={} source=36 dest: 33}, { cond=(AND p2 (NOT p3)), acceptance={} source=36 dest: 34}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=37 dest: 35}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=37 dest: 36}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=37 dest: 37}, { cond=(AND p1 (NOT p3)), acceptance={} source=37 dest: 38}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=37 dest: 39}, { cond=(AND p2 p1 (NOT p3)), acceptance={0} source=37 dest: 40}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=38 dest: 32}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=38 dest: 33}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=38 dest: 34}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=38 dest: 41}, { cond=(AND p1 (NOT p3)), acceptance={} source=38 dest: 42}, { cond=(AND p2 p1 (NOT p3)), acceptance={0} source=38 dest: 43}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={} source=39 dest: 35}, { cond=(AND p2 (NOT p3)), acceptance={0} source=39 dest: 39}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=40 dest: 35}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=40 dest: 37}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=40 dest: 39}, { cond=(AND p2 p1 (NOT p3)), acceptance={0} source=40 dest: 40}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=41 dest: 15}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=41 dest: 16}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=41 dest: 19}, { cond=(AND p1 (NOT p3)), acceptance={} source=41 dest: 20}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=41 dest: 23}, { cond=(AND p2 p1 (NOT p3)), acceptance={0} source=41 dest: 25}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=42 dest: 12}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=42 dest: 13}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=42 dest: 14}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=42 dest: 27}, { cond=(AND p1 (NOT p3)), acceptance={} source=42 dest: 28}, { cond=(AND p2 p1 (NOT p3)), acceptance={0} source=42 dest: 29}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=43 dest: 15}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=43 dest: 19}, { cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=43 dest: 23}, { cond=(AND p2 p1 (NOT p3)), acceptance={0} source=43 dest: 25}]], initial=3, aps=[p4:(OR (EQ s926 0) (EQ s1239 1)), p2:(OR (EQ s28 0) (EQ s1132 1)), p0:(OR (EQ s1100 0) (EQ s270 1)), p1:(OR (EQ s191 0) (EQ s1059 1)), p3:(OR (EQ s288 0) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 22153 reset in 1665 ms.
Product exploration explored 100000 steps with 22227 reset in 1188 ms.
Computed a total of 193 stabilizing places and 865 stable transitions
Graph (complete) has 4665 edges and 1313 vertex of which 1290 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.17 ms
Computed a total of 193 stabilizing places and 865 stable transitions
Knowledge obtained : [(AND p4 p2 p0 p1 p3), (X p0), (X (NOT (AND (NOT p2) p1 p4))), (X p4), (X (AND p2 p1 p4)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p4)))), (X (NOT (AND (NOT p2) (NOT p4)))), (X (NOT (AND p2 p1 (NOT p4)))), (X (NOT (AND p1 (NOT p4)))), (X (NOT (AND (NOT p1) (NOT p4)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p4)))), (X (AND p1 p4)), (X (NOT (AND (NOT p2) p4))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p4)))), (X (NOT (AND (NOT p2) (NOT p1) p4))), (X (NOT (AND p2 (NOT p1) p4))), (X (AND p2 p4)), (X (AND p0 p4)), (X (NOT (AND (NOT p2) p1 (NOT p4)))), (X (AND p0 p2 p1)), (X (NOT (AND (NOT p1) p4))), (X (NOT (AND p2 (NOT p1) (NOT p4)))), (X (X p0)), (X (X (NOT (AND (NOT p2) p1 p4)))), (X (X p4)), (X (X (AND p2 p1))), (X (X (AND p2 p1 p4))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p4))))), (X (X (NOT (AND (NOT p2) (NOT p4))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p1 (NOT p4))))), true, (X (X (NOT (AND p1 (NOT p4))))), (X (X (NOT (AND (NOT p1) (NOT p4))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p4))))), (X (X (AND p1 p4))), (X (X (NOT (AND (NOT p2) p4)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND p0 (NOT p4))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1) p4)))), (X (X (NOT (AND p2 (NOT p1) p4)))), (X (X (AND p2 p4))), (X (X p2)), (X (X (AND p0 p4))), (X (X (NOT (AND (NOT p2) p1 (NOT p4))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND (NOT p1) p4)))), (X (X (NOT (AND p2 (NOT p1) (NOT p4)))))]
False Knowledge obtained : []
Knowledge based reduction with 60 factoid took 95195 ms. Reduced automaton from 44 states, 173 edges and 5 AP (stutter sensitive) to 44 states, 173 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 2426 ms :[(NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), true, (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Incomplete random walk after 10000 steps, including 44 resets, run finished after 501 ms. (steps per millisecond=19 ) properties (out of 43) seen :9
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 34) 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 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 34) 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 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) 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 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 34) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 34) seen :0
Running SMT prover for 34 properties.
[2023-03-08 16:09:59] [INFO ] Invariant cache hit.
[2023-03-08 16:10:01] [INFO ] After 1526ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:34
[2023-03-08 16:10:02] [INFO ] [Nat]Absence check using 0 positive and 21 generalized place invariants in 13 ms returned sat
[2023-03-08 16:10:08] [INFO ] After 5624ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :34
[2023-03-08 16:10:15] [INFO ] After 12298ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :34
Attempting to minimize the solution found.
Minimization took 3225 ms.
[2023-03-08 16:10:18] [INFO ] After 17327ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :34
Fused 34 Parikh solutions to 30 different solutions.
Finished Parikh walk after 1074 steps, including 3 resets, run visited all 1 properties in 5 ms. (steps per millisecond=214 )
Parikh walk visited 34 properties in 323 ms.
Knowledge obtained : [(AND p4 p2 p0 p1 p3), (X p0), (X (NOT (AND (NOT p2) p1 p4))), (X p4), (X (AND p2 p1 p4)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p4)))), (X (NOT (AND (NOT p2) (NOT p4)))), (X (NOT (AND p2 p1 (NOT p4)))), (X (NOT (AND p1 (NOT p4)))), (X (NOT (AND (NOT p1) (NOT p4)))), (X (NOT (AND p0 p2 (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p4)))), (X (AND p1 p4)), (X (NOT (AND (NOT p2) p4))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p4)))), (X (NOT (AND (NOT p2) (NOT p1) p4))), (X (NOT (AND p2 (NOT p1) p4))), (X (AND p2 p4)), (X (AND p0 p4)), (X (NOT (AND (NOT p2) p1 (NOT p4)))), (X (AND p0 p2 p1)), (X (NOT (AND (NOT p1) p4))), (X (NOT (AND p2 (NOT p1) (NOT p4)))), (X (X p0)), (X (X (NOT (AND (NOT p2) p1 p4)))), (X (X p4)), (X (X (AND p2 p1))), (X (X (AND p2 p1 p4))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p2 (NOT p4))))), (X (X (NOT (AND (NOT p2) (NOT p4))))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 p1 (NOT p4))))), true, (X (X (NOT (AND p1 (NOT p4))))), (X (X (NOT (AND (NOT p1) (NOT p4))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p4))))), (X (X (AND p1 p4))), (X (X (NOT (AND (NOT p2) p4)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND p0 (NOT p4))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1) p4)))), (X (X (NOT (AND p2 (NOT p1) p4)))), (X (X (AND p2 p4))), (X (X p2)), (X (X (AND p0 p4))), (X (X (NOT (AND (NOT p2) p1 (NOT p4))))), (X (X (AND p0 p2 p1))), (X (X (NOT (AND (NOT p1) p4)))), (X (X (NOT (AND p2 (NOT p1) (NOT p4)))))]
False Knowledge obtained : [(F (NOT p3)), (F (AND p2 (NOT p4))), (F (NOT (AND p1 p2 p4))), (F (AND (NOT p2) (NOT p4))), (F (AND (NOT p1) (NOT p2) p0)), (F (AND p1 p2 (NOT p4))), (F (AND (NOT p1) p2 p4)), (F (NOT p0)), (F (NOT p4)), (F (NOT p1)), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND p2 p4))), (F (AND (NOT p2) p4)), (F (NOT p2)), (F (AND p1 (NOT p3))), (F (AND (NOT p1) p2 (NOT p4))), (F (NOT (AND p1 p4))), (F (AND p1 p2 (NOT p3))), (F (AND p1 (NOT p2) p4)), (F (AND (NOT p1) p2 (NOT p3))), (F (NOT (AND p4 p0))), (F (AND (NOT p1) p0)), (F (AND (NOT p4) p0)), (F (AND (NOT p1) (NOT p2) (NOT p3))), (F (AND (NOT p1) (NOT p4))), (F (AND p2 (NOT p3))), (F (AND (NOT p1) (NOT p2) (NOT p4))), (F (NOT (AND p1 p2 p0))), (F (AND (NOT p2) (NOT p3))), (F (AND (NOT p1) p2 p0)), (F (AND (NOT p4) (NOT p3))), (F (AND p1 (NOT p4))), (F (AND p1 (NOT p2) (NOT p4))), (F (AND p1 (NOT p2) (NOT p3))), (F (AND (NOT p1) p4)), (F (AND (NOT p1) (NOT p3))), (F (AND (NOT p1) (NOT p2) p4)), (F (AND p4 (NOT p3))), (F (NOT (AND p1 p0))), (F (AND p1 (NOT p2) p0)), (F (NOT (AND p1 p2))), (F (AND (NOT p1) p2)), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 60 factoid took 99898 ms. Reduced automaton from 44 states, 173 edges and 5 AP (stutter sensitive) to 44 states, 173 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 2534 ms :[(NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), true, (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 2837 ms :[(NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), true, (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Support contains 10 out of 1313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1313/1313 places, 2394/2394 transitions.
Applied a total of 0 rules in 83 ms. Remains 1313 /1313 variables (removed 0) and now considering 2394/2394 (removed 0) transitions.
[2023-03-08 16:12:04] [INFO ] Invariant cache hit.
[2023-03-08 16:12:05] [INFO ] Implicit Places using invariants in 693 ms returned []
[2023-03-08 16:12:05] [INFO ] Invariant cache hit.
[2023-03-08 16:12:06] [INFO ] Implicit Places using invariants and state equation in 1197 ms returned []
Implicit Place search using SMT with State Equation took 1893 ms to find 0 implicit places.
[2023-03-08 16:12:06] [INFO ] Invariant cache hit.
[2023-03-08 16:12:08] [INFO ] Dead Transitions using invariants and state equation in 1740 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3721 ms. Remains : 1313/1313 places, 2394/2394 transitions.
Computed a total of 193 stabilizing places and 865 stable transitions
Graph (complete) has 4665 edges and 1313 vertex of which 1290 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.14 ms
Computed a total of 193 stabilizing places and 865 stable transitions
Knowledge obtained : [(AND p4 p2 p0 p1 p3), (X p0), (X p4), (X (AND p1 p2 p0)), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND p1 p2 (NOT p4)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p2 (NOT p4)))), (X (NOT (AND (NOT p2) (NOT p4)))), (X (NOT (AND p1 (NOT p2) (NOT p4)))), (X (NOT (AND (NOT p1) (NOT p2) p4))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 (NOT p4)))), (X (NOT (AND (NOT p1) p2 (NOT p4)))), (X (AND p1 p2 p4)), (X (NOT (AND (NOT p1) (NOT p4)))), (X (AND p4 p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (AND p1 p4)), (X (NOT (AND (NOT p2) p4))), (X (NOT (AND (NOT p1) p2 p4))), (X (AND p2 p4)), (X (AND p1 p0)), (X (NOT (AND (NOT p4) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p4)))), (X (NOT (AND (NOT p1) p4))), (X (NOT (AND p1 (NOT p2) p4))), (X (X p0)), (X (X p4)), (X (X (AND p1 p2 p0))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 p2 (NOT p4))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p2 (NOT p4))))), (X (X (NOT (AND (NOT p2) (NOT p4))))), (X (X (NOT (AND p1 (NOT p2) (NOT p4))))), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p1) (NOT p2) p4)))), true, (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p4))))), (X (X (NOT (AND (NOT p1) p2 (NOT p4))))), (X (X (AND p1 p2 p4))), (X (X (NOT (AND (NOT p1) (NOT p4))))), (X (X (AND p4 p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND p1 p4))), (X (X (NOT (AND (NOT p2) p4)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2 p4)))), (X (X p1)), (X (X (AND p2 p4))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p2)), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p4) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p4))))), (X (X (NOT (AND (NOT p1) p4)))), (X (X (NOT (AND p1 (NOT p2) p4))))]
False Knowledge obtained : []
Knowledge based reduction with 60 factoid took 93830 ms. Reduced automaton from 44 states, 173 edges and 5 AP (stutter sensitive) to 44 states, 173 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 2674 ms :[(NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), true, (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Incomplete random walk after 10000 steps, including 44 resets, run finished after 537 ms. (steps per millisecond=18 ) properties (out of 43) seen :14
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :0
Running SMT prover for 29 properties.
[2023-03-08 16:13:45] [INFO ] Invariant cache hit.
[2023-03-08 16:13:46] [INFO ] After 1045ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:29
[2023-03-08 16:13:47] [INFO ] [Nat]Absence check using 0 positive and 21 generalized place invariants in 23 ms returned sat
[2023-03-08 16:13:53] [INFO ] After 4490ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :29
[2023-03-08 16:13:58] [INFO ] After 10072ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :29
Attempting to minimize the solution found.
Minimization took 2776 ms.
[2023-03-08 16:14:01] [INFO ] After 15253ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :29
Fused 29 Parikh solutions to 27 different solutions.
Parikh walk visited 27 properties in 657 ms.
Support contains 8 out of 1313 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1313/1313 places, 2394/2394 transitions.
Graph (trivial) has 1351 edges and 1313 vertex of which 490 / 1313 are part of one of the 55 SCC in 4 ms
Free SCC test removed 435 places
Drop transitions removed 555 transitions
Reduce isomorphic transitions removed 555 transitions.
Graph (complete) has 3906 edges and 878 vertex of which 855 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.3 ms
Discarding 23 places :
Also discarding 0 output transitions
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 378 rules applied. Total rules applied 380 place count 855 transition count 1461
Reduce places removed 350 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 352 rules applied. Total rules applied 732 place count 505 transition count 1459
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 734 place count 503 transition count 1459
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 75 Pre rules applied. Total rules applied 734 place count 503 transition count 1384
Deduced a syphon composed of 75 places in 1 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 150 rules applied. Total rules applied 884 place count 428 transition count 1384
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 892 place count 420 transition count 1376
Iterating global reduction 3 with 8 rules applied. Total rules applied 900 place count 420 transition count 1376
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 900 place count 420 transition count 1369
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 914 place count 413 transition count 1369
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Deduced a syphon composed of 116 places in 1 ms
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 3 with 232 rules applied. Total rules applied 1146 place count 297 transition count 1253
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: -322
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 1230 place count 255 transition count 1575
Drop transitions removed 20 transitions
Ensure Unique test removed 35 transitions
Reduce isomorphic transitions removed 55 transitions.
Iterating post reduction 3 with 55 rules applied. Total rules applied 1285 place count 255 transition count 1520
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -84
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 1299 place count 248 transition count 1604
Drop transitions removed 280 transitions
Redundant transition composition rules discarded 280 transitions
Iterating global reduction 4 with 280 rules applied. Total rules applied 1579 place count 248 transition count 1324
Free-agglomeration rule applied 70 times with reduction of 35 identical transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 1649 place count 248 transition count 1219
Reduce places removed 70 places and 0 transitions.
Drop transitions removed 180 transitions
Ensure Unique test removed 91 transitions
Reduce isomorphic transitions removed 271 transitions.
Graph (complete) has 1621 edges and 178 vertex of which 177 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 342 rules applied. Total rules applied 1991 place count 177 transition count 948
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1992 place count 177 transition count 947
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 1998 place count 171 transition count 899
Iterating global reduction 6 with 6 rules applied. Total rules applied 2004 place count 171 transition count 899
Drop transitions removed 147 transitions
Redundant transition composition rules discarded 147 transitions
Iterating global reduction 6 with 147 rules applied. Total rules applied 2151 place count 171 transition count 752
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2152 place count 170 transition count 751
Applied a total of 2152 rules in 297 ms. Remains 170 /1313 variables (removed 1143) and now considering 751/2394 (removed 1643) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 297 ms. Remains : 170/1313 places, 751/2394 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 354391 steps, run timeout after 3002 ms. (steps per millisecond=118 ) properties seen :{}
Probabilistic random walk after 354391 steps, saw 50522 distinct states, run finished after 3004 ms. (steps per millisecond=117 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-08 16:14:05] [INFO ] Flow matrix only has 352 transitions (discarded 399 similar events)
// Phase 1: matrix 352 rows 170 cols
[2023-03-08 16:14:05] [INFO ] Computed 27 place invariants in 5 ms
[2023-03-08 16:14:05] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 16:14:06] [INFO ] [Nat]Absence check using 7 positive place invariants in 4 ms returned sat
[2023-03-08 16:14:06] [INFO ] [Nat]Absence check using 7 positive and 20 generalized place invariants in 12 ms returned sat
[2023-03-08 16:14:06] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 16:14:06] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 16:14:06] [INFO ] After 46ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 16:14:06] [INFO ] After 95ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-03-08 16:14:06] [INFO ] After 351ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 8 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 751/751 transitions.
Applied a total of 0 rules in 16 ms. Remains 170 /170 variables (removed 0) and now considering 751/751 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 170/170 places, 751/751 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 751/751 transitions.
Applied a total of 0 rules in 16 ms. Remains 170 /170 variables (removed 0) and now considering 751/751 (removed 0) transitions.
[2023-03-08 16:14:06] [INFO ] Flow matrix only has 352 transitions (discarded 399 similar events)
[2023-03-08 16:14:06] [INFO ] Invariant cache hit.
[2023-03-08 16:14:06] [INFO ] Implicit Places using invariants in 247 ms returned []
[2023-03-08 16:14:06] [INFO ] Flow matrix only has 352 transitions (discarded 399 similar events)
[2023-03-08 16:14:06] [INFO ] Invariant cache hit.
[2023-03-08 16:14:06] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-08 16:14:07] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 752 ms to find 0 implicit places.
[2023-03-08 16:14:07] [INFO ] Redundant transitions in 55 ms returned []
[2023-03-08 16:14:07] [INFO ] Flow matrix only has 352 transitions (discarded 399 similar events)
[2023-03-08 16:14:07] [INFO ] Invariant cache hit.
[2023-03-08 16:14:07] [INFO ] Dead Transitions using invariants and state equation in 713 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1546 ms. Remains : 170/170 places, 751/751 transitions.
Graph (trivial) has 165 edges and 170 vertex of which 47 / 170 are part of one of the 6 SCC in 0 ms
Free SCC test removed 41 places
Drop transitions removed 65 transitions
Ensure Unique test removed 399 transitions
Reduce isomorphic transitions removed 464 transitions.
Graph (complete) has 425 edges and 129 vertex of which 118 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 0 output transitions
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 28 place count 118 transition count 261
Reduce places removed 26 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 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 1 with 28 rules applied. Total rules applied 56 place count 92 transition count 259
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 58 place count 91 transition count 258
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 59 place count 90 transition count 258
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 59 place count 90 transition count 245
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 85 place count 77 transition count 245
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 90 place count 72 transition count 240
Iterating global reduction 4 with 5 rules applied. Total rules applied 95 place count 72 transition count 240
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 100 place count 67 transition count 205
Iterating global reduction 4 with 5 rules applied. Total rules applied 105 place count 67 transition count 205
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 50 transitions.
Iterating post reduction 4 with 50 rules applied. Total rules applied 155 place count 67 transition count 155
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 20 rules applied. Total rules applied 175 place count 57 transition count 145
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 190 place count 57 transition count 130
Performed 8 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 16 rules applied. Total rules applied 206 place count 49 transition count 181
Drop transitions removed 69 transitions
Redundant transition composition rules discarded 69 transitions
Iterating global reduction 6 with 69 rules applied. Total rules applied 275 place count 49 transition count 112
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 287 place count 41 transition count 108
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 6 with 27 rules applied. Total rules applied 314 place count 41 transition count 81
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 316 place count 40 transition count 89
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 7 with 19 rules applied. Total rules applied 335 place count 40 transition count 70
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 337 place count 40 transition count 68
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 339 place count 38 transition count 68
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 8 with 10 rules applied. Total rules applied 349 place count 38 transition count 68
Applied a total of 349 rules in 49 ms. Remains 38 /170 variables (removed 132) and now considering 68/751 (removed 683) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 68 rows 38 cols
[2023-03-08 16:14:07] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-08 16:14:07] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 16:14:08] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-03-08 16:14:08] [INFO ] After 50ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 16:14:08] [INFO ] After 71ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-08 16:14:08] [INFO ] After 140ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p4 p2 p0 p1 p3), (X p0), (X p4), (X (AND p1 p2 p0)), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND p1 p2 (NOT p4)))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p2 (NOT p4)))), (X (NOT (AND (NOT p2) (NOT p4)))), (X (NOT (AND p1 (NOT p2) (NOT p4)))), (X (NOT (AND (NOT p1) (NOT p2) p4))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT (AND p1 (NOT p4)))), (X (NOT (AND (NOT p1) p2 (NOT p4)))), (X (AND p1 p2 p4)), (X (NOT (AND (NOT p1) (NOT p4)))), (X (AND p4 p0)), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (AND p1 p4)), (X (NOT (AND (NOT p2) p4))), (X (NOT (AND (NOT p1) p2 p4))), (X (AND p2 p4)), (X (AND p1 p0)), (X (NOT (AND (NOT p4) p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p4)))), (X (NOT (AND (NOT p1) p4))), (X (NOT (AND p1 (NOT p2) p4))), (X (X p0)), (X (X p4)), (X (X (AND p1 p2 p0))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND p1 p2 (NOT p4))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND p2 (NOT p4))))), (X (X (NOT (AND (NOT p2) (NOT p4))))), (X (X (NOT (AND p1 (NOT p2) (NOT p4))))), (X (X (AND p1 p2))), (X (X (NOT (AND (NOT p1) (NOT p2) p4)))), true, (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p4))))), (X (X (NOT (AND (NOT p1) p2 (NOT p4))))), (X (X (AND p1 p2 p4))), (X (X (NOT (AND (NOT p1) (NOT p4))))), (X (X (AND p4 p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (AND p1 p4))), (X (X (NOT (AND (NOT p2) p4)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2 p4)))), (X (X p1)), (X (X (AND p2 p4))), (X (X (NOT (AND (NOT p1) p2)))), (X (X p2)), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p4) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p4))))), (X (X (NOT (AND (NOT p1) p4)))), (X (X (NOT (AND p1 (NOT p2) p4))))]
False Knowledge obtained : [(F (NOT p3)), (F (AND p2 (NOT p4))), (F (NOT (AND p1 p2 p4))), (F (AND (NOT p2) (NOT p4))), (F (AND (NOT p1) (NOT p2) p0)), (F (AND p1 p2 (NOT p4))), (F (AND (NOT p1) p2 p4)), (F (NOT p0)), (F (NOT p4)), (F (NOT p1)), (F (AND (NOT p1) (NOT p2))), (F (NOT (AND p2 p4))), (F (AND (NOT p2) p4)), (F (NOT p2)), (F (AND p1 (NOT p3))), (F (AND (NOT p1) p2 (NOT p4))), (F (NOT (AND p1 p4))), (F (AND p1 p2 (NOT p3))), (F (AND p1 (NOT p2) p4)), (F (NOT (AND p4 p0))), (F (AND (NOT p1) p0)), (F (AND (NOT p4) p0)), (F (AND (NOT p1) (NOT p2) (NOT p3))), (F (AND (NOT p1) (NOT p4))), (F (AND p2 (NOT p3))), (F (AND (NOT p1) (NOT p2) (NOT p4))), (F (NOT (AND p1 p2 p0))), (F (AND (NOT p2) (NOT p3))), (F (AND (NOT p1) p2 p0)), (F (AND p1 (NOT p4))), (F (AND p1 (NOT p2) (NOT p4))), (F (AND (NOT p1) p4)), (F (AND p1 (NOT p2) (NOT p3))), (F (AND (NOT p1) (NOT p2) p4)), (F (AND (NOT p1) (NOT p3))), (F (AND p4 (NOT p3))), (F (NOT (AND p1 p0))), (F (AND p1 (NOT p2) p0)), (F (NOT (AND p1 p2))), (F (AND (NOT p1) p2)), (F (AND p1 (NOT p2)))]
Knowledge based reduction with 60 factoid took 101680 ms. Reduced automaton from 44 states, 173 edges and 5 AP (stutter sensitive) to 44 states, 173 edges and 5 AP (stutter sensitive).
Stuttering acceptance computed with spot in 2560 ms :[(NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), true, (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 2769 ms :[(NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), true, (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Stuttering acceptance computed with spot in 2614 ms :[(NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), true, (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Product exploration explored 100000 steps with 22291 reset in 1232 ms.
Product exploration explored 100000 steps with 22208 reset in 970 ms.
Applying partial POR strategy [true, false, false, false, false, false, false, false, true, false, false, true, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, true, false, false, false, false, false, false, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 2372 ms :[(NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p4), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), true, (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (AND (NOT p3) (NOT p4)), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (AND (NOT p3) (NOT p4)), (NOT p3), (NOT p3), (NOT p3), (AND (NOT p4) (NOT p3)), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3), (NOT p3)]
Support contains 10 out of 1313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1313/1313 places, 2394/2394 transitions.
Graph (trivial) has 1347 edges and 1313 vertex of which 485 / 1313 are part of one of the 55 SCC in 3 ms
Free SCC test removed 430 places
Ensure Unique test removed 492 transitions
Reduce isomorphic transitions removed 492 transitions.
Graph (complete) has 4086 edges and 883 vertex of which 860 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.9 ms
Discarding 23 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 346 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 346 rules applied. Total rules applied 348 place count 860 transition count 1900
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 49 Pre rules applied. Total rules applied 348 place count 860 transition count 1942
Deduced a syphon composed of 395 places in 3 ms
Iterating global reduction 1 with 49 rules applied. Total rules applied 397 place count 860 transition count 1942
Discarding 184 places :
Symmetric choice reduction at 1 with 184 rule applications. Total rules 581 place count 676 transition count 1758
Deduced a syphon composed of 211 places in 3 ms
Iterating global reduction 1 with 184 rules applied. Total rules applied 765 place count 676 transition count 1758
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 355 places in 1 ms
Iterating global reduction 1 with 144 rules applied. Total rules applied 909 place count 676 transition count 1758
Discarding 108 places :
Symmetric choice reduction at 1 with 108 rule applications. Total rules 1017 place count 568 transition count 1650
Deduced a syphon composed of 247 places in 1 ms
Iterating global reduction 1 with 108 rules applied. Total rules applied 1125 place count 568 transition count 1650
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: -314
Deduced a syphon composed of 291 places in 1 ms
Iterating global reduction 1 with 44 rules applied. Total rules applied 1169 place count 568 transition count 1964
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 1176 place count 568 transition count 1957
Discarding 53 places :
Symmetric choice reduction at 2 with 53 rule applications. Total rules 1229 place count 515 transition count 1788
Deduced a syphon composed of 238 places in 1 ms
Iterating global reduction 2 with 53 rules applied. Total rules applied 1282 place count 515 transition count 1788
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -98
Deduced a syphon composed of 245 places in 1 ms
Iterating global reduction 2 with 7 rules applied. Total rules applied 1289 place count 515 transition count 1886
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1296 place count 508 transition count 1872
Deduced a syphon composed of 238 places in 1 ms
Iterating global reduction 2 with 7 rules applied. Total rules applied 1303 place count 508 transition count 1872
Deduced a syphon composed of 238 places in 1 ms
Drop transitions removed 113 transitions
Redundant transition composition rules discarded 113 transitions
Iterating global reduction 2 with 113 rules applied. Total rules applied 1416 place count 508 transition count 1759
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1430 place count 494 transition count 1745
Deduced a syphon composed of 224 places in 1 ms
Iterating global reduction 2 with 14 rules applied. Total rules applied 1444 place count 494 transition count 1745
Deduced a syphon composed of 224 places in 1 ms
Applied a total of 1444 rules in 689 ms. Remains 494 /1313 variables (removed 819) and now considering 1745/2394 (removed 649) transitions.
[2023-03-08 16:16:06] [INFO ] Redundant transitions in 2210 ms returned []
[2023-03-08 16:16:06] [INFO ] Flow matrix only has 1439 transitions (discarded 306 similar events)
// Phase 1: matrix 1439 rows 494 cols
[2023-03-08 16:16:06] [INFO ] Computed 7 place invariants in 12 ms
[2023-03-08 16:16:07] [INFO ] Dead Transitions using invariants and state equation in 986 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 494/1313 places, 1745/2394 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3899 ms. Remains : 494/1313 places, 1745/2394 transitions.
Support contains 10 out of 1313 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1313/1313 places, 2394/2394 transitions.
Applied a total of 0 rules in 46 ms. Remains 1313 /1313 variables (removed 0) and now considering 2394/2394 (removed 0) transitions.
// Phase 1: matrix 2394 rows 1313 cols
[2023-03-08 16:16:07] [INFO ] Computed 21 place invariants in 12 ms
[2023-03-08 16:16:07] [INFO ] Implicit Places using invariants in 469 ms returned []
[2023-03-08 16:16:07] [INFO ] Invariant cache hit.
[2023-03-08 16:16:10] [INFO ] Implicit Places using invariants and state equation in 2358 ms returned [13, 21, 187, 199, 365, 373, 538, 546, 711, 719, 884, 892, 1057, 1067]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 2837 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1299/1313 places, 2394/2394 transitions.
Applied a total of 0 rules in 79 ms. Remains 1299 /1299 variables (removed 0) and now considering 2394/2394 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2963 ms. Remains : 1299/1313 places, 2394/2394 transitions.
Treatment of property CloudDeployment-PT-7b-LTLCardinality-03 finished in 480470 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 U p1)))'
Support contains 4 out of 1328 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1328/1328 places, 2411/2411 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1313 transition count 2396
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1313 transition count 2396
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 1313 transition count 2395
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 37 place count 1307 transition count 2389
Iterating global reduction 1 with 6 rules applied. Total rules applied 43 place count 1307 transition count 2389
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 47 place count 1307 transition count 2385
Applied a total of 47 rules in 218 ms. Remains 1307 /1328 variables (removed 21) and now considering 2385/2411 (removed 26) transitions.
// Phase 1: matrix 2385 rows 1307 cols
[2023-03-08 16:16:11] [INFO ] Computed 21 place invariants in 17 ms
[2023-03-08 16:16:11] [INFO ] Implicit Places using invariants in 533 ms returned []
[2023-03-08 16:16:11] [INFO ] Invariant cache hit.
[2023-03-08 16:16:12] [INFO ] Implicit Places using invariants and state equation in 1244 ms returned []
Implicit Place search using SMT with State Equation took 1780 ms to find 0 implicit places.
[2023-03-08 16:16:12] [INFO ] Invariant cache hit.
[2023-03-08 16:16:14] [INFO ] Dead Transitions using invariants and state equation in 2153 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1307/1328 places, 2385/2411 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4153 ms. Remains : 1307/1328 places, 2385/2411 transitions.
Stuttering acceptance computed with spot in 95 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : CloudDeployment-PT-7b-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s897 0) (EQ s1067 1)), p0:(OR (EQ s895 0) (EQ s543 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1919 ms.
Product exploration explored 100000 steps with 50000 reset in 1887 ms.
Computed a total of 190 stabilizing places and 862 stable transitions
Graph (complete) has 4657 edges and 1307 vertex of which 1284 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.9 ms
Computed a total of 190 stabilizing places and 862 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), true, (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 6 factoid took 105 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CloudDeployment-PT-7b-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CloudDeployment-PT-7b-LTLCardinality-04 finished in 8203 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)&&X(G(p1)))))'
Support contains 4 out of 1328 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1328/1328 places, 2411/2411 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1313 transition count 2396
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1313 transition count 2396
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 1313 transition count 2395
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 1308 transition count 2390
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 1308 transition count 2390
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 45 place count 1308 transition count 2386
Applied a total of 45 rules in 174 ms. Remains 1308 /1328 variables (removed 20) and now considering 2386/2411 (removed 25) transitions.
// Phase 1: matrix 2386 rows 1308 cols
[2023-03-08 16:16:19] [INFO ] Computed 21 place invariants in 16 ms
[2023-03-08 16:16:19] [INFO ] Implicit Places using invariants in 575 ms returned []
[2023-03-08 16:16:19] [INFO ] Invariant cache hit.
[2023-03-08 16:16:22] [INFO ] Implicit Places using invariants and state equation in 2768 ms returned [13, 23, 189, 197, 362, 370, 536, 544, 710, 718, 883, 891, 1056, 1064]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 3349 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1294/1328 places, 2386/2411 transitions.
Applied a total of 0 rules in 95 ms. Remains 1294 /1294 variables (removed 0) and now considering 2386/2386 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3619 ms. Remains : 1294/1328 places, 2386/2411 transitions.
Stuttering acceptance computed with spot in 227 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CloudDeployment-PT-7b-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p1:(AND (NEQ s593 0) (NEQ s13 1)), p0:(AND (EQ s493 0) (EQ s373 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-7b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-7b-LTLCardinality-05 finished in 3879 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 U (p1||G(!p0)))))'
Support contains 4 out of 1328 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1328/1328 places, 2411/2411 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1312 transition count 2395
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1312 transition count 2395
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 38 place count 1306 transition count 2389
Iterating global reduction 0 with 6 rules applied. Total rules applied 44 place count 1306 transition count 2389
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 48 place count 1306 transition count 2385
Applied a total of 48 rules in 273 ms. Remains 1306 /1328 variables (removed 22) and now considering 2385/2411 (removed 26) transitions.
// Phase 1: matrix 2385 rows 1306 cols
[2023-03-08 16:16:23] [INFO ] Computed 21 place invariants in 13 ms
[2023-03-08 16:16:23] [INFO ] Implicit Places using invariants in 658 ms returned []
[2023-03-08 16:16:23] [INFO ] Invariant cache hit.
[2023-03-08 16:16:26] [INFO ] Implicit Places using invariants and state equation in 2492 ms returned [13, 21, 187, 196, 361, 369, 534, 542, 707, 715, 880, 888, 1054, 1062]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 3158 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1292/1328 places, 2385/2411 transitions.
Applied a total of 0 rules in 55 ms. Remains 1292 /1292 variables (removed 0) and now considering 2385/2385 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3487 ms. Remains : 1292/1328 places, 2385/2411 transitions.
Stuttering acceptance computed with spot in 117 ms :[true, (AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : CloudDeployment-PT-7b-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (NOT (OR (EQ s188 0) (EQ s1217 1))) (NOT (OR (EQ s883 0) (EQ s743 1)))), p0:(OR (EQ s883 0) (EQ s743 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CloudDeployment-PT-7b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-7b-LTLCardinality-06 finished in 3634 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 2 out of 1328 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1328/1328 places, 2411/2411 transitions.
Graph (trivial) has 1375 edges and 1328 vertex of which 497 / 1328 are part of one of the 56 SCC in 4 ms
Free SCC test removed 441 places
Ensure Unique test removed 504 transitions
Reduce isomorphic transitions removed 504 transitions.
Graph (complete) has 4107 edges and 887 vertex of which 864 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.7 ms
Discarding 23 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 352 transitions
Trivial Post-agglo rules discarded 352 transitions
Performed 352 trivial Post agglomeration. Transition count delta: 352
Iterating post reduction 0 with 352 rules applied. Total rules applied 354 place count 863 transition count 1552
Reduce places removed 352 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 353 rules applied. Total rules applied 707 place count 511 transition count 1551
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 708 place count 510 transition count 1551
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 708 place count 510 transition count 1485
Deduced a syphon composed of 66 places in 2 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 840 place count 444 transition count 1485
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 851 place count 433 transition count 1474
Iterating global reduction 3 with 11 rules applied. Total rules applied 862 place count 433 transition count 1474
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 864 place count 433 transition count 1472
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 864 place count 433 transition count 1468
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 872 place count 429 transition count 1468
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 873 place count 428 transition count 1467
Iterating global reduction 4 with 1 rules applied. Total rules applied 874 place count 428 transition count 1467
Performed 136 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 136 places in 1 ms
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 4 with 272 rules applied. Total rules applied 1146 place count 292 transition count 1329
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1147 place count 292 transition count 1328
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 5 with 54 rules applied. Total rules applied 1201 place count 265 transition count 1396
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 1207 place count 265 transition count 1390
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -72
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 1219 place count 259 transition count 1462
Drop transitions removed 53 transitions
Redundant transition composition rules discarded 53 transitions
Iterating global reduction 6 with 53 rules applied. Total rules applied 1272 place count 259 transition count 1409
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1273 place count 258 transition count 1408
Applied a total of 1273 rules in 414 ms. Remains 258 /1328 variables (removed 1070) and now considering 1408/2411 (removed 1003) transitions.
[2023-03-08 16:16:26] [INFO ] Flow matrix only has 1108 transitions (discarded 300 similar events)
// Phase 1: matrix 1108 rows 258 cols
[2023-03-08 16:16:26] [INFO ] Computed 7 place invariants in 4 ms
[2023-03-08 16:16:27] [INFO ] Implicit Places using invariants in 346 ms returned []
[2023-03-08 16:16:27] [INFO ] Flow matrix only has 1108 transitions (discarded 300 similar events)
[2023-03-08 16:16:27] [INFO ] Invariant cache hit.
[2023-03-08 16:16:27] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-08 16:16:28] [INFO ] Implicit Places using invariants and state equation in 1282 ms returned []
Implicit Place search using SMT with State Equation took 1632 ms to find 0 implicit places.
[2023-03-08 16:16:30] [INFO ] Redundant transitions in 1891 ms returned []
[2023-03-08 16:16:30] [INFO ] Flow matrix only has 1108 transitions (discarded 300 similar events)
[2023-03-08 16:16:30] [INFO ] Invariant cache hit.
[2023-03-08 16:16:31] [INFO ] Dead Transitions using invariants and state equation in 961 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 258/1328 places, 1408/2411 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4918 ms. Remains : 258/1328 places, 1408/2411 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : CloudDeployment-PT-7b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s85 0) (EQ s127 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 315 steps with 4 reset in 7 ms.
FORMULA CloudDeployment-PT-7b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-7b-LTLCardinality-10 finished in 4985 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 2 out of 1328 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1328/1328 places, 2411/2411 transitions.
Graph (trivial) has 1377 edges and 1328 vertex of which 497 / 1328 are part of one of the 56 SCC in 2 ms
Free SCC test removed 441 places
Ensure Unique test removed 504 transitions
Reduce isomorphic transitions removed 504 transitions.
Graph (complete) has 4107 edges and 887 vertex of which 864 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.4 ms
Discarding 23 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 352 transitions
Trivial Post-agglo rules discarded 352 transitions
Performed 352 trivial Post agglomeration. Transition count delta: 352
Iterating post reduction 0 with 352 rules applied. Total rules applied 354 place count 863 transition count 1552
Reduce places removed 352 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 353 rules applied. Total rules applied 707 place count 511 transition count 1551
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 708 place count 510 transition count 1551
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 708 place count 510 transition count 1484
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 842 place count 443 transition count 1484
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 853 place count 432 transition count 1473
Iterating global reduction 3 with 11 rules applied. Total rules applied 864 place count 432 transition count 1473
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 866 place count 432 transition count 1471
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 866 place count 432 transition count 1467
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 874 place count 428 transition count 1467
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 875 place count 427 transition count 1466
Iterating global reduction 4 with 1 rules applied. Total rules applied 876 place count 427 transition count 1466
Performed 136 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 136 places in 0 ms
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 4 with 272 rules applied. Total rules applied 1148 place count 291 transition count 1328
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1149 place count 291 transition count 1327
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -70
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 5 with 56 rules applied. Total rules applied 1205 place count 263 transition count 1397
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1212 place count 263 transition count 1390
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -84
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 1226 place count 256 transition count 1474
Drop transitions removed 56 transitions
Redundant transition composition rules discarded 56 transitions
Iterating global reduction 6 with 56 rules applied. Total rules applied 1282 place count 256 transition count 1418
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1283 place count 255 transition count 1417
Applied a total of 1283 rules in 231 ms. Remains 255 /1328 variables (removed 1073) and now considering 1417/2411 (removed 994) transitions.
[2023-03-08 16:16:31] [INFO ] Flow matrix only has 1117 transitions (discarded 300 similar events)
// Phase 1: matrix 1117 rows 255 cols
[2023-03-08 16:16:31] [INFO ] Computed 7 place invariants in 5 ms
[2023-03-08 16:16:32] [INFO ] Implicit Places using invariants in 245 ms returned []
[2023-03-08 16:16:32] [INFO ] Flow matrix only has 1117 transitions (discarded 300 similar events)
[2023-03-08 16:16:32] [INFO ] Invariant cache hit.
[2023-03-08 16:16:32] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-08 16:16:33] [INFO ] Implicit Places using invariants and state equation in 1069 ms returned []
Implicit Place search using SMT with State Equation took 1317 ms to find 0 implicit places.
[2023-03-08 16:16:35] [INFO ] Redundant transitions in 1938 ms returned []
[2023-03-08 16:16:35] [INFO ] Flow matrix only has 1117 transitions (discarded 300 similar events)
[2023-03-08 16:16:35] [INFO ] Invariant cache hit.
[2023-03-08 16:16:35] [INFO ] Dead Transitions using invariants and state equation in 701 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 255/1328 places, 1417/2411 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4198 ms. Remains : 255/1328 places, 1417/2411 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : CloudDeployment-PT-7b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s31 0) (EQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 20 steps with 0 reset in 1 ms.
FORMULA CloudDeployment-PT-7b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-7b-LTLCardinality-11 finished in 4252 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)||X(X(X(F((G(p2)||p1)))))))'
Support contains 4 out of 1328 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1328/1328 places, 2411/2411 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 1311 transition count 2394
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 1311 transition count 2394
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 1311 transition count 2393
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 40 place count 1306 transition count 2388
Iterating global reduction 1 with 5 rules applied. Total rules applied 45 place count 1306 transition count 2388
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 48 place count 1306 transition count 2385
Applied a total of 48 rules in 178 ms. Remains 1306 /1328 variables (removed 22) and now considering 2385/2411 (removed 26) transitions.
// Phase 1: matrix 2385 rows 1306 cols
[2023-03-08 16:16:35] [INFO ] Computed 21 place invariants in 9 ms
[2023-03-08 16:16:36] [INFO ] Implicit Places using invariants in 512 ms returned []
[2023-03-08 16:16:36] [INFO ] Invariant cache hit.
[2023-03-08 16:16:39] [INFO ] Implicit Places using invariants and state equation in 3038 ms returned [13, 21, 187, 195, 360, 368, 533, 541, 706, 714, 879, 887, 1052, 1062]
Discarding 14 places :
Implicit Place search using SMT with State Equation took 3555 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1292/1328 places, 2385/2411 transitions.
Applied a total of 0 rules in 92 ms. Remains 1292 /1292 variables (removed 0) and now considering 2385/2385 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3826 ms. Remains : 1292/1328 places, 2385/2411 transitions.
Stuttering acceptance computed with spot in 360 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : CloudDeployment-PT-7b-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s623 0) (EQ s881 1)), p1:(OR (EQ s862 0) (EQ s1043 1)), p2:(OR (EQ s862 0) (EQ s1043 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 1377 ms.
Product exploration explored 100000 steps with 25000 reset in 1114 ms.
Computed a total of 190 stabilizing places and 862 stable transitions
Graph (complete) has 4330 edges and 1292 vertex of which 1283 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.6 ms
Computed a total of 190 stabilizing places and 862 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (X (NOT p0))), true]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 157 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 44 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 2385 rows 1292 cols
[2023-03-08 16:16:42] [INFO ] Computed 7 place invariants in 9 ms
[2023-03-08 16:16:43] [INFO ] After 234ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT p0)), (X (X (NOT p0))), true, (G (NOT (AND (NOT p1) p2)))]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 5 factoid took 307 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 198 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 1292 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 1292/1292 places, 2385/2385 transitions.
Applied a total of 0 rules in 82 ms. Remains 1292 /1292 variables (removed 0) and now considering 2385/2385 (removed 0) transitions.
[2023-03-08 16:16:43] [INFO ] Invariant cache hit.
[2023-03-08 16:16:44] [INFO ] Implicit Places using invariants in 585 ms returned []
[2023-03-08 16:16:44] [INFO ] Invariant cache hit.
[2023-03-08 16:16:45] [INFO ] Implicit Places using invariants and state equation in 889 ms returned []
Implicit Place search using SMT with State Equation took 1493 ms to find 0 implicit places.
[2023-03-08 16:16:45] [INFO ] Invariant cache hit.
[2023-03-08 16:16:48] [INFO ] Dead Transitions using invariants and state equation in 2701 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4278 ms. Remains : 1292/1292 places, 2385/2385 transitions.
Computed a total of 190 stabilizing places and 862 stable transitions
Graph (complete) has 4330 edges and 1292 vertex of which 1283 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.9 ms
Computed a total of 190 stabilizing places and 862 stable transitions
Knowledge obtained : [p1, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 114 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Finished random walk after 27 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=27 )
Knowledge obtained : [p1, true]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 2 factoid took 145 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 186 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25000 reset in 1212 ms.
Product exploration explored 100000 steps with 25000 reset in 1184 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 180 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 1292 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1292/1292 places, 2385/2385 transitions.
Graph (trivial) has 1341 edges and 1292 vertex of which 497 / 1292 are part of one of the 56 SCC in 1 ms
Free SCC test removed 441 places
Ensure Unique test removed 504 transitions
Reduce isomorphic transitions removed 504 transitions.
Graph (complete) has 3735 edges and 851 vertex of which 842 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.6 ms
Discarding 9 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Performed 344 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 344 rules applied. Total rules applied 346 place count 842 transition count 1879
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 49 Pre rules applied. Total rules applied 346 place count 842 transition count 1920
Deduced a syphon composed of 393 places in 3 ms
Iterating global reduction 1 with 49 rules applied. Total rules applied 395 place count 842 transition count 1920
Discarding 182 places :
Symmetric choice reduction at 1 with 182 rule applications. Total rules 577 place count 660 transition count 1738
Deduced a syphon composed of 211 places in 3 ms
Iterating global reduction 1 with 182 rules applied. Total rules applied 759 place count 660 transition count 1738
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 352 places in 1 ms
Iterating global reduction 1 with 141 rules applied. Total rules applied 900 place count 660 transition count 1738
Discarding 106 places :
Symmetric choice reduction at 1 with 106 rule applications. Total rules 1006 place count 554 transition count 1632
Deduced a syphon composed of 246 places in 2 ms
Iterating global reduction 1 with 106 rules applied. Total rules applied 1112 place count 554 transition count 1632
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: -301
Deduced a syphon composed of 288 places in 1 ms
Iterating global reduction 1 with 42 rules applied. Total rules applied 1154 place count 554 transition count 1933
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 1161 place count 554 transition count 1926
Discarding 49 places :
Symmetric choice reduction at 2 with 49 rule applications. Total rules 1210 place count 505 transition count 1765
Deduced a syphon composed of 239 places in 1 ms
Iterating global reduction 2 with 49 rules applied. Total rules applied 1259 place count 505 transition count 1765
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -98
Deduced a syphon composed of 246 places in 1 ms
Iterating global reduction 2 with 7 rules applied. Total rules applied 1266 place count 505 transition count 1863
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 1273 place count 498 transition count 1849
Deduced a syphon composed of 239 places in 1 ms
Iterating global reduction 2 with 7 rules applied. Total rules applied 1280 place count 498 transition count 1849
Deduced a syphon composed of 239 places in 1 ms
Drop transitions removed 105 transitions
Redundant transition composition rules discarded 105 transitions
Iterating global reduction 2 with 105 rules applied. Total rules applied 1385 place count 498 transition count 1744
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 1399 place count 484 transition count 1730
Deduced a syphon composed of 225 places in 1 ms
Iterating global reduction 2 with 14 rules applied. Total rules applied 1413 place count 484 transition count 1730
Deduced a syphon composed of 225 places in 1 ms
Applied a total of 1413 rules in 479 ms. Remains 484 /1292 variables (removed 808) and now considering 1730/2385 (removed 655) transitions.
[2023-03-08 16:16:54] [INFO ] Redundant transitions in 1649 ms returned []
[2023-03-08 16:16:54] [INFO ] Flow matrix only has 1430 transitions (discarded 300 similar events)
// Phase 1: matrix 1430 rows 484 cols
[2023-03-08 16:16:54] [INFO ] Computed 7 place invariants in 6 ms
[2023-03-08 16:16:54] [INFO ] Dead Transitions using invariants and state equation in 920 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 484/1292 places, 1730/2385 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3061 ms. Remains : 484/1292 places, 1730/2385 transitions.
Support contains 2 out of 1292 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1292/1292 places, 2385/2385 transitions.
Applied a total of 0 rules in 50 ms. Remains 1292 /1292 variables (removed 0) and now considering 2385/2385 (removed 0) transitions.
// Phase 1: matrix 2385 rows 1292 cols
[2023-03-08 16:16:55] [INFO ] Computed 7 place invariants in 13 ms
[2023-03-08 16:16:55] [INFO ] Implicit Places using invariants in 418 ms returned []
[2023-03-08 16:16:55] [INFO ] Invariant cache hit.
[2023-03-08 16:16:56] [INFO ] Implicit Places using invariants and state equation in 1041 ms returned []
Implicit Place search using SMT with State Equation took 1462 ms to find 0 implicit places.
[2023-03-08 16:16:56] [INFO ] Invariant cache hit.
[2023-03-08 16:16:58] [INFO ] Dead Transitions using invariants and state equation in 2208 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3723 ms. Remains : 1292/1292 places, 2385/2385 transitions.
Treatment of property CloudDeployment-PT-7b-LTLCardinality-12 finished in 23117 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)&&F(p1))))'
Support contains 4 out of 1328 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1328/1328 places, 2411/2411 transitions.
Graph (trivial) has 1375 edges and 1328 vertex of which 497 / 1328 are part of one of the 56 SCC in 2 ms
Free SCC test removed 441 places
Ensure Unique test removed 504 transitions
Reduce isomorphic transitions removed 504 transitions.
Graph (complete) has 4107 edges and 887 vertex of which 864 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.3 ms
Discarding 23 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 353 transitions
Trivial Post-agglo rules discarded 353 transitions
Performed 353 trivial Post agglomeration. Transition count delta: 353
Iterating post reduction 0 with 353 rules applied. Total rules applied 355 place count 863 transition count 1551
Reduce places removed 353 places and 0 transitions.
Iterating post reduction 1 with 353 rules applied. Total rules applied 708 place count 510 transition count 1551
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 708 place count 510 transition count 1484
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 842 place count 443 transition count 1484
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 851 place count 434 transition count 1475
Iterating global reduction 2 with 9 rules applied. Total rules applied 860 place count 434 transition count 1475
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 862 place count 434 transition count 1473
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 862 place count 434 transition count 1469
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 870 place count 430 transition count 1469
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 871 place count 429 transition count 1468
Iterating global reduction 3 with 1 rules applied. Total rules applied 872 place count 429 transition count 1468
Performed 134 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 134 places in 0 ms
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 3 with 268 rules applied. Total rules applied 1140 place count 295 transition count 1332
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1141 place count 295 transition count 1331
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -70
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 4 with 56 rules applied. Total rules applied 1197 place count 267 transition count 1401
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 1204 place count 267 transition count 1394
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -84
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 1218 place count 260 transition count 1478
Drop transitions removed 57 transitions
Redundant transition composition rules discarded 57 transitions
Iterating global reduction 5 with 57 rules applied. Total rules applied 1275 place count 260 transition count 1421
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 1277 place count 260 transition count 1421
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1278 place count 259 transition count 1420
Applied a total of 1278 rules in 271 ms. Remains 259 /1328 variables (removed 1069) and now considering 1420/2411 (removed 991) transitions.
[2023-03-08 16:16:59] [INFO ] Flow matrix only has 1120 transitions (discarded 300 similar events)
// Phase 1: matrix 1120 rows 259 cols
[2023-03-08 16:16:59] [INFO ] Computed 7 place invariants in 15 ms
[2023-03-08 16:16:59] [INFO ] Implicit Places using invariants in 500 ms returned []
[2023-03-08 16:16:59] [INFO ] Flow matrix only has 1120 transitions (discarded 300 similar events)
[2023-03-08 16:16:59] [INFO ] Invariant cache hit.
[2023-03-08 16:17:00] [INFO ] State equation strengthened by 56 read => feed constraints.
[2023-03-08 16:17:00] [INFO ] Implicit Places using invariants and state equation in 939 ms returned []
Implicit Place search using SMT with State Equation took 1442 ms to find 0 implicit places.
[2023-03-08 16:17:02] [INFO ] Redundant transitions in 1739 ms returned []
[2023-03-08 16:17:02] [INFO ] Flow matrix only has 1120 transitions (discarded 300 similar events)
[2023-03-08 16:17:02] [INFO ] Invariant cache hit.
[2023-03-08 16:17:03] [INFO ] Dead Transitions using invariants and state equation in 939 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 259/1328 places, 1420/2411 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4399 ms. Remains : 259/1328 places, 1420/2411 transitions.
Stuttering acceptance computed with spot in 124 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CloudDeployment-PT-7b-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s66 0) (EQ s184 1)), p1:(OR (EQ s169 0) (EQ s63 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2723 steps with 51 reset in 24 ms.
FORMULA CloudDeployment-PT-7b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CloudDeployment-PT-7b-LTLCardinality-14 finished in 4568 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' '!(((p0&&(p1 U G((p2 U X(X(X(p3))))))) U X(G(p4))))'
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)||X(X(X(F((G(p2)||p1)))))))'
Found a Shortening insensitive property : CloudDeployment-PT-7b-LTLCardinality-12
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 4 out of 1328 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1328/1328 places, 2411/2411 transitions.
Graph (trivial) has 1371 edges and 1328 vertex of which 493 / 1328 are part of one of the 55 SCC in 1 ms
Free SCC test removed 438 places
Ensure Unique test removed 501 transitions
Reduce isomorphic transitions removed 501 transitions.
Graph (complete) has 4110 edges and 890 vertex of which 867 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.11 ms
Discarding 23 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 349 transitions
Trivial Post-agglo rules discarded 349 transitions
Performed 349 trivial Post agglomeration. Transition count delta: 349
Iterating post reduction 0 with 349 rules applied. Total rules applied 351 place count 866 transition count 1558
Reduce places removed 349 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 350 rules applied. Total rules applied 701 place count 517 transition count 1557
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 702 place count 516 transition count 1557
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 69 Pre rules applied. Total rules applied 702 place count 516 transition count 1488
Deduced a syphon composed of 69 places in 2 ms
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 3 with 138 rules applied. Total rules applied 840 place count 447 transition count 1488
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 850 place count 437 transition count 1478
Iterating global reduction 3 with 10 rules applied. Total rules applied 860 place count 437 transition count 1478
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 861 place count 437 transition count 1477
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 861 place count 437 transition count 1474
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 867 place count 434 transition count 1474
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 868 place count 433 transition count 1473
Iterating global reduction 4 with 1 rules applied. Total rules applied 869 place count 433 transition count 1473
Performed 136 Post agglomeration using F-continuation condition with reduction of 2 identical transitions.
Deduced a syphon composed of 136 places in 0 ms
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 4 with 272 rules applied. Total rules applied 1141 place count 297 transition count 1335
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1142 place count 297 transition count 1334
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: -70
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 5 with 56 rules applied. Total rules applied 1198 place count 269 transition count 1404
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1205 place count 269 transition count 1397
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -84
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 1219 place count 262 transition count 1481
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1220 place count 261 transition count 1480
Applied a total of 1220 rules in 274 ms. Remains 261 /1328 variables (removed 1067) and now considering 1480/2411 (removed 931) transitions.
[2023-03-08 16:17:05] [INFO ] Flow matrix only has 1188 transitions (discarded 292 similar events)
// Phase 1: matrix 1188 rows 261 cols
[2023-03-08 16:17:05] [INFO ] Computed 7 place invariants in 7 ms
[2023-03-08 16:17:06] [INFO ] Implicit Places using invariants in 306 ms returned []
[2023-03-08 16:17:06] [INFO ] Flow matrix only has 1188 transitions (discarded 292 similar events)
[2023-03-08 16:17:06] [INFO ] Invariant cache hit.
[2023-03-08 16:17:06] [INFO ] State equation strengthened by 62 read => feed constraints.
[2023-03-08 16:17:07] [INFO ] Implicit Places using invariants and state equation in 1176 ms returned []
Implicit Place search using SMT with State Equation took 1490 ms to find 0 implicit places.
[2023-03-08 16:17:07] [INFO ] Flow matrix only has 1188 transitions (discarded 292 similar events)
[2023-03-08 16:17:07] [INFO ] Invariant cache hit.
[2023-03-08 16:17:08] [INFO ] Dead Transitions using invariants and state equation in 1114 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 261/1328 places, 1480/2411 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2880 ms. Remains : 261/1328 places, 1480/2411 transitions.
Running random walk in product with property : CloudDeployment-PT-7b-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s109 0) (EQ s156 1)), p1:(OR (EQ s148 0) (EQ s181 1)), p2:(OR (EQ s148 0) (EQ s181 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 187 steps with 46 reset in 1 ms.
Treatment of property CloudDeployment-PT-7b-LTLCardinality-12 finished in 3253 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-08 16:17:08] [INFO ] Flatten gal took : 126 ms
[2023-03-08 16:17:08] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-08 16:17:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1328 places, 2411 transitions and 10836 arcs took 23 ms.
Total runtime 560877 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CloudDeployment-PT-7b
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/377
LTLCardinality
FORMULA CloudDeployment-PT-7b-LTLCardinality-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1678292346148
--------------------
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/377/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/377/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/377/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: rewrite Frontend/Parser/formula_rewrite.k:352
lola: rewrite Frontend/Parser/formula_rewrite.k:352
lola: rewrite Frontend/Parser/formula_rewrite.k:352
lola: rewrite Frontend/Parser/formula_rewrite.k:376
lola: rewrite Frontend/Parser/formula_rewrite.k:376
lola: rewrite Frontend/Parser/formula_rewrite.k:376
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 CloudDeployment-PT-7b-LTLCardinality-12
lola: time limit : 1798 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for CloudDeployment-PT-7b-LTLCardinality-12
lola: result : true
lola: markings : 13
lola: fired transitions : 20
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 CloudDeployment-PT-7b-LTLCardinality-03
lola: time limit : 3597 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CloudDeployment-PT-7b-LTLCardinality-12: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudDeployment-PT-7b-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 4/3597 2/32 CloudDeployment-PT-7b-LTLCardinality-03 88080 m, 17616 m/sec, 314679 t fired, .
Time elapsed: 7 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CloudDeployment-PT-7b-LTLCardinality-12: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudDeployment-PT-7b-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 9/3597 4/32 CloudDeployment-PT-7b-LTLCardinality-03 223564 m, 27096 m/sec, 802084 t fired, .
Time elapsed: 12 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CloudDeployment-PT-7b-LTLCardinality-12: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudDeployment-PT-7b-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 14/3597 6/32 CloudDeployment-PT-7b-LTLCardinality-03 346619 m, 24611 m/sec, 1258675 t fired, .
Time elapsed: 17 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CloudDeployment-PT-7b-LTLCardinality-12: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudDeployment-PT-7b-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 19/3597 7/32 CloudDeployment-PT-7b-LTLCardinality-03 460231 m, 22722 m/sec, 1694530 t fired, .
Time elapsed: 22 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CloudDeployment-PT-7b-LTLCardinality-12: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudDeployment-PT-7b-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 24/3597 9/32 CloudDeployment-PT-7b-LTLCardinality-03 546069 m, 17167 m/sec, 2107813 t fired, .
Time elapsed: 27 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CloudDeployment-PT-7b-LTLCardinality-12: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudDeployment-PT-7b-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 29/3597 10/32 CloudDeployment-PT-7b-LTLCardinality-03 647025 m, 20191 m/sec, 2555621 t fired, .
Time elapsed: 32 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CloudDeployment-PT-7b-LTLCardinality-12: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudDeployment-PT-7b-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 34/3597 11/32 CloudDeployment-PT-7b-LTLCardinality-03 741164 m, 18827 m/sec, 3005250 t fired, .
Time elapsed: 37 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CloudDeployment-PT-7b-LTLCardinality-12: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudDeployment-PT-7b-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 39/3597 12/32 CloudDeployment-PT-7b-LTLCardinality-03 834034 m, 18574 m/sec, 3448866 t fired, .
Time elapsed: 42 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CloudDeployment-PT-7b-LTLCardinality-12: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudDeployment-PT-7b-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 44/3597 14/32 CloudDeployment-PT-7b-LTLCardinality-03 929418 m, 19076 m/sec, 3893367 t fired, .
Time elapsed: 47 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CloudDeployment-PT-7b-LTLCardinality-12: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudDeployment-PT-7b-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 49/3597 15/32 CloudDeployment-PT-7b-LTLCardinality-03 1033528 m, 20822 m/sec, 4357857 t fired, .
Time elapsed: 52 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CloudDeployment-PT-7b-LTLCardinality-12: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudDeployment-PT-7b-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 54/3597 17/32 CloudDeployment-PT-7b-LTLCardinality-03 1130258 m, 19346 m/sec, 4820505 t fired, .
Time elapsed: 57 secs. Pages in use: 17
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CloudDeployment-PT-7b-LTLCardinality-12: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudDeployment-PT-7b-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 59/3597 18/32 CloudDeployment-PT-7b-LTLCardinality-03 1232412 m, 20430 m/sec, 5287943 t fired, .
Time elapsed: 62 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CloudDeployment-PT-7b-LTLCardinality-12: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudDeployment-PT-7b-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 64/3597 20/32 CloudDeployment-PT-7b-LTLCardinality-03 1346183 m, 22754 m/sec, 5708632 t fired, .
Time elapsed: 67 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CloudDeployment-PT-7b-LTLCardinality-12: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudDeployment-PT-7b-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 69/3597 21/32 CloudDeployment-PT-7b-LTLCardinality-03 1476595 m, 26082 m/sec, 6178799 t fired, .
Time elapsed: 72 secs. Pages in use: 21
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CloudDeployment-PT-7b-LTLCardinality-12: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudDeployment-PT-7b-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 74/3597 22/32 CloudDeployment-PT-7b-LTLCardinality-03 1588791 m, 22439 m/sec, 6592217 t fired, .
Time elapsed: 77 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CloudDeployment-PT-7b-LTLCardinality-12: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudDeployment-PT-7b-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 79/3597 24/32 CloudDeployment-PT-7b-LTLCardinality-03 1685405 m, 19322 m/sec, 7023408 t fired, .
Time elapsed: 82 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CloudDeployment-PT-7b-LTLCardinality-12: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudDeployment-PT-7b-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 84/3597 25/32 CloudDeployment-PT-7b-LTLCardinality-03 1770939 m, 17106 m/sec, 7442601 t fired, .
Time elapsed: 87 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CloudDeployment-PT-7b-LTLCardinality-12: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudDeployment-PT-7b-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 89/3597 27/32 CloudDeployment-PT-7b-LTLCardinality-03 1881420 m, 22096 m/sec, 7924975 t fired, .
Time elapsed: 92 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CloudDeployment-PT-7b-LTLCardinality-12: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudDeployment-PT-7b-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 94/3597 28/32 CloudDeployment-PT-7b-LTLCardinality-03 1969572 m, 17630 m/sec, 8341532 t fired, .
Time elapsed: 97 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CloudDeployment-PT-7b-LTLCardinality-12: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudDeployment-PT-7b-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 99/3597 29/32 CloudDeployment-PT-7b-LTLCardinality-03 2064036 m, 18892 m/sec, 8796266 t fired, .
Time elapsed: 102 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CloudDeployment-PT-7b-LTLCardinality-12: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudDeployment-PT-7b-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 104/3597 31/32 CloudDeployment-PT-7b-LTLCardinality-03 2156343 m, 18461 m/sec, 9237799 t fired, .
Time elapsed: 107 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CloudDeployment-PT-7b-LTLCardinality-12: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudDeployment-PT-7b-LTLCardinality-03: LTL 0 0 1 0 1 0 0 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 109/3597 32/32 CloudDeployment-PT-7b-LTLCardinality-03 2268007 m, 22332 m/sec, 9728555 t fired, .
Time elapsed: 112 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for CloudDeployment-PT-7b-LTLCardinality-03 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CloudDeployment-PT-7b-LTLCardinality-12: LTL true LTL model checker
PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CloudDeployment-PT-7b-LTLCardinality-03: LTL 0 0 0 0 1 0 1 0
TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
Time elapsed: 117 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: Portfolio finished: no open tasks 2
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CloudDeployment-PT-7b-LTLCardinality-03: LTL unknown AGGR
CloudDeployment-PT-7b-LTLCardinality-12: LTL true LTL model checker
Time elapsed: 117 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="CloudDeployment-PT-7b"
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 CloudDeployment-PT-7b, 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 r071-smll-167814398000451"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CloudDeployment-PT-7b.tgz
mv CloudDeployment-PT-7b 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 '
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 ;