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

About the Execution of LoLa+red for Szymanski-PT-b02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1638.563 341765.00 378937.00 2003.00 TTFFFTTTFTFTFTFF 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.r487-tall-167912703100451.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 Szymanski-PT-b02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r487-tall-167912703100451
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 7.6K Feb 26 16:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 16:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 16:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 16:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 16:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Feb 26 16:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 16:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 16:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 3.7M Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679188671883

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=Szymanski-PT-b02
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 01:17:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 01:17:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 01:17:53] [INFO ] Load time of PNML (sax parser for PT used): 264 ms
[2023-03-19 01:17:53] [INFO ] Transformed 568 places.
[2023-03-19 01:17:53] [INFO ] Transformed 8320 transitions.
[2023-03-19 01:17:53] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 383 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 260 places in 17 ms
Reduce places removed 260 places and 256 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA Szymanski-PT-b02-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 15 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 306 transition count 8064
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 305 transition count 7936
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 305 transition count 7936
Applied a total of 4 rules in 205 ms. Remains 305 /308 variables (removed 3) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 01:17:54] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 01:17:54] [INFO ] Computed 1 place invariants in 52 ms
[2023-03-19 01:17:55] [INFO ] Implicit Places using invariants in 864 ms returned []
[2023-03-19 01:17:55] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:17:55] [INFO ] Invariant cache hit.
[2023-03-19 01:17:55] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:18:01] [INFO ] Implicit Places using invariants and state equation in 6618 ms returned []
Implicit Place search using SMT with State Equation took 7525 ms to find 0 implicit places.
[2023-03-19 01:18:01] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:18:01] [INFO ] Invariant cache hit.
[2023-03-19 01:18:03] [INFO ] Dead Transitions using invariants and state equation in 1992 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/308 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9727 ms. Remains : 305/308 places, 7936/8064 transitions.
Support contains 15 out of 305 places after structural reductions.
[2023-03-19 01:18:04] [INFO ] Flatten gal took : 396 ms
[2023-03-19 01:18:04] [INFO ] Flatten gal took : 247 ms
[2023-03-19 01:18:05] [INFO ] Input system was already deterministic with 7936 transitions.
Support contains 13 out of 305 places (down from 15) after GAL structural reductions.
Incomplete random walk after 10001 steps, including 3 resets, run finished after 332 ms. (steps per millisecond=30 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2023-03-19 01:18:06] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:18:06] [INFO ] Invariant cache hit.
[2023-03-19 01:18:06] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 01:18:06] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-19 01:18:06] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 01:18:09] [INFO ] After 3472ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :5
[2023-03-19 01:18:09] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:18:31] [INFO ] After 21376ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :3 sat :3
[2023-03-19 01:18:31] [INFO ] After 21380ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :3
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-19 01:18:31] [INFO ] After 25024ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :3
Fused 8 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 76 ms.
Support contains 7 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 305 transition count 7810
Applied a total of 126 rules in 457 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7936 (removed 126) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 458 ms. Remains : 305/305 places, 7810/7936 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 123 ms. (steps per millisecond=81 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-19 01:18:32] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2023-03-19 01:18:32] [INFO ] Computed 1 place invariants in 51 ms
[2023-03-19 01:18:32] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 01:18:32] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 01:18:33] [INFO ] After 917ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 01:18:33] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:18:51] [INFO ] After 17850ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-19 01:18:57] [INFO ] After 23995ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-19 01:18:57] [INFO ] After 25011ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 43 ms.
Support contains 5 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 305 transition count 7809
Applied a total of 1 rules in 243 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7810 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 243 ms. Remains : 305/305 places, 7809/7810 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 125081 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 125081 steps, saw 43739 distinct states, run finished after 3002 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-19 01:19:00] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2023-03-19 01:19:01] [INFO ] Computed 2 place invariants in 22 ms
[2023-03-19 01:19:01] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 01:19:01] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-19 01:19:01] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-19 01:19:02] [INFO ] After 1149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 01:19:02] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:19:26] [INFO ] After 23752ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 01:19:26] [INFO ] After 23757ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-19 01:19:26] [INFO ] After 25023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 59 ms.
Support contains 5 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 186 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 186 ms. Remains : 305/305 places, 7809/7809 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 200 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
[2023-03-19 01:19:26] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2023-03-19 01:19:26] [INFO ] Invariant cache hit.
[2023-03-19 01:19:27] [INFO ] Implicit Places using invariants in 486 ms returned []
[2023-03-19 01:19:27] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2023-03-19 01:19:27] [INFO ] Invariant cache hit.
[2023-03-19 01:19:27] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:19:35] [INFO ] Implicit Places using invariants and state equation in 8637 ms returned []
Implicit Place search using SMT with State Equation took 9127 ms to find 0 implicit places.
[2023-03-19 01:19:36] [INFO ] Redundant transitions in 859 ms returned []
[2023-03-19 01:19:36] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
[2023-03-19 01:19:36] [INFO ] Invariant cache hit.
[2023-03-19 01:19:38] [INFO ] Dead Transitions using invariants and state equation in 2169 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12374 ms. Remains : 305/305 places, 7809/7809 transitions.
Graph (trivial) has 5264 edges and 305 vertex of which 38 / 305 are part of one of the 2 SCC in 4 ms
Free SCC test removed 36 places
Drop transitions removed 4264 transitions
Ensure Unique test removed 1182 transitions
Reduce isomorphic transitions removed 5446 transitions.
Drop transitions removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 0 with 416 rules applied. Total rules applied 417 place count 269 transition count 1947
Applied a total of 417 rules in 189 ms. Remains 269 /305 variables (removed 36) and now considering 1947/7809 (removed 5862) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 1947 rows 269 cols
[2023-03-19 01:19:38] [INFO ] Computed 2 place invariants in 10 ms
[2023-03-19 01:19:39] [INFO ] After 183ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 01:19:39] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-19 01:19:39] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-19 01:19:39] [INFO ] After 682ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 01:19:39] [INFO ] State equation strengthened by 504 read => feed constraints.
[2023-03-19 01:19:41] [INFO ] After 1302ms SMT Verify possible using 504 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-19 01:19:41] [INFO ] After 1865ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 692 ms.
[2023-03-19 01:19:42] [INFO ] After 3339ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Successfully simplified 3 atomic propositions for a total of 6 simplifications.
FORMULA Szymanski-PT-b02-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 11 stabilizing places and 2304 stable transitions
FORMULA Szymanski-PT-b02-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 37 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 01:19:42] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 01:19:42] [INFO ] Computed 1 place invariants in 17 ms
[2023-03-19 01:19:43] [INFO ] Implicit Places using invariants in 472 ms returned []
[2023-03-19 01:19:43] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:19:43] [INFO ] Invariant cache hit.
[2023-03-19 01:19:43] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:19:50] [INFO ] Implicit Places using invariants and state equation in 7741 ms returned []
Implicit Place search using SMT with State Equation took 8217 ms to find 0 implicit places.
[2023-03-19 01:19:50] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:19:50] [INFO ] Invariant cache hit.
[2023-03-19 01:19:52] [INFO ] Dead Transitions using invariants and state equation in 2002 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10262 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 237 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b02-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ s209 s128)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 523 ms.
Product exploration explored 100000 steps with 0 reset in 481 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 152254 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 152254 steps, saw 52063 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 01:19:57] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:19:57] [INFO ] Invariant cache hit.
[2023-03-19 01:19:57] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:19:57] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 01:19:58] [INFO ] After 664ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 01:19:58] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:20:02] [INFO ] After 4387ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 01:20:02] [INFO ] After 4497ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 57 ms.
[2023-03-19 01:20:02] [INFO ] After 5281ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 305 transition count 7808
Applied a total of 128 rules in 195 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7936 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 196 ms. Remains : 305/305 places, 7808/7936 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 153762 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 153762 steps, saw 52222 distinct states, run finished after 3003 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 01:20:06] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 01:20:06] [INFO ] Computed 3 place invariants in 18 ms
[2023-03-19 01:20:06] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:20:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-19 01:20:06] [INFO ] After 537ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 01:20:06] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:20:15] [INFO ] After 9069ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-19 01:20:15] [INFO ] After 9667ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 27 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 182 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 185 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 182 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2023-03-19 01:20:16] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 01:20:16] [INFO ] Invariant cache hit.
[2023-03-19 01:20:16] [INFO ] Implicit Places using invariants in 508 ms returned []
[2023-03-19 01:20:16] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 01:20:16] [INFO ] Invariant cache hit.
[2023-03-19 01:20:17] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:20:18] [INFO ] Implicit Places using invariants and state equation in 2164 ms returned []
Implicit Place search using SMT with State Equation took 2679 ms to find 0 implicit places.
[2023-03-19 01:20:19] [INFO ] Redundant transitions in 656 ms returned []
[2023-03-19 01:20:19] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 01:20:19] [INFO ] Invariant cache hit.
[2023-03-19 01:20:21] [INFO ] Dead Transitions using invariants and state equation in 2165 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5691 ms. Remains : 305/305 places, 7808/7808 transitions.
Graph (trivial) has 5264 edges and 305 vertex of which 38 / 305 are part of one of the 2 SCC in 1 ms
Free SCC test removed 36 places
Drop transitions removed 4264 transitions
Ensure Unique test removed 1182 transitions
Reduce isomorphic transitions removed 5446 transitions.
Drop transitions removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 0 with 416 rules applied. Total rules applied 417 place count 269 transition count 1946
Applied a total of 417 rules in 123 ms. Remains 269 /305 variables (removed 36) and now considering 1946/7808 (removed 5862) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1946 rows 269 cols
[2023-03-19 01:20:21] [INFO ] Computed 3 place invariants in 8 ms
[2023-03-19 01:20:21] [INFO ] After 82ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:20:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-19 01:20:22] [INFO ] After 348ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 01:20:22] [INFO ] State equation strengthened by 504 read => feed constraints.
[2023-03-19 01:20:22] [INFO ] After 272ms SMT Verify possible using 504 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 01:20:22] [INFO ] After 344ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 75 ms.
[2023-03-19 01:20:22] [INFO ] After 849ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 31 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 01:20:23] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 01:20:23] [INFO ] Computed 1 place invariants in 20 ms
[2023-03-19 01:20:23] [INFO ] Implicit Places using invariants in 459 ms returned []
[2023-03-19 01:20:23] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:20:23] [INFO ] Invariant cache hit.
[2023-03-19 01:20:24] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:20:31] [INFO ] Implicit Places using invariants and state equation in 7955 ms returned []
Implicit Place search using SMT with State Equation took 8417 ms to find 0 implicit places.
[2023-03-19 01:20:31] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:20:31] [INFO ] Invariant cache hit.
[2023-03-19 01:20:33] [INFO ] Dead Transitions using invariants and state equation in 2005 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10455 ms. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 151198 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 151198 steps, saw 51799 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 01:20:36] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:20:36] [INFO ] Invariant cache hit.
[2023-03-19 01:20:36] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:20:37] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 01:20:37] [INFO ] After 670ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 01:20:37] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:20:42] [INFO ] After 4365ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 01:20:42] [INFO ] After 4474ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-19 01:20:42] [INFO ] After 5298ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 305 transition count 7808
Applied a total of 128 rules in 206 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7936 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 207 ms. Remains : 305/305 places, 7808/7936 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 151553 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 151553 steps, saw 51540 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 01:20:45] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 01:20:45] [INFO ] Computed 3 place invariants in 13 ms
[2023-03-19 01:20:45] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:20:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-19 01:20:46] [INFO ] After 569ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 01:20:46] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:20:55] [INFO ] After 9078ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-19 01:20:55] [INFO ] After 9720ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 20 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 180 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 185 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2023-03-19 01:20:55] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 01:20:55] [INFO ] Invariant cache hit.
[2023-03-19 01:20:56] [INFO ] Implicit Places using invariants in 473 ms returned []
[2023-03-19 01:20:56] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 01:20:56] [INFO ] Invariant cache hit.
[2023-03-19 01:20:56] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:20:58] [INFO ] Implicit Places using invariants and state equation in 2067 ms returned []
Implicit Place search using SMT with State Equation took 2555 ms to find 0 implicit places.
[2023-03-19 01:20:59] [INFO ] Redundant transitions in 849 ms returned []
[2023-03-19 01:20:59] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 01:20:59] [INFO ] Invariant cache hit.
[2023-03-19 01:21:01] [INFO ] Dead Transitions using invariants and state equation in 2253 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5870 ms. Remains : 305/305 places, 7808/7808 transitions.
Graph (trivial) has 5264 edges and 305 vertex of which 38 / 305 are part of one of the 2 SCC in 0 ms
Free SCC test removed 36 places
Drop transitions removed 4264 transitions
Ensure Unique test removed 1182 transitions
Reduce isomorphic transitions removed 5446 transitions.
Drop transitions removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 0 with 416 rules applied. Total rules applied 417 place count 269 transition count 1946
Applied a total of 417 rules in 139 ms. Remains 269 /305 variables (removed 36) and now considering 1946/7808 (removed 5862) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1946 rows 269 cols
[2023-03-19 01:21:01] [INFO ] Computed 3 place invariants in 14 ms
[2023-03-19 01:21:01] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:21:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-19 01:21:02] [INFO ] After 328ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 01:21:02] [INFO ] State equation strengthened by 504 read => feed constraints.
[2023-03-19 01:21:02] [INFO ] After 262ms SMT Verify possible using 504 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 01:21:02] [INFO ] After 319ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-19 01:21:02] [INFO ] After 741ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 478 ms.
Product exploration explored 100000 steps with 0 reset in 477 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 373 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 01:21:05] [INFO ] Redundant transitions in 799 ms returned []
[2023-03-19 01:21:05] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 01:21:05] [INFO ] Computed 1 place invariants in 21 ms
[2023-03-19 01:21:07] [INFO ] Dead Transitions using invariants and state equation in 2028 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3220 ms. Remains : 305/305 places, 7936/7936 transitions.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 32 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 01:21:07] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:21:07] [INFO ] Invariant cache hit.
[2023-03-19 01:21:07] [INFO ] Implicit Places using invariants in 452 ms returned []
[2023-03-19 01:21:07] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:21:07] [INFO ] Invariant cache hit.
[2023-03-19 01:21:08] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:21:15] [INFO ] Implicit Places using invariants and state equation in 7650 ms returned []
Implicit Place search using SMT with State Equation took 8104 ms to find 0 implicit places.
[2023-03-19 01:21:15] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:21:15] [INFO ] Invariant cache hit.
[2023-03-19 01:21:17] [INFO ] Dead Transitions using invariants and state equation in 1894 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10032 ms. Remains : 305/305 places, 7936/7936 transitions.
Treatment of property Szymanski-PT-b02-LTLCardinality-02 finished in 95164 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 32 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 01:21:17] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:21:17] [INFO ] Invariant cache hit.
[2023-03-19 01:21:18] [INFO ] Implicit Places using invariants in 440 ms returned []
[2023-03-19 01:21:18] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:21:18] [INFO ] Invariant cache hit.
[2023-03-19 01:21:18] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:21:25] [INFO ] Implicit Places using invariants and state equation in 7750 ms returned []
Implicit Place search using SMT with State Equation took 8194 ms to find 0 implicit places.
[2023-03-19 01:21:26] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:21:26] [INFO ] Invariant cache hit.
[2023-03-19 01:21:27] [INFO ] Dead Transitions using invariants and state equation in 1959 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10187 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 120 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b02-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GT s175 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Szymanski-PT-b02-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b02-LTLCardinality-03 finished in 10338 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 186 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 01:21:28] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:21:28] [INFO ] Invariant cache hit.
[2023-03-19 01:21:28] [INFO ] Implicit Places using invariants in 438 ms returned []
[2023-03-19 01:21:28] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:21:28] [INFO ] Invariant cache hit.
[2023-03-19 01:21:29] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:21:35] [INFO ] Implicit Places using invariants and state equation in 6942 ms returned []
Implicit Place search using SMT with State Equation took 7381 ms to find 0 implicit places.
[2023-03-19 01:21:36] [INFO ] Redundant transitions in 774 ms returned []
[2023-03-19 01:21:36] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:21:36] [INFO ] Invariant cache hit.
[2023-03-19 01:21:38] [INFO ] Dead Transitions using invariants and state equation in 1843 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10189 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b02-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 s47)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 113 steps with 0 reset in 3 ms.
FORMULA Szymanski-PT-b02-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b02-LTLCardinality-04 finished in 10289 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&&(G(p1)||X(F(!p1))))))'
Support contains 3 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 31 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 01:21:38] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:21:38] [INFO ] Invariant cache hit.
[2023-03-19 01:21:38] [INFO ] Implicit Places using invariants in 424 ms returned []
[2023-03-19 01:21:38] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:21:38] [INFO ] Invariant cache hit.
[2023-03-19 01:21:39] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:21:46] [INFO ] Implicit Places using invariants and state equation in 7170 ms returned []
Implicit Place search using SMT with State Equation took 7596 ms to find 0 implicit places.
[2023-03-19 01:21:46] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:21:46] [INFO ] Invariant cache hit.
[2023-03-19 01:21:48] [INFO ] Dead Transitions using invariants and state equation in 2258 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9899 ms. Remains : 305/305 places, 7936/7936 transitions.
Stuttering acceptance computed with spot in 156 ms :[p1, (NOT p0), (NOT p0), true]
Running random walk in product with property : Szymanski-PT-b02-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(LEQ s216 0), p0:(LEQ s193 s77)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 820 ms.
Product exploration explored 100000 steps with 50000 reset in 712 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND p0 (NOT p1)))), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND p0 (NOT p1))))
Knowledge based reduction with 5 factoid took 200 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Szymanski-PT-b02-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Szymanski-PT-b02-LTLCardinality-13 finished in 11836 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Found a Lengthening insensitive property : Szymanski-PT-b02-LTLCardinality-02
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 69 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 01:21:50] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:21:50] [INFO ] Invariant cache hit.
[2023-03-19 01:21:50] [INFO ] Implicit Places using invariants in 432 ms returned []
[2023-03-19 01:21:50] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:21:50] [INFO ] Invariant cache hit.
[2023-03-19 01:21:51] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:21:58] [INFO ] Implicit Places using invariants and state equation in 7974 ms returned []
Implicit Place search using SMT with State Equation took 8412 ms to find 0 implicit places.
[2023-03-19 01:21:58] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:21:58] [INFO ] Invariant cache hit.
[2023-03-19 01:22:00] [INFO ] Dead Transitions using invariants and state equation in 2037 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 10520 ms. Remains : 305/305 places, 7936/7936 transitions.
Running random walk in product with property : Szymanski-PT-b02-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ s209 s128)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 566 ms.
Product exploration explored 100000 steps with 0 reset in 504 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 74 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 144698 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 144698 steps, saw 50188 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 01:22:05] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:22:05] [INFO ] Invariant cache hit.
[2023-03-19 01:22:05] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:22:05] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 01:22:06] [INFO ] After 634ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 01:22:06] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:22:10] [INFO ] After 4160ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 01:22:10] [INFO ] After 4272ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-03-19 01:22:10] [INFO ] After 5023ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 305 transition count 7808
Applied a total of 128 rules in 181 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7936 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 182 ms. Remains : 305/305 places, 7808/7936 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 151833 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 151833 steps, saw 51592 distinct states, run finished after 3003 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 01:22:13] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 01:22:13] [INFO ] Computed 3 place invariants in 13 ms
[2023-03-19 01:22:13] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:22:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-19 01:22:14] [INFO ] After 550ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 01:22:14] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:22:23] [INFO ] After 9069ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-19 01:22:23] [INFO ] After 9688ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 21 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 175 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 175 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 175 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2023-03-19 01:22:23] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 01:22:23] [INFO ] Invariant cache hit.
[2023-03-19 01:22:24] [INFO ] Implicit Places using invariants in 497 ms returned []
[2023-03-19 01:22:24] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 01:22:24] [INFO ] Invariant cache hit.
[2023-03-19 01:22:24] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:22:26] [INFO ] Implicit Places using invariants and state equation in 2078 ms returned []
Implicit Place search using SMT with State Equation took 2611 ms to find 0 implicit places.
[2023-03-19 01:22:27] [INFO ] Redundant transitions in 837 ms returned []
[2023-03-19 01:22:27] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 01:22:27] [INFO ] Invariant cache hit.
[2023-03-19 01:22:29] [INFO ] Dead Transitions using invariants and state equation in 2380 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6030 ms. Remains : 305/305 places, 7808/7808 transitions.
Graph (trivial) has 5264 edges and 305 vertex of which 38 / 305 are part of one of the 2 SCC in 0 ms
Free SCC test removed 36 places
Drop transitions removed 4264 transitions
Ensure Unique test removed 1182 transitions
Reduce isomorphic transitions removed 5446 transitions.
Drop transitions removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 0 with 416 rules applied. Total rules applied 417 place count 269 transition count 1946
Applied a total of 417 rules in 146 ms. Remains 269 /305 variables (removed 36) and now considering 1946/7808 (removed 5862) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1946 rows 269 cols
[2023-03-19 01:22:29] [INFO ] Computed 3 place invariants in 12 ms
[2023-03-19 01:22:29] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:22:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-19 01:22:30] [INFO ] After 371ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 01:22:30] [INFO ] State equation strengthened by 504 read => feed constraints.
[2023-03-19 01:22:30] [INFO ] After 276ms SMT Verify possible using 504 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 01:22:30] [INFO ] After 341ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-19 01:22:30] [INFO ] After 833ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 31 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 01:22:31] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 01:22:31] [INFO ] Computed 1 place invariants in 25 ms
[2023-03-19 01:22:31] [INFO ] Implicit Places using invariants in 460 ms returned []
[2023-03-19 01:22:31] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:22:31] [INFO ] Invariant cache hit.
[2023-03-19 01:22:32] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:22:39] [INFO ] Implicit Places using invariants and state equation in 7492 ms returned []
Implicit Place search using SMT with State Equation took 7955 ms to find 0 implicit places.
[2023-03-19 01:22:39] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:22:39] [INFO ] Invariant cache hit.
[2023-03-19 01:22:41] [INFO ] Dead Transitions using invariants and state equation in 1887 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9874 ms. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 148445 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :{}
Probabilistic random walk after 148445 steps, saw 51042 distinct states, run finished after 3001 ms. (steps per millisecond=49 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 01:22:44] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:22:44] [INFO ] Invariant cache hit.
[2023-03-19 01:22:44] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:22:44] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 01:22:45] [INFO ] After 681ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 01:22:45] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:22:49] [INFO ] After 4525ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 01:22:49] [INFO ] After 4629ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 56 ms.
[2023-03-19 01:22:49] [INFO ] After 5439ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 305 transition count 7808
Applied a total of 128 rules in 192 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7936 (removed 128) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 192 ms. Remains : 305/305 places, 7808/7936 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 151421 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 151421 steps, saw 51473 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 01:22:53] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
// Phase 1: matrix 2604 rows 305 cols
[2023-03-19 01:22:53] [INFO ] Computed 3 place invariants in 20 ms
[2023-03-19 01:22:53] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:22:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-19 01:22:53] [INFO ] After 558ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 01:22:53] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:23:02] [INFO ] After 9082ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-19 01:23:02] [INFO ] After 9709ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 27 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 174 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 174 ms. Remains : 305/305 places, 7808/7808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7808/7808 transitions.
Applied a total of 0 rules in 186 ms. Remains 305 /305 variables (removed 0) and now considering 7808/7808 (removed 0) transitions.
[2023-03-19 01:23:03] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 01:23:03] [INFO ] Invariant cache hit.
[2023-03-19 01:23:03] [INFO ] Implicit Places using invariants in 516 ms returned []
[2023-03-19 01:23:03] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 01:23:03] [INFO ] Invariant cache hit.
[2023-03-19 01:23:04] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:23:05] [INFO ] Implicit Places using invariants and state equation in 2077 ms returned []
Implicit Place search using SMT with State Equation took 2594 ms to find 0 implicit places.
[2023-03-19 01:23:06] [INFO ] Redundant transitions in 843 ms returned []
[2023-03-19 01:23:06] [INFO ] Flow matrix only has 2604 transitions (discarded 5204 similar events)
[2023-03-19 01:23:06] [INFO ] Invariant cache hit.
[2023-03-19 01:23:08] [INFO ] Dead Transitions using invariants and state equation in 2140 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5775 ms. Remains : 305/305 places, 7808/7808 transitions.
Graph (trivial) has 5264 edges and 305 vertex of which 38 / 305 are part of one of the 2 SCC in 0 ms
Free SCC test removed 36 places
Drop transitions removed 4264 transitions
Ensure Unique test removed 1182 transitions
Reduce isomorphic transitions removed 5446 transitions.
Drop transitions removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 0 with 416 rules applied. Total rules applied 417 place count 269 transition count 1946
Applied a total of 417 rules in 121 ms. Remains 269 /305 variables (removed 36) and now considering 1946/7808 (removed 5862) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1946 rows 269 cols
[2023-03-19 01:23:08] [INFO ] Computed 3 place invariants in 13 ms
[2023-03-19 01:23:09] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 01:23:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-19 01:23:09] [INFO ] After 365ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 01:23:09] [INFO ] State equation strengthened by 504 read => feed constraints.
[2023-03-19 01:23:09] [INFO ] After 266ms SMT Verify possible using 504 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 01:23:09] [INFO ] After 329ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-19 01:23:09] [INFO ] After 791ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 191 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 467 ms.
Product exploration explored 100000 steps with 0 reset in 459 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 191 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 01:23:12] [INFO ] Redundant transitions in 780 ms returned []
[2023-03-19 01:23:12] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 01:23:12] [INFO ] Computed 1 place invariants in 15 ms
[2023-03-19 01:23:14] [INFO ] Dead Transitions using invariants and state equation in 1962 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2943 ms. Remains : 305/305 places, 7936/7936 transitions.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 28 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 01:23:14] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:23:14] [INFO ] Invariant cache hit.
[2023-03-19 01:23:14] [INFO ] Implicit Places using invariants in 431 ms returned []
[2023-03-19 01:23:14] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:23:14] [INFO ] Invariant cache hit.
[2023-03-19 01:23:15] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 01:23:22] [INFO ] Implicit Places using invariants and state equation in 7507 ms returned []
Implicit Place search using SMT with State Equation took 7944 ms to find 0 implicit places.
[2023-03-19 01:23:22] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 01:23:22] [INFO ] Invariant cache hit.
[2023-03-19 01:23:24] [INFO ] Dead Transitions using invariants and state equation in 2057 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10032 ms. Remains : 305/305 places, 7936/7936 transitions.
Treatment of property Szymanski-PT-b02-LTLCardinality-02 finished in 94499 ms.
[2023-03-19 01:23:24] [INFO ] Flatten gal took : 196 ms
[2023-03-19 01:23:24] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2023-03-19 01:23:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 305 places, 7936 transitions and 31616 arcs took 46 ms.
Total runtime 331675 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Szymanski-PT-b02
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLCardinality

FORMULA Szymanski-PT-b02-LTLCardinality-02 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679189013648

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 1.000000 secs.
lola: LAUNCH task # 1 (type EXCL) for 0 Szymanski-PT-b02-LTLCardinality-02
lola: time limit : 3599 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Szymanski-PT-b02-LTLCardinality-02: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 4/3599 2/32 Szymanski-PT-b02-LTLCardinality-02 205719 m, 41143 m/sec, 839446 t fired, .

Time elapsed: 5 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 1
lola: FINISHED task # 1 (type EXCL) for Szymanski-PT-b02-LTLCardinality-02
lola: result : false
lola: markings : 253830
lola: fired transitions : 1018923
lola: time used : 5.000000
lola: memory pages used : 2
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Szymanski-PT-b02-LTLCardinality-02: LTL false LTL model checker


Time elapsed: 6 secs. Pages in use: 2

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="Szymanski-PT-b02"
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 Szymanski-PT-b02, 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 r487-tall-167912703100451"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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