About the Execution of ITS-Tools for DatabaseWithMutex-PT-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16222.207 | 3600000.00 | 13046559.00 | 32432.70 | FT?FFFFFTFFFFFFF | normal |
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.r060-tall-165254772200572.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 DatabaseWithMutex-PT-10, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r060-tall-165254772200572
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.4M
-rw-r--r-- 1 mcc users 72K Apr 30 05:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 329K Apr 30 05:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 103K Apr 30 05:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 523K Apr 30 05:26 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.7K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 52K May 9 07:35 LTLCardinality.txt
-rw-r--r-- 1 mcc users 171K May 9 07:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 41K May 9 07:35 LTLFireability.txt
-rw-r--r-- 1 mcc users 169K May 9 07:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.4K May 9 07:35 UpperBounds.txt
-rw-r--r-- 1 mcc users 20K May 9 07:35 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 840K May 10 09:33 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 DatabaseWithMutex-PT-10-LTLFireability-00
FORMULA_NAME DatabaseWithMutex-PT-10-LTLFireability-01
FORMULA_NAME DatabaseWithMutex-PT-10-LTLFireability-02
FORMULA_NAME DatabaseWithMutex-PT-10-LTLFireability-03
FORMULA_NAME DatabaseWithMutex-PT-10-LTLFireability-04
FORMULA_NAME DatabaseWithMutex-PT-10-LTLFireability-05
FORMULA_NAME DatabaseWithMutex-PT-10-LTLFireability-06
FORMULA_NAME DatabaseWithMutex-PT-10-LTLFireability-07
FORMULA_NAME DatabaseWithMutex-PT-10-LTLFireability-08
FORMULA_NAME DatabaseWithMutex-PT-10-LTLFireability-09
FORMULA_NAME DatabaseWithMutex-PT-10-LTLFireability-10
FORMULA_NAME DatabaseWithMutex-PT-10-LTLFireability-11
FORMULA_NAME DatabaseWithMutex-PT-10-LTLFireability-12
FORMULA_NAME DatabaseWithMutex-PT-10-LTLFireability-13
FORMULA_NAME DatabaseWithMutex-PT-10-LTLFireability-14
FORMULA_NAME DatabaseWithMutex-PT-10-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652624291784
Running Version 202205111006
[2022-05-15 14:18:12] [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-15 14:18:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-15 14:18:13] [INFO ] Load time of PNML (sax parser for PT used): 153 ms
[2022-05-15 14:18:13] [INFO ] Transformed 830 places.
[2022-05-15 14:18:13] [INFO ] Transformed 800 transitions.
[2022-05-15 14:18:13] [INFO ] Found NUPN structural information;
[2022-05-15 14:18:13] [INFO ] Parsed PT model containing 830 places and 800 transitions in 261 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
[2022-05-15 14:18:13] [INFO ] Reduced 90 identical enabling conditions.
FORMULA DatabaseWithMutex-PT-10-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-10-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-10-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-10-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DatabaseWithMutex-PT-10-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 632 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 39 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 14:18:13] [INFO ] Computed 130 place invariants in 53 ms
[2022-05-15 14:18:13] [INFO ] Implicit Places using invariants in 399 ms returned []
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 14:18:13] [INFO ] Computed 130 place invariants in 24 ms
[2022-05-15 14:18:14] [INFO ] Implicit Places using invariants and state equation in 496 ms returned []
Implicit Place search using SMT with State Equation took 925 ms to find 0 implicit places.
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 14:18:14] [INFO ] Computed 130 place invariants in 47 ms
[2022-05-15 14:18:15] [INFO ] Dead Transitions using invariants and state equation in 938 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 830/830 places, 800/800 transitions.
Support contains 632 out of 830 places after structural reductions.
[2022-05-15 14:18:15] [INFO ] Flatten gal took : 285 ms
[2022-05-15 14:18:15] [INFO ] Flatten gal took : 90 ms
[2022-05-15 14:18:16] [INFO ] Input system was already deterministic with 800 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 377 ms. (steps per millisecond=26 ) properties (out of 21) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 14:18:16] [INFO ] Computed 130 place invariants in 12 ms
[2022-05-15 14:18:16] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2022-05-15 14:18:16] [INFO ] [Real]Absence check using 19 positive and 111 generalized place invariants in 72 ms returned sat
[2022-05-15 14:18:17] [INFO ] After 358ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2022-05-15 14:18:17] [INFO ] After 504ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 112 ms.
[2022-05-15 14:18:17] [INFO ] After 917ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :2
Finished Parikh walk after 101 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=50 )
Parikh walk visited 2 properties in 13 ms.
FORMULA DatabaseWithMutex-PT-10-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 110 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 47 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 14:18:17] [INFO ] Computed 130 place invariants in 12 ms
[2022-05-15 14:18:18] [INFO ] Implicit Places using invariants in 859 ms returned [19, 36, 51, 52, 65, 67, 75, 79, 95, 106, 112, 115, 138, 145, 146, 165, 186, 189, 217, 218, 220, 230, 243, 245, 251, 252, 258, 260, 269, 272, 278, 295, 300, 326, 330, 332, 345, 350, 357, 360, 385, 399, 407, 414, 415, 416, 431, 436, 440, 447, 452, 466, 471, 474, 490, 497, 504, 507, 540, 563, 565, 567, 573, 577, 578, 580, 582, 589, 593, 596, 598, 603, 609, 626, 642, 659, 666, 668, 683, 684, 686, 693, 701, 703, 706, 708, 710, 722, 723, 737, 755, 760, 764, 766, 777, 780, 797, 802, 804, 817]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 873 ms to find 100 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 730/830 places, 800/800 transitions.
Applied a total of 0 rules in 29 ms. Remains 730 /730 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 730/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (EQ s243 1) (EQ s637 1)) (AND (EQ s4 1) (EQ s470 1)) (AND (EQ s102 1) (EQ s596 1)) (AND (EQ s15 1) (EQ s653 1)) (AND (EQ s127 1) (EQ s579 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][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1072 ms.
Product exploration explored 100000 steps with 50000 reset in 1017 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA DatabaseWithMutex-PT-10-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-01 finished in 3356 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((G(F(p1))&&G(X(p2)))||p0)))'
Support contains 410 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 41 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 14:18:21] [INFO ] Computed 130 place invariants in 8 ms
[2022-05-15 14:18:21] [INFO ] Implicit Places using invariants in 296 ms returned []
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 14:18:21] [INFO ] Computed 130 place invariants in 8 ms
[2022-05-15 14:18:22] [INFO ] Implicit Places using invariants and state equation in 661 ms returned []
Implicit Place search using SMT with State Equation took 970 ms to find 0 implicit places.
[2022-05-15 14:18:22] [INFO ] Redundant transitions in 49 ms returned []
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 14:18:22] [INFO ] Computed 130 place invariants in 10 ms
[2022-05-15 14:18:23] [INFO ] Dead Transitions using invariants and state equation in 913 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 830/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p2 (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(OR (AND (EQ s3 1) (EQ s63 1) (EQ s151 1) (EQ s315 1) (EQ s341 1) (EQ s411 1) (EQ s686 1) (EQ s694 1) (EQ s789 1) (EQ s826 1)) (AND (EQ s28 1) (EQ s29 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2853 reset in 2177 ms.
Product exploration explored 100000 steps with 2840 reset in 2197 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0)))), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 458 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 67 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Finished random walk after 2999 steps, including 0 resets, run visited all 4 properties in 31 ms. (steps per millisecond=96 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0)))), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p2 (NOT p0))), (F (AND p2 (NOT p0) (NOT p1))), (F (NOT (AND (NOT p2) (NOT p0))))]
Knowledge based reduction with 9 factoid took 425 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 79 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 14:18:29] [INFO ] Computed 130 place invariants in 12 ms
[2022-05-15 14:18:33] [INFO ] [Real]Absence check using 19 positive place invariants in 26 ms returned sat
[2022-05-15 14:18:34] [INFO ] [Real]Absence check using 19 positive and 111 generalized place invariants in 1403 ms returned sat
[2022-05-15 14:18:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 14:18:44] [INFO ] [Real]Absence check using state equation in 9745 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p2))
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 14:18:44] [INFO ] Computed 130 place invariants in 10 ms
[2022-05-15 14:18:46] [INFO ] [Real]Absence check using 19 positive place invariants in 16 ms returned sat
[2022-05-15 14:18:48] [INFO ] [Real]Absence check using 19 positive and 111 generalized place invariants in 1304 ms returned sat
[2022-05-15 14:18:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 14:18:59] [INFO ] [Real]Absence check using state equation in 11632 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 410 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 32 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 14:18:59] [INFO ] Computed 130 place invariants in 7 ms
[2022-05-15 14:18:59] [INFO ] Implicit Places using invariants in 318 ms returned []
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 14:18:59] [INFO ] Computed 130 place invariants in 7 ms
[2022-05-15 14:19:00] [INFO ] Implicit Places using invariants and state equation in 718 ms returned []
Implicit Place search using SMT with State Equation took 1037 ms to find 0 implicit places.
[2022-05-15 14:19:00] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 14:19:00] [INFO ] Computed 130 place invariants in 10 ms
[2022-05-15 14:19:01] [INFO ] Dead Transitions using invariants and state equation in 909 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 830/830 places, 800/800 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0)))), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 250 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 66 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Finished random walk after 248 steps, including 0 resets, run visited all 4 properties in 9 ms. (steps per millisecond=27 )
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0)))), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p2 (NOT p0))), (F (AND p2 (NOT p0) (NOT p1))), (F (NOT (AND (NOT p2) (NOT p0))))]
Knowledge based reduction with 9 factoid took 338 ms. Reduced automaton from 2 states, 4 edges and 3 AP to 2 states, 4 edges and 3 AP.
Stuttering acceptance computed with spot in 71 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 92 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 14:19:02] [INFO ] Computed 130 place invariants in 12 ms
[2022-05-15 14:19:06] [INFO ] [Real]Absence check using 19 positive place invariants in 15 ms returned sat
[2022-05-15 14:19:08] [INFO ] [Real]Absence check using 19 positive and 111 generalized place invariants in 1393 ms returned sat
[2022-05-15 14:19:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 14:19:18] [INFO ] [Real]Absence check using state equation in 9744 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p2))
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 14:19:18] [INFO ] Computed 130 place invariants in 14 ms
[2022-05-15 14:19:20] [INFO ] [Real]Absence check using 19 positive place invariants in 14 ms returned sat
[2022-05-15 14:19:21] [INFO ] [Real]Absence check using 19 positive and 111 generalized place invariants in 1258 ms returned sat
[2022-05-15 14:19:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 14:19:33] [INFO ] [Real]Absence check using state equation in 11779 ms returned unknown
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 76 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2853 reset in 2141 ms.
Product exploration explored 100000 steps with 2844 reset in 2166 ms.
Built C files in :
/tmp/ltsmin12344568085757946392
[2022-05-15 14:19:37] [INFO ] Computing symmetric may disable matrix : 800 transitions.
[2022-05-15 14:19:37] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 14:19:37] [INFO ] Computing symmetric may enable matrix : 800 transitions.
[2022-05-15 14:19:37] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 14:19:37] [INFO ] Computing Do-Not-Accords matrix : 800 transitions.
[2022-05-15 14:19:37] [INFO ] Computation of Completed DNA matrix. took 33 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 14:19:37] [INFO ] Built C files in 229ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12344568085757946392
Running compilation step : cd /tmp/ltsmin12344568085757946392;'/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'
Compilation finished in 2799 ms.
Running link step : cd /tmp/ltsmin12344568085757946392;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin12344568085757946392;'/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' '--hoa' '/tmp/stateBased3342205615979480108.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 410 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 35 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 14:19:52] [INFO ] Computed 130 place invariants in 5 ms
[2022-05-15 14:19:52] [INFO ] Implicit Places using invariants in 276 ms returned []
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 14:19:52] [INFO ] Computed 130 place invariants in 10 ms
[2022-05-15 14:19:53] [INFO ] Implicit Places using invariants and state equation in 919 ms returned []
Implicit Place search using SMT with State Equation took 1197 ms to find 0 implicit places.
[2022-05-15 14:19:53] [INFO ] Redundant transitions in 15 ms returned []
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 14:19:53] [INFO ] Computed 130 place invariants in 5 ms
[2022-05-15 14:19:54] [INFO ] Dead Transitions using invariants and state equation in 926 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 830/830 places, 800/800 transitions.
Built C files in :
/tmp/ltsmin4135357096603470306
[2022-05-15 14:19:54] [INFO ] Computing symmetric may disable matrix : 800 transitions.
[2022-05-15 14:19:54] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 14:19:54] [INFO ] Computing symmetric may enable matrix : 800 transitions.
[2022-05-15 14:19:54] [INFO ] Computation of Complete enable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 14:19:54] [INFO ] Computing Do-Not-Accords matrix : 800 transitions.
[2022-05-15 14:19:54] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 14:19:54] [INFO ] Built C files in 156ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4135357096603470306
Running compilation step : cd /tmp/ltsmin4135357096603470306;'/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'
Compilation finished in 2543 ms.
Running link step : cd /tmp/ltsmin4135357096603470306;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin4135357096603470306;'/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' '--hoa' '/tmp/stateBased10799918736461844394.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-15 14:20:09] [INFO ] Flatten gal took : 57 ms
[2022-05-15 14:20:10] [INFO ] Flatten gal took : 48 ms
[2022-05-15 14:20:10] [INFO ] Time to serialize gal into /tmp/LTL10214645957668298677.gal : 10 ms
[2022-05-15 14:20:10] [INFO ] Time to serialize properties into /tmp/LTL9734292546436647189.ltl : 3 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/LTL10214645957668298677.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9734292546436647189.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/LTL1021464...267
Read 1 LTL properties
Checking formula 0 : !((F(("(((((((MesBuffReply_7_8==1)||(MesBuffReply_6_7==1))||((MesBuffReply_2_8==1)||(MesBuffReply_1_1==1)))||(((MesBuffReply_3_6==1)||...30505
Formula 0 simplified : !F("(((((((MesBuffReply_7_8==1)||(MesBuffReply_6_7==1))||((MesBuffReply_2_8==1)||(MesBuffReply_1_1==1)))||(((MesBuffReply_3_6==1)||(...30485
Detected timeout of ITS tools.
[2022-05-15 14:20:25] [INFO ] Flatten gal took : 48 ms
[2022-05-15 14:20:25] [INFO ] Applying decomposition
[2022-05-15 14:20:25] [INFO ] Flatten gal took : 104 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/graph10823720512502130298.txt' '-o' '/tmp/graph10823720512502130298.bin' '-w' '/tmp/graph10823720512502130298.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10823720512502130298.bin' '-l' '-1' '-v' '-w' '/tmp/graph10823720512502130298.weights' '-q' '0' '-e' '0.001'
[2022-05-15 14:20:25] [INFO ] Decomposing Gal with order
[2022-05-15 14:20:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 14:20:25] [INFO ] Removed a total of 1689 redundant transitions.
[2022-05-15 14:20:25] [INFO ] Flatten gal took : 164 ms
[2022-05-15 14:20:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 18 ms.
[2022-05-15 14:20:25] [INFO ] Time to serialize gal into /tmp/LTL424474165429433596.gal : 11 ms
[2022-05-15 14:20:25] [INFO ] Time to serialize properties into /tmp/LTL3695997962149796916.ltl : 6 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/LTL424474165429433596.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3695997962149796916.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/LTL4244741...244
Read 1 LTL properties
Checking formula 0 : !((F(("(((((((i10.u117.MesBuffReply_7_8==1)||(i24.u78.MesBuffReply_6_7==1))||((i20.u46.MesBuffReply_2_8==1)||(i16.u2.MesBuffReply_1_1=...41418
Formula 0 simplified : !F("(((((((i10.u117.MesBuffReply_7_8==1)||(i24.u78.MesBuffReply_6_7==1))||((i20.u46.MesBuffReply_2_8==1)||(i16.u2.MesBuffReply_1_1==...41398
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4036445017339053912
[2022-05-15 14:20:40] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4036445017339053912
Running compilation step : cd /tmp/ltsmin4036445017339053912;'/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'
Compilation finished in 1504 ms.
Running link step : cd /tmp/ltsmin4036445017339053912;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin4036445017339053912;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((([](<>((LTLAPp1==true)))&&[](X((LTLAPp2==true))))||(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-02 finished in 154747 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((G((G(p1)&&(F(p2)||G(p2))))&&p0))))'
Support contains 210 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 17 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 14:20:56] [INFO ] Computed 130 place invariants in 10 ms
[2022-05-15 14:20:56] [INFO ] Implicit Places using invariants in 931 ms returned [19, 36, 51, 52, 65, 67, 75, 79, 95, 106, 112, 115, 138, 145, 146, 165, 186, 189, 217, 218, 220, 230, 243, 245, 251, 252, 258, 260, 269, 272, 278, 295, 300, 326, 330, 332, 345, 350, 357, 360, 385, 399, 407, 414, 415, 416, 431, 436, 440, 447, 452, 466, 471, 474, 490, 497, 504, 507, 540, 563, 565, 567, 573, 577, 578, 580, 582, 589, 593, 596, 598, 603, 609, 626, 642, 659, 666, 668, 683, 684, 686, 693, 701, 703, 706, 708, 710, 722, 723, 737, 755, 760, 764, 766, 777, 780, 797, 802, 804, 817]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 934 ms to find 100 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 730/830 places, 800/800 transitions.
Applied a total of 0 rules in 11 ms. Remains 730 /730 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 730/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (OR (EQ s310 0) (EQ s592 0)) (OR (EQ s189 0) (EQ s388 0)) (OR (EQ s592 0) (EQ s709 0)) (OR (EQ s51 0) (EQ s271 0)) (OR (EQ s23 0) (EQ s592 0)) (OR...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 545 reset in 794 ms.
Product exploration explored 100000 steps with 493 reset in 840 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p2)), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 907 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 8 edges and 3 AP.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 292 ms. (steps per millisecond=34 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 800 rows 730 cols
[2022-05-15 14:21:00] [INFO ] Computed 30 place invariants in 19 ms
[2022-05-15 14:21:01] [INFO ] After 114ms 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 p0 p1 p2), (X (NOT (AND p0 p1 (NOT p2)))), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p2)), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X p1)), (G (NOT (AND p0 (NOT p2) p1)))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (AND (NOT p2) p1)), (F (OR (NOT p0) (NOT p1))), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 11 factoid took 461 ms. Reduced automaton from 4 states, 8 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 186 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p2))]
Support contains 210 out of 730 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 730/730 places, 800/800 transitions.
Applied a total of 0 rules in 11 ms. Remains 730 /730 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 730 cols
[2022-05-15 14:21:01] [INFO ] Computed 30 place invariants in 23 ms
[2022-05-15 14:21:02] [INFO ] Implicit Places using invariants in 717 ms returned []
// Phase 1: matrix 800 rows 730 cols
[2022-05-15 14:21:02] [INFO ] Computed 30 place invariants in 16 ms
[2022-05-15 14:23:42] [INFO ] Performed 379/730 implicitness test of which 0 returned IMPLICIT in 159 seconds.
[2022-05-15 14:23:42] [INFO ] Timeout of Implicit test with SMT after 159 seconds.
[2022-05-15 14:23:42] [INFO ] Implicit Places using invariants and state equation in 160047 ms returned []
Implicit Place search using SMT with State Equation took 160774 ms to find 0 implicit places.
// Phase 1: matrix 800 rows 730 cols
[2022-05-15 14:23:42] [INFO ] Computed 30 place invariants in 11 ms
[2022-05-15 14:23:44] [INFO ] Dead Transitions using invariants and state equation in 1366 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 730/730 places, 800/800 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 303 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 253 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p2))]
Finished random walk after 34 steps, including 0 resets, run visited all 5 properties in 5 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p1)), (X (NOT (OR (NOT p0) (NOT p1)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 p1))), (X (X (NOT (OR (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (AND (NOT p2) p1)), (F (NOT p1)), (F (OR (NOT p0) (NOT p1))), (F (NOT p2)), (F (NOT (AND p0 p1)))]
Knowledge based reduction with 7 factoid took 367 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 4 states, 7 edges and 3 AP.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 174 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 600 reset in 767 ms.
Product exploration explored 100000 steps with 609 reset in 780 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 162 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p1) (NOT p2))]
Support contains 210 out of 730 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 730/730 places, 800/800 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 730 transition count 800
Deduced a syphon composed of 100 places in 0 ms
Applied a total of 100 rules in 72 ms. Remains 730 /730 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2022-05-15 14:23:47] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 800 rows 730 cols
[2022-05-15 14:23:47] [INFO ] Computed 30 place invariants in 18 ms
[2022-05-15 14:23:49] [INFO ] Dead Transitions using invariants and state equation in 1273 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 730/730 places, 800/800 transitions.
Finished structural reductions, in 1 iterations. Remains : 730/730 places, 800/800 transitions.
Product exploration explored 100000 steps with 588 reset in 821 ms.
Product exploration explored 100000 steps with 612 reset in 857 ms.
Built C files in :
/tmp/ltsmin13830072088270242548
[2022-05-15 14:23:50] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13830072088270242548
Running compilation step : cd /tmp/ltsmin13830072088270242548;'/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'
Compilation finished in 1421 ms.
Running link step : cd /tmp/ltsmin13830072088270242548;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin13830072088270242548;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13826269790358070980.hoa' '--buchi-type=spotba'
LTSmin run took 650 ms.
FORMULA DatabaseWithMutex-PT-10-LTLFireability-03 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-03 finished in 176975 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(G(!(X(F(X(!p0))) U p1))))))'
Support contains 110 out of 830 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 : 830/830 places, 800/800 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 830 transition count 700
Reduce places removed 110 places and 0 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 1 with 210 rules applied. Total rules applied 310 place count 720 transition count 600
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 2 with 100 rules applied. Total rules applied 410 place count 620 transition count 600
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 410 place count 620 transition count 500
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 610 place count 520 transition count 500
Applied a total of 610 rules in 41 ms. Remains 520 /830 variables (removed 310) and now considering 500/800 (removed 300) transitions.
// Phase 1: matrix 500 rows 520 cols
[2022-05-15 14:23:53] [INFO ] Computed 120 place invariants in 4 ms
[2022-05-15 14:23:53] [INFO ] Implicit Places using invariants in 191 ms returned []
// Phase 1: matrix 500 rows 520 cols
[2022-05-15 14:23:53] [INFO ] Computed 120 place invariants in 7 ms
[2022-05-15 14:23:53] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
[2022-05-15 14:23:53] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 500 rows 520 cols
[2022-05-15 14:23:53] [INFO ] Computed 120 place invariants in 4 ms
[2022-05-15 14:23:54] [INFO ] Dead Transitions using invariants and state equation in 461 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 520/830 places, 500/800 transitions.
Finished structural reductions, in 1 iterations. Remains : 520/830 places, 500/800 transitions.
Stuttering acceptance computed with spot in 32 ms :[p1]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(OR (EQ s222 1) (EQ s127 1) (EQ s244 1) (EQ s430 1) (EQ s54 1) (EQ s23 1) (EQ s310 1) (EQ s105 1) (EQ s487 1) (EQ s18 1) (EQ s327 1) (EQ s372 1) (EQ s4...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 889 ms.
Product exploration explored 100000 steps with 0 reset in 1030 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[p1]
Finished random walk after 78 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=39 )
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 117 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 28 ms :[p1]
Stuttering acceptance computed with spot in 27 ms :[p1]
// Phase 1: matrix 500 rows 520 cols
[2022-05-15 14:23:56] [INFO ] Computed 120 place invariants in 8 ms
[2022-05-15 14:23:57] [INFO ] [Real]Absence check using 9 positive place invariants in 7 ms returned sat
[2022-05-15 14:23:58] [INFO ] [Real]Absence check using 9 positive and 111 generalized place invariants in 1220 ms returned sat
[2022-05-15 14:23:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 14:23:59] [INFO ] [Real]Absence check using state equation in 852 ms returned sat
[2022-05-15 14:23:59] [INFO ] Computed and/alt/rep : 300/1100/300 causal constraints (skipped 100 transitions) in 29 ms.
[2022-05-15 14:23:59] [INFO ] Added : 1 causal constraints over 1 iterations in 142 ms. Result :sat
Could not prove EG p1
Support contains 110 out of 520 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 : 520/520 places, 500/500 transitions.
Applied a total of 0 rules in 15 ms. Remains 520 /520 variables (removed 0) and now considering 500/500 (removed 0) transitions.
// Phase 1: matrix 500 rows 520 cols
[2022-05-15 14:23:59] [INFO ] Computed 120 place invariants in 7 ms
[2022-05-15 14:23:59] [INFO ] Implicit Places using invariants in 209 ms returned []
// Phase 1: matrix 500 rows 520 cols
[2022-05-15 14:23:59] [INFO ] Computed 120 place invariants in 6 ms
[2022-05-15 14:24:00] [INFO ] Implicit Places using invariants and state equation in 388 ms returned []
Implicit Place search using SMT with State Equation took 599 ms to find 0 implicit places.
[2022-05-15 14:24:00] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 500 rows 520 cols
[2022-05-15 14:24:00] [INFO ] Computed 120 place invariants in 4 ms
[2022-05-15 14:24:00] [INFO ] Dead Transitions using invariants and state equation in 489 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 520/520 places, 500/500 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 120 ms :[p1]
Finished random walk after 39 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=19 )
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 1 states, 2 edges and 1 AP to 1 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[p1]
Stuttering acceptance computed with spot in 26 ms :[p1]
// Phase 1: matrix 500 rows 520 cols
[2022-05-15 14:24:01] [INFO ] Computed 120 place invariants in 8 ms
[2022-05-15 14:24:01] [INFO ] [Real]Absence check using 9 positive place invariants in 5 ms returned sat
[2022-05-15 14:24:03] [INFO ] [Real]Absence check using 9 positive and 111 generalized place invariants in 1248 ms returned sat
[2022-05-15 14:24:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 14:24:04] [INFO ] [Real]Absence check using state equation in 871 ms returned sat
[2022-05-15 14:24:04] [INFO ] Computed and/alt/rep : 300/1100/300 causal constraints (skipped 100 transitions) in 34 ms.
[2022-05-15 14:24:04] [INFO ] Added : 1 causal constraints over 1 iterations in 128 ms. Result :sat
Could not prove EG p1
Stuttering acceptance computed with spot in 33 ms :[p1]
Product exploration explored 100000 steps with 0 reset in 921 ms.
Product exploration explored 100000 steps with 0 reset in 964 ms.
Built C files in :
/tmp/ltsmin8221389447178781165
[2022-05-15 14:24:06] [INFO ] Computing symmetric may disable matrix : 500 transitions.
[2022-05-15 14:24:06] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 14:24:06] [INFO ] Computing symmetric may enable matrix : 500 transitions.
[2022-05-15 14:24:06] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 14:24:06] [INFO ] Computing Do-Not-Accords matrix : 500 transitions.
[2022-05-15 14:24:06] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 14:24:06] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8221389447178781165
Running compilation step : cd /tmp/ltsmin8221389447178781165;'/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'
Compilation finished in 1224 ms.
Running link step : cd /tmp/ltsmin8221389447178781165;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin8221389447178781165;'/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' '--hoa' '/tmp/stateBased6610509261777501569.hoa' '--buchi-type=spotba'
LTSmin run took 1226 ms.
FORMULA DatabaseWithMutex-PT-10-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-05 finished in 15823 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 100 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Drop transitions removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 830 transition count 700
Reduce places removed 110 places and 0 transitions.
Drop transitions removed 200 transitions
Trivial Post-agglo rules discarded 200 transitions
Performed 200 trivial Post agglomeration. Transition count delta: 200
Iterating post reduction 1 with 310 rules applied. Total rules applied 410 place count 720 transition count 500
Reduce places removed 200 places and 0 transitions.
Iterating post reduction 2 with 200 rules applied. Total rules applied 610 place count 520 transition count 500
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 610 place count 520 transition count 400
Deduced a syphon composed of 100 places in 1 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 810 place count 420 transition count 400
Applied a total of 810 rules in 39 ms. Remains 420 /830 variables (removed 410) and now considering 400/800 (removed 400) transitions.
// Phase 1: matrix 400 rows 420 cols
[2022-05-15 14:24:08] [INFO ] Computed 120 place invariants in 4 ms
[2022-05-15 14:24:10] [INFO ] Implicit Places using invariants in 1975 ms returned [0, 4, 9, 14, 18, 20, 22, 24, 25, 26, 27, 30, 31, 32, 33, 34, 36, 39, 41, 46, 47, 48, 49, 50, 52, 54, 56, 57, 61, 64, 66, 67, 69, 70, 71, 74, 77, 81, 86, 87, 93, 94, 96, 97, 98, 105, 106, 107, 108, 109, 110, 115, 118, 120, 121, 123, 124, 125, 126, 127, 132, 133, 137, 138, 140, 141, 144, 145, 147, 149, 150, 152, 153, 154, 156, 160, 165, 166, 169, 170, 171, 172, 175, 176, 181, 182, 187, 192, 193, 196, 199, 203, 204, 205, 207, 208, 209, 210, 213, 214, 217, 218, 219, 221, 222, 223, 227, 229, 231, 233, 237, 238, 240, 241, 243, 247, 248, 251, 255, 257, 259, 261, 267, 268, 271, 272, 277, 278, 281, 282, 283, 285, 286, 289, 290, 291, 292, 294, 296, 297, 299, 300, 302, 304, 307, 308, 309, 310, 311, 312, 313, 315, 318, 320, 324, 329, 335, 336, 338, 340, 341, 342, 344, 347, 348, 349, 353, 354, 356, 357, 359, 360, 362, 364, 365, 367, 368, 369, 372, 373, 375, 376, 377, 384, 386, 387, 388, 390, 391, 392, 397, 398, 399, 404, 406, 407, 408, 409, 414, 417]
[2022-05-15 14:24:10] [INFO ] Actually due to overlaps returned [0, 4, 18, 20, 22, 26, 27, 32, 33, 34, 41, 46, 47, 49, 50, 56, 61, 64, 67, 69, 74, 77, 86, 87, 96, 97, 98, 105, 106, 110, 118, 120, 121, 125, 137, 138, 144, 147, 149, 150, 152, 154, 160, 165, 170, 172, 187, 192, 193, 199, 204, 205, 213, 214, 217, 222, 223, 231, 233, 241, 243, 248, 255, 261, 267, 268, 271, 272, 278, 281, 282, 283, 285, 286, 292, 302, 308, 311, 313, 318, 320, 335, 338, 342, 344, 354, 364, 365, 369, 372, 373, 376, 377, 384, 386, 391, 398, 404, 407, 417]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 1983 ms to find 100 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 320/830 places, 400/800 transitions.
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 320 transition count 300
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 220 transition count 300
Applied a total of 200 rules in 9 ms. Remains 220 /320 variables (removed 100) and now considering 300/400 (removed 100) transitions.
// Phase 1: matrix 300 rows 220 cols
[2022-05-15 14:24:10] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-15 14:24:10] [INFO ] Implicit Places using invariants in 93 ms returned []
// Phase 1: matrix 300 rows 220 cols
[2022-05-15 14:24:10] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-15 14:24:11] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 266 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 220/830 places, 300/800 transitions.
Finished structural reductions, in 2 iterations. Remains : 220/830 places, 300/800 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0)]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s143 1) (EQ s160 1) (EQ s178 1) (EQ s121 1) (EQ s161 1) (EQ s174 1) (EQ s124 1) (EQ s205 1) (EQ s56 1) (EQ s42 1) (EQ s11 1) (EQ s95 1) (EQ s21...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 450 ms.
Stack based approach found an accepted trace after 6893 steps with 0 reset with depth 6894 and stack size 6830 in 42 ms.
FORMULA DatabaseWithMutex-PT-10-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-06 finished in 2957 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(F(p1))||p0)))'
Support contains 13 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 20 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 14:24:11] [INFO ] Computed 130 place invariants in 10 ms
[2022-05-15 14:24:12] [INFO ] Implicit Places using invariants in 1060 ms returned [19, 36, 51, 52, 65, 67, 75, 79, 95, 106, 112, 115, 138, 145, 146, 165, 186, 189, 217, 218, 220, 230, 243, 245, 251, 252, 258, 260, 269, 272, 278, 295, 300, 326, 330, 332, 345, 350, 357, 360, 385, 399, 407, 414, 415, 416, 436, 440, 447, 452, 466, 471, 474, 490, 497, 504, 507, 540, 563, 565, 567, 573, 577, 578, 580, 582, 589, 593, 596, 598, 603, 609, 626, 642, 659, 666, 668, 683, 684, 686, 693, 701, 703, 706, 708, 710, 722, 723, 737, 755, 760, 764, 766, 777, 780, 797, 802, 804, 817]
Discarding 99 places :
Implicit Place search using SMT only with invariants took 1063 ms to find 99 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 731/830 places, 800/800 transitions.
Applied a total of 0 rules in 14 ms. Remains 731 /731 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 731/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p1:(EQ s273 0), p0:(OR (EQ s675 0) (AND (EQ s29 1) (EQ s133 1) (EQ s286 1) (EQ s334 1) (EQ s343 1) (EQ s377 1) (EQ s385 1) (EQ s500 1) (EQ s511 1) (EQ s62...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 840 ms.
Product exploration explored 100000 steps with 50000 reset in 838 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 3 factoid took 52 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA DatabaseWithMutex-PT-10-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-08 finished in 2957 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U p1))'
Support contains 12 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Drop transitions removed 189 transitions
Trivial Post-agglo rules discarded 189 transitions
Performed 189 trivial Post agglomeration. Transition count delta: 189
Iterating post reduction 0 with 189 rules applied. Total rules applied 189 place count 830 transition count 611
Reduce places removed 199 places and 0 transitions.
Drop transitions removed 191 transitions
Trivial Post-agglo rules discarded 191 transitions
Performed 191 trivial Post agglomeration. Transition count delta: 191
Iterating post reduction 1 with 390 rules applied. Total rules applied 579 place count 631 transition count 420
Reduce places removed 191 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 2 with 201 rules applied. Total rules applied 780 place count 440 transition count 410
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 790 place count 430 transition count 410
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 100 Pre rules applied. Total rules applied 790 place count 430 transition count 310
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 4 with 200 rules applied. Total rules applied 990 place count 330 transition count 310
Applied a total of 990 rules in 33 ms. Remains 330 /830 variables (removed 500) and now considering 310/800 (removed 490) transitions.
// Phase 1: matrix 310 rows 330 cols
[2022-05-15 14:24:14] [INFO ] Computed 120 place invariants in 2 ms
[2022-05-15 14:24:16] [INFO ] Implicit Places using invariants in 1490 ms returned [0, 4, 7, 11, 14, 15, 17, 18, 19, 20, 23, 24, 26, 27, 29, 31, 33, 38, 39, 40, 41, 42, 44, 46, 48, 49, 51, 52, 53, 54, 56, 58, 59, 61, 65, 69, 70, 74, 75, 76, 77, 78, 85, 86, 87, 88, 89, 93, 94, 95, 96, 97, 98, 100, 101, 102, 105, 106, 108, 109, 111, 112, 115, 117, 119, 120, 122, 123, 124, 125, 129, 131, 132, 133, 134, 135, 136, 139, 140, 144, 145, 149, 150, 151, 154, 157, 160, 161, 162, 164, 165, 166, 167, 169, 170, 173, 174, 175, 177, 178, 179, 180, 181, 183, 186, 187, 188, 189, 191, 193, 194, 196, 199, 200, 202, 204, 207, 210, 211, 215, 216, 218, 219, 220, 221, 222, 225, 226, 227, 228, 230, 232, 233, 235, 236, 237, 238, 240, 241, 242, 243, 244, 245, 248, 250, 252, 254, 259, 263, 264, 265, 267, 268, 269, 271, 273, 274, 275, 279, 282, 283, 284, 285, 286, 289, 290, 291, 292, 294, 295, 296, 297, 298, 302, 304, 306, 308, 310, 311, 312, 315, 316, 317, 319, 320, 321, 322, 323, 326, 328]
[2022-05-15 14:24:16] [INFO ] Actually due to overlaps returned [0, 4, 14, 15, 19, 20, 26, 27, 33, 38, 39, 41, 42, 48, 51, 52, 54, 56, 61, 69, 70, 76, 77, 78, 85, 89, 94, 95, 96, 100, 108, 109, 115, 117, 119, 120, 122, 124, 129, 131, 134, 136, 149, 150, 151, 157, 161, 162, 169, 170, 173, 178, 179, 183, 189, 191, 194, 199, 204, 207, 210, 211, 216, 218, 219, 220, 221, 222, 228, 237, 241, 244, 250, 252, 263, 265, 269, 271, 289, 292, 294, 295, 297, 298, 302, 304, 311, 316, 319, 321, 328, 40, 74, 75, 112, 181, 196, 268, 306, 312]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 1495 ms to find 100 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 230/830 places, 310/800 transitions.
Drop transitions removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 230 transition count 230
Reduce places removed 88 places and 0 transitions.
Graph (trivial) has 179 edges and 142 vertex of which 90 / 142 are part of one of the 10 SCC in 2 ms
Free SCC test removed 80 places
Iterating post reduction 1 with 89 rules applied. Total rules applied 169 place count 62 transition count 230
Ensure Unique test removed 150 transitions
Reduce isomorphic transitions removed 150 transitions.
Iterating post reduction 2 with 150 rules applied. Total rules applied 319 place count 62 transition count 80
Applied a total of 319 rules in 9 ms. Remains 62 /230 variables (removed 168) and now considering 80/310 (removed 230) transitions.
[2022-05-15 14:24:16] [INFO ] Flow matrix only has 71 transitions (discarded 9 similar events)
// Phase 1: matrix 71 rows 62 cols
[2022-05-15 14:24:16] [INFO ] Computed 12 place invariants in 0 ms
[2022-05-15 14:24:16] [INFO ] Implicit Places using invariants in 32 ms returned []
[2022-05-15 14:24:16] [INFO ] Flow matrix only has 71 transitions (discarded 9 similar events)
// Phase 1: matrix 71 rows 62 cols
[2022-05-15 14:24:16] [INFO ] Computed 12 place invariants in 2 ms
[2022-05-15 14:24:16] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 62/830 places, 80/800 transitions.
Finished structural reductions, in 2 iterations. Remains : 62/830 places, 80/800 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), true, p0]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s5 1) (EQ s14 1)), p0:(AND (EQ s0 1) (EQ s10 1) (EQ s18 1) (EQ s22 1) (EQ s25 1) (EQ s28 1) (EQ s39 1) (EQ s44 1) (EQ s53 1) (EQ s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA DatabaseWithMutex-PT-10-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-09 finished in 1789 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((G(!X(p0)) U (p1 U p2))||G(p3)))'
Support contains 15 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 25 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 14:24:16] [INFO ] Computed 130 place invariants in 15 ms
[2022-05-15 14:24:17] [INFO ] Implicit Places using invariants in 1023 ms returned [19, 36, 51, 52, 65, 67, 75, 79, 95, 106, 112, 115, 138, 145, 146, 165, 186, 189, 217, 218, 220, 230, 243, 245, 251, 252, 258, 260, 272, 278, 295, 300, 326, 330, 332, 345, 350, 357, 360, 385, 399, 407, 414, 415, 416, 431, 436, 440, 447, 452, 466, 471, 474, 490, 497, 504, 507, 540, 563, 565, 567, 573, 577, 578, 580, 582, 589, 593, 596, 598, 603, 609, 626, 642, 659, 666, 668, 683, 684, 686, 693, 701, 703, 706, 708, 710, 722, 723, 737, 755, 760, 764, 766, 777, 780, 797, 802, 804, 817]
Discarding 99 places :
Implicit Place search using SMT only with invariants took 1025 ms to find 99 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 731/830 places, 800/800 transitions.
Applied a total of 0 rules in 16 ms. Remains 731 /731 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 731/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 379 ms :[(AND (NOT p2) (NOT p3)), p0, (NOT p2), (AND p0 (NOT p2)), (AND p0 (NOT p3)), (AND p0 (NOT p2) (NOT p3)), true, (NOT p2), (NOT p3), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p3 (NOT p2)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=0 dest: 3}, { cond=(AND p3 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 4}, { cond=(AND p3 (NOT p2) p1), acceptance={} source=0 dest: 5}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p3 (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) p0), acceptance={} source=4 dest: 6}, { cond=(AND p3 p0), acceptance={} source=4 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1) p0), acceptance={} source=5 dest: 6}, { cond=(AND (NOT p3) (NOT p2) p1 p0), acceptance={} source=5 dest: 7}, { cond=(AND p3 (NOT p2) (NOT p1) p0), acceptance={} source=5 dest: 8}, { cond=(AND p3 (NOT p2) p1 p0), acceptance={} source=5 dest: 9}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p2) p1), acceptance={0} source=7 dest: 7}], [{ cond=(NOT p3), acceptance={} source=8 dest: 6}, { cond=p3, acceptance={} source=8 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=9 dest: 6}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=9 dest: 7}, { cond=(AND p3 (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=9 dest: 8}, { cond=(AND p3 (NOT p2) p1 (NOT p0)), acceptance={} source=9 dest: 9}]], initial=0, aps=[p3:(EQ s364 0), p2:(AND (EQ s463 1) (EQ s567 1)), p1:(AND (EQ s507 1) (EQ s714 1)), p0:(AND (EQ s67 1) (EQ s98 1) (EQ s154 1) (EQ s172 1) (EQ s241 1) (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1078 steps with 0 reset in 13 ms.
FORMULA DatabaseWithMutex-PT-10-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-11 finished in 1489 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 10 out of 830 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 830 transition count 601
Reduce places removed 209 places and 0 transitions.
Drop transitions removed 191 transitions
Trivial Post-agglo rules discarded 191 transitions
Performed 191 trivial Post agglomeration. Transition count delta: 191
Iterating post reduction 1 with 400 rules applied. Total rules applied 599 place count 621 transition count 410
Reduce places removed 191 places and 0 transitions.
Iterating post reduction 2 with 191 rules applied. Total rules applied 790 place count 430 transition count 410
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 790 place count 430 transition count 310
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 990 place count 330 transition count 310
Applied a total of 990 rules in 29 ms. Remains 330 /830 variables (removed 500) and now considering 310/800 (removed 490) transitions.
// Phase 1: matrix 310 rows 330 cols
[2022-05-15 14:24:17] [INFO ] Computed 120 place invariants in 2 ms
[2022-05-15 14:24:19] [INFO ] Implicit Places using invariants in 1322 ms returned [0, 4, 7, 11, 13, 14, 15, 17, 18, 19, 20, 23, 24, 25, 26, 27, 29, 31, 37, 38, 39, 40, 41, 43, 45, 47, 48, 50, 51, 52, 53, 55, 56, 57, 60, 63, 64, 68, 69, 73, 74, 75, 76, 77, 83, 84, 85, 86, 87, 88, 92, 93, 95, 97, 98, 99, 100, 101, 104, 105, 107, 108, 110, 111, 114, 115, 116, 118, 119, 121, 122, 124, 128, 131, 132, 133, 134, 135, 138, 139, 143, 144, 148, 150, 151, 155, 158, 160, 161, 162, 164, 165, 166, 167, 169, 171, 174, 175, 176, 178, 180, 181, 182, 184, 185, 187, 188, 189, 190, 191, 193, 194, 196, 199, 200, 204, 207, 208, 211, 215, 216, 218, 219, 220, 221, 222, 226, 227, 228, 229, 232, 234, 235, 237, 238, 239, 240, 242, 243, 244, 245, 247, 248, 250, 252, 254, 256, 260, 264, 265, 266, 268, 269, 270, 272, 275, 276, 277, 280, 281, 283, 285, 286, 287, 288, 290, 291, 292, 293, 296, 297, 298, 299, 300, 304, 306, 307, 308, 310, 311, 312, 315, 317, 319, 320, 321, 322, 323, 326, 328]
[2022-05-15 14:24:19] [INFO ] Actually due to overlaps returned [0, 4, 13, 14, 15, 19, 20, 25, 26, 27, 37, 38, 40, 41, 47, 50, 51, 53, 55, 60, 63, 68, 69, 75, 76, 77, 83, 84, 88, 93, 95, 99, 107, 108, 114, 116, 118, 119, 121, 128, 133, 135, 148, 150, 151, 158, 161, 162, 169, 171, 174, 180, 184, 185, 190, 191, 194, 199, 204, 207, 208, 211, 216, 218, 219, 220, 221, 222, 229, 239, 243, 248, 252, 254, 264, 266, 270, 272, 281, 290, 291, 296, 297, 299, 300, 304, 306, 311, 319, 321, 328, 7, 23, 101, 138, 175, 244, 250, 285, 326]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 1328 ms to find 100 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 230/830 places, 310/800 transitions.
Drop transitions removed 90 transitions
Trivial Post-agglo rules discarded 90 transitions
Performed 90 trivial Post agglomeration. Transition count delta: 90
Iterating post reduction 0 with 90 rules applied. Total rules applied 90 place count 230 transition count 220
Reduce places removed 99 places and 0 transitions.
Graph (trivial) has 190 edges and 131 vertex of which 100 / 131 are part of one of the 10 SCC in 0 ms
Free SCC test removed 90 places
Iterating post reduction 1 with 100 rules applied. Total rules applied 190 place count 41 transition count 220
Ensure Unique test removed 170 transitions
Reduce isomorphic transitions removed 170 transitions.
Iterating post reduction 2 with 170 rules applied. Total rules applied 360 place count 41 transition count 50
Applied a total of 360 rules in 4 ms. Remains 41 /230 variables (removed 189) and now considering 50/310 (removed 260) transitions.
[2022-05-15 14:24:19] [INFO ] Flow matrix only has 41 transitions (discarded 9 similar events)
// Phase 1: matrix 41 rows 41 cols
[2022-05-15 14:24:19] [INFO ] Computed 11 place invariants in 17 ms
[2022-05-15 14:24:19] [INFO ] Implicit Places using invariants in 43 ms returned []
[2022-05-15 14:24:19] [INFO ] Flow matrix only has 41 transitions (discarded 9 similar events)
// Phase 1: matrix 41 rows 41 cols
[2022-05-15 14:24:19] [INFO ] Computed 11 place invariants in 1 ms
[2022-05-15 14:24:19] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 41/830 places, 50/800 transitions.
Finished structural reductions, in 2 iterations. Remains : 41/830 places, 50/800 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s4 1) (EQ s6 1) (EQ s11 1) (EQ s12 1) (EQ s13 1) (EQ s17 1) (EQ s21 1) (EQ s22 1) (EQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA DatabaseWithMutex-PT-10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-12 finished in 1533 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(p0) U G(p1))))))'
Support contains 11 out of 830 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 830/830 places, 800/800 transitions.
Applied a total of 0 rules in 16 ms. Remains 830 /830 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 830 cols
[2022-05-15 14:24:19] [INFO ] Computed 130 place invariants in 14 ms
[2022-05-15 14:24:20] [INFO ] Implicit Places using invariants in 1014 ms returned [19, 36, 51, 52, 65, 67, 75, 79, 95, 106, 112, 115, 138, 145, 146, 165, 186, 189, 217, 218, 220, 230, 243, 245, 251, 252, 258, 260, 269, 272, 278, 295, 300, 326, 330, 332, 345, 350, 357, 360, 385, 399, 407, 414, 415, 416, 431, 436, 440, 447, 452, 466, 471, 474, 490, 497, 504, 507, 540, 563, 565, 567, 573, 577, 578, 580, 582, 589, 593, 596, 598, 603, 609, 626, 642, 659, 666, 668, 683, 684, 686, 693, 701, 703, 706, 708, 710, 722, 723, 737, 755, 760, 764, 766, 777, 780, 797, 802, 817]
Discarding 99 places :
Implicit Place search using SMT only with invariants took 1020 ms to find 99 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 731/830 places, 800/800 transitions.
Applied a total of 0 rules in 11 ms. Remains 731 /731 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 731/830 places, 800/800 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : DatabaseWithMutex-PT-10-LTLFireability-14 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=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s98 1) (EQ s154 1) (EQ s172 1) (EQ s242 1) (EQ s401 1) (EQ s472 1) (EQ s561 1) (EQ s581 1) (EQ s671 1) (EQ s706 1)), p0:(EQ s482 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 281 reset in 444 ms.
Product exploration explored 100000 steps with 249 reset in 493 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 192 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 800 rows 731 cols
[2022-05-15 14:24:22] [INFO ] Computed 31 place invariants in 19 ms
[2022-05-15 14:24:22] [INFO ] [Real]Absence check using 21 positive place invariants in 21 ms returned sat
[2022-05-15 14:24:22] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 30 ms returned sat
[2022-05-15 14:24:22] [INFO ] After 197ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 14:24:22] [INFO ] [Nat]Absence check using 21 positive place invariants in 196 ms returned sat
[2022-05-15 14:24:22] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 46 ms returned sat
[2022-05-15 14:24:47] [INFO ] After 25015ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 10 out of 731 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 731/731 places, 800/800 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 731 transition count 601
Reduce places removed 209 places and 0 transitions.
Drop transitions removed 191 transitions
Trivial Post-agglo rules discarded 191 transitions
Performed 191 trivial Post agglomeration. Transition count delta: 191
Iterating post reduction 1 with 400 rules applied. Total rules applied 599 place count 522 transition count 410
Reduce places removed 191 places and 0 transitions.
Iterating post reduction 2 with 191 rules applied. Total rules applied 790 place count 331 transition count 410
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 790 place count 331 transition count 310
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 990 place count 231 transition count 310
Free-agglomeration rule applied 100 times.
Iterating global reduction 3 with 100 rules applied. Total rules applied 1090 place count 231 transition count 210
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 3 with 100 rules applied. Total rules applied 1190 place count 131 transition count 210
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1191 place count 131 transition count 209
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1192 place count 130 transition count 209
Applied a total of 1192 rules in 52 ms. Remains 130 /731 variables (removed 601) and now considering 209/800 (removed 591) transitions.
Finished structural reductions, in 1 iterations. Remains : 130/731 places, 209/800 transitions.
Finished random walk after 243 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=40 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 2 factoid took 145 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 189 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 179 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0)]
// Phase 1: matrix 800 rows 731 cols
[2022-05-15 14:24:47] [INFO ] Computed 31 place invariants in 18 ms
[2022-05-15 14:24:48] [INFO ] [Real]Absence check using 21 positive place invariants in 62 ms returned sat
[2022-05-15 14:24:48] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 157 ms returned sat
[2022-05-15 14:24:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 14:24:54] [INFO ] [Real]Absence check using state equation in 5554 ms returned sat
[2022-05-15 14:24:54] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 14:24:54] [INFO ] [Nat]Absence check using 21 positive place invariants in 63 ms returned sat
[2022-05-15 14:24:54] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 97 ms returned sat
[2022-05-15 14:24:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 14:24:56] [INFO ] [Nat]Absence check using state equation in 1327 ms returned sat
[2022-05-15 14:24:56] [INFO ] Computed and/alt/rep : 699/2291/699 causal constraints (skipped 1 transitions) in 46 ms.
[2022-05-15 14:24:57] [INFO ] Added : 69 causal constraints over 14 iterations in 901 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 11 out of 731 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 731/731 places, 800/800 transitions.
Applied a total of 0 rules in 12 ms. Remains 731 /731 variables (removed 0) and now considering 800/800 (removed 0) transitions.
// Phase 1: matrix 800 rows 731 cols
[2022-05-15 14:24:57] [INFO ] Computed 31 place invariants in 12 ms
[2022-05-15 14:24:57] [INFO ] Implicit Places using invariants in 830 ms returned []
// Phase 1: matrix 800 rows 731 cols
[2022-05-15 14:24:57] [INFO ] Computed 31 place invariants in 20 ms
[2022-05-15 14:25:04] [INFO ] Implicit Places using invariants and state equation in 6183 ms returned []
Implicit Place search using SMT with State Equation took 7017 ms to find 0 implicit places.
// Phase 1: matrix 800 rows 731 cols
[2022-05-15 14:25:04] [INFO ] Computed 31 place invariants in 16 ms
[2022-05-15 14:25:05] [INFO ] Dead Transitions using invariants and state equation in 1337 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 731/731 places, 800/800 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 184 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 800 rows 731 cols
[2022-05-15 14:25:05] [INFO ] Computed 31 place invariants in 21 ms
[2022-05-15 14:25:06] [INFO ] [Real]Absence check using 21 positive place invariants in 14 ms returned sat
[2022-05-15 14:25:06] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 27 ms returned sat
[2022-05-15 14:25:06] [INFO ] After 193ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-15 14:25:06] [INFO ] [Nat]Absence check using 21 positive place invariants in 188 ms returned sat
[2022-05-15 14:25:06] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 46 ms returned sat
[2022-05-15 14:25:31] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 10 out of 731 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 731/731 places, 800/800 transitions.
Drop transitions removed 199 transitions
Trivial Post-agglo rules discarded 199 transitions
Performed 199 trivial Post agglomeration. Transition count delta: 199
Iterating post reduction 0 with 199 rules applied. Total rules applied 199 place count 731 transition count 601
Reduce places removed 209 places and 0 transitions.
Drop transitions removed 191 transitions
Trivial Post-agglo rules discarded 191 transitions
Performed 191 trivial Post agglomeration. Transition count delta: 191
Iterating post reduction 1 with 400 rules applied. Total rules applied 599 place count 522 transition count 410
Reduce places removed 191 places and 0 transitions.
Iterating post reduction 2 with 191 rules applied. Total rules applied 790 place count 331 transition count 410
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 100 Pre rules applied. Total rules applied 790 place count 331 transition count 310
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 990 place count 231 transition count 310
Free-agglomeration rule applied 100 times.
Iterating global reduction 3 with 100 rules applied. Total rules applied 1090 place count 231 transition count 210
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 3 with 100 rules applied. Total rules applied 1190 place count 131 transition count 210
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1191 place count 131 transition count 209
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1192 place count 130 transition count 209
Applied a total of 1192 rules in 48 ms. Remains 130 /731 variables (removed 601) and now considering 209/800 (removed 591) transitions.
Finished structural reductions, in 1 iterations. Remains : 130/731 places, 209/800 transitions.
Finished random walk after 555 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=79 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 2 factoid took 130 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 5 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 174 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0)]
// Phase 1: matrix 800 rows 731 cols
[2022-05-15 14:25:31] [INFO ] Computed 31 place invariants in 12 ms
[2022-05-15 14:25:32] [INFO ] [Real]Absence check using 21 positive place invariants in 57 ms returned sat
[2022-05-15 14:25:32] [INFO ] [Real]Absence check using 21 positive and 10 generalized place invariants in 152 ms returned sat
[2022-05-15 14:25:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-15 14:25:37] [INFO ] [Real]Absence check using state equation in 5456 ms returned sat
[2022-05-15 14:25:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-15 14:25:38] [INFO ] [Nat]Absence check using 21 positive place invariants in 62 ms returned sat
[2022-05-15 14:25:38] [INFO ] [Nat]Absence check using 21 positive and 10 generalized place invariants in 95 ms returned sat
[2022-05-15 14:25:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-15 14:25:39] [INFO ] [Nat]Absence check using state equation in 1277 ms returned sat
[2022-05-15 14:25:39] [INFO ] Computed and/alt/rep : 699/2291/699 causal constraints (skipped 1 transitions) in 43 ms.
[2022-05-15 14:25:40] [INFO ] Added : 69 causal constraints over 14 iterations in 846 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 158 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 288 reset in 467 ms.
Product exploration explored 100000 steps with 270 reset in 480 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 176 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0)]
Support contains 11 out of 731 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 731/731 places, 800/800 transitions.
Performed 198 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 198 rules applied. Total rules applied 198 place count 731 transition count 800
Performed 100 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 100 Pre rules applied. Total rules applied 198 place count 731 transition count 800
Deduced a syphon composed of 298 places in 0 ms
Iterating global reduction 1 with 100 rules applied. Total rules applied 298 place count 731 transition count 800
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 388 places in 0 ms
Iterating global reduction 1 with 90 rules applied. Total rules applied 388 place count 731 transition count 800
Deduced a syphon composed of 388 places in 0 ms
Applied a total of 388 rules in 98 ms. Remains 731 /731 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2022-05-15 14:25:41] [INFO ] Redundant transitions in 10 ms returned []
// Phase 1: matrix 800 rows 731 cols
[2022-05-15 14:25:41] [INFO ] Computed 31 place invariants in 15 ms
[2022-05-15 14:25:43] [INFO ] Dead Transitions using invariants and state equation in 1171 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 731/731 places, 800/800 transitions.
Finished structural reductions, in 1 iterations. Remains : 731/731 places, 800/800 transitions.
Product exploration explored 100000 steps with 715 reset in 596 ms.
Product exploration explored 100000 steps with 752 reset in 593 ms.
Built C files in :
/tmp/ltsmin5152796084235153093
[2022-05-15 14:25:44] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5152796084235153093
Running compilation step : cd /tmp/ltsmin5152796084235153093;'/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'
Compilation finished in 1395 ms.
Running link step : cd /tmp/ltsmin5152796084235153093;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin5152796084235153093;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3878777657379392904.hoa' '--buchi-type=spotba'
LTSmin run took 832 ms.
FORMULA DatabaseWithMutex-PT-10-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DatabaseWithMutex-PT-10-LTLFireability-14 finished in 87157 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(((G(F(p1))&&G(X(p2)))||p0)))'
[2022-05-15 14:25:46] [INFO ] Flatten gal took : 44 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7998105506674383309
[2022-05-15 14:25:46] [INFO ] Computing symmetric may disable matrix : 800 transitions.
[2022-05-15 14:25:46] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 14:25:46] [INFO ] Computing symmetric may enable matrix : 800 transitions.
[2022-05-15 14:25:46] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 14:25:46] [INFO ] Applying decomposition
[2022-05-15 14:25:46] [INFO ] Flatten gal took : 72 ms
[2022-05-15 14:25:46] [INFO ] Computing Do-Not-Accords matrix : 800 transitions.
[2022-05-15 14:25:46] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-15 14:25:47] [INFO ] Built C files in 184ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7998105506674383309
Running compilation step : cd /tmp/ltsmin7998105506674383309;'/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'
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/graph16752858491605090995.txt' '-o' '/tmp/graph16752858491605090995.bin' '-w' '/tmp/graph16752858491605090995.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16752858491605090995.bin' '-l' '-1' '-v' '-w' '/tmp/graph16752858491605090995.weights' '-q' '0' '-e' '0.001'
[2022-05-15 14:25:47] [INFO ] Decomposing Gal with order
[2022-05-15 14:25:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 14:25:47] [INFO ] Removed a total of 1690 redundant transitions.
[2022-05-15 14:25:47] [INFO ] Flatten gal took : 158 ms
[2022-05-15 14:25:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 24 ms.
[2022-05-15 14:25:47] [INFO ] Time to serialize gal into /tmp/LTLFireability4999355715881868745.gal : 27 ms
[2022-05-15 14:25:47] [INFO ] Time to serialize properties into /tmp/LTLFireability17283104666968710242.ltl : 3 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/LTLFireability4999355715881868745.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17283104666968710242.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...268
Read 1 LTL properties
Checking formula 0 : !((F(("(((((((i11.u117.MesBuffReply_7_8==1)||(i26.u79.MesBuffReply_6_7==1))||((i21.u191.MesBuffReply_2_8==1)||(i18.u1.MesBuffReply_1_1...41447
Formula 0 simplified : !F("(((((((i11.u117.MesBuffReply_7_8==1)||(i26.u79.MesBuffReply_6_7==1))||((i21.u191.MesBuffReply_2_8==1)||(i18.u1.MesBuffReply_1_1=...41427
Compilation finished in 2479 ms.
Running link step : cd /tmp/ltsmin7998105506674383309;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin7998105506674383309;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>((([](<>((LTLAPp1==true)))&&[](X((LTLAPp2==true))))||(LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2022-05-15 14:48:22] [INFO ] Applying decomposition
[2022-05-15 14:48:23] [INFO ] Flatten gal took : 722 ms
[2022-05-15 14:48:23] [INFO ] Decomposing Gal with order
[2022-05-15 14:48:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-15 14:48:24] [INFO ] Removed a total of 1690 redundant transitions.
[2022-05-15 14:48:24] [INFO ] Flatten gal took : 642 ms
[2022-05-15 14:48:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 48 ms.
[2022-05-15 14:48:25] [INFO ] Time to serialize gal into /tmp/LTLFireability4451160731759322064.gal : 70 ms
[2022-05-15 14:48:25] [INFO ] Time to serialize properties into /tmp/LTLFireability14761764806208305159.ltl : 24 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/LTLFireability4451160731759322064.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14761764806208305159.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...268
Read 1 LTL properties
Checking formula 0 : !((F(("(((((((u103.MesBuffReply_7_8==1)||(u69.MesBuffReply_6_7==1))||((u83.MesBuffReply_2_8==1)||(u23.MesBuffReply_1_1==1)))||(((u115....35846
Formula 0 simplified : !F("(((((((u103.MesBuffReply_7_8==1)||(u69.MesBuffReply_6_7==1))||((u83.MesBuffReply_2_8==1)||(u23.MesBuffReply_1_1==1)))||(((u115.M...35826
Detected timeout of ITS tools.
[2022-05-15 15:10:57] [INFO ] Flatten gal took : 370 ms
[2022-05-15 15:10:59] [INFO ] Input system was already deterministic with 800 transitions.
[2022-05-15 15:10:59] [INFO ] Transformed 830 places.
[2022-05-15 15:10:59] [INFO ] Transformed 800 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-15 15:11:30] [INFO ] Time to serialize gal into /tmp/LTLFireability14346556263428184484.gal : 24 ms
[2022-05-15 15:11:30] [INFO ] Time to serialize properties into /tmp/LTLFireability2340538828799217375.ltl : 21 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/LTLFireability14346556263428184484.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2340538828799217375.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...334
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(("(((((((MesBuffReply_7_8==1)||(MesBuffReply_6_7==1))||((MesBuffReply_2_8==1)||(MesBuffReply_1_1==1)))||(((MesBuffReply_3_6==1)||...30505
Formula 0 simplified : !F("(((((((MesBuffReply_7_8==1)||(MesBuffReply_6_7==1))||((MesBuffReply_2_8==1)||(MesBuffReply_1_1==1)))||(((MesBuffReply_3_6==1)||(...30485
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="DatabaseWithMutex-PT-10"
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 DatabaseWithMutex-PT-10, 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 r060-tall-165254772200572"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DatabaseWithMutex-PT-10.tgz
mv DatabaseWithMutex-PT-10 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 '
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 ;