About the Execution of ITS-Tools for HirschbergSinclair-PT-05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1456.615 | 31371.00 | 64028.00 | 669.70 | TFTTFFTFFTFTFFFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r197-smll-167840344200428.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is HirschbergSinclair-PT-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-smll-167840344200428
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 12K Feb 26 02:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 02:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 26 02:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 02:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 16:14 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:14 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:14 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 02:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K Feb 26 02:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 26 02:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K Feb 26 02:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 16:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:14 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 157K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-00
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-01
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-02
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-03
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-04
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-05
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-06
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-07
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-08
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-09
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-10
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-11
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-12
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-13
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-14
FORMULA_NAME HirschbergSinclair-PT-05-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678559319510
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-05
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-11 18:28:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-11 18:28:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 18:28:42] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2023-03-11 18:28:42] [INFO ] Transformed 124 places.
[2023-03-11 18:28:42] [INFO ] Transformed 111 transitions.
[2023-03-11 18:28:42] [INFO ] Parsed PT model containing 124 places and 111 transitions and 340 arcs in 241 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA HirschbergSinclair-PT-05-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-05-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-05-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 124 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 124/124 places, 111/111 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 119 transition count 111
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 7 place count 117 transition count 109
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 117 transition count 109
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 115 transition count 107
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 115 transition count 107
Applied a total of 13 rules in 64 ms. Remains 115 /124 variables (removed 9) and now considering 107/111 (removed 4) transitions.
// Phase 1: matrix 107 rows 115 cols
[2023-03-11 18:28:42] [INFO ] Computed 8 place invariants in 9 ms
[2023-03-11 18:28:42] [INFO ] Implicit Places using invariants in 363 ms returned []
[2023-03-11 18:28:42] [INFO ] Invariant cache hit.
[2023-03-11 18:28:43] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 582 ms to find 0 implicit places.
[2023-03-11 18:28:43] [INFO ] Invariant cache hit.
[2023-03-11 18:28:43] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 115/124 places, 107/111 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 789 ms. Remains : 115/124 places, 107/111 transitions.
Support contains 34 out of 115 places after structural reductions.
[2023-03-11 18:28:43] [INFO ] Flatten gal took : 47 ms
[2023-03-11 18:28:43] [INFO ] Flatten gal took : 19 ms
[2023-03-11 18:28:43] [INFO ] Input system was already deterministic with 107 transitions.
Support contains 31 out of 115 places (down from 34) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 90 resets, run finished after 586 ms. (steps per millisecond=17 ) properties (out of 29) seen :26
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 26 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 27 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 18:28:44] [INFO ] Invariant cache hit.
[2023-03-11 18:28:44] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 9 ms returned sat
[2023-03-11 18:28:44] [INFO ] After 158ms 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 1 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA HirschbergSinclair-PT-05-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 115 stabilizing places and 107 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 115 transition count 107
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 107/107 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 112 transition count 104
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 112 transition count 104
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 109 transition count 101
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 109 transition count 101
Applied a total of 12 rules in 27 ms. Remains 109 /115 variables (removed 6) and now considering 101/107 (removed 6) transitions.
// Phase 1: matrix 101 rows 109 cols
[2023-03-11 18:28:45] [INFO ] Computed 8 place invariants in 3 ms
[2023-03-11 18:28:45] [INFO ] Implicit Places using invariants in 115 ms returned []
[2023-03-11 18:28:45] [INFO ] Invariant cache hit.
[2023-03-11 18:28:45] [INFO ] Implicit Places using invariants and state equation in 215 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
[2023-03-11 18:28:45] [INFO ] Invariant cache hit.
[2023-03-11 18:28:45] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 109/115 places, 101/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 480 ms. Remains : 109/115 places, 101/107 transitions.
Stuttering acceptance computed with spot in 254 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s72 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 1666 reset in 633 ms.
Product exploration explored 100000 steps with 1660 reset in 267 ms.
Computed a total of 109 stabilizing places and 101 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 109 transition count 101
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 171 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Finished random walk after 58 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=58 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 181 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2023-03-11 18:28:47] [INFO ] Invariant cache hit.
[2023-03-11 18:28:47] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-11 18:28:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 18:28:47] [INFO ] [Real]Absence check using state equation in 102 ms returned sat
[2023-03-11 18:28:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 18:28:47] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 7 ms returned sat
[2023-03-11 18:28:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 18:28:47] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2023-03-11 18:28:47] [INFO ] Computed and/alt/rep : 47/50/47 causal constraints (skipped 49 transitions) in 15 ms.
[2023-03-11 18:28:47] [INFO ] Added : 30 causal constraints over 6 iterations in 117 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 109 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 109/109 places, 101/101 transitions.
Reduce places removed 5 places and 5 transitions.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 104 transition count 53
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 86 place count 61 transition count 53
Applied a total of 86 rules in 29 ms. Remains 61 /109 variables (removed 48) and now considering 53/101 (removed 48) transitions.
// Phase 1: matrix 53 rows 61 cols
[2023-03-11 18:28:47] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-11 18:28:47] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-11 18:28:47] [INFO ] Invariant cache hit.
[2023-03-11 18:28:48] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2023-03-11 18:28:48] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 18:28:48] [INFO ] Invariant cache hit.
[2023-03-11 18:28:48] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/109 places, 53/101 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 290 ms. Remains : 61/109 places, 53/101 transitions.
Computed a total of 61 stabilizing places and 53 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 61 transition count 53
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 248 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 36 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=18 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 225 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
[2023-03-11 18:28:48] [INFO ] Invariant cache hit.
[2023-03-11 18:28:48] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-11 18:28:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-11 18:28:48] [INFO ] [Real]Absence check using state equation in 32 ms returned sat
[2023-03-11 18:28:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-11 18:28:49] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 6 ms returned sat
[2023-03-11 18:28:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-11 18:28:49] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2023-03-11 18:28:49] [INFO ] Computed and/alt/rep : 44/48/44 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-11 18:28:49] [INFO ] Added : 21 causal constraints over 5 iterations in 46 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3339 reset in 178 ms.
Product exploration explored 100000 steps with 3341 reset in 213 ms.
Built C files in :
/tmp/ltsmin4046148009676823494
[2023-03-11 18:28:49] [INFO ] Computing symmetric may disable matrix : 53 transitions.
[2023-03-11 18:28:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 18:28:49] [INFO ] Computing symmetric may enable matrix : 53 transitions.
[2023-03-11 18:28:49] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 18:28:49] [INFO ] Computing Do-Not-Accords matrix : 53 transitions.
[2023-03-11 18:28:49] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-11 18:28:49] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4046148009676823494
Running compilation step : cd /tmp/ltsmin4046148009676823494;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 498 ms.
Running link step : cd /tmp/ltsmin4046148009676823494;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin4046148009676823494;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15187249441595403942.hoa' '--buchi-type=spotba'
LTSmin run took 112 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-00 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-05-LTLFireability-00 finished in 5188 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X((p0 U (p1 U G(!p1))))))'
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 107/107 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 112 transition count 104
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 112 transition count 104
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 109 transition count 101
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 109 transition count 101
Applied a total of 12 rules in 10 ms. Remains 109 /115 variables (removed 6) and now considering 101/107 (removed 6) transitions.
// Phase 1: matrix 101 rows 109 cols
[2023-03-11 18:28:50] [INFO ] Computed 8 place invariants in 4 ms
[2023-03-11 18:28:50] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-11 18:28:50] [INFO ] Invariant cache hit.
[2023-03-11 18:28:50] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 246 ms to find 0 implicit places.
[2023-03-11 18:28:50] [INFO ] Invariant cache hit.
[2023-03-11 18:28:50] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 109/115 places, 101/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 348 ms. Remains : 109/115 places, 101/107 transitions.
Stuttering acceptance computed with spot in 285 ms :[(OR (NOT p0) p1), (NOT p0), p1, p1, p1, true]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(AND (GEQ s9 1) (GEQ s108 1)), p1:(GEQ s87 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 87 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLFireability-01 finished in 655 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F(p1)))'
Support contains 2 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 107/107 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 113 transition count 105
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 113 transition count 105
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 111 transition count 103
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 111 transition count 103
Applied a total of 8 rules in 13 ms. Remains 111 /115 variables (removed 4) and now considering 103/107 (removed 4) transitions.
// Phase 1: matrix 103 rows 111 cols
[2023-03-11 18:28:50] [INFO ] Computed 8 place invariants in 3 ms
[2023-03-11 18:28:51] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-11 18:28:51] [INFO ] Invariant cache hit.
[2023-03-11 18:28:51] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2023-03-11 18:28:51] [INFO ] Invariant cache hit.
[2023-03-11 18:28:51] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 111/115 places, 103/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 438 ms. Remains : 111/115 places, 103/107 transitions.
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(GEQ s105 1), p0:(LT s84 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 178 ms.
Product exploration explored 100000 steps with 50000 reset in 178 ms.
Computed a total of 111 stabilizing places and 103 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 111 transition count 103
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT p1))), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 5 factoid took 112 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-05-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-05-LTLFireability-02 finished in 1103 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U p1) U G((!p2||F(p3)))))'
Support contains 6 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 107/107 transitions.
Reduce places removed 3 places and 3 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 112 transition count 77
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 54 place count 85 transition count 77
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 57 place count 82 transition count 74
Iterating global reduction 2 with 3 rules applied. Total rules applied 60 place count 82 transition count 74
Applied a total of 60 rules in 16 ms. Remains 82 /115 variables (removed 33) and now considering 74/107 (removed 33) transitions.
// Phase 1: matrix 74 rows 82 cols
[2023-03-11 18:28:52] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-11 18:28:52] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-11 18:28:52] [INFO ] Invariant cache hit.
[2023-03-11 18:28:52] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2023-03-11 18:28:52] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 18:28:52] [INFO ] Invariant cache hit.
[2023-03-11 18:28:52] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 82/115 places, 74/107 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 289 ms. Remains : 82/115 places, 74/107 transitions.
Stuttering acceptance computed with spot in 407 ms :[(AND p2 (NOT p3)), (NOT p3), (AND (NOT p3) p2), (AND (NOT p3) p2 p1 (NOT p0)), (AND (NOT p3) (NOT p0)), (AND (NOT p1) (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p3) p2), (AND (NOT p3) (NOT p0) p2 p1)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p3) (NOT p1) p0), acceptance={} source=0 dest: 4}, { cond=(AND p2 (NOT p3) (NOT p1) p0), acceptance={} source=0 dest: 5}, { cond=(OR (AND p2 (NOT p3) p1) (AND p2 (NOT p3) p0)), acceptance={} source=0 dest: 6}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND p2 (NOT p3) p1 (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}, { cond=(AND p2 (NOT p3) p1 p0), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p3) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) p0), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p3) (NOT p1) p0), acceptance={0} source=5 dest: 5}], [{ cond=(AND p2 (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=6 dest: 1}, { cond=(AND p2 (NOT p3) (NOT p1) p0), acceptance={} source=6 dest: 4}, { cond=(AND p2 (NOT p3) (NOT p1) p0), acceptance={} source=6 dest: 5}, { cond=(OR (AND (NOT p2) (NOT p3) p1) (AND (NOT p2) (NOT p3) p0)), acceptance={} source=6 dest: 6}, { cond=(OR (AND p2 (NOT p3) p1) (AND p2 (NOT p3) p0)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p2) (NOT p3) (NOT p1) p0), acceptance={} source=6 dest: 8}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=7 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=7 dest: 7}], [{ cond=(AND p2 (NOT p3) p1 (NOT p0)), acceptance={} source=8 dest: 1}, { cond=(AND p2 (NOT p3) p1 p0), acceptance={} source=8 dest: 4}, { cond=(AND (NOT p2) (NOT p3) p1 (NOT p0)), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p2) (NOT p3) p1 p0), acceptance={} source=8 dest: 8}]], initial=0, aps=[p1:(GEQ s48 1), p0:(AND (GEQ s1 1) (GEQ s10 1)), p2:(AND (GEQ s3 1) (GEQ s40 1)), p3:(AND (GEQ s3 1) (GEQ s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 1289 reset in 212 ms.
Product exploration explored 100000 steps with 1288 reset in 220 ms.
Computed a total of 82 stabilizing places and 74 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 82 transition count 74
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (X (NOT (AND p2 (NOT p3) (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (OR p1 p0))), (X (NOT (AND p2 (NOT p3) (NOT p1) (NOT p0)))), (X (NOT (OR (AND (NOT p2) (NOT p3) p1) (AND (NOT p2) (NOT p3) p0)))), (X (NOT (AND (NOT p3) p0))), (X (NOT (AND (NOT p3) (NOT p1) p0))), (X (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0))), (X (NOT (AND p2 (NOT p3)))), (X (AND (NOT p3) (NOT p1) (NOT p0))), (X (NOT (OR (AND p2 (NOT p3) p1) (AND p2 (NOT p3) p0)))), (X (NOT p3)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND p2 (NOT p3) p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p2 (NOT p3) p1 (NOT p0)))), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1) p0))), (X (X (NOT (AND p2 (NOT p3) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p3) p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p3) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3) p1 (NOT p0))))), true, (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (OR (AND p2 (NOT p3) p1) (AND p2 (NOT p3) p0))))), (X (X (NOT p3))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p2 (NOT p3) p1 p0)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p2 (NOT p3) p1 (NOT p0))))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p3)))]
False Knowledge obtained : [(X (X (OR p1 p0))), (X (X (NOT (OR p1 p0)))), (X (X (OR (AND (NOT p2) (NOT p3) p1) (AND (NOT p2) (NOT p3) p0)))), (X (X (NOT (OR (AND (NOT p2) (NOT p3) p1) (AND (NOT p2) (NOT p3) p0))))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (AND (NOT p3) (NOT p1) p0))), (X (X (NOT (AND (NOT p3) (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0))))), (X (X (AND (NOT p3) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND (NOT p2) (NOT p3) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1) p0))))]
Knowledge based reduction with 37 factoid took 2178 ms. Reduced automaton from 9 states, 32 edges and 4 AP (stutter insensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p3) p2), (NOT p3), (AND (NOT p3) p2)]
Finished random walk after 79 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=26 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2) (NOT p3)), (X (NOT (AND p2 (NOT p3) (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (OR p1 p0))), (X (NOT (AND p2 (NOT p3) (NOT p1) (NOT p0)))), (X (NOT (OR (AND (NOT p2) (NOT p3) p1) (AND (NOT p2) (NOT p3) p0)))), (X (NOT (AND (NOT p3) p0))), (X (NOT (AND (NOT p3) (NOT p1) p0))), (X (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0))), (X (NOT (AND p2 (NOT p3)))), (X (AND (NOT p3) (NOT p1) (NOT p0))), (X (NOT (OR (AND p2 (NOT p3) p1) (AND p2 (NOT p3) p0)))), (X (NOT p3)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 p0))), (X (NOT (AND p2 (NOT p3) p1 p0))), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p2 (NOT p3) p1 (NOT p0)))), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p1) p0))), (X (X (NOT (AND p2 (NOT p3) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p3) p1 p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p3) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p3) p1 (NOT p0))))), true, (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (OR (AND p2 (NOT p3) p1) (AND p2 (NOT p3) p0))))), (X (X (NOT p3))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND p2 (NOT p3) p1 p0)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND p2 (NOT p3) p1 (NOT p0))))), (F (G (NOT p1))), (F (G (NOT p0))), (F (G (NOT p2))), (F (G (NOT p3)))]
False Knowledge obtained : [(X (X (OR p1 p0))), (X (X (NOT (OR p1 p0)))), (X (X (OR (AND (NOT p2) (NOT p3) p1) (AND (NOT p2) (NOT p3) p0)))), (X (X (NOT (OR (AND (NOT p2) (NOT p3) p1) (AND (NOT p2) (NOT p3) p0))))), (X (X (AND (NOT p3) p0))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (AND (NOT p3) (NOT p1) p0))), (X (X (NOT (AND (NOT p3) (NOT p1) p0)))), (X (X (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1) (NOT p0))))), (X (X (AND (NOT p3) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND (NOT p2) (NOT p3) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p3) (NOT p1) p0)))), (F p3), (F (AND p2 (NOT p3)))]
Knowledge based reduction with 37 factoid took 2003 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p3) p2), (NOT p3), (AND (NOT p3) p2)]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p3) p2), (NOT p3), (AND (NOT p3) p2)]
Support contains 3 out of 82 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 82/82 places, 74/74 transitions.
Applied a total of 0 rules in 2 ms. Remains 82 /82 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2023-03-11 18:28:57] [INFO ] Invariant cache hit.
[2023-03-11 18:28:57] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-11 18:28:57] [INFO ] Invariant cache hit.
[2023-03-11 18:28:57] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2023-03-11 18:28:57] [INFO ] Invariant cache hit.
[2023-03-11 18:28:58] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 249 ms. Remains : 82/82 places, 74/74 transitions.
Computed a total of 82 stabilizing places and 74 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 82 transition count 74
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p3) (NOT p2)), (X (NOT (AND p2 (NOT p3)))), true, (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT p3))), (F (G (NOT p3))), (F (G (NOT p2)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 365 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p3) p2), (NOT p3), (AND (NOT p3) p2)]
Finished random walk after 79 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=26 )
Knowledge obtained : [(AND (NOT p3) (NOT p2)), (X (NOT (AND p2 (NOT p3)))), true, (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT p3))), (F (G (NOT p3))), (F (G (NOT p2)))]
False Knowledge obtained : [(F p3), (F (AND (NOT p3) p2))]
Knowledge based reduction with 7 factoid took 317 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p3) p2), (NOT p3), (AND (NOT p3) p2)]
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p3) p2), (NOT p3), (AND (NOT p3) p2)]
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p3) p2), (NOT p3), (AND (NOT p3) p2)]
Product exploration explored 100000 steps with 1290 reset in 123 ms.
Product exploration explored 100000 steps with 1288 reset in 147 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p3) p2), (NOT p3), (AND (NOT p3) p2)]
Support contains 3 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 74/74 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 82 transition count 74
Deduced a syphon composed of 10 places in 0 ms
Applied a total of 10 rules in 32 ms. Remains 82 /82 variables (removed 0) and now considering 74/74 (removed 0) transitions.
[2023-03-11 18:28:59] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 74 rows 82 cols
[2023-03-11 18:28:59] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-11 18:29:00] [INFO ] Dead Transitions using invariants and state equation in 87 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 82/82 places, 74/74 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 129 ms. Remains : 82/82 places, 74/74 transitions.
Built C files in :
/tmp/ltsmin7054131860447336381
[2023-03-11 18:29:00] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7054131860447336381
Running compilation step : cd /tmp/ltsmin7054131860447336381;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 226 ms.
Running link step : cd /tmp/ltsmin7054131860447336381;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin7054131860447336381;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12624616140578949101.hoa' '--buchi-type=spotba'
LTSmin run took 4529 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property HirschbergSinclair-PT-05-LTLFireability-03 finished in 12866 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G((!p1 U p2))&&p0))))'
Support contains 4 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 107/107 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 112 transition count 104
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 112 transition count 104
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 110 transition count 102
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 110 transition count 102
Applied a total of 10 rules in 10 ms. Remains 110 /115 variables (removed 5) and now considering 102/107 (removed 5) transitions.
// Phase 1: matrix 102 rows 110 cols
[2023-03-11 18:29:04] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-11 18:29:04] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-11 18:29:04] [INFO ] Invariant cache hit.
[2023-03-11 18:29:05] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2023-03-11 18:29:05] [INFO ] Invariant cache hit.
[2023-03-11 18:29:05] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 110/115 places, 102/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 335 ms. Remains : 110/115 places, 102/107 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p2) p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(OR (AND p0 p2) (AND p0 (NOT p1))), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(OR p2 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s9 1) (GEQ s24 1)), p2:(AND (GEQ s9 1) (GEQ s24 1)), p1:(AND (GEQ s5 1) (GEQ s78 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 111 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLFireability-04 finished in 558 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 107/107 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 112 transition count 104
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 112 transition count 104
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 109 transition count 101
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 109 transition count 101
Applied a total of 12 rules in 9 ms. Remains 109 /115 variables (removed 6) and now considering 101/107 (removed 6) transitions.
// Phase 1: matrix 101 rows 109 cols
[2023-03-11 18:29:05] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-11 18:29:05] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-11 18:29:05] [INFO ] Invariant cache hit.
[2023-03-11 18:29:05] [INFO ] Implicit Places using invariants and state equation in 155 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
[2023-03-11 18:29:05] [INFO ] Invariant cache hit.
[2023-03-11 18:29:05] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 109/115 places, 101/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 338 ms. Remains : 109/115 places, 101/107 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s9 1) (LT s83 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 167 ms.
Product exploration explored 100000 steps with 50000 reset in 168 ms.
Computed a total of 109 stabilizing places and 101 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 109 transition count 101
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), true, (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 4 factoid took 73 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-05-LTLFireability-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-05-LTLFireability-06 finished in 898 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(F(p1)))))'
Support contains 2 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 107/107 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 112 transition count 104
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 112 transition count 104
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 109 transition count 101
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 109 transition count 101
Applied a total of 12 rules in 13 ms. Remains 109 /115 variables (removed 6) and now considering 101/107 (removed 6) transitions.
[2023-03-11 18:29:06] [INFO ] Invariant cache hit.
[2023-03-11 18:29:06] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-11 18:29:06] [INFO ] Invariant cache hit.
[2023-03-11 18:29:06] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 251 ms to find 0 implicit places.
[2023-03-11 18:29:06] [INFO ] Invariant cache hit.
[2023-03-11 18:29:06] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 109/115 places, 101/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 364 ms. Remains : 109/115 places, 101/107 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s74 1), p1:(LT s61 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLFireability-08 finished in 543 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||G(p2)||F((G(!p0)||(!p0&&G(F(p0)))))))'
Support contains 5 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 107/107 transitions.
Reduce places removed 3 places and 3 transitions.
Drop transitions removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 112 transition count 76
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 84 transition count 76
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 59 place count 81 transition count 73
Iterating global reduction 2 with 3 rules applied. Total rules applied 62 place count 81 transition count 73
Applied a total of 62 rules in 12 ms. Remains 81 /115 variables (removed 34) and now considering 73/107 (removed 34) transitions.
// Phase 1: matrix 73 rows 81 cols
[2023-03-11 18:29:06] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-11 18:29:06] [INFO ] Implicit Places using invariants in 67 ms returned []
[2023-03-11 18:29:06] [INFO ] Invariant cache hit.
[2023-03-11 18:29:07] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
[2023-03-11 18:29:07] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 18:29:07] [INFO ] Invariant cache hit.
[2023-03-11 18:29:07] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/115 places, 73/107 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 333 ms. Remains : 81/115 places, 73/107 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0 (NOT p2))]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(AND (GEQ s5 1) (GEQ s24 1)), p0:(GEQ s63 1), p2:(AND (GEQ s2 1) (GEQ s71 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Initial state of product has no viable successors after 0 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-09 TRUE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLFireability-09 finished in 426 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U ((X(p2)&&p1) U G(p3))))'
Support contains 4 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 107/107 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 114 transition count 106
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 114 transition count 106
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 113 transition count 105
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 113 transition count 105
Applied a total of 4 rules in 7 ms. Remains 113 /115 variables (removed 2) and now considering 105/107 (removed 2) transitions.
// Phase 1: matrix 105 rows 113 cols
[2023-03-11 18:29:07] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-11 18:29:07] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-11 18:29:07] [INFO ] Invariant cache hit.
[2023-03-11 18:29:07] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2023-03-11 18:29:07] [INFO ] Invariant cache hit.
[2023-03-11 18:29:07] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 113/115 places, 105/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 318 ms. Remains : 113/115 places, 105/107 transitions.
Stuttering acceptance computed with spot in 221 ms :[(NOT p3), true, (OR (AND (NOT p2) p3) (AND p1 (NOT p2))), (NOT p3), (NOT p3), (AND (NOT p3) p1 (NOT p2))]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p3 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p3) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p3) p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p3 (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 4}, { cond=(AND p3 p1 (NOT p0)), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND p3 (NOT p2)) (AND p1 (NOT p2))), acceptance={} source=2 dest: 1}], [{ cond=(NOT p3), acceptance={} source=3 dest: 1}, { cond=p3, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) p1), acceptance={} source=4 dest: 2}, { cond=(AND p3 (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND p3 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) p1), acceptance={0} source=4 dest: 4}, { cond=(AND p3 p1), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p3) p1 (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p3 p1 (NOT p2)), acceptance={} source=5 dest: 3}]], initial=0, aps=[p3:(GEQ s101 1), p0:(AND (LT s50 1) (LT s97 1)), p1:(AND (GEQ s50 1) (GEQ s17 1)), p2:(GEQ s17 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 44 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLFireability-10 finished in 561 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))&&F((X(p2)||p1))))))'
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 107/107 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 113 transition count 105
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 113 transition count 105
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 111 transition count 103
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 111 transition count 103
Applied a total of 8 rules in 4 ms. Remains 111 /115 variables (removed 4) and now considering 103/107 (removed 4) transitions.
// Phase 1: matrix 103 rows 111 cols
[2023-03-11 18:29:07] [INFO ] Computed 8 place invariants in 2 ms
[2023-03-11 18:29:07] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-11 18:29:07] [INFO ] Invariant cache hit.
[2023-03-11 18:29:08] [INFO ] Implicit Places using invariants and state equation in 162 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
[2023-03-11 18:29:08] [INFO ] Invariant cache hit.
[2023-03-11 18:29:08] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 111/115 places, 103/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 337 ms. Remains : 111/115 places, 103/107 transitions.
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (LT s7 1) (LT s77 1)), p0:(OR (LT s7 1) (LT s77 1)), p2:(GEQ s11 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 901 reset in 193 ms.
Product exploration explored 100000 steps with 901 reset in 253 ms.
Computed a total of 111 stabilizing places and 103 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 111 transition count 103
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0 (NOT p2)), true, (X (X p1)), (F (G p1)), (F (G p0)), (F (G (NOT p2)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(F (G p0))
Knowledge based reduction with 6 factoid took 137 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA HirschbergSinclair-PT-05-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property HirschbergSinclair-PT-05-LTLFireability-11 finished in 1234 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 115 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 115/115 places, 107/107 transitions.
Reduce places removed 4 places and 4 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 111 transition count 67
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 75 transition count 67
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 75 place count 72 transition count 64
Iterating global reduction 2 with 3 rules applied. Total rules applied 78 place count 72 transition count 64
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 71 transition count 63
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 71 transition count 63
Applied a total of 80 rules in 10 ms. Remains 71 /115 variables (removed 44) and now considering 63/107 (removed 44) transitions.
// Phase 1: matrix 63 rows 71 cols
[2023-03-11 18:29:09] [INFO ] Computed 8 place invariants in 1 ms
[2023-03-11 18:29:09] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-11 18:29:09] [INFO ] Invariant cache hit.
[2023-03-11 18:29:09] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
[2023-03-11 18:29:09] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-11 18:29:09] [INFO ] Invariant cache hit.
[2023-03-11 18:29:09] [INFO ] Dead Transitions using invariants and state equation in 61 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/115 places, 63/107 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 240 ms. Remains : 71/115 places, 63/107 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-05-LTLFireability-14 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 (GEQ s5 1) (GEQ s65 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 482 steps with 7 reset in 1 ms.
FORMULA HirschbergSinclair-PT-05-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-05-LTLFireability-14 finished in 324 ms.
All properties solved by simple procedures.
Total runtime 27540 ms.
BK_STOP 1678559350881
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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="HirschbergSinclair-PT-05"
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-5348"
echo " Executing tool itstools"
echo " Input is HirschbergSinclair-PT-05, 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 r197-smll-167840344200428"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-05.tgz
mv HirschbergSinclair-PT-05 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 ;