Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r132-tall-165271821400804.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is MultiCrashLeafsetExtension-PT-S32C03, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r132-tall-165271821400804
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 18M
-rw-r--r-- 1 mcc users 12K Apr 29 16:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 29 16:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Apr 29 16:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Apr 29 16:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 6.9K May 9 08:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 9 08:17 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 9 08:17 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 9 08:17 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:17 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.6K May 9 08:17 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 18M May 10 09:34 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 MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-00
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-01
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-02
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-03
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-04
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-05
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-06
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-07
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-08
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-09
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-10
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-11
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-12
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-13
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-14
FORMULA_NAME MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652871234018

Running Version 202205111006
[2022-05-18 10:53:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-18 10:53:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-18 10:53:56] [INFO ] Load time of PNML (sax parser for PT used): 808 ms
[2022-05-18 10:53:56] [INFO ] Transformed 15862 places.
[2022-05-18 10:53:56] [INFO ] Transformed 25109 transitions.
[2022-05-18 10:53:56] [INFO ] Parsed PT model containing 15862 places and 25109 transitions in 1041 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 64 out of 15862 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 15862/15862 places, 25109/25109 transitions.
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 15820 transition count 25109
Discarding 3156 places :
Symmetric choice reduction at 1 with 3156 rule applications. Total rules 3198 place count 12664 transition count 21953
Iterating global reduction 1 with 3156 rules applied. Total rules applied 6354 place count 12664 transition count 21953
Discarding 2960 places :
Symmetric choice reduction at 1 with 2960 rule applications. Total rules 9314 place count 9704 transition count 18993
Iterating global reduction 1 with 2960 rules applied. Total rules applied 12274 place count 9704 transition count 18993
Discarding 976 places :
Symmetric choice reduction at 1 with 976 rule applications. Total rules 13250 place count 8728 transition count 16065
Iterating global reduction 1 with 976 rules applied. Total rules applied 14226 place count 8728 transition count 16065
Applied a total of 14226 rules in 8516 ms. Remains 8728 /15862 variables (removed 7134) and now considering 16065/25109 (removed 9044) transitions.
[2022-05-18 10:54:05] [INFO ] Flow matrix only has 15009 transitions (discarded 1056 similar events)
// Phase 1: matrix 15009 rows 8728 cols
[2022-05-18 10:54:06] [INFO ] Computed 1361 place invariants in 999 ms
[2022-05-18 10:54:07] [INFO ] Implicit Places using invariants in 2020 ms returned []
Implicit Place search using SMT only with invariants took 2048 ms to find 0 implicit places.
[2022-05-18 10:54:07] [INFO ] Flow matrix only has 15009 transitions (discarded 1056 similar events)
// Phase 1: matrix 15009 rows 8728 cols
[2022-05-18 10:54:08] [INFO ] Computed 1361 place invariants in 822 ms
[2022-05-18 10:54:08] [INFO ] Dead Transitions using invariants and state equation in 1625 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8728/15862 places, 16065/25109 transitions.
Finished structural reductions, in 1 iterations. Remains : 8728/15862 places, 16065/25109 transitions.
Support contains 64 out of 8728 places after structural reductions.
[2022-05-18 10:54:09] [INFO ] Flatten gal took : 746 ms
[2022-05-18 10:54:10] [INFO ] Flatten gal took : 556 ms
[2022-05-18 10:54:11] [INFO ] Input system was already deterministic with 16065 transitions.
Incomplete random walk after 10000 steps, including 318 resets, run finished after 734 ms. (steps per millisecond=13 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 40 ms. (steps per millisecond=25 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Interrupted probabilistic random walk after 12493 steps, run timeout after 3001 ms. (steps per millisecond=4 ) properties seen :{7=1, 14=1}
Probabilistic random walk after 12493 steps, saw 5949 distinct states, run finished after 3003 ms. (steps per millisecond=4 ) properties seen :2
Running SMT prover for 28 properties.
[2022-05-18 10:54:15] [INFO ] Flow matrix only has 15009 transitions (discarded 1056 similar events)
// Phase 1: matrix 15009 rows 8728 cols
[2022-05-18 10:54:16] [INFO ] Computed 1361 place invariants in 849 ms
[2022-05-18 10:54:20] [INFO ] [Real]Absence check using 63 positive place invariants in 120 ms returned sat
[2022-05-18 10:54:21] [INFO ] [Real]Absence check using 63 positive and 1298 generalized place invariants in 559 ms returned sat
[2022-05-18 10:54:41] [INFO ] After 17025ms SMT Verify possible using state equation in real domain returned unsat :4 sat :18 real:6
[2022-05-18 10:54:41] [INFO ] State equation strengthened by 6146 read => feed constraints.
[2022-05-18 10:54:41] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-18 10:54:41] [INFO ] After 25184ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 28 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 47 out of 8728 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8728/8728 places, 16065/16065 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 8728 transition count 16062
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 8725 transition count 16062
Performed 198 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 198 Pre rules applied. Total rules applied 6 place count 8725 transition count 15864
Deduced a syphon composed of 198 places in 77 ms
Reduce places removed 198 places and 0 transitions.
Iterating global reduction 2 with 396 rules applied. Total rules applied 402 place count 8527 transition count 15864
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 406 place count 8523 transition count 15854
Iterating global reduction 2 with 4 rules applied. Total rules applied 410 place count 8523 transition count 15854
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 411 place count 8522 transition count 15851
Iterating global reduction 2 with 1 rules applied. Total rules applied 412 place count 8522 transition count 15851
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 16 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 482 place count 8487 transition count 15816
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 485 place count 8484 transition count 15813
Iterating global reduction 2 with 3 rules applied. Total rules applied 488 place count 8484 transition count 15813
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 488 place count 8484 transition count 15811
Deduced a syphon composed of 2 places in 15 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 492 place count 8482 transition count 15811
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 495 place count 8479 transition count 15802
Iterating global reduction 2 with 3 rules applied. Total rules applied 498 place count 8479 transition count 15802
Free-agglomeration rule (complex) applied 542 times.
Iterating global reduction 2 with 542 rules applied. Total rules applied 1040 place count 8479 transition count 17196
Reduce places removed 542 places and 0 transitions.
Iterating post reduction 2 with 542 rules applied. Total rules applied 1582 place count 7937 transition count 17196
Partial Free-agglomeration rule applied 96 times.
Drop transitions removed 96 transitions
Iterating global reduction 3 with 96 rules applied. Total rules applied 1678 place count 7937 transition count 17196
Applied a total of 1678 rules in 21077 ms. Remains 7937 /8728 variables (removed 791) and now considering 17196/16065 (removed -1131) transitions.
Finished structural reductions, in 1 iterations. Remains : 7937/8728 places, 17196/16065 transitions.
Incomplete random walk after 10000 steps, including 518 resets, run finished after 654 ms. (steps per millisecond=15 ) properties (out of 24) seen :3
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
[2022-05-18 10:55:03] [INFO ] Flow matrix only has 15669 transitions (discarded 1527 similar events)
// Phase 1: matrix 15669 rows 7937 cols
[2022-05-18 10:55:04] [INFO ] Computed 1361 place invariants in 830 ms
[2022-05-18 10:55:07] [INFO ] [Real]Absence check using 65 positive place invariants in 141 ms returned sat
[2022-05-18 10:55:08] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 495 ms returned sat
[2022-05-18 10:55:27] [INFO ] After 16692ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:19
[2022-05-18 10:55:27] [INFO ] State equation strengthened by 8068 read => feed constraints.
[2022-05-18 10:55:29] [INFO ] After 2146ms SMT Verify possible using 8068 Read/Feed constraints in real domain returned unsat :0 sat :2 real:19
[2022-05-18 10:55:29] [INFO ] After 2149ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2 real:19
Attempting to minimize the solution found.
Minimization took 7 ms.
[2022-05-18 10:55:29] [INFO ] After 25057ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2 real:19
[2022-05-18 10:55:32] [INFO ] [Nat]Absence check using 65 positive place invariants in 148 ms returned sat
[2022-05-18 10:55:33] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 483 ms returned sat
[2022-05-18 10:55:54] [INFO ] After 19009ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :20
[2022-05-18 10:55:54] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-18 10:55:54] [INFO ] After 25040ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2 real:19
Fused 21 Parikh solutions to 12 different solutions.
Parikh walk visited 0 properties in 44 ms.
Support contains 42 out of 7937 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 7937/7937 places, 17196/17196 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 7937 transition count 17195
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 7936 transition count 17195
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 7936 transition count 17193
Deduced a syphon composed of 2 places in 10 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 7934 transition count 17193
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 8 place count 7932 transition count 17191
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 7932 transition count 17191
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 7932 transition count 17191
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 14 place count 7931 transition count 17190
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 7931 transition count 17190
Applied a total of 15 rules in 8013 ms. Remains 7931 /7937 variables (removed 6) and now considering 17190/17196 (removed 6) transitions.
Finished structural reductions, in 1 iterations. Remains : 7931/7937 places, 17190/17196 transitions.
Successfully simplified 4 atomic propositions for a total of 14 simplifications.
FORMULA MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 2712 stabilizing places and 4096 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((X(p0)&&F((G(X(p1))||F(p2))))))))'
Support contains 6 out of 8728 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8728/8728 places, 16065/16065 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 8715 transition count 16044
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 8715 transition count 16044
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 35 place count 8706 transition count 16029
Iterating global reduction 0 with 9 rules applied. Total rules applied 44 place count 8706 transition count 16029
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 50 place count 8700 transition count 16011
Iterating global reduction 0 with 6 rules applied. Total rules applied 56 place count 8700 transition count 16011
Applied a total of 56 rules in 9146 ms. Remains 8700 /8728 variables (removed 28) and now considering 16011/16065 (removed 54) transitions.
[2022-05-18 10:56:12] [INFO ] Flow matrix only has 14955 transitions (discarded 1056 similar events)
// Phase 1: matrix 14955 rows 8700 cols
[2022-05-18 10:56:13] [INFO ] Computed 1361 place invariants in 878 ms
[2022-05-18 10:56:14] [INFO ] Implicit Places using invariants in 1685 ms returned []
Implicit Place search using SMT only with invariants took 1687 ms to find 0 implicit places.
[2022-05-18 10:56:14] [INFO ] Flow matrix only has 14955 transitions (discarded 1056 similar events)
// Phase 1: matrix 14955 rows 8700 cols
[2022-05-18 10:56:15] [INFO ] Computed 1361 place invariants in 812 ms
[2022-05-18 10:56:15] [INFO ] Dead Transitions using invariants and state equation in 1676 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8700/8728 places, 16011/16065 transitions.
Finished structural reductions, in 1 iterations. Remains : 8700/8728 places, 16011/16065 transitions.
Stuttering acceptance computed with spot in 424 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p2) (NOT p1)), true]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}, { cond=(NOT p2), acceptance={} source=3 dest: 5}], [{ cond=(NOT p0), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p2) p1), acceptance={} source=5 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p2:(AND (GEQ s3796 1) (GEQ s6025 1)), p0:(AND (GEQ s2142 1) (GEQ s4386 1)), p1:(AND (GEQ s3396 1) (GEQ s3505 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 33 steps with 0 reset in 5 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-02 finished in 13330 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p1)&&p0)))'
Support contains 5 out of 8728 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8728/8728 places, 16065/16065 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 8728 transition count 16059
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 8722 transition count 16059
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 12 place count 8722 transition count 15858
Deduced a syphon composed of 201 places in 13 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 414 place count 8521 transition count 15858
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 422 place count 8513 transition count 15842
Iterating global reduction 2 with 8 rules applied. Total rules applied 430 place count 8513 transition count 15842
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 430 place count 8513 transition count 15841
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 432 place count 8512 transition count 15841
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 436 place count 8508 transition count 15829
Iterating global reduction 2 with 4 rules applied. Total rules applied 440 place count 8508 transition count 15829
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 13 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 510 place count 8473 transition count 15794
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 516 place count 8467 transition count 15788
Iterating global reduction 2 with 6 rules applied. Total rules applied 522 place count 8467 transition count 15788
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 522 place count 8467 transition count 15784
Deduced a syphon composed of 4 places in 11 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 530 place count 8463 transition count 15784
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 536 place count 8457 transition count 15766
Iterating global reduction 2 with 6 rules applied. Total rules applied 542 place count 8457 transition count 15766
Applied a total of 542 rules in 15775 ms. Remains 8457 /8728 variables (removed 271) and now considering 15766/16065 (removed 299) transitions.
[2022-05-18 10:56:32] [INFO ] Flow matrix only has 14710 transitions (discarded 1056 similar events)
// Phase 1: matrix 14710 rows 8457 cols
[2022-05-18 10:56:32] [INFO ] Computed 1361 place invariants in 796 ms
[2022-05-18 10:56:33] [INFO ] Implicit Places using invariants in 1648 ms returned []
Implicit Place search using SMT only with invariants took 1654 ms to find 0 implicit places.
[2022-05-18 10:56:33] [INFO ] Flow matrix only has 14710 transitions (discarded 1056 similar events)
// Phase 1: matrix 14710 rows 8457 cols
[2022-05-18 10:56:34] [INFO ] Computed 1361 place invariants in 805 ms
[2022-05-18 10:56:35] [INFO ] Dead Transitions using invariants and state equation in 1624 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8457/8728 places, 15766/16065 transitions.
Finished structural reductions, in 1 iterations. Remains : 8457/8728 places, 15766/16065 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s2575 1) (GEQ s7729 1)), p1:(AND (GEQ s3707 1) (GEQ s4341 1) (GEQ s4344 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-03 finished in 19254 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X((G(F(G(p0)))&&(F(G(F(!p0)))||p1))))))'
Support contains 4 out of 8728 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8728/8728 places, 16065/16065 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 8728 transition count 16059
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 8722 transition count 16059
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 12 place count 8722 transition count 15859
Deduced a syphon composed of 200 places in 11 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 412 place count 8522 transition count 15859
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 419 place count 8515 transition count 15844
Iterating global reduction 2 with 7 rules applied. Total rules applied 426 place count 8515 transition count 15844
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 426 place count 8515 transition count 15843
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 428 place count 8514 transition count 15843
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 431 place count 8511 transition count 15834
Iterating global reduction 2 with 3 rules applied. Total rules applied 434 place count 8511 transition count 15834
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 13 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 508 place count 8474 transition count 15797
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 514 place count 8468 transition count 15791
Iterating global reduction 2 with 6 rules applied. Total rules applied 520 place count 8468 transition count 15791
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 520 place count 8468 transition count 15788
Deduced a syphon composed of 3 places in 12 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 526 place count 8465 transition count 15788
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 532 place count 8459 transition count 15770
Iterating global reduction 2 with 6 rules applied. Total rules applied 538 place count 8459 transition count 15770
Applied a total of 538 rules in 15335 ms. Remains 8459 /8728 variables (removed 269) and now considering 15770/16065 (removed 295) transitions.
[2022-05-18 10:56:50] [INFO ] Flow matrix only has 14714 transitions (discarded 1056 similar events)
// Phase 1: matrix 14714 rows 8459 cols
[2022-05-18 10:56:51] [INFO ] Computed 1361 place invariants in 780 ms
[2022-05-18 10:56:52] [INFO ] Implicit Places using invariants in 1628 ms returned []
Implicit Place search using SMT only with invariants took 1631 ms to find 0 implicit places.
[2022-05-18 10:56:52] [INFO ] Flow matrix only has 14714 transitions (discarded 1056 similar events)
// Phase 1: matrix 14714 rows 8459 cols
[2022-05-18 10:56:53] [INFO ] Computed 1361 place invariants in 834 ms
[2022-05-18 10:56:54] [INFO ] Dead Transitions using invariants and state equation in 1617 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8459/8728 places, 15770/16065 transitions.
Finished structural reductions, in 1 iterations. Remains : 8459/8728 places, 15770/16065 transitions.
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND p0 (NOT p1))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s1743 1) (LT s4675 1)), p1:(AND (GEQ s4616 1) (GEQ s4671 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 3 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-04 finished in 18791 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X((X(X(G(X(p0))))||p1))))'
Support contains 3 out of 8728 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8728/8728 places, 16065/16065 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 8715 transition count 16044
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 8715 transition count 16044
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 35 place count 8706 transition count 16027
Iterating global reduction 0 with 9 rules applied. Total rules applied 44 place count 8706 transition count 16027
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 49 place count 8701 transition count 16012
Iterating global reduction 0 with 5 rules applied. Total rules applied 54 place count 8701 transition count 16012
Applied a total of 54 rules in 9117 ms. Remains 8701 /8728 variables (removed 27) and now considering 16012/16065 (removed 53) transitions.
[2022-05-18 10:57:03] [INFO ] Flow matrix only has 14956 transitions (discarded 1056 similar events)
// Phase 1: matrix 14956 rows 8701 cols
[2022-05-18 10:57:04] [INFO ] Computed 1361 place invariants in 797 ms
[2022-05-18 10:57:05] [INFO ] Implicit Places using invariants in 1676 ms returned []
Implicit Place search using SMT only with invariants took 1678 ms to find 0 implicit places.
[2022-05-18 10:57:05] [INFO ] Flow matrix only has 14956 transitions (discarded 1056 similar events)
// Phase 1: matrix 14956 rows 8701 cols
[2022-05-18 10:57:06] [INFO ] Computed 1361 place invariants in 781 ms
[2022-05-18 10:57:06] [INFO ] Dead Transitions using invariants and state equation in 1661 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8701/8728 places, 16012/16065 transitions.
Finished structural reductions, in 1 iterations. Remains : 8701/8728 places, 16012/16065 transitions.
Stuttering acceptance computed with spot in 543 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(LT s4517 1), p0:(OR (LT s869 1) (LT s5875 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3197 reset in 1759 ms.
Product exploration explored 100000 steps with 3199 reset in 1656 ms.
Computed a total of 2685 stabilizing places and 4043 stable transitions
Computed a total of 2685 stabilizing places and 4043 stable transitions
Detected a total of 2685/8701 stabilizing places and 4043/16012 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 230 ms. Reduced automaton from 6 states, 8 edges and 2 AP to 6 states, 8 edges and 2 AP.
Stuttering acceptance computed with spot in 206 ms :[true, (NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 320 resets, run finished after 295 ms. (steps per millisecond=33 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 12899 steps, run timeout after 3001 ms. (steps per millisecond=4 ) properties seen :{}
Probabilistic random walk after 12899 steps, saw 6135 distinct states, run finished after 3003 ms. (steps per millisecond=4 ) properties seen :0
Running SMT prover for 2 properties.
[2022-05-18 10:57:14] [INFO ] Flow matrix only has 14956 transitions (discarded 1056 similar events)
// Phase 1: matrix 14956 rows 8701 cols
[2022-05-18 10:57:15] [INFO ] Computed 1361 place invariants in 782 ms
[2022-05-18 10:57:16] [INFO ] [Real]Absence check using 65 positive place invariants in 118 ms returned sat
[2022-05-18 10:57:17] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 494 ms returned sat
[2022-05-18 10:57:28] [INFO ] After 10963ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2022-05-18 10:57:28] [INFO ] State equation strengthened by 6120 read => feed constraints.
[2022-05-18 10:57:30] [INFO ] After 1907ms SMT Verify possible using 6120 Read/Feed constraints in real domain returned unsat :1 sat :0 real:1
[2022-05-18 10:57:30] [INFO ] After 14805ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2022-05-18 10:57:31] [INFO ] [Nat]Absence check using 65 positive place invariants in 115 ms returned sat
[2022-05-18 10:57:31] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 517 ms returned sat
[2022-05-18 10:57:43] [INFO ] After 11243ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2022-05-18 10:57:44] [INFO ] After 997ms SMT Verify possible using 6120 Read/Feed constraints in natural domain returned unsat :1 sat :1
[2022-05-18 10:57:58] [INFO ] Deduced a trap composed of 796 places in 14187 ms of which 19 ms to minimize.
[2022-05-18 10:57:59] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-18 10:57:59] [INFO ] After 28498ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 15 ms.
Support contains 1 out of 8701 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8701/8701 places, 16012/16012 transitions.
Performed 208 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 208 Pre rules applied. Total rules applied 0 place count 8701 transition count 15804
Deduced a syphon composed of 208 places in 13 ms
Reduce places removed 208 places and 0 transitions.
Iterating global reduction 0 with 416 rules applied. Total rules applied 416 place count 8493 transition count 15804
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 12 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 0 with 68 rules applied. Total rules applied 484 place count 8459 transition count 15770
Free-agglomeration rule (complex) applied 577 times.
Iterating global reduction 0 with 577 rules applied. Total rules applied 1061 place count 8459 transition count 17171
Reduce places removed 577 places and 0 transitions.
Iterating post reduction 0 with 577 rules applied. Total rules applied 1638 place count 7882 transition count 17171
Partial Free-agglomeration rule applied 33 times.
Drop transitions removed 33 transitions
Iterating global reduction 1 with 33 rules applied. Total rules applied 1671 place count 7882 transition count 17171
Applied a total of 1671 rules in 10197 ms. Remains 7882 /8701 variables (removed 819) and now considering 17171/16012 (removed -1159) transitions.
Finished structural reductions, in 1 iterations. Remains : 7882/8701 places, 17171/16012 transitions.
Finished random walk after 837 steps, including 43 resets, run visited all 1 properties in 36 ms. (steps per millisecond=23 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (G p0)]
False Knowledge obtained : [(F (NOT p1))]
Property proved to be true thanks to knowledge :(G p0)
Knowledge based reduction with 6 factoid took 171 ms. Reduced automaton from 6 states, 8 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-05 finished in 75026 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||G(p1))))'
Support contains 3 out of 8728 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8728/8728 places, 16065/16065 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 8728 transition count 16060
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 8723 transition count 16060
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 10 place count 8723 transition count 15859
Deduced a syphon composed of 201 places in 12 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 412 place count 8522 transition count 15859
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 420 place count 8514 transition count 15843
Iterating global reduction 2 with 8 rules applied. Total rules applied 428 place count 8514 transition count 15843
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 428 place count 8514 transition count 15842
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 430 place count 8513 transition count 15842
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 434 place count 8509 transition count 15830
Iterating global reduction 2 with 4 rules applied. Total rules applied 438 place count 8509 transition count 15830
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 16 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 512 place count 8472 transition count 15793
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 517 place count 8467 transition count 15788
Iterating global reduction 2 with 5 rules applied. Total rules applied 522 place count 8467 transition count 15788
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 522 place count 8467 transition count 15785
Deduced a syphon composed of 3 places in 12 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 528 place count 8464 transition count 15785
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 533 place count 8459 transition count 15770
Iterating global reduction 2 with 5 rules applied. Total rules applied 538 place count 8459 transition count 15770
Applied a total of 538 rules in 15467 ms. Remains 8459 /8728 variables (removed 269) and now considering 15770/16065 (removed 295) transitions.
[2022-05-18 10:58:24] [INFO ] Flow matrix only has 14714 transitions (discarded 1056 similar events)
// Phase 1: matrix 14714 rows 8459 cols
[2022-05-18 10:58:25] [INFO ] Computed 1361 place invariants in 794 ms
[2022-05-18 10:58:26] [INFO ] Implicit Places using invariants in 1630 ms returned []
Implicit Place search using SMT only with invariants took 1631 ms to find 0 implicit places.
[2022-05-18 10:58:26] [INFO ] Flow matrix only has 14714 transitions (discarded 1056 similar events)
// Phase 1: matrix 14714 rows 8459 cols
[2022-05-18 10:58:27] [INFO ] Computed 1361 place invariants in 822 ms
[2022-05-18 10:58:28] [INFO ] Dead Transitions using invariants and state equation in 1680 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8459/8728 places, 15770/16065 transitions.
Finished structural reductions, in 1 iterations. Remains : 8459/8728 places, 15770/16065 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p1:(OR (LT s1664 1) (LT s4550 1)), p0:(GEQ s3587 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 4406 reset in 2177 ms.
Product exploration explored 100000 steps with 4407 reset in 2158 ms.
Computed a total of 2476 stabilizing places and 3834 stable transitions
Computed a total of 2476 stabilizing places and 3834 stable transitions
Detected a total of 2476/8459 stabilizing places and 3834/15770 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p0)), true, (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 389 ms. Reduced automaton from 3 states, 6 edges and 2 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 440 resets, run finished after 258 ms. (steps per millisecond=38 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 14077 steps, run timeout after 3001 ms. (steps per millisecond=4 ) properties seen :{}
Probabilistic random walk after 14077 steps, saw 6580 distinct states, run finished after 3001 ms. (steps per millisecond=4 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 10:58:36] [INFO ] Flow matrix only has 14714 transitions (discarded 1056 similar events)
// Phase 1: matrix 14714 rows 8459 cols
[2022-05-18 10:58:37] [INFO ] Computed 1361 place invariants in 793 ms
[2022-05-18 10:58:38] [INFO ] [Real]Absence check using 65 positive place invariants in 138 ms returned sat
[2022-05-18 10:58:38] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 480 ms returned sat
[2022-05-18 10:58:50] [INFO ] After 11167ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-18 10:58:50] [INFO ] State equation strengthened by 6120 read => feed constraints.
[2022-05-18 10:58:50] [INFO ] After 399ms SMT Verify possible using 6120 Read/Feed constraints in real domain returned unsat :1 sat :0
[2022-05-18 10:58:50] [INFO ] After 13225ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p0)), true, (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0)))), (G p1)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G p1)
Knowledge based reduction with 12 factoid took 275 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-07 finished in 41447 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G((p0 U p1))) U p2))'
Support contains 4 out of 8728 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8728/8728 places, 16065/16065 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 8728 transition count 16061
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 8724 transition count 16061
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 8 place count 8724 transition count 15860
Deduced a syphon composed of 201 places in 12 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 410 place count 8523 transition count 15860
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 418 place count 8515 transition count 15844
Iterating global reduction 2 with 8 rules applied. Total rules applied 426 place count 8515 transition count 15844
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 426 place count 8515 transition count 15843
Deduced a syphon composed of 1 places in 14 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 428 place count 8514 transition count 15843
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 432 place count 8510 transition count 15831
Iterating global reduction 2 with 4 rules applied. Total rules applied 436 place count 8510 transition count 15831
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 12 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 510 place count 8473 transition count 15794
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 514 place count 8469 transition count 15790
Iterating global reduction 2 with 4 rules applied. Total rules applied 518 place count 8469 transition count 15790
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 518 place count 8469 transition count 15788
Deduced a syphon composed of 2 places in 12 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 522 place count 8467 transition count 15788
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 526 place count 8463 transition count 15776
Iterating global reduction 2 with 4 rules applied. Total rules applied 530 place count 8463 transition count 15776
Applied a total of 530 rules in 15510 ms. Remains 8463 /8728 variables (removed 265) and now considering 15776/16065 (removed 289) transitions.
[2022-05-18 10:59:06] [INFO ] Flow matrix only has 14720 transitions (discarded 1056 similar events)
// Phase 1: matrix 14720 rows 8463 cols
[2022-05-18 10:59:07] [INFO ] Computed 1361 place invariants in 839 ms
[2022-05-18 10:59:07] [INFO ] Implicit Places using invariants in 1547 ms returned []
Implicit Place search using SMT only with invariants took 1557 ms to find 0 implicit places.
[2022-05-18 10:59:07] [INFO ] Flow matrix only has 14720 transitions (discarded 1056 similar events)
// Phase 1: matrix 14720 rows 8463 cols
[2022-05-18 10:59:08] [INFO ] Computed 1361 place invariants in 828 ms
[2022-05-18 10:59:09] [INFO ] Dead Transitions using invariants and state equation in 1612 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8463/8728 places, 15776/16065 transitions.
Finished structural reductions, in 1 iterations. Remains : 8463/8728 places, 15776/16065 transitions.
Stuttering acceptance computed with spot in 120 ms :[(NOT p2), (NOT p1), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(OR p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(GEQ s4972 1), p1:(LT s4221 1), p0:(AND (GEQ s5418 1) (GEQ s7440 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 4311 reset in 1868 ms.
Product exploration explored 100000 steps with 4314 reset in 1945 ms.
Computed a total of 2480 stabilizing places and 3840 stable transitions
Computed a total of 2480 stabilizing places and 3840 stable transitions
Detected a total of 2480/8463 stabilizing places and 3840/15776 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 495 ms. Reduced automaton from 3 states, 8 edges and 3 AP to 3 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 121 ms :[(NOT p2), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 431 resets, run finished after 389 ms. (steps per millisecond=25 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 47 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2022-05-18 10:59:14] [INFO ] Flow matrix only has 14720 transitions (discarded 1056 similar events)
// Phase 1: matrix 14720 rows 8463 cols
[2022-05-18 10:59:15] [INFO ] Computed 1361 place invariants in 812 ms
[2022-05-18 10:59:17] [INFO ] [Real]Absence check using 65 positive place invariants in 175 ms returned sat
[2022-05-18 10:59:17] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 505 ms returned sat
[2022-05-18 10:59:17] [INFO ] After 2103ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2022-05-18 10:59:18] [INFO ] [Nat]Absence check using 65 positive place invariants in 163 ms returned sat
[2022-05-18 10:59:19] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 501 ms returned sat
[2022-05-18 10:59:30] [INFO ] After 11148ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2022-05-18 10:59:30] [INFO ] State equation strengthened by 6122 read => feed constraints.
[2022-05-18 10:59:32] [INFO ] After 1736ms SMT Verify possible using 6122 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2022-05-18 10:59:35] [INFO ] After 4351ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 922 ms.
[2022-05-18 10:59:36] [INFO ] After 18424ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 8463 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8463/8463 places, 15776/15776 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8463 transition count 15775
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8462 transition count 15775
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 8461 transition count 15774
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 8461 transition count 15774
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 8461 transition count 15773
Deduced a syphon composed of 1 places in 26 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 8460 transition count 15773
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 8459 transition count 15770
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 8459 transition count 15770
Free-agglomeration rule (complex) applied 577 times.
Iterating global reduction 2 with 577 rules applied. Total rules applied 585 place count 8459 transition count 17171
Reduce places removed 577 places and 0 transitions.
Iterating post reduction 2 with 577 rules applied. Total rules applied 1162 place count 7882 transition count 17171
Partial Free-agglomeration rule applied 33 times.
Drop transitions removed 33 transitions
Iterating global reduction 3 with 33 rules applied. Total rules applied 1195 place count 7882 transition count 17171
Applied a total of 1195 rules in 12964 ms. Remains 7882 /8463 variables (removed 581) and now considering 17171/15776 (removed -1395) transitions.
Finished structural reductions, in 1 iterations. Remains : 7882/8463 places, 17171/15776 transitions.
Incomplete random walk after 10000 steps, including 523 resets, run finished after 446 ms. (steps per millisecond=22 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :0
Finished probabilistic random walk after 3034 steps, run visited all 2 properties in 637 ms. (steps per millisecond=4 )
Probabilistic random walk after 3034 steps, saw 1449 distinct states, run finished after 638 ms. (steps per millisecond=4 ) properties seen :2
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0)), (X (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (OR p1 p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p1) p0)))]
False Knowledge obtained : [(F p2), (F (AND (NOT p1) (NOT p0))), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 14 factoid took 615 ms. Reduced automaton from 3 states, 7 edges and 3 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 73 ms :[(NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p2), (NOT p1)]
[2022-05-18 10:59:51] [INFO ] Flow matrix only has 14720 transitions (discarded 1056 similar events)
// Phase 1: matrix 14720 rows 8463 cols
[2022-05-18 10:59:52] [INFO ] Computed 1361 place invariants in 840 ms
Could not prove EG (NOT p2)
Support contains 2 out of 8463 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 8463/8463 places, 15776/15776 transitions.
Applied a total of 0 rules in 3026 ms. Remains 8463 /8463 variables (removed 0) and now considering 15776/15776 (removed 0) transitions.
[2022-05-18 11:00:10] [INFO ] Flow matrix only has 14720 transitions (discarded 1056 similar events)
// Phase 1: matrix 14720 rows 8463 cols
[2022-05-18 11:00:11] [INFO ] Computed 1361 place invariants in 808 ms
[2022-05-18 11:00:11] [INFO ] Implicit Places using invariants in 1651 ms returned []
Implicit Place search using SMT only with invariants took 1654 ms to find 0 implicit places.
[2022-05-18 11:00:11] [INFO ] Flow matrix only has 14720 transitions (discarded 1056 similar events)
// Phase 1: matrix 14720 rows 8463 cols
[2022-05-18 11:00:12] [INFO ] Computed 1361 place invariants in 817 ms
[2022-05-18 11:00:13] [INFO ] Dead Transitions using invariants and state equation in 1684 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8463/8463 places, 15776/15776 transitions.
Computed a total of 2480 stabilizing places and 3840 stable transitions
Computed a total of 2480 stabilizing places and 3840 stable transitions
Detected a total of 2480/8463 stabilizing places and 3840/15776 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge obtained : [(AND (NOT p2) p1), (X (NOT p2)), (X p1), (X (X (NOT p2))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 284 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 78 ms :[(NOT p2), (NOT p1)]
Incomplete random walk after 10000 steps, including 430 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 47 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2022-05-18 11:00:14] [INFO ] Flow matrix only has 14720 transitions (discarded 1056 similar events)
// Phase 1: matrix 14720 rows 8463 cols
[2022-05-18 11:00:15] [INFO ] Computed 1361 place invariants in 821 ms
[2022-05-18 11:00:16] [INFO ] [Real]Absence check using 65 positive place invariants in 157 ms returned sat
[2022-05-18 11:00:16] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 539 ms returned sat
[2022-05-18 11:00:27] [INFO ] After 10742ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2022-05-18 11:00:27] [INFO ] State equation strengthened by 6122 read => feed constraints.
[2022-05-18 11:00:28] [INFO ] After 985ms SMT Verify possible using 6122 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 11:00:28] [INFO ] After 13493ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 11:00:29] [INFO ] [Nat]Absence check using 65 positive place invariants in 153 ms returned sat
[2022-05-18 11:00:30] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 520 ms returned sat
[2022-05-18 11:00:41] [INFO ] After 10957ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 11:00:42] [INFO ] After 1420ms SMT Verify possible using 6122 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-18 11:00:56] [INFO ] Deduced a trap composed of 900 places in 13599 ms of which 8 ms to minimize.
[2022-05-18 11:00:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-05-18 11:00:56] [INFO ] After 28088ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 4 ms.
Support contains 1 out of 8463 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 8463/8463 places, 15776/15776 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8463 transition count 15775
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8462 transition count 15775
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 8461 transition count 15774
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 8461 transition count 15774
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 8461 transition count 15773
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 8460 transition count 15773
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 8459 transition count 15770
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 8459 transition count 15770
Free-agglomeration rule (complex) applied 577 times.
Iterating global reduction 2 with 577 rules applied. Total rules applied 585 place count 8459 transition count 17171
Reduce places removed 577 places and 0 transitions.
Iterating post reduction 2 with 577 rules applied. Total rules applied 1162 place count 7882 transition count 17171
Partial Free-agglomeration rule applied 33 times.
Drop transitions removed 33 transitions
Iterating global reduction 3 with 33 rules applied. Total rules applied 1195 place count 7882 transition count 17171
Applied a total of 1195 rules in 12811 ms. Remains 7882 /8463 variables (removed 581) and now considering 17171/15776 (removed -1395) transitions.
Finished structural reductions, in 1 iterations. Remains : 7882/8463 places, 17171/15776 transitions.
Incomplete random walk after 10000 steps, including 523 resets, run finished after 377 ms. (steps per millisecond=26 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3034 steps, run visited all 1 properties in 604 ms. (steps per millisecond=5 )
Probabilistic random walk after 3034 steps, saw 1449 distinct states, run finished after 605 ms. (steps per millisecond=5 ) properties seen :1
Knowledge obtained : [(AND (NOT p2) p1), (X (NOT p2)), (X p1), (X (X (NOT p2))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F p2), (F (NOT p1))]
Knowledge based reduction with 7 factoid took 299 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 71 ms :[(NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p2), (NOT p1)]
[2022-05-18 11:01:11] [INFO ] Flow matrix only has 14720 transitions (discarded 1056 similar events)
// Phase 1: matrix 14720 rows 8463 cols
[2022-05-18 11:01:11] [INFO ] Computed 1361 place invariants in 796 ms
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 78 ms :[(NOT p2), (NOT p1)]
Product exploration explored 100000 steps with 4313 reset in 1808 ms.
Product exploration explored 100000 steps with 4311 reset in 1816 ms.
Built C files in :
/tmp/ltsmin12665789146272821097
[2022-05-18 11:01:30] [INFO ] Too many transitions (15776) to apply POR reductions. Disabling POR matrices.
[2022-05-18 11:01:30] [INFO ] Built C files in 195ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12665789146272821097
Running compilation step : cd /tmp/ltsmin12665789146272821097;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12665789146272821097;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12665789146272821097;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 8463 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8463/8463 places, 15776/15776 transitions.
Applied a total of 0 rules in 2978 ms. Remains 8463 /8463 variables (removed 0) and now considering 15776/15776 (removed 0) transitions.
[2022-05-18 11:01:36] [INFO ] Flow matrix only has 14720 transitions (discarded 1056 similar events)
// Phase 1: matrix 14720 rows 8463 cols
[2022-05-18 11:01:37] [INFO ] Computed 1361 place invariants in 819 ms
[2022-05-18 11:01:39] [INFO ] Implicit Places using invariants in 2385 ms returned []
Implicit Place search using SMT only with invariants took 2396 ms to find 0 implicit places.
[2022-05-18 11:01:39] [INFO ] Flow matrix only has 14720 transitions (discarded 1056 similar events)
// Phase 1: matrix 14720 rows 8463 cols
[2022-05-18 11:01:40] [INFO ] Computed 1361 place invariants in 815 ms
[2022-05-18 11:01:40] [INFO ] Dead Transitions using invariants and state equation in 1685 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 8463/8463 places, 15776/15776 transitions.
Built C files in :
/tmp/ltsmin18373034424380848811
[2022-05-18 11:01:40] [INFO ] Too many transitions (15776) to apply POR reductions. Disabling POR matrices.
[2022-05-18 11:01:41] [INFO ] Built C files in 175ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18373034424380848811
Running compilation step : cd /tmp/ltsmin18373034424380848811;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18373034424380848811;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin18373034424380848811;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-18 11:01:45] [INFO ] Flatten gal took : 578 ms
[2022-05-18 11:01:46] [INFO ] Flatten gal took : 563 ms
[2022-05-18 11:01:46] [INFO ] Time to serialize gal into /tmp/LTL16021269980787532675.gal : 126 ms
[2022-05-18 11:01:46] [INFO ] Time to serialize properties into /tmp/LTL7360585863734985751.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16021269980787532675.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7360585863734985751.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1602126...267
Read 1 LTL properties
Checking formula 0 : !(((F(G(("((Node26NotifyThatHeIsActive>=1)&&(Node31ThinksNode26ShouldBeNodeMasterToReplaceNode16>=1))")U("(Node17HasTheLeafSetOfRx2ToR...226
Formula 0 simplified : !(FG("((Node26NotifyThatHeIsActive>=1)&&(Node31ThinksNode26ShouldBeNodeMasterToReplaceNode16>=1))" U "(Node17HasTheLeafSetOfRx2ToRep...220
Detected timeout of ITS tools.
[2022-05-18 11:02:02] [INFO ] Flatten gal took : 486 ms
[2022-05-18 11:02:02] [INFO ] Applying decomposition
[2022-05-18 11:02:02] [INFO ] Flatten gal took : 585 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7194363468089491508.txt' '-o' '/tmp/graph7194363468089491508.bin' '-w' '/tmp/graph7194363468089491508.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7194363468089491508.bin' '-l' '-1' '-v' '-w' '/tmp/graph7194363468089491508.weights' '-q' '0' '-e' '0.001'
[2022-05-18 11:02:04] [INFO ] Decomposing Gal with order
[2022-05-18 11:02:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 11:02:09] [INFO ] Removed a total of 13861 redundant transitions.
[2022-05-18 11:02:10] [INFO ] Flatten gal took : 4524 ms
[2022-05-18 11:02:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 9014 labels/synchronizations in 1560 ms.
[2022-05-18 11:02:13] [INFO ] Time to serialize gal into /tmp/LTL16891089257307436249.gal : 153 ms
[2022-05-18 11:02:13] [INFO ] Time to serialize properties into /tmp/LTL9255048718322901609.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16891089257307436249.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9255048718322901609.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1689108...246
Read 1 LTL properties
Checking formula 0 : !(((F(G(("((i16.i2.u423.Node26NotifyThatHeIsActive>=1)&&(i24.u575.Node31ThinksNode26ShouldBeNodeMasterToReplaceNode16>=1))")U("(i0.u66...264
Formula 0 simplified : !(FG("((i16.i2.u423.Node26NotifyThatHeIsActive>=1)&&(i24.u575.Node31ThinksNode26ShouldBeNodeMasterToReplaceNode16>=1))" U "(i0.u664....258
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10683391046057259084
[2022-05-18 11:02:28] [INFO ] Built C files in 123ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10683391046057259084
Running compilation step : cd /tmp/ltsmin10683391046057259084;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10683391046057259084;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10683391046057259084;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-08 finished in 220340 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((F(X(p0))&&p1))||G(X(p2))))'
Support contains 6 out of 8728 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8728/8728 places, 16065/16065 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 8716 transition count 16047
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 8716 transition count 16047
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 33 place count 8707 transition count 16032
Iterating global reduction 0 with 9 rules applied. Total rules applied 42 place count 8707 transition count 16032
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 8701 transition count 16014
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 8701 transition count 16014
Applied a total of 54 rules in 9749 ms. Remains 8701 /8728 variables (removed 27) and now considering 16014/16065 (removed 51) transitions.
[2022-05-18 11:02:41] [INFO ] Flow matrix only has 14958 transitions (discarded 1056 similar events)
// Phase 1: matrix 14958 rows 8701 cols
[2022-05-18 11:02:41] [INFO ] Computed 1361 place invariants in 871 ms
[2022-05-18 11:02:42] [INFO ] Implicit Places using invariants in 1708 ms returned []
Implicit Place search using SMT only with invariants took 1710 ms to find 0 implicit places.
[2022-05-18 11:02:42] [INFO ] Flow matrix only has 14958 transitions (discarded 1056 similar events)
// Phase 1: matrix 14958 rows 8701 cols
[2022-05-18 11:02:43] [INFO ] Computed 1361 place invariants in 863 ms
[2022-05-18 11:02:44] [INFO ] Dead Transitions using invariants and state equation in 1585 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8701/8728 places, 16014/16065 transitions.
Finished structural reductions, in 1 iterations. Remains : 8701/8728 places, 16014/16065 transitions.
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}, { cond=p1, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p2 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (LT s692 1) (LT s8589 1)), p0:(OR (LT s2480 1) (LT s4588 1)), p2:(OR (LT s4467 1) (LT s4471 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 6309 ms.
Product exploration explored 100000 steps with 50000 reset in 6225 ms.
Computed a total of 2685 stabilizing places and 4045 stable transitions
Computed a total of 2685 stabilizing places and 4045 stable transitions
Detected a total of 2685/8701 stabilizing places and 4045/16014 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (AND p1 p2)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND p1 p2))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p1) p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 17 factoid took 312 ms. Reduced automaton from 5 states, 11 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-09 finished in 26134 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)&&X((F(X(p2))&&p1))))))'
Support contains 6 out of 8728 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8728/8728 places, 16065/16065 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 8728 transition count 16059
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 8722 transition count 16059
Performed 201 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 201 Pre rules applied. Total rules applied 12 place count 8722 transition count 15858
Deduced a syphon composed of 201 places in 13 ms
Reduce places removed 201 places and 0 transitions.
Iterating global reduction 2 with 402 rules applied. Total rules applied 414 place count 8521 transition count 15858
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 422 place count 8513 transition count 15842
Iterating global reduction 2 with 8 rules applied. Total rules applied 430 place count 8513 transition count 15842
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 430 place count 8513 transition count 15841
Deduced a syphon composed of 1 places in 12 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 432 place count 8512 transition count 15841
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 436 place count 8508 transition count 15829
Iterating global reduction 2 with 4 rules applied. Total rules applied 440 place count 8508 transition count 15829
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 14 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 514 place count 8471 transition count 15792
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 520 place count 8465 transition count 15786
Iterating global reduction 2 with 6 rules applied. Total rules applied 526 place count 8465 transition count 15786
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 526 place count 8465 transition count 15782
Deduced a syphon composed of 4 places in 11 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 534 place count 8461 transition count 15782
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 540 place count 8455 transition count 15764
Iterating global reduction 2 with 6 rules applied. Total rules applied 546 place count 8455 transition count 15764
Applied a total of 546 rules in 15930 ms. Remains 8455 /8728 variables (removed 273) and now considering 15764/16065 (removed 301) transitions.
[2022-05-18 11:03:13] [INFO ] Flow matrix only has 14708 transitions (discarded 1056 similar events)
// Phase 1: matrix 14708 rows 8455 cols
[2022-05-18 11:03:14] [INFO ] Computed 1361 place invariants in 790 ms
[2022-05-18 11:03:14] [INFO ] Implicit Places using invariants in 1481 ms returned []
Implicit Place search using SMT only with invariants took 1482 ms to find 0 implicit places.
[2022-05-18 11:03:14] [INFO ] Flow matrix only has 14708 transitions (discarded 1056 similar events)
// Phase 1: matrix 14708 rows 8455 cols
[2022-05-18 11:03:15] [INFO ] Computed 1361 place invariants in 815 ms
[2022-05-18 11:03:16] [INFO ] Dead Transitions using invariants and state equation in 1502 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8455/8728 places, 15764/16065 transitions.
Finished structural reductions, in 1 iterations. Remains : 8455/8728 places, 15764/16065 transitions.
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 2}, { cond=p0, acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s3129 1) (GEQ s3813 1)), p1:(AND (GEQ s6332 1) (GEQ s7472 1)), p2:(OR (LT s2269 1) (LT s8165 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-10 finished in 19217 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G(X(F(p1)))))'
Support contains 6 out of 8728 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8728/8728 places, 16065/16065 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 8714 transition count 16043
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 8714 transition count 16043
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 38 place count 8704 transition count 16025
Iterating global reduction 0 with 10 rules applied. Total rules applied 48 place count 8704 transition count 16025
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 54 place count 8698 transition count 16007
Iterating global reduction 0 with 6 rules applied. Total rules applied 60 place count 8698 transition count 16007
Applied a total of 60 rules in 9089 ms. Remains 8698 /8728 variables (removed 30) and now considering 16007/16065 (removed 58) transitions.
[2022-05-18 11:03:25] [INFO ] Flow matrix only has 14951 transitions (discarded 1056 similar events)
// Phase 1: matrix 14951 rows 8698 cols
[2022-05-18 11:03:26] [INFO ] Computed 1361 place invariants in 775 ms
[2022-05-18 11:03:27] [INFO ] Implicit Places using invariants in 1486 ms returned []
Implicit Place search using SMT only with invariants took 1486 ms to find 0 implicit places.
[2022-05-18 11:03:27] [INFO ] Flow matrix only has 14951 transitions (discarded 1056 similar events)
// Phase 1: matrix 14951 rows 8698 cols
[2022-05-18 11:03:27] [INFO ] Computed 1361 place invariants in 753 ms
[2022-05-18 11:03:28] [INFO ] Dead Transitions using invariants and state equation in 1454 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8698/8728 places, 16007/16065 transitions.
Finished structural reductions, in 1 iterations. Remains : 8698/8728 places, 16007/16065 transitions.
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s2094 1) (GEQ s4384 1)) (AND (GEQ s2271 1) (GEQ s2893 1))), p1:(OR (LT s4014 1) (LT s6759 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3195 reset in 1813 ms.
Product exploration explored 100000 steps with 3197 reset in 1848 ms.
Computed a total of 2682 stabilizing places and 4038 stable transitions
Computed a total of 2682 stabilizing places and 4038 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), true, (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 173 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 56 ms :[(NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 320 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 13069 steps, run timeout after 3001 ms. (steps per millisecond=4 ) properties seen :{}
Probabilistic random walk after 13069 steps, saw 6224 distinct states, run finished after 3001 ms. (steps per millisecond=4 ) properties seen :0
Running SMT prover for 1 properties.
[2022-05-18 11:03:35] [INFO ] Flow matrix only has 14951 transitions (discarded 1056 similar events)
// Phase 1: matrix 14951 rows 8698 cols
[2022-05-18 11:03:36] [INFO ] Computed 1361 place invariants in 799 ms
[2022-05-18 11:03:37] [INFO ] [Real]Absence check using 65 positive place invariants in 107 ms returned sat
[2022-05-18 11:03:38] [INFO ] [Real]Absence check using 65 positive and 1296 generalized place invariants in 441 ms returned sat
[2022-05-18 11:03:48] [INFO ] After 11995ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-18 11:03:49] [INFO ] [Nat]Absence check using 65 positive place invariants in 107 ms returned sat
[2022-05-18 11:03:50] [INFO ] [Nat]Absence check using 65 positive and 1296 generalized place invariants in 436 ms returned sat
[2022-05-18 11:04:00] [INFO ] After 10167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-18 11:04:00] [INFO ] State equation strengthened by 6118 read => feed constraints.
[2022-05-18 11:04:00] [INFO ] After 342ms SMT Verify possible using 6118 Read/Feed constraints in natural domain returned unsat :1 sat :0
[2022-05-18 11:04:00] [INFO ] After 12002ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), true, (X (X p1)), (G p1)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(G p1)
Knowledge based reduction with 6 factoid took 139 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-11 finished in 44338 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F((G(F(p0))||p1)))))))'
Support contains 4 out of 8728 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8728/8728 places, 16065/16065 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 8714 transition count 16043
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 8714 transition count 16043
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 38 place count 8704 transition count 16025
Iterating global reduction 0 with 10 rules applied. Total rules applied 48 place count 8704 transition count 16025
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 54 place count 8698 transition count 16007
Iterating global reduction 0 with 6 rules applied. Total rules applied 60 place count 8698 transition count 16007
Applied a total of 60 rules in 9158 ms. Remains 8698 /8728 variables (removed 30) and now considering 16007/16065 (removed 58) transitions.
[2022-05-18 11:04:10] [INFO ] Flow matrix only has 14951 transitions (discarded 1056 similar events)
// Phase 1: matrix 14951 rows 8698 cols
[2022-05-18 11:04:10] [INFO ] Computed 1361 place invariants in 821 ms
[2022-05-18 11:04:11] [INFO ] Implicit Places using invariants in 1587 ms returned []
Implicit Place search using SMT only with invariants took 1591 ms to find 0 implicit places.
[2022-05-18 11:04:11] [INFO ] Flow matrix only has 14951 transitions (discarded 1056 similar events)
// Phase 1: matrix 14951 rows 8698 cols
[2022-05-18 11:04:12] [INFO ] Computed 1361 place invariants in 731 ms
[2022-05-18 11:04:13] [INFO ] Dead Transitions using invariants and state equation in 1523 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 8698/8728 places, 16007/16065 transitions.
Finished structural reductions, in 1 iterations. Remains : 8698/8728 places, 16007/16065 transitions.
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s5365 1) (GEQ s6584 1)), p0:(AND (GEQ s1954 1) (GEQ s7235 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 30 steps with 0 reset in 2 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-13 finished in 12604 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 8728 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8728/8728 places, 16065/16065 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 8728 transition count 16059
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 8722 transition count 16059
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 200 Pre rules applied. Total rules applied 12 place count 8722 transition count 15859
Deduced a syphon composed of 200 places in 12 ms
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 2 with 400 rules applied. Total rules applied 412 place count 8522 transition count 15859
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 419 place count 8515 transition count 15844
Iterating global reduction 2 with 7 rules applied. Total rules applied 426 place count 8515 transition count 15844
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 426 place count 8515 transition count 15843
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 428 place count 8514 transition count 15843
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 431 place count 8511 transition count 15834
Iterating global reduction 2 with 3 rules applied. Total rules applied 434 place count 8511 transition count 15834
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 12 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 508 place count 8474 transition count 15797
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 514 place count 8468 transition count 15791
Iterating global reduction 2 with 6 rules applied. Total rules applied 520 place count 8468 transition count 15791
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 520 place count 8468 transition count 15788
Deduced a syphon composed of 3 places in 11 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 526 place count 8465 transition count 15788
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 532 place count 8459 transition count 15770
Iterating global reduction 2 with 6 rules applied. Total rules applied 538 place count 8459 transition count 15770
Applied a total of 538 rules in 15297 ms. Remains 8459 /8728 variables (removed 269) and now considering 15770/16065 (removed 295) transitions.
[2022-05-18 11:04:28] [INFO ] Flow matrix only has 14714 transitions (discarded 1056 similar events)
// Phase 1: matrix 14714 rows 8459 cols
[2022-05-18 11:04:29] [INFO ] Computed 1361 place invariants in 770 ms
[2022-05-18 11:04:30] [INFO ] Implicit Places using invariants in 1647 ms returned []
Implicit Place search using SMT only with invariants took 1651 ms to find 0 implicit places.
[2022-05-18 11:04:30] [INFO ] Flow matrix only has 14714 transitions (discarded 1056 similar events)
// Phase 1: matrix 14714 rows 8459 cols
[2022-05-18 11:04:31] [INFO ] Computed 1361 place invariants in 739 ms
[2022-05-18 11:04:32] [INFO ] Dead Transitions using invariants and state equation in 1586 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8459/8728 places, 15770/16065 transitions.
Finished structural reductions, in 1 iterations. Remains : 8459/8728 places, 15770/16065 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s4279 1) (GEQ s4337 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 1 ms.
FORMULA MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MultiCrashLeafsetExtension-PT-S32C03-LTLFireability-15 finished in 18626 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(G((p0 U p1))) U p2))'
[2022-05-18 11:04:32] [INFO ] Flatten gal took : 496 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14429235840134410369
[2022-05-18 11:04:33] [INFO ] Too many transitions (16065) to apply POR reductions. Disabling POR matrices.
[2022-05-18 11:04:33] [INFO ] Built C files in 109ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14429235840134410369
Running compilation step : cd /tmp/ltsmin14429235840134410369;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-18 11:04:33] [INFO ] Applying decomposition
[2022-05-18 11:04:33] [INFO ] Flatten gal took : 469 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14665322689041503262.txt' '-o' '/tmp/graph14665322689041503262.bin' '-w' '/tmp/graph14665322689041503262.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14665322689041503262.bin' '-l' '-1' '-v' '-w' '/tmp/graph14665322689041503262.weights' '-q' '0' '-e' '0.001'
[2022-05-18 11:04:34] [INFO ] Decomposing Gal with order
[2022-05-18 11:04:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-18 11:04:39] [INFO ] Removed a total of 13223 redundant transitions.
[2022-05-18 11:04:39] [INFO ] Flatten gal took : 2463 ms
[2022-05-18 11:04:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 8745 labels/synchronizations in 1060 ms.
[2022-05-18 11:04:41] [INFO ] Time to serialize gal into /tmp/LTLFireability15151283346692349008.gal : 85 ms
[2022-05-18 11:04:41] [INFO ] Time to serialize properties into /tmp/LTLFireability17615992991670210677.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15151283346692349008.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17615992991670210677.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...269
Read 1 LTL properties
Checking formula 0 : !(((F(G(("((i27.i1.u522.Node26NotifyThatHeIsActive>=1)&&(i27.i1.u522.Node31ThinksNode26ShouldBeNodeMasterToReplaceNode16>=1))")U("(i4....269
Formula 0 simplified : !(FG("((i27.i1.u522.Node26NotifyThatHeIsActive>=1)&&(i27.i1.u522.Node31ThinksNode26ShouldBeNodeMasterToReplaceNode16>=1))" U "(i4.u3...263
Compilation finished in 152643 ms.
Running link step : cd /tmp/ltsmin14429235840134410369;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 136 ms.
Running LTSmin : cd /tmp/ltsmin14429235840134410369;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '(<>([](((LTLAPp0==true) U (LTLAPp1==true)))) U (LTLAPp2==true))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-18 11:28:21] [INFO ] Flatten gal took : 4419 ms
[2022-05-18 11:28:21] [INFO ] Time to serialize gal into /tmp/LTLFireability7502733883055551621.gal : 248 ms
[2022-05-18 11:28:21] [INFO ] Time to serialize properties into /tmp/LTLFireability16986445474007455808.ltl : 18 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7502733883055551621.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16986445474007455808.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...289
Read 1 LTL properties
Checking formula 0 : !(((F(G(("((Node26NotifyThatHeIsActive>=1)&&(Node31ThinksNode26ShouldBeNodeMasterToReplaceNode16>=1))")U("(Node17HasTheLeafSetOfRx2ToR...226
Formula 0 simplified : !(FG("((Node26NotifyThatHeIsActive>=1)&&(Node31ThinksNode26ShouldBeNodeMasterToReplaceNode16>=1))" U "(Node17HasTheLeafSetOfRx2ToRep...220
Detected timeout of ITS tools.
[2022-05-18 11:51:59] [INFO ] Flatten gal took : 3773 ms
[2022-05-18 11:52:00] [INFO ] Input system was already deterministic with 16065 transitions.
[2022-05-18 11:52:00] [INFO ] Transformed 8728 places.
[2022-05-18 11:52:00] [INFO ] Transformed 16065 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2022-05-18 11:52:36] [INFO ] Time to serialize gal into /tmp/LTLFireability15779965972378527368.gal : 85 ms
[2022-05-18 11:52:36] [INFO ] Time to serialize properties into /tmp/LTLFireability16575570614832072053.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15779965972378527368.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16575570614832072053.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...335
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !(((F(G(("((Node26NotifyThatHeIsActive>=1)&&(Node31ThinksNode26ShouldBeNodeMasterToReplaceNode16>=1))")U("(Node17HasTheLeafSetOfRx2ToR...226
Formula 0 simplified : !(FG("((Node26NotifyThatHeIsActive>=1)&&(Node31ThinksNode26ShouldBeNodeMasterToReplaceNode16>=1))" U "(Node17HasTheLeafSetOfRx2ToRep...220

BK_TIME_CONFINEMENT_REACHED

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="MultiCrashLeafsetExtension-PT-S32C03"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is MultiCrashLeafsetExtension-PT-S32C03, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r132-tall-165271821400804"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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