About the Execution of ITS-Tools for DES-PT-05a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1597.396 | 97437.00 | 227108.00 | 500.90 | TFFFFFTFFFFFFTFF | 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.r042-smll-165252095700436.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 DES-PT-05a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r042-smll-165252095700436
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 276K
-rw-r--r-- 1 mcc users 6.7K Apr 29 15:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Apr 29 15:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 29 15:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 29 15:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.1K May 9 07:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 9 07:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 9 07:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K May 9 07:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 37K 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 DES-PT-05a-LTLFireability-00
FORMULA_NAME DES-PT-05a-LTLFireability-01
FORMULA_NAME DES-PT-05a-LTLFireability-02
FORMULA_NAME DES-PT-05a-LTLFireability-03
FORMULA_NAME DES-PT-05a-LTLFireability-04
FORMULA_NAME DES-PT-05a-LTLFireability-05
FORMULA_NAME DES-PT-05a-LTLFireability-06
FORMULA_NAME DES-PT-05a-LTLFireability-07
FORMULA_NAME DES-PT-05a-LTLFireability-08
FORMULA_NAME DES-PT-05a-LTLFireability-09
FORMULA_NAME DES-PT-05a-LTLFireability-10
FORMULA_NAME DES-PT-05a-LTLFireability-11
FORMULA_NAME DES-PT-05a-LTLFireability-12
FORMULA_NAME DES-PT-05a-LTLFireability-13
FORMULA_NAME DES-PT-05a-LTLFireability-14
FORMULA_NAME DES-PT-05a-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1652723222170
Running Version 202205111006
[2022-05-16 17:47:04] [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-16 17:47:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 17:47:04] [INFO ] Load time of PNML (sax parser for PT used): 116 ms
[2022-05-16 17:47:04] [INFO ] Transformed 135 places.
[2022-05-16 17:47:04] [INFO ] Transformed 92 transitions.
[2022-05-16 17:47:04] [INFO ] Found NUPN structural information;
[2022-05-16 17:47:04] [INFO ] Parsed PT model containing 135 places and 92 transitions in 298 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-05a-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-05a-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-05a-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-05a-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-05a-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-05a-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 78/78 transitions.
Applied a total of 0 rules in 22 ms. Remains 135 /135 variables (removed 0) and now considering 78/78 (removed 0) transitions.
// Phase 1: matrix 78 rows 135 cols
[2022-05-16 17:47:04] [INFO ] Computed 59 place invariants in 23 ms
[2022-05-16 17:47:05] [INFO ] Implicit Places using invariants in 480 ms returned []
// Phase 1: matrix 78 rows 135 cols
[2022-05-16 17:47:05] [INFO ] Computed 59 place invariants in 11 ms
[2022-05-16 17:47:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 17:47:05] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 1011 ms to find 0 implicit places.
// Phase 1: matrix 78 rows 135 cols
[2022-05-16 17:47:05] [INFO ] Computed 59 place invariants in 18 ms
[2022-05-16 17:47:06] [INFO ] Dead Transitions using invariants and state equation in 289 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 135/135 places, 78/78 transitions.
Support contains 45 out of 135 places after structural reductions.
[2022-05-16 17:47:06] [INFO ] Flatten gal took : 85 ms
[2022-05-16 17:47:06] [INFO ] Flatten gal took : 33 ms
[2022-05-16 17:47:06] [INFO ] Input system was already deterministic with 78 transitions.
Incomplete random walk after 10000 steps, including 222 resets, run finished after 559 ms. (steps per millisecond=17 ) properties (out of 23) seen :21
Incomplete Best-First random walk after 10001 steps, including 43 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 50 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 78 rows 135 cols
[2022-05-16 17:47:07] [INFO ] Computed 59 place invariants in 2 ms
[2022-05-16 17:47:07] [INFO ] [Real]Absence check using 34 positive place invariants in 13 ms returned sat
[2022-05-16 17:47:07] [INFO ] [Real]Absence check using 34 positive and 25 generalized place invariants in 15 ms returned sat
[2022-05-16 17:47:07] [INFO ] After 146ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 17:47:07] [INFO ] [Nat]Absence check using 34 positive place invariants in 22 ms returned sat
[2022-05-16 17:47:07] [INFO ] [Nat]Absence check using 34 positive and 25 generalized place invariants in 17 ms returned sat
[2022-05-16 17:47:07] [INFO ] After 215ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-16 17:47:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 17:47:07] [INFO ] After 32ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-16 17:47:08] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 6 ms to minimize.
[2022-05-16 17:47:08] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 1 ms to minimize.
[2022-05-16 17:47:08] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 161 ms
[2022-05-16 17:47:08] [INFO ] After 221ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2022-05-16 17:47:08] [INFO ] After 603ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 309 steps, including 3 resets, run visited all 1 properties in 3 ms. (steps per millisecond=103 )
Parikh walk visited 1 properties in 4 ms.
Computed a total of 38 stabilizing places and 32 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||(G(p1)&&X(p2))))'
Support contains 9 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 78/78 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 134 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 134 transition count 77
Applied a total of 2 rules in 20 ms. Remains 134 /135 variables (removed 1) and now considering 77/78 (removed 1) transitions.
// Phase 1: matrix 77 rows 134 cols
[2022-05-16 17:47:08] [INFO ] Computed 59 place invariants in 5 ms
[2022-05-16 17:47:08] [INFO ] Implicit Places using invariants in 235 ms returned []
// Phase 1: matrix 77 rows 134 cols
[2022-05-16 17:47:08] [INFO ] Computed 59 place invariants in 6 ms
[2022-05-16 17:47:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 17:47:09] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 647 ms to find 0 implicit places.
// Phase 1: matrix 77 rows 134 cols
[2022-05-16 17:47:09] [INFO ] Computed 59 place invariants in 8 ms
[2022-05-16 17:47:09] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 134/135 places, 77/78 transitions.
Finished structural reductions, in 1 iterations. Remains : 134/135 places, 77/78 transitions.
Stuttering acceptance computed with spot in 467 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : DES-PT-05a-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p0) p2), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s70 0) (EQ s87 0)), p0:(OR (EQ s21 0) (EQ s23 0) (EQ s27 0) (EQ s28 0) (EQ s30 0) (EQ s32 0)), p2:(EQ s24 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1072 ms.
Product exploration explored 100000 steps with 50000 reset in 584 ms.
Computed a total of 37 stabilizing places and 31 stable transitions
Computed a total of 37 stabilizing places and 31 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))))), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : [(X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge :(X (NOT (OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2)))))
Knowledge based reduction with 5 factoid took 211 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA DES-PT-05a-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-05a-LTLFireability-00 finished in 3271 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (G(!p2)||p1)))'
Support contains 10 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 78/78 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 134 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 134 transition count 77
Applied a total of 2 rules in 30 ms. Remains 134 /135 variables (removed 1) and now considering 77/78 (removed 1) transitions.
// Phase 1: matrix 77 rows 134 cols
[2022-05-16 17:47:11] [INFO ] Computed 59 place invariants in 1 ms
[2022-05-16 17:47:12] [INFO ] Implicit Places using invariants in 150 ms returned []
// Phase 1: matrix 77 rows 134 cols
[2022-05-16 17:47:12] [INFO ] Computed 59 place invariants in 6 ms
[2022-05-16 17:47:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2022-05-16 17:47:12] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 383 ms to find 0 implicit places.
[2022-05-16 17:47:12] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 77 rows 134 cols
[2022-05-16 17:47:12] [INFO ] Computed 59 place invariants in 3 ms
[2022-05-16 17:47:12] [INFO ] Dead Transitions using invariants and state equation in 103 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 134/135 places, 77/78 transitions.
Finished structural reductions, in 1 iterations. Remains : 134/135 places, 77/78 transitions.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) p2), true, p2]
Running random walk in product with property : DES-PT-05a-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p2 p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (AND (EQ s21 1) (EQ s23 1) (EQ s27 1) (EQ s28 1) (EQ s30 1) (EQ s32 1) (EQ s112 1) (EQ s121 1)) (AND (EQ s112 1) (EQ s121 1))), p2:(AND (EQ s72 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 424 steps with 9 reset in 4 ms.
FORMULA DES-PT-05a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05a-LTLFireability-01 finished in 639 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(G(!X(X((X(!p0) U p1)))) U !X(X(p0))))'
Support contains 4 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 78/78 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 134 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 134 transition count 77
Applied a total of 2 rules in 9 ms. Remains 134 /135 variables (removed 1) and now considering 77/78 (removed 1) transitions.
// Phase 1: matrix 77 rows 134 cols
[2022-05-16 17:47:12] [INFO ] Computed 59 place invariants in 2 ms
[2022-05-16 17:47:12] [INFO ] Implicit Places using invariants in 146 ms returned [32]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 148 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/135 places, 77/78 transitions.
Applied a total of 0 rules in 5 ms. Remains 133 /133 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 133/135 places, 77/78 transitions.
Stuttering acceptance computed with spot in 214 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-05a-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(AND (EQ s118 1) (EQ s127 1)), p0:(AND (EQ s83 1) (EQ s99 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DES-PT-05a-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05a-LTLFireability-04 finished in 397 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(p0))))'
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 78/78 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 133 transition count 77
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 132 transition count 76
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 132 transition count 76
Applied a total of 3 rules in 18 ms. Remains 132 /135 variables (removed 3) and now considering 76/78 (removed 2) transitions.
// Phase 1: matrix 76 rows 132 cols
[2022-05-16 17:47:12] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-16 17:47:13] [INFO ] Implicit Places using invariants in 124 ms returned []
// Phase 1: matrix 76 rows 132 cols
[2022-05-16 17:47:13] [INFO ] Computed 58 place invariants in 10 ms
[2022-05-16 17:47:13] [INFO ] Implicit Places using invariants and state equation in 309 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
[2022-05-16 17:47:13] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 76 rows 132 cols
[2022-05-16 17:47:13] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-16 17:47:13] [INFO ] Dead Transitions using invariants and state equation in 96 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/135 places, 76/78 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/135 places, 76/78 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-05a-LTLFireability-05 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 s4 1) (EQ s51 1) (EQ s53 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 43 steps with 0 reset in 0 ms.
FORMULA DES-PT-05a-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05a-LTLFireability-05 finished in 644 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!(!G(p0) U F(p0))||X(p1)||G(p2)))'
Support contains 6 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 78/78 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 134 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 134 transition count 77
Applied a total of 2 rules in 6 ms. Remains 134 /135 variables (removed 1) and now considering 77/78 (removed 1) transitions.
// Phase 1: matrix 77 rows 134 cols
[2022-05-16 17:47:13] [INFO ] Computed 59 place invariants in 2 ms
[2022-05-16 17:47:13] [INFO ] Implicit Places using invariants in 139 ms returned [32]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 141 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/135 places, 77/78 transitions.
Applied a total of 0 rules in 3 ms. Remains 133 /133 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 133/135 places, 77/78 transitions.
Stuttering acceptance computed with spot in 358 ms :[true, (NOT p1), (AND (NOT p1) p0 (NOT p2)), (AND p0 (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) p0 (NOT p1)), p0, (NOT p2), (AND p0 (NOT p2))]
Running random walk in product with property : DES-PT-05a-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p2), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 7}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=5 dest: 6}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=5 dest: 7}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=5 dest: 8}], [{ cond=p0, acceptance={} source=6 dest: 0}, { cond=(NOT p0), acceptance={} source=6 dest: 6}], [{ cond=(NOT p2), acceptance={} source=7 dest: 0}, { cond=p2, acceptance={} source=7 dest: 7}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=8 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=8 dest: 6}, { cond=(AND p0 p2), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p0) p2), acceptance={} source=8 dest: 8}]], initial=2, aps=[p1:(OR (EQ s18 0) (EQ s25 0)), p0:(AND (EQ s29 1) (EQ s113 1)), p2:(AND (EQ s65 1) (EQ s82 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 650 ms.
Product exploration explored 100000 steps with 50000 reset in 591 ms.
Computed a total of 36 stabilizing places and 31 stable transitions
Computed a total of 36 stabilizing places and 31 stable transitions
Knowledge obtained : [(AND p1 (NOT p0) (NOT p2)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) p2 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p2 (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 p2 (NOT p1)))), true, (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p2 (NOT p1))))
Knowledge based reduction with 17 factoid took 361 ms. Reduced automaton from 9 states, 22 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA DES-PT-05a-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-05a-LTLFireability-06 finished in 2145 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(((F(p1)&&p0)||p2))||F(p1))))'
Support contains 4 out of 135 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 78/78 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 134 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 134 transition count 77
Applied a total of 2 rules in 8 ms. Remains 134 /135 variables (removed 1) and now considering 77/78 (removed 1) transitions.
// Phase 1: matrix 77 rows 134 cols
[2022-05-16 17:47:15] [INFO ] Computed 59 place invariants in 1 ms
[2022-05-16 17:47:15] [INFO ] Implicit Places using invariants in 208 ms returned [32]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 209 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/135 places, 77/78 transitions.
Applied a total of 0 rules in 3 ms. Remains 133 /133 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 133/135 places, 77/78 transitions.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DES-PT-05a-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s121 1) (EQ s123 1)), p2:(AND (EQ s85 1) (EQ s101 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]]
Stuttering criterion allowed to conclude after 41 steps with 1 reset in 1 ms.
FORMULA DES-PT-05a-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05a-LTLFireability-09 finished in 348 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((F(p1)&&p0))||F(X(!((p1 U p2) U p3))))))'
Support contains 6 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 78/78 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 134 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 134 transition count 77
Applied a total of 2 rules in 6 ms. Remains 134 /135 variables (removed 1) and now considering 77/78 (removed 1) transitions.
// Phase 1: matrix 77 rows 134 cols
[2022-05-16 17:47:16] [INFO ] Computed 59 place invariants in 1 ms
[2022-05-16 17:47:16] [INFO ] Implicit Places using invariants in 171 ms returned [32]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 174 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/135 places, 77/78 transitions.
Applied a total of 0 rules in 4 ms. Remains 133 /133 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 133/135 places, 77/78 transitions.
Stuttering acceptance computed with spot in 271 ms :[(OR (AND (NOT p0) p3) (AND (NOT p1) p3)), (OR (AND (NOT p0) p3) (AND (NOT p1) p3)), p3, (AND p2 p3), (AND (NOT p1) p3)]
Running random walk in product with property : DES-PT-05a-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) p3)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2) (NOT p3)), acceptance={} source=1 dest: 3}, { cond=(OR (AND p0 (NOT p1) p2) (AND p0 (NOT p1) p3)), acceptance={} source=1 dest: 4}], [{ cond=(AND p2 (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=p3, acceptance={0, 1} source=2 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(AND p2 (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(AND p2 p3), acceptance={0, 1} source=3 dest: 2}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2) p3), acceptance={1} source=3 dest: 3}], [{ cond=(AND (NOT p1) p2 (NOT p3)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) p3), acceptance={0, 1} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s15 1) (EQ s49 1)), p2:(AND (EQ s26 1) (EQ s47 1)), p3:(AND (EQ s67 1) (EQ s84 1)), p1:(AND (EQ s15 1) (EQ s49 1))], nbAcceptance=2, 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 7186 reset in 816 ms.
Product exploration explored 100000 steps with 7153 reset in 454 ms.
Computed a total of 36 stabilizing places and 31 stable transitions
Computed a total of 36 stabilizing places and 31 stable transitions
Detected a total of 36/133 stabilizing places and 31/77 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (X (NOT (OR (AND p0 (NOT p1) p2) (AND p0 (NOT p1) p3)))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), true, (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (OR (AND p0 (NOT p1) p2) (AND p0 (NOT p1) p3))))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND p2 (NOT p3))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 875 ms. Reduced automaton from 5 states, 14 edges and 4 AP to 5 states, 14 edges and 4 AP.
Stuttering acceptance computed with spot in 229 ms :[(OR (AND (NOT p0) p3) (AND (NOT p1) p3)), (OR (AND (NOT p0) p3) (AND (NOT p1) p3)), p3, (AND p2 p3), (AND (NOT p1) p3)]
Incomplete random walk after 10000 steps, including 222 resets, run finished after 536 ms. (steps per millisecond=18 ) properties (out of 10) seen :8
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 48 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 77 rows 133 cols
[2022-05-16 17:47:19] [INFO ] Computed 58 place invariants in 3 ms
[2022-05-16 17:47:19] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (X (NOT (OR (AND p0 (NOT p1) p2) (AND p0 (NOT p1) p3)))), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p3)))), (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3)))), true, (X (X (NOT p3))), (X (X (NOT (AND (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (OR (AND p0 (NOT p1) p2) (AND p0 (NOT p1) p3))))), (X (X (NOT (AND p1 (NOT p2) p3)))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p3))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2) (NOT p3))))), (X (X (NOT (AND (NOT p1) p3)))), (X (X (NOT (AND p2 (NOT p3))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (OR (AND p2 (NOT p1) p0) (AND (NOT p1) p0 p3)))), (G (NOT (AND (NOT p2) p1 (NOT p0) (NOT p3))))]
False Knowledge obtained : [(F p3), (F (AND p2 (NOT p3))), (F (AND p2 p3)), (F (AND (NOT p2) p1 (NOT p3))), (F (OR (AND p2 (NOT p0)) (AND (NOT p0) p3))), (F (AND p2 (NOT p1) (NOT p3))), (F (AND (NOT p2) p1 p3)), (F (AND (NOT p1) p3))]
Knowledge based reduction with 19 factoid took 1606 ms. Reduced automaton from 5 states, 14 edges and 4 AP to 4 states, 10 edges and 4 AP.
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p0) p3), (AND (NOT p0) p3), p3, (AND p2 p3)]
Stuttering acceptance computed with spot in 196 ms :[(AND (NOT p0) p3), (AND (NOT p0) p3), p3, (AND p2 p3)]
Support contains 6 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 77/77 transitions.
Applied a total of 0 rules in 4 ms. Remains 133 /133 variables (removed 0) and now considering 77/77 (removed 0) transitions.
// Phase 1: matrix 77 rows 133 cols
[2022-05-16 17:47:21] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 17:47:21] [INFO ] Implicit Places using invariants in 221 ms returned []
// Phase 1: matrix 77 rows 133 cols
[2022-05-16 17:47:21] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-16 17:47:22] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
// Phase 1: matrix 77 rows 133 cols
[2022-05-16 17:47:22] [INFO ] Computed 58 place invariants in 8 ms
[2022-05-16 17:47:22] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/133 places, 77/77 transitions.
Computed a total of 36 stabilizing places and 31 stable transitions
Computed a total of 36 stabilizing places and 31 stable transitions
Detected a total of 36/133 stabilizing places and 31/77 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p3)))), true, (X (X (NOT p3))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p3))))), (X (X (NOT (AND p2 (NOT p3))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 427 ms. Reduced automaton from 4 states, 10 edges and 4 AP to 4 states, 10 edges and 4 AP.
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) p3), (AND (NOT p0) p3), p3, (AND p2 p3)]
Incomplete random walk after 10000 steps, including 217 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :5
Finished Best-First random walk after 763 steps, including 3 resets, run visited all 1 properties in 2 ms. (steps per millisecond=381 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p3)))), true, (X (X (NOT p3))), (X (X (NOT (AND p1 (NOT p2) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) p2) (AND (NOT p0) p3))))), (X (X (NOT (AND p2 (NOT p3))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND p2 p3)), (F (AND (NOT p2) p1 (NOT p3))), (F (AND (NOT p2) p1 p3)), (F (OR (AND p2 (NOT p0)) (AND (NOT p0) p3))), (F p3), (F (AND p2 (NOT p3)))]
Knowledge based reduction with 9 factoid took 540 ms. Reduced automaton from 4 states, 10 edges and 4 AP to 4 states, 10 edges and 4 AP.
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) p3), (AND (NOT p0) p3), p3, (AND p2 p3)]
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p0) p3), (AND (NOT p0) p3), p3, (AND p2 p3)]
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) p3), (AND (NOT p0) p3), p3, (AND p2 p3)]
Product exploration explored 100000 steps with 7079 reset in 506 ms.
Product exploration explored 100000 steps with 7112 reset in 509 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p0) p3), (AND (NOT p0) p3), p3, (AND p2 p3)]
Support contains 6 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 77/77 transitions.
Applied a total of 0 rules in 12 ms. Remains 133 /133 variables (removed 0) and now considering 77/77 (removed 0) transitions.
[2022-05-16 17:47:25] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 77 rows 133 cols
[2022-05-16 17:47:25] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-16 17:47:25] [INFO ] Dead Transitions using invariants and state equation in 109 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/133 places, 77/77 transitions.
Product exploration explored 100000 steps with 7111 reset in 456 ms.
Product exploration explored 100000 steps with 7170 reset in 518 ms.
Built C files in :
/tmp/ltsmin2058953125535156472
[2022-05-16 17:47:26] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2058953125535156472
Running compilation step : cd /tmp/ltsmin2058953125535156472;'/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 621 ms.
Running link step : cd /tmp/ltsmin2058953125535156472;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin2058953125535156472;'/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/stateBased11080931227276540256.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 77/77 transitions.
Applied a total of 0 rules in 2 ms. Remains 133 /133 variables (removed 0) and now considering 77/77 (removed 0) transitions.
// Phase 1: matrix 77 rows 133 cols
[2022-05-16 17:47:42] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 17:47:42] [INFO ] Implicit Places using invariants in 134 ms returned []
// Phase 1: matrix 77 rows 133 cols
[2022-05-16 17:47:42] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 17:47:42] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 377 ms to find 0 implicit places.
// Phase 1: matrix 77 rows 133 cols
[2022-05-16 17:47:42] [INFO ] Computed 58 place invariants in 0 ms
[2022-05-16 17:47:42] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/133 places, 77/77 transitions.
Built C files in :
/tmp/ltsmin16974668276661038792
[2022-05-16 17:47:42] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16974668276661038792
Running compilation step : cd /tmp/ltsmin16974668276661038792;'/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 272 ms.
Running link step : cd /tmp/ltsmin16974668276661038792;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin16974668276661038792;'/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/stateBased1574676041116667573.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-16 17:47:57] [INFO ] Flatten gal took : 14 ms
[2022-05-16 17:47:57] [INFO ] Flatten gal took : 12 ms
[2022-05-16 17:47:57] [INFO ] Time to serialize gal into /tmp/LTL17144103482407809143.gal : 4 ms
[2022-05-16 17:47:57] [INFO ] Time to serialize properties into /tmp/LTL17682703778423379725.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17144103482407809143.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17682703778423379725.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/LTL1714410...268
Read 1 LTL properties
Checking formula 0 : !((G((X(((F("((p15==1)&&(p50==1))"))&&("(p15==1)"))&&("(p50==1)")))||(F(X(!((("((p15==1)&&(p50==1))")U("((p26==1)&&(p48==1))"))U("((p6...180
Formula 0 simplified : !G(X("(p15==1)" & "(p50==1)" & F"((p15==1)&&(p50==1))") | FX!(("((p15==1)&&(p50==1))" U "((p26==1)&&(p48==1))") U "((p68==1)&&(p85==...161
Detected timeout of ITS tools.
[2022-05-16 17:48:12] [INFO ] Flatten gal took : 11 ms
[2022-05-16 17:48:12] [INFO ] Applying decomposition
[2022-05-16 17:48:12] [INFO ] Flatten gal took : 11 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/graph8274565874214951530.txt' '-o' '/tmp/graph8274565874214951530.bin' '-w' '/tmp/graph8274565874214951530.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph8274565874214951530.bin' '-l' '-1' '-v' '-w' '/tmp/graph8274565874214951530.weights' '-q' '0' '-e' '0.001'
[2022-05-16 17:48:12] [INFO ] Decomposing Gal with order
[2022-05-16 17:48:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-16 17:48:13] [INFO ] Removed a total of 14 redundant transitions.
[2022-05-16 17:48:13] [INFO ] Flatten gal took : 85 ms
[2022-05-16 17:48:13] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 5 ms.
[2022-05-16 17:48:13] [INFO ] Time to serialize gal into /tmp/LTL10432549115109295663.gal : 5 ms
[2022-05-16 17:48:13] [INFO ] Time to serialize properties into /tmp/LTL2487038362736466686.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/LTL10432549115109295663.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2487038362736466686.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/LTL1043254...246
Read 1 LTL properties
Checking formula 0 : !((G((X(((F("((i1.u12.p15==1)&&(i1.u12.p50==1))"))&&("(i1.u12.p15==1)"))&&("(i1.u12.p50==1)")))||(F(X(!((("((i1.u12.p15==1)&&(i1.u12.p...249
Formula 0 simplified : !G(X("(i1.u12.p15==1)" & "(i1.u12.p50==1)" & F"((i1.u12.p15==1)&&(i1.u12.p50==1))") | FX!(("((i1.u12.p15==1)&&(i1.u12.p50==1))" U "(...230
Reverse transition relation is NOT exact ! Due to transitions t1, t37, t38, u13.t11, u47.t5, u47.t16, i0.t75, i0.t69, i0.t0, i0.u1.t9, i1.t71, i1.u0.t10, i...335
Computing Next relation with stutter on 33629 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17423517562654536405
[2022-05-16 17:48:28] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17423517562654536405
Running compilation step : cd /tmp/ltsmin17423517562654536405;'/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 259 ms.
Running link step : cd /tmp/ltsmin17423517562654536405;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin17423517562654536405;'/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' '[]((X((<>((LTLAPp1==true))&&(LTLAPp0==true)))||<>(X(!(((LTLAPp1==true) U (LTLAPp2==true)) U (LTLAPp3==true))))))' '--buchi-type=spotba'
LTSmin run took 5203 ms.
FORMULA DES-PT-05a-LTLFireability-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-05a-LTLFireability-11 finished in 77704 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(p0) U G((X(p1) U p2)))) U G(p0)))'
Support contains 6 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 78/78 transitions.
Applied a total of 0 rules in 2 ms. Remains 135 /135 variables (removed 0) and now considering 78/78 (removed 0) transitions.
// Phase 1: matrix 78 rows 135 cols
[2022-05-16 17:48:33] [INFO ] Computed 59 place invariants in 1 ms
[2022-05-16 17:48:33] [INFO ] Implicit Places using invariants in 187 ms returned [32]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 188 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 134/135 places, 78/78 transitions.
Applied a total of 0 rules in 1 ms. Remains 134 /134 variables (removed 0) and now considering 78/78 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 134/135 places, 78/78 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : DES-PT-05a-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s77 1) (EQ s93 1)), p2:(AND (EQ s12 1) (EQ s49 1)), p1:(AND (EQ s57 1) (EQ s127 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 50 steps with 0 reset in 0 ms.
FORMULA DES-PT-05a-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05a-LTLFireability-12 finished in 371 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 78/78 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 134 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 134 transition count 77
Applied a total of 2 rules in 3 ms. Remains 134 /135 variables (removed 1) and now considering 77/78 (removed 1) transitions.
// Phase 1: matrix 77 rows 134 cols
[2022-05-16 17:48:34] [INFO ] Computed 59 place invariants in 1 ms
[2022-05-16 17:48:34] [INFO ] Implicit Places using invariants in 129 ms returned [32]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 132 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 133/135 places, 77/78 transitions.
Applied a total of 0 rules in 2 ms. Remains 133 /133 variables (removed 0) and now considering 77/77 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 133/135 places, 77/78 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-05a-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s26 1) (EQ s47 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 18198 reset in 268 ms.
Product exploration explored 100000 steps with 18189 reset in 295 ms.
Computed a total of 36 stabilizing places and 31 stable transitions
Computed a total of 36 stabilizing places and 31 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
// Phase 1: matrix 77 rows 133 cols
[2022-05-16 17:48:35] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 17:48:35] [INFO ] [Real]Absence check using 33 positive place invariants in 12 ms returned sat
[2022-05-16 17:48:35] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 27 ms returned sat
[2022-05-16 17:48:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:48:35] [INFO ] [Real]Absence check using state equation in 117 ms returned sat
[2022-05-16 17:48:35] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 17:48:35] [INFO ] [Nat]Absence check using 33 positive place invariants in 13 ms returned sat
[2022-05-16 17:48:35] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 19 ms returned sat
[2022-05-16 17:48:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 17:48:35] [INFO ] [Nat]Absence check using state equation in 129 ms returned sat
[2022-05-16 17:48:35] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
[2022-05-16 17:48:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2022-05-16 17:48:35] [INFO ] Computed and/alt/rep : 74/240/74 causal constraints (skipped 2 transitions) in 9 ms.
[2022-05-16 17:48:35] [INFO ] Added : 66 causal constraints over 14 iterations in 221 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 77/77 transitions.
Applied a total of 0 rules in 10 ms. Remains 133 /133 variables (removed 0) and now considering 77/77 (removed 0) transitions.
// Phase 1: matrix 77 rows 133 cols
[2022-05-16 17:48:36] [INFO ] Computed 58 place invariants in 0 ms
[2022-05-16 17:48:36] [INFO ] Implicit Places using invariants in 152 ms returned []
// Phase 1: matrix 77 rows 133 cols
[2022-05-16 17:48:36] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 17:48:36] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2022-05-16 17:48:36] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 77 rows 133 cols
[2022-05-16 17:48:36] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 17:48:36] [INFO ] Dead Transitions using invariants and state equation in 138 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 133/133 places, 77/77 transitions.
Computed a total of 36 stabilizing places and 31 stable transitions
Computed a total of 36 stabilizing places and 31 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
// Phase 1: matrix 77 rows 133 cols
[2022-05-16 17:48:36] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 17:48:37] [INFO ] [Real]Absence check using 33 positive place invariants in 13 ms returned sat
[2022-05-16 17:48:37] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 30 ms returned sat
[2022-05-16 17:48:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 17:48:37] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2022-05-16 17:48:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 17:48:37] [INFO ] [Nat]Absence check using 33 positive place invariants in 13 ms returned sat
[2022-05-16 17:48:37] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 21 ms returned sat
[2022-05-16 17:48:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 17:48:37] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2022-05-16 17:48:37] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 2 ms to minimize.
[2022-05-16 17:48:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2022-05-16 17:48:37] [INFO ] Computed and/alt/rep : 74/240/74 causal constraints (skipped 2 transitions) in 9 ms.
[2022-05-16 17:48:37] [INFO ] Added : 66 causal constraints over 14 iterations in 242 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Product exploration explored 100000 steps with 18187 reset in 257 ms.
Product exploration explored 100000 steps with 18164 reset in 288 ms.
Built C files in :
/tmp/ltsmin7069619394743226487
[2022-05-16 17:48:38] [INFO ] Computing symmetric may disable matrix : 77 transitions.
[2022-05-16 17:48:38] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 17:48:38] [INFO ] Computing symmetric may enable matrix : 77 transitions.
[2022-05-16 17:48:38] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 17:48:38] [INFO ] Computing Do-Not-Accords matrix : 77 transitions.
[2022-05-16 17:48:38] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 17:48:38] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7069619394743226487
Running compilation step : cd /tmp/ltsmin7069619394743226487;'/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 283 ms.
Running link step : cd /tmp/ltsmin7069619394743226487;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin7069619394743226487;'/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/stateBased2882330539848012487.hoa' '--buchi-type=spotba'
LTSmin run took 73 ms.
FORMULA DES-PT-05a-LTLFireability-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-05a-LTLFireability-13 finished in 4685 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(F(G(F(G(F(G(p0))))))))))'
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 78/78 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 133 transition count 77
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 132 transition count 76
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 132 transition count 76
Applied a total of 3 rules in 14 ms. Remains 132 /135 variables (removed 3) and now considering 76/78 (removed 2) transitions.
// Phase 1: matrix 76 rows 132 cols
[2022-05-16 17:48:38] [INFO ] Computed 58 place invariants in 2 ms
[2022-05-16 17:48:39] [INFO ] Implicit Places using invariants in 228 ms returned []
// Phase 1: matrix 76 rows 132 cols
[2022-05-16 17:48:39] [INFO ] Computed 58 place invariants in 0 ms
[2022-05-16 17:48:39] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
[2022-05-16 17:48:39] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 76 rows 132 cols
[2022-05-16 17:48:39] [INFO ] Computed 58 place invariants in 1 ms
[2022-05-16 17:48:39] [INFO ] Dead Transitions using invariants and state equation in 147 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/135 places, 76/78 transitions.
Finished structural reductions, in 1 iterations. Remains : 132/135 places, 76/78 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-05a-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s41 1) (EQ s43 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 96 steps with 0 reset in 0 ms.
FORMULA DES-PT-05a-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-05a-LTLFireability-14 finished in 718 ms.
All properties solved by simple procedures.
Total runtime 95126 ms.
BK_STOP 1652723319607
--------------------
content from stderr:
+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-05a"
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 DES-PT-05a, 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 r042-smll-165252095700436"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-05a.tgz
mv DES-PT-05a 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 ;