Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.0M
-rw-r--r-- 1 mcc users 23K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 163K May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 338K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 1.7M May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 6 14:48 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 5.7K Mar 28 16:24 LTLCardinality.txt
-rw-r--r-- 1 mcc users 35K Mar 28 16:24 LTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Mar 28 16:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 28 16:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 27 06:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 21K Mar 27 06:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Mar 25 08:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Mar 25 08:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Mar 22 09:15 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.7K Mar 22 09:15 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 481K May 5 16:51 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 PermAdmissibility-PT-05-00
FORMULA_NAME PermAdmissibility-PT-05-01
FORMULA_NAME PermAdmissibility-PT-05-02
FORMULA_NAME PermAdmissibility-PT-05-03
FORMULA_NAME PermAdmissibility-PT-05-04
FORMULA_NAME PermAdmissibility-PT-05-05
FORMULA_NAME PermAdmissibility-PT-05-06
FORMULA_NAME PermAdmissibility-PT-05-07
FORMULA_NAME PermAdmissibility-PT-05-08
FORMULA_NAME PermAdmissibility-PT-05-09
FORMULA_NAME PermAdmissibility-PT-05-10
FORMULA_NAME PermAdmissibility-PT-05-11
FORMULA_NAME PermAdmissibility-PT-05-12
FORMULA_NAME PermAdmissibility-PT-05-13
FORMULA_NAME PermAdmissibility-PT-05-14
FORMULA_NAME PermAdmissibility-PT-05-15

=== Now, execution of the tool begins

BK_START 1620998814636

Running Version 0
[2021-05-14 13:27:11] [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]
[2021-05-14 13:27:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-14 13:27:11] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2021-05-14 13:27:11] [INFO ] Transformed 168 places.
[2021-05-14 13:27:11] [INFO ] Transformed 592 transitions.
[2021-05-14 13:27:11] [INFO ] Parsed PT model containing 168 places and 592 transitions in 125 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2021-05-14 13:27:11] [INFO ] Initial state test concluded for 4 properties.
FORMULA PermAdmissibility-PT-05-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 101 out of 168 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 168/168 places, 592/592 transitions.
Reduce places removed 64 places and 0 transitions.
Iterating post reduction 0 with 64 rules applied. Total rules applied 64 place count 104 transition count 592
Applied a total of 64 rules in 21 ms. Remains 104 /168 variables (removed 64) and now considering 592/592 (removed 0) transitions.
// Phase 1: matrix 592 rows 104 cols
[2021-05-14 13:27:11] [INFO ] Computed 16 place invariants in 26 ms
[2021-05-14 13:27:12] [INFO ] Implicit Places using invariants in 147 ms returned []
// Phase 1: matrix 592 rows 104 cols
[2021-05-14 13:27:12] [INFO ] Computed 16 place invariants in 9 ms
[2021-05-14 13:27:12] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
// Phase 1: matrix 592 rows 104 cols
[2021-05-14 13:27:12] [INFO ] Computed 16 place invariants in 15 ms
[2021-05-14 13:27:12] [INFO ] Dead Transitions using invariants and state equation in 280 ms returned []
Finished structural reductions, in 1 iterations. Remains : 104/168 places, 592/592 transitions.
[2021-05-14 13:27:12] [INFO ] Flatten gal took : 108 ms
[2021-05-14 13:27:12] [INFO ] Flatten gal took : 69 ms
[2021-05-14 13:27:13] [INFO ] Input system was already deterministic with 592 transitions.
Incomplete random walk after 100003 steps, including 1036 resets, run finished after 339 ms. (steps per millisecond=294 ) properties (out of 32) seen :31
Running SMT prover for 1 properties.
// Phase 1: matrix 592 rows 104 cols
[2021-05-14 13:27:13] [INFO ] Computed 16 place invariants in 7 ms
[2021-05-14 13:27:13] [INFO ] [Real]Absence check using 0 positive and 16 generalized place invariants in 5 ms returned sat
[2021-05-14 13:27:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-14 13:27:13] [INFO ] [Real]Absence check using state equation in 132 ms returned sat
[2021-05-14 13:27:13] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 560 transitions) in 105 ms.
[2021-05-14 13:27:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-14 13:27:13] [INFO ] [Nat]Absence check using 0 positive and 16 generalized place invariants in 5 ms returned sat
[2021-05-14 13:27:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-14 13:27:14] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2021-05-14 13:27:14] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 560 transitions) in 74 ms.
[2021-05-14 13:27:14] [INFO ] Added : 13 causal constraints over 3 iterations in 180 ms. Result :sat
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G((p0||F(p1)))))], workingDir=/home/mcc/execution]
Support contains 14 out of 104 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 78 transition count 344
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 76 place count 54 transition count 108
Iterating global reduction 0 with 24 rules applied. Total rules applied 100 place count 54 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 101 place count 53 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 102 place count 53 transition count 100
Applied a total of 102 rules in 28 ms. Remains 53 /104 variables (removed 51) and now considering 100/592 (removed 492) transitions.
// Phase 1: matrix 100 rows 53 cols
[2021-05-14 13:27:14] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-14 13:27:14] [INFO ] Implicit Places using invariants in 39 ms returned [0, 5, 18, 25]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 41 ms to find 4 implicit places.
[2021-05-14 13:27:14] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 100 rows 49 cols
[2021-05-14 13:27:14] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 13:27:14] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Starting structural reductions, iteration 1 : 49/104 places, 100/592 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 49 transition count 99
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 48 transition count 99
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 48 transition count 98
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 47 transition count 98
Applied a total of 4 rules in 11 ms. Remains 47 /49 variables (removed 2) and now considering 98/100 (removed 2) transitions.
// Phase 1: matrix 98 rows 47 cols
[2021-05-14 13:27:14] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-14 13:27:14] [INFO ] Implicit Places using invariants in 30 ms returned []
// Phase 1: matrix 98 rows 47 cols
[2021-05-14 13:27:14] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-14 13:27:14] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 47/104 places, 98/592 transitions.
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-PT-05-00 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s31 1) (LT s33 1) (LT s42 1)) (OR (LT s32 1) (LT s34 1) (LT s42 1)) (OR (LT s32 1) (LT s33 1) (LT s42 1)) (OR (LT s31 1) (LT s34 1) (LT s42 1))), p1:(AND (OR (LT s20 1) (LT s26 1) (LT s35 1)) (OR (LT s23 1) (LT s27 1) (LT s35 1)) (OR (LT s19 1) (LT s26 1) (LT s35 1)) (OR (LT s24 1) (LT s27 1) (LT s35 1)) (OR (LT s20 1) (LT s23 1) (LT s35 1)) (OR (LT s26 1) (LT s28 1) (LT s35 1)) (OR (LT s20 1) (LT s25 1) (LT s35 1)) (OR (LT s25 1) (LT s28 1) (LT s35 1)) (OR (LT s19 1) (LT s23 1) (LT s35 1)) (OR (LT s19 1) (LT s25 1) (LT s35 1)) (OR (LT s24 1) (LT s28 1) (LT s35 1)) (OR (LT s26 1) (LT s27 1) (LT s35 1)) (OR (LT s20 1) (LT s24 1) (LT s35 1)) (OR (LT s25 1) (LT s27 1) (LT s35 1)) (OR (LT s23 1) (LT s28 1) (LT s35 1)) (OR (LT s19 1) (LT s24 1) (LT s35 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2730 reset in 527 ms.
Product exploration explored 100000 steps with 2762 reset in 480 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 47 transition count 98
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 : [(F (G p0)), (F (G p1)), p0, p1]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA PermAdmissibility-PT-05-00 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property PermAdmissibility-PT-05-00 finished in 14758 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((G(p0)&&F(p1))))], workingDir=/home/mcc/execution]
Support contains 22 out of 104 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 91 transition count 468
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 91 transition count 468
Applied a total of 26 rules in 23 ms. Remains 91 /104 variables (removed 13) and now considering 468/592 (removed 124) transitions.
// Phase 1: matrix 468 rows 91 cols
[2021-05-14 13:27:29] [INFO ] Computed 16 place invariants in 4 ms
[2021-05-14 13:27:29] [INFO ] Implicit Places using invariants in 83 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 85 ms to find 1 implicit places.
// Phase 1: matrix 468 rows 90 cols
[2021-05-14 13:27:29] [INFO ] Computed 15 place invariants in 3 ms
[2021-05-14 13:27:29] [INFO ] Dead Transitions using invariants and state equation in 182 ms returned []
Starting structural reductions, iteration 1 : 90/104 places, 468/592 transitions.
Applied a total of 0 rules in 9 ms. Remains 90 /90 variables (removed 0) and now considering 468/468 (removed 0) transitions.
// Phase 1: matrix 468 rows 90 cols
[2021-05-14 13:27:29] [INFO ] Computed 15 place invariants in 3 ms
[2021-05-14 13:27:29] [INFO ] Dead Transitions using invariants and state equation in 184 ms returned []
Finished structural reductions, in 2 iterations. Remains : 90/104 places, 468/592 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-PT-05-01 automaton TGBA [mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(AND (OR (LT s2 1) (LT s13 1) (LT s15 1)) (OR (LT s6 1) (LT s12 1) (LT s15 1)) (OR (LT s3 1) (LT s10 1) (LT s15 1)) (OR (LT s7 1) (LT s8 1) (LT s15 1)) (OR (LT s0 1) (LT s9 1) (LT s15 1)) (OR (LT s7 1) (LT s10 1) (LT s15 1)) (OR (LT s0 1) (LT s8 1) (LT s15 1)) (OR (LT s2 1) (LT s12 1) (LT s15 1)) (OR (LT s6 1) (LT s13 1) (LT s15 1)) (OR (LT s3 1) (LT s9 1) (LT s15 1)) (OR (LT s7 1) (LT s15 1) (LT s16 1)) (OR (LT s6 1) (LT s10 1) (LT s15 1)) (OR (LT s7 1) (LT s11 1) (LT s15 1)) (OR (LT s1 1) (LT s14 1) (LT s15 1)) (OR (LT s4 1) (LT s10 1) (LT s15 1)) (OR (LT s1 1) (LT s9 1) (LT s15 1)) (OR (LT s0 1) (LT s12 1) (LT s15 1)) (OR (LT s6 1) (LT s15 1) (LT s16 1)) (OR (LT s0 1) (LT s11 1) (LT s15 1)) (OR (LT s3 1) (LT s12 1) (LT s15 1)) (OR (LT s5 1) (LT s13 1) (LT s15 1)) (OR (LT s4 1) (LT s9 1) (LT s15 1)) (OR (LT s1 1) (LT s8 1) (LT s15 1)) (OR (LT s0 1) (LT s15 1) (LT s16 1)) (OR (LT s6 1) (LT s11 1) (LT s15 1)) (OR (LT s2 1) (LT s14 1) (LT s15 1)) (OR (LT s3 1) (LT s11 1) (LT s15 1)) (OR (LT s5 1) (LT s14 1) (LT s15 1)) (OR (LT s0 1) (LT s10 1) (LT s15 1)) (OR (LT s4 1) (LT s8 1) (LT s15 1)) (OR (LT s7 1) (LT s9 1) (LT s15 1)) (OR (LT s3 1) (LT s15 1) (LT s16 1)) (OR (LT s7 1) (LT s14 1) (LT s15 1)) (OR (LT s4 1) (LT s13 1) (LT s15 1)) (OR (LT s0 1) (LT s14 1) (LT s15 1)) (OR (LT s4 1) (LT s12 1) (LT s15 1)) (OR (LT s5 1) (LT s9 1) (LT s15 1)) (OR (LT s2 1) (LT s8 1) (LT s15 1)) (OR (LT s1 1) (LT s11 1) (LT s15 1)) (OR (LT s5 1) (LT s15 1) (LT s16 1)) (OR (LT s0 1) (LT s13 1) (LT s15 1)) (OR (LT s1 1) (LT s10 1) (LT s15 1)) (OR (LT s4 1) (LT s11 1) (LT s15 1)) (OR (LT s4 1) (LT s14 1) (LT s15 1)) (OR (LT s2 1) (LT s15 1) (LT s16 1)) (OR (LT s5 1) (LT s8 1) (LT s15 1)) (OR (LT s5 1) (LT s12 1) (LT s15 1)) (OR (LT s3 1) (LT s13 1) (LT s15 1)) (OR (LT s3 1) (LT s8 1) (LT s15 1)) (OR (LT s4 1) (LT s15 1) (LT s16 1)) (OR (LT s2 1) (LT s11 1) (LT s15 1)) (OR (LT s6 1) (LT s14 1) (LT s15 1)) (OR (LT s6 1) (LT s9 1) (LT s15 1)) (OR (LT s1 1) (LT s13 1) (LT s15 1)) (OR (LT s7 1) (LT s12 1) (LT s15 1)) (OR (LT s2 1) (LT s10 1) (LT s15 1)) (OR (LT s3 1) (LT s14 1) (LT s15 1)) (OR (LT s5 1) (LT s11 1) (LT s15 1)) (OR (LT s1 1) (LT s15 1) (LT s16 1)) (OR (LT s6 1) (LT s8 1) (LT s15 1)) (OR (LT s2 1) (LT s9 1) (LT s15 1)) (OR (LT s1 1) (LT s12 1) (LT s15 1)) (OR (LT s7 1) (LT s13 1) (LT s15 1)) (OR (LT s5 1) (LT s10 1) (LT s15 1))), p1:(AND (OR (LT s67 1) (LT s70 1) (LT s84 1)) (OR (LT s67 1) (LT s69 1) (LT s84 1)) (OR (LT s68 1) (LT s70 1) (LT s84 1)) (OR (LT s68 1) (LT s69 1) (LT s84 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 36 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-PT-05-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-01 finished in 607 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(((G(p1)&&X(F((X(p3)||p2))))||p0))))], workingDir=/home/mcc/execution]
Support contains 39 out of 104 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 78 transition count 344
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 78 transition count 344
Applied a total of 52 rules in 6 ms. Remains 78 /104 variables (removed 26) and now considering 344/592 (removed 248) transitions.
// Phase 1: matrix 344 rows 78 cols
[2021-05-14 13:27:29] [INFO ] Computed 16 place invariants in 3 ms
[2021-05-14 13:27:29] [INFO ] Implicit Places using invariants in 44 ms returned [0, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 45 ms to find 2 implicit places.
// Phase 1: matrix 344 rows 76 cols
[2021-05-14 13:27:29] [INFO ] Computed 14 place invariants in 2 ms
[2021-05-14 13:27:29] [INFO ] Dead Transitions using invariants and state equation in 120 ms returned []
Starting structural reductions, iteration 1 : 76/104 places, 344/592 transitions.
Applied a total of 0 rules in 3 ms. Remains 76 /76 variables (removed 0) and now considering 344/344 (removed 0) transitions.
// Phase 1: matrix 344 rows 76 cols
[2021-05-14 13:27:29] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-14 13:27:29] [INFO ] Dead Transitions using invariants and state equation in 124 ms returned []
Finished structural reductions, in 2 iterations. Remains : 76/104 places, 344/592 transitions.
Stuttering acceptance computed with spot in 197 ms :[(NOT p1), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), true]
Running random walk in product with property : PermAdmissibility-PT-05-02 automaton TGBA [mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 6}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 6}], [{ cond=(OR (AND p1 p2) (AND p1 p3)), acceptance={0} source=3 dest: 0}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={0} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 6}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=5, aps=[p1:(AND (OR (LT s17 1) (LT s58 1) (LT s65 1)) (OR (LT s32 1) (LT s35 1) (LT s65 1)) (OR (LT s20 1) (LT s59 1) (LT s65 1)) (OR (LT s20 1) (LT s40 1) (LT s65 1)) (OR (LT s18 1) (LT s35 1) (LT s65 1)) (OR (LT s17 1) (LT s38 1) (LT s65 1)) (OR (LT s17 1) (LT s57 1) (LT s65 1)) (OR (LT s17 1) (LT s59 1) (LT s65 1)) (OR (LT s21 1) (LT s57 1) (LT s65 1)) (OR (LT s22 1) (LT s35 1) (LT s65 1)) (OR (LT s20 1) (LT s39 1) (LT s65 1)) (OR (LT s18 1) (LT s57 1) (LT s65 1)) (OR (LT s17 1) (LT s39 1) (LT s65 1)) (OR (LT s21 1) (LT s37 1) (LT s65 1)) (OR (LT s23 1) (LT s40 1) (LT s65 1)) (OR (LT s21 1) (LT s58 1) (LT s65 1)) (OR (LT s19 1) (LT s35 1) (LT s65 1)) (OR (LT s23 1) (LT s58 1) (LT s65 1)) (OR (LT s18 1) (LT s38 1) (LT s65 1)) (OR (LT s20 1) (LT s57 1) (LT s65 1)) (OR (LT s22 1) (LT s37 1) (LT s65 1)) (OR (LT s17 1) (LT s40 1) (LT s65 1)) (OR (LT s18 1) (LT s37 1) (LT s65 1)) (OR (LT s32 1) (LT s37 1) (LT s65 1)) (OR (LT s21 1) (LT s40 1) (LT s65 1)) (OR (LT s21 1) (LT s38 1) (LT s65 1)) (OR (LT s18 1) (LT s39 1) (LT s65 1)) (OR (LT s23 1) (LT s59 1) (LT s65 1)) (OR (LT s20 1) (LT s58 1) (LT s65 1)) (OR (LT s21 1) (LT s39 1) (LT s65 1)) (OR (LT s19 1) (LT s57 1) (LT s65 1)) (OR (LT s22 1) (LT s58 1) (LT s65 1)) (OR (LT s18 1) (LT s40 1) (LT s65 1)) (OR (LT s22 1) (LT s39 1) (LT s65 1)) (OR (LT s22 1) (LT s59 1) (LT s65 1)) (OR (LT s19 1) (LT s37 1) (LT s65 1)) (OR (LT s23 1) (LT s35 1) (LT s65 1)) (OR (LT s19 1) (LT s58 1) (LT s65 1)) (OR (LT s23 1) (LT s37 1) (LT s65 1)) (OR (LT s32 1) (LT s39 1) (LT s65 1)) (OR (LT s17 1) (LT s35 1) (LT s65 1)) (OR (LT s22 1) (LT s38 1) (LT s65 1)) (OR (LT s19 1) (LT s38 1) (LT s65 1)) (OR (LT s20 1) (LT s35 1) (LT s65 1)) (OR (LT s23 1) (LT s57 1) (LT s65 1)) (OR (LT s32 1) (LT s59 1) (LT s65 1)) (OR (LT s32 1) (LT s38 1) (LT s65 1)) (OR (LT s19 1) (LT s59 1) (LT s65 1)) (OR (LT s19 1) (LT s40 1) (LT s65 1)) (OR (LT s20 1) (LT s37 1) (LT s65 1)) (OR (LT s23 1) (LT s39 1) (LT s65 1)) (OR (LT s18 1) (LT s58 1) (LT s65 1)) (OR (LT s21 1) (LT s59 1) (LT s65 1)) (OR (LT s19 1) (LT s39 1) (LT s65 1)) (OR (LT s32 1) (LT s58 1) (LT s65 1)) (OR (LT s22 1) (LT s40 1) (LT s65 1)) (OR (LT s17 1) (LT s37 1) (LT s65 1)) (OR (LT s18 1) (LT s59 1) (LT s65 1)) (OR (LT s20 1) (LT s38 1) (LT s65 1)) (OR (LT s22 1) (LT s57 1) (LT s65 1)) (OR (LT s21 1) (LT s35 1) (LT s65 1)) (OR (LT s32 1) (LT s40 1) (LT s65 1)) (OR (LT s32 1) (LT s57 1) (LT s65 1)) (OR (LT s23 1) (LT s38 1) (LT s65 1))), p0:(OR (AND (GEQ s69 1) (GEQ s73 1) (GEQ s75 1)) (AND (GEQ s69 1) (GEQ s73 1) (GEQ s74 1)) (AND (GEQ s68 1) (GEQ s73 1) (GEQ s74 1)) (AND (GEQ s68 1) (GEQ s73 1) (GEQ s75 1))), p2:(OR (AND (GEQ s69 1) (GEQ s73 1) (GEQ s75 1)) (AND (GEQ s69 1) (GEQ s73 1) (GEQ s74 1)) (AND (GEQ s68 1) (GEQ s73 1) (GEQ s74 1)) (AND (GEQ s68 1) (GEQ s73 1) (GEQ s75 1))), p3:(AND (OR (LT s26 1) (LT s52 1) (LT s67 1)) (OR (LT s29 1) (LT s63 1) (LT s67 1)) (OR (LT s27 1) (LT s49 1) (LT s67 1)) (OR (LT s30 1) (LT s50 1) (LT s67 1)) (OR (LT s41 1) (LT s49 1) (LT s67 1)) (OR (LT s26 1) (LT s61 1) (LT s67 1)) (OR (LT s27 1) (LT s50 1) (LT s67 1)) (OR (LT s30 1) (LT s61 1) (LT s67 1)) (OR (LT s29 1) (LT s62 1) (LT s67 1)) (OR (LT s30 1) (LT s52 1) (LT s67 1)) (OR (LT s30 1) (LT s51 1) (LT s67 1)) (OR (LT s27 1) (LT s51 1) (LT s67 1)) (OR (LT s25 1) (LT s64 1) (LT s67 1)) (OR (LT s26 1) (LT s62 1) (LT s67 1)) (OR (LT s25 1) (LT s62 1) (LT s67 1)) (OR (LT s29 1) (LT s61 1) (LT s67 1)) (OR (LT s28 1) (LT s64 1) (LT s67 1)) (OR (LT s26 1) (LT s50 1) (LT s67 1)) (OR (LT s42 1) (LT s62 1) (LT s67 1)) (OR (LT s29 1) (LT s51 1) (LT s67 1)) (OR (LT s29 1) (LT s52 1) (LT s67 1)) (OR (LT s30 1) (LT s49 1) (LT s67 1)) (OR (LT s26 1) (LT s51 1) (LT s67 1)) (OR (LT s25 1) (LT s63 1) (LT s67 1)) (OR (LT s42 1) (LT s61 1) (LT s67 1)) (OR (LT s42 1) (LT s52 1) (LT s67 1)) (OR (LT s28 1) (LT s63 1) (LT s67 1)) (OR (LT s28 1) (LT s61 1) (LT s67 1)) (OR (LT s25 1) (LT s50 1) (LT s67 1)) (OR (LT s41 1) (LT s63 1) (LT s67 1)) (OR (LT s28 1) (LT s51 1) (LT s67 1)) (OR (LT s27 1) (LT s64 1) (LT s67 1)) (OR (LT s29 1) (LT s49 1) (LT s67 1)) (OR (LT s41 1) (LT s64 1) (LT s67 1)) (OR (LT s42 1) (LT s51 1) (LT s67 1)) (OR (LT s28 1) (LT s62 1) (LT s67 1)) (OR (LT s25 1) (LT s61 1) (LT s67 1)) (OR (LT s41 1) (LT s62 1) (LT s67 1)) (OR (LT s25 1) (LT s51 1) (LT s67 1)) (OR (LT s30 1) (LT s64 1) (LT s67 1)) (OR (LT s28 1) (LT s52 1) (LT s67 1)) (OR (LT s41 1) (LT s52 1) (LT s67 1)) (OR (LT s27 1) (LT s63 1) (LT s67 1)) (OR (LT s26 1) (LT s49 1) (LT s67 1)) (OR (LT s25 1) (LT s52 1) (LT s67 1)) (OR (LT s41 1) (LT s61 1) (LT s67 1)) (OR (LT s29 1) (LT s50 1) (LT s67 1)) (OR (LT s42 1) (LT s50 1) (LT s67 1)) (OR (LT s28 1) (LT s49 1) (LT s67 1)) (OR (LT s42 1) (LT s63 1) (LT s67 1)) (OR (LT s27 1) (LT s61 1) (LT s67 1)) (OR (LT s41 1) (LT s51 1) (LT s67 1)) (OR (LT s27 1) (LT s62 1) (LT s67 1)) (OR (LT s42 1) (LT s49 1) (LT s67 1)) (OR (LT s27 1) (LT s52 1) (LT s67 1)) (OR (LT s30 1) (LT s63 1) (LT s67 1)) (OR (LT s28 1) (LT s50 1) (LT s67 1)) (OR (LT s26 1) (LT s63 1) (LT s67 1)) (OR (LT s42 1) (LT s64 1) (LT s67 1)) (OR (LT s41 1) (LT s50 1) (LT s67 1)) (OR (LT s25 1) (LT s49 1) (LT s67 1)) (OR (LT s29 1) (LT s64 1) (LT s67 1)) (OR (LT s30 1) (LT s62 1) (LT s67 1)) (OR (LT s26 1) (LT s64 1) (LT s67 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 27 steps with 2 reset in 0 ms.
FORMULA PermAdmissibility-PT-05-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-02 finished in 512 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(!p0))], workingDir=/home/mcc/execution]
Support contains 9 out of 104 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 78 transition count 344
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 76 place count 54 transition count 108
Iterating global reduction 0 with 24 rules applied. Total rules applied 100 place count 54 transition count 108
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 101 place count 53 transition count 100
Iterating global reduction 0 with 1 rules applied. Total rules applied 102 place count 53 transition count 100
Applied a total of 102 rules in 26 ms. Remains 53 /104 variables (removed 51) and now considering 100/592 (removed 492) transitions.
// Phase 1: matrix 100 rows 53 cols
[2021-05-14 13:27:30] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-14 13:27:30] [INFO ] Implicit Places using invariants in 48 ms returned [0, 5, 18, 25]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 49 ms to find 4 implicit places.
[2021-05-14 13:27:30] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 100 rows 49 cols
[2021-05-14 13:27:30] [INFO ] Computed 12 place invariants in 6 ms
[2021-05-14 13:27:30] [INFO ] Dead Transitions using invariants and state equation in 50 ms returned []
Starting structural reductions, iteration 1 : 49/104 places, 100/592 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 49 transition count 99
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 48 transition count 99
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 48 transition count 98
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 47 transition count 98
Applied a total of 4 rules in 16 ms. Remains 47 /49 variables (removed 2) and now considering 98/100 (removed 2) transitions.
// Phase 1: matrix 98 rows 47 cols
[2021-05-14 13:27:30] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 13:27:30] [INFO ] Implicit Places using invariants in 53 ms returned []
// Phase 1: matrix 98 rows 47 cols
[2021-05-14 13:27:30] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 13:27:30] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 47/104 places, 98/592 transitions.
Stuttering acceptance computed with spot in 28 ms :[p0]
Running random walk in product with property : PermAdmissibility-PT-05-04 automaton TGBA [mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (OR (LT s20 1) (LT s26 1) (LT s35 1)) (OR (LT s23 1) (LT s27 1) (LT s35 1)) (OR (LT s19 1) (LT s26 1) (LT s35 1)) (OR (LT s24 1) (LT s27 1) (LT s35 1)) (OR (LT s20 1) (LT s23 1) (LT s35 1)) (OR (LT s26 1) (LT s28 1) (LT s35 1)) (OR (LT s20 1) (LT s25 1) (LT s35 1)) (OR (LT s25 1) (LT s28 1) (LT s35 1)) (OR (LT s19 1) (LT s23 1) (LT s35 1)) (OR (LT s19 1) (LT s25 1) (LT s35 1)) (OR (LT s24 1) (LT s28 1) (LT s35 1)) (OR (LT s26 1) (LT s27 1) (LT s35 1)) (OR (LT s20 1) (LT s24 1) (LT s35 1)) (OR (LT s25 1) (LT s27 1) (LT s35 1)) (OR (LT s23 1) (LT s28 1) (LT s35 1)) (OR (LT s19 1) (LT s24 1) (LT s35 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 11394 reset in 365 ms.
Product exploration explored 100000 steps with 11432 reset in 393 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 47 transition count 98
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 : [(F (G p0)), p0]
Stuttering acceptance computed with spot in 20 ms :[p0]
Product exploration explored 100000 steps with 11399 reset in 380 ms.
Product exploration explored 100000 steps with 11471 reset in 376 ms.
[2021-05-14 13:27:32] [INFO ] Flatten gal took : 8 ms
[2021-05-14 13:27:32] [INFO ] Flatten gal took : 7 ms
[2021-05-14 13:27:32] [INFO ] Time to serialize gal into /tmp/LTL6584781879350038496.gal : 3 ms
[2021-05-14 13:27:32] [INFO ] Time to serialize properties into /tmp/LTL16382431218506609291.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL6584781879350038496.gal, -t, CGAL, -LTL, /tmp/LTL16382431218506609291.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6584781879350038496.gal -t CGAL -LTL /tmp/LTL16382431218506609291.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((F("((((((((((((((((((aux7_6>=1)&&(aux5_4>=1))&&(c9>=1))||(((aux5_1>=1)&&(aux7_3>=1))&&(c9>=1)))||(((aux7_7>=1)&&(aux5_4>=1))&&(c9>=1)))||(((aux5_0>=1)&&(aux7_3>=1))&&(c9>=1)))||(((aux7_6>=1)&&(aux5_1>=1))&&(c9>=1)))||(((aux5_4>=1)&&(aux7_2>=1))&&(c9>=1)))||(((aux7_6>=1)&&(aux5_5>=1))&&(c9>=1)))||(((aux5_5>=1)&&(aux7_2>=1))&&(c9>=1)))||(((aux7_7>=1)&&(aux5_1>=1))&&(c9>=1)))||(((aux7_7>=1)&&(aux5_5>=1))&&(c9>=1)))||(((aux5_0>=1)&&(aux7_2>=1))&&(c9>=1)))||(((aux5_4>=1)&&(aux7_3>=1))&&(c9>=1)))||(((aux7_6>=1)&&(aux5_0>=1))&&(c9>=1)))||(((aux5_5>=1)&&(aux7_3>=1))&&(c9>=1)))||(((aux5_1>=1)&&(aux7_2>=1))&&(c9>=1)))||(((aux7_7>=1)&&(aux5_0>=1))&&(c9>=1)))")))
Formula 0 simplified : !F"((((((((((((((((((aux7_6>=1)&&(aux5_4>=1))&&(c9>=1))||(((aux5_1>=1)&&(aux7_3>=1))&&(c9>=1)))||(((aux7_7>=1)&&(aux5_4>=1))&&(c9>=1)))||(((aux5_0>=1)&&(aux7_3>=1))&&(c9>=1)))||(((aux7_6>=1)&&(aux5_1>=1))&&(c9>=1)))||(((aux5_4>=1)&&(aux7_2>=1))&&(c9>=1)))||(((aux7_6>=1)&&(aux5_5>=1))&&(c9>=1)))||(((aux5_5>=1)&&(aux7_2>=1))&&(c9>=1)))||(((aux7_7>=1)&&(aux5_1>=1))&&(c9>=1)))||(((aux7_7>=1)&&(aux5_5>=1))&&(c9>=1)))||(((aux5_0>=1)&&(aux7_2>=1))&&(c9>=1)))||(((aux5_4>=1)&&(aux7_3>=1))&&(c9>=1)))||(((aux7_6>=1)&&(aux5_0>=1))&&(c9>=1)))||(((aux5_5>=1)&&(aux7_3>=1))&&(c9>=1)))||(((aux5_1>=1)&&(aux7_2>=1))&&(c9>=1)))||(((aux7_7>=1)&&(aux5_0>=1))&&(c9>=1)))"
Detected timeout of ITS tools.
[2021-05-14 13:27:47] [INFO ] Flatten gal took : 7 ms
[2021-05-14 13:27:47] [INFO ] Applying decomposition
[2021-05-14 13:27:47] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph17709528426928077214.txt, -o, /tmp/graph17709528426928077214.bin, -w, /tmp/graph17709528426928077214.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph17709528426928077214.bin, -l, -1, -v, -w, /tmp/graph17709528426928077214.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 13:27:47] [INFO ] Decomposing Gal with order
[2021-05-14 13:27:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 13:27:47] [INFO ] Removed a total of 65 redundant transitions.
[2021-05-14 13:27:47] [INFO ] Flatten gal took : 38 ms
[2021-05-14 13:27:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 80 labels/synchronizations in 6 ms.
[2021-05-14 13:27:47] [INFO ] Time to serialize gal into /tmp/LTL12366965636784943540.gal : 3 ms
[2021-05-14 13:27:50] [INFO ] Time to serialize properties into /tmp/LTL7351417724952839418.ltl : 2935 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL12366965636784943540.gal, -t, CGAL, -LTL, /tmp/LTL7351417724952839418.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL12366965636784943540.gal -t CGAL -LTL /tmp/LTL7351417724952839418.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((F("((((((((((((((((((i1.u3.aux7_6>=1)&&(i1.u3.aux5_4>=1))&&(i1.u4.c9>=1))||(((i1.u3.aux5_1>=1)&&(i1.u3.aux7_3>=1))&&(i1.u4.c9>=1)))||(((i1.u3.aux7_7>=1)&&(i1.u3.aux5_4>=1))&&(i1.u4.c9>=1)))||(((i1.u3.aux5_0>=1)&&(i1.u3.aux7_3>=1))&&(i1.u4.c9>=1)))||(((i1.u3.aux7_6>=1)&&(i1.u3.aux5_1>=1))&&(i1.u4.c9>=1)))||(((i1.u3.aux5_4>=1)&&(i1.u3.aux7_2>=1))&&(i1.u4.c9>=1)))||(((i1.u3.aux7_6>=1)&&(i1.u3.aux5_5>=1))&&(i1.u4.c9>=1)))||(((i1.u3.aux5_5>=1)&&(i1.u3.aux7_2>=1))&&(i1.u4.c9>=1)))||(((i1.u3.aux7_7>=1)&&(i1.u3.aux5_1>=1))&&(i1.u4.c9>=1)))||(((i1.u3.aux7_7>=1)&&(i1.u3.aux5_5>=1))&&(i1.u4.c9>=1)))||(((i1.u3.aux5_0>=1)&&(i1.u3.aux7_2>=1))&&(i1.u4.c9>=1)))||(((i1.u3.aux5_4>=1)&&(i1.u3.aux7_3>=1))&&(i1.u4.c9>=1)))||(((i1.u3.aux7_6>=1)&&(i1.u3.aux5_0>=1))&&(i1.u4.c9>=1)))||(((i1.u3.aux5_5>=1)&&(i1.u3.aux7_3>=1))&&(i1.u4.c9>=1)))||(((i1.u3.aux5_1>=1)&&(i1.u3.aux7_2>=1))&&(i1.u4.c9>=1)))||(((i1.u3.aux7_7>=1)&&(i1.u3.aux5_0>=1))&&(i1.u4.c9>=1)))")))
Formula 0 simplified : !F"((((((((((((((((((i1.u3.aux7_6>=1)&&(i1.u3.aux5_4>=1))&&(i1.u4.c9>=1))||(((i1.u3.aux5_1>=1)&&(i1.u3.aux7_3>=1))&&(i1.u4.c9>=1)))||(((i1.u3.aux7_7>=1)&&(i1.u3.aux5_4>=1))&&(i1.u4.c9>=1)))||(((i1.u3.aux5_0>=1)&&(i1.u3.aux7_3>=1))&&(i1.u4.c9>=1)))||(((i1.u3.aux7_6>=1)&&(i1.u3.aux5_1>=1))&&(i1.u4.c9>=1)))||(((i1.u3.aux5_4>=1)&&(i1.u3.aux7_2>=1))&&(i1.u4.c9>=1)))||(((i1.u3.aux7_6>=1)&&(i1.u3.aux5_5>=1))&&(i1.u4.c9>=1)))||(((i1.u3.aux5_5>=1)&&(i1.u3.aux7_2>=1))&&(i1.u4.c9>=1)))||(((i1.u3.aux7_7>=1)&&(i1.u3.aux5_1>=1))&&(i1.u4.c9>=1)))||(((i1.u3.aux7_7>=1)&&(i1.u3.aux5_5>=1))&&(i1.u4.c9>=1)))||(((i1.u3.aux5_0>=1)&&(i1.u3.aux7_2>=1))&&(i1.u4.c9>=1)))||(((i1.u3.aux5_4>=1)&&(i1.u3.aux7_3>=1))&&(i1.u4.c9>=1)))||(((i1.u3.aux7_6>=1)&&(i1.u3.aux5_0>=1))&&(i1.u4.c9>=1)))||(((i1.u3.aux5_5>=1)&&(i1.u3.aux7_3>=1))&&(i1.u4.c9>=1)))||(((i1.u3.aux5_1>=1)&&(i1.u3.aux7_2>=1))&&(i1.u4.c9>=1)))||(((i1.u3.aux7_7>=1)&&(i1.u3.aux5_0>=1))&&(i1.u4.c9>=1)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8436281401979848055
[2021-05-14 13:28:05] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8436281401979848055
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin8436281401979848055]
Compilation finished in 567 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin8436281401979848055]
Link finished in 51 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, <>((LTLAPp0==true)), --buchi-type=spotba], workingDir=/tmp/ltsmin8436281401979848055]
LTSmin run took 1471 ms.
FORMULA PermAdmissibility-PT-05-04 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-PT-05-04 finished in 37307 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F((G(p0)||(X(p0)&&p1)))))], workingDir=/home/mcc/execution]
Support contains 26 out of 104 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 91 transition count 468
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 91 transition count 468
Applied a total of 26 rules in 5 ms. Remains 91 /104 variables (removed 13) and now considering 468/592 (removed 124) transitions.
// Phase 1: matrix 468 rows 91 cols
[2021-05-14 13:28:07] [INFO ] Computed 16 place invariants in 3 ms
[2021-05-14 13:28:07] [INFO ] Implicit Places using invariants in 94 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 96 ms to find 1 implicit places.
// Phase 1: matrix 468 rows 90 cols
[2021-05-14 13:28:07] [INFO ] Computed 15 place invariants in 7 ms
[2021-05-14 13:28:07] [INFO ] Dead Transitions using invariants and state equation in 178 ms returned []
Starting structural reductions, iteration 1 : 90/104 places, 468/592 transitions.
Applied a total of 0 rules in 4 ms. Remains 90 /90 variables (removed 0) and now considering 468/468 (removed 0) transitions.
// Phase 1: matrix 468 rows 90 cols
[2021-05-14 13:28:07] [INFO ] Computed 15 place invariants in 2 ms
[2021-05-14 13:28:07] [INFO ] Dead Transitions using invariants and state equation in 164 ms returned []
Finished structural reductions, in 2 iterations. Remains : 90/104 places, 468/592 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-05-05 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (OR (LT s2 1) (LT s13 1) (LT s15 1)) (OR (LT s6 1) (LT s12 1) (LT s15 1)) (OR (LT s3 1) (LT s10 1) (LT s15 1)) (OR (LT s7 1) (LT s8 1) (LT s15 1)) (OR (LT s0 1) (LT s9 1) (LT s15 1)) (OR (LT s7 1) (LT s10 1) (LT s15 1)) (OR (LT s0 1) (LT s8 1) (LT s15 1)) (OR (LT s2 1) (LT s12 1) (LT s15 1)) (OR (LT s6 1) (LT s13 1) (LT s15 1)) (OR (LT s3 1) (LT s9 1) (LT s15 1)) (OR (LT s7 1) (LT s15 1) (LT s16 1)) (OR (LT s6 1) (LT s10 1) (LT s15 1)) (OR (LT s7 1) (LT s11 1) (LT s15 1)) (OR (LT s1 1) (LT s14 1) (LT s15 1)) (OR (LT s4 1) (LT s10 1) (LT s15 1)) (OR (LT s1 1) (LT s9 1) (LT s15 1)) (OR (LT s0 1) (LT s12 1) (LT s15 1)) (OR (LT s6 1) (LT s15 1) (LT s16 1)) (OR (LT s0 1) (LT s11 1) (LT s15 1)) (OR (LT s3 1) (LT s12 1) (LT s15 1)) (OR (LT s5 1) (LT s13 1) (LT s15 1)) (OR (LT s4 1) (LT s9 1) (LT s15 1)) (OR (LT s1 1) (LT s8 1) (LT s15 1)) (OR (LT s0 1) (LT s15 1) (LT s16 1)) (OR (LT s6 1) (LT s11 1) (LT s15 1)) (OR (LT s2 1) (LT s14 1) (LT s15 1)) (OR (LT s3 1) (LT s11 1) (LT s15 1)) (OR (LT s5 1) (LT s14 1) (LT s15 1)) (OR (LT s0 1) (LT s10 1) (LT s15 1)) (OR (LT s4 1) (LT s8 1) (LT s15 1)) (OR (LT s7 1) (LT s9 1) (LT s15 1)) (OR (LT s3 1) (LT s15 1) (LT s16 1)) (OR (LT s7 1) (LT s14 1) (LT s15 1)) (OR (LT s4 1) (LT s13 1) (LT s15 1)) (OR (LT s0 1) (LT s14 1) (LT s15 1)) (OR (LT s4 1) (LT s12 1) (LT s15 1)) (OR (LT s5 1) (LT s9 1) (LT s15 1)) (OR (LT s2 1) (LT s8 1) (LT s15 1)) (OR (LT s1 1) (LT s11 1) (LT s15 1)) (OR (LT s5 1) (LT s15 1) (LT s16 1)) (OR (LT s0 1) (LT s13 1) (LT s15 1)) (OR (LT s1 1) (LT s10 1) (LT s15 1)) (OR (LT s4 1) (LT s11 1) (LT s15 1)) (OR (LT s4 1) (LT s14 1) (LT s15 1)) (OR (LT s2 1) (LT s15 1) (LT s16 1)) (OR (LT s5 1) (LT s8 1) (LT s15 1)) (OR (LT s5 1) (LT s12 1) (LT s15 1)) (OR (LT s3 1) (LT s13 1) (LT s15 1)) (OR (LT s3 1) (LT s8 1) (LT s15 1)) (OR (LT s4 1) (LT s15 1) (LT s16 1)) (OR (LT s2 1) (LT s11 1) (LT s15 1)) (OR (LT s6 1) (LT s14 1) (LT s15 1)) (OR (LT s6 1) (LT s9 1) (LT s15 1)) (OR (LT s1 1) (LT s13 1) (LT s15 1)) (OR (LT s7 1) (LT s12 1) (LT s15 1)) (OR (LT s2 1) (LT s10 1) (LT s15 1)) (OR (LT s3 1) (LT s14 1) (LT s15 1)) (OR (LT s5 1) (LT s11 1) (LT s15 1)) (OR (LT s1 1) (LT s15 1) (LT s16 1)) (OR (LT s6 1) (LT s8 1) (LT s15 1)) (OR (LT s2 1) (LT s9 1) (LT s15 1)) (OR (LT s1 1) (LT s12 1) (LT s15 1)) (OR (LT s7 1) (LT s13 1) (LT s15 1)) (OR (LT s5 1) (LT s10 1) (LT s15 1))), p0:(AND (OR (LT s24 1) (LT s27 1) (LT s28 1)) (OR (LT s24 1) (LT s25 1) (LT s30 1)) (OR (LT s24 1) (LT s25 1) (LT s29 1)) (OR (LT s24 1) (LT s25 1) (LT s27 1)) (OR (LT s22 1) (LT s24 1) (LT s28 1)) (OR (LT s24 1) (LT s28 1) (LT s29 1)) (OR (LT s22 1) (LT s24 1) (LT s26 1)) (OR (LT s24 1) (LT s26 1) (LT s29 1)) (OR (LT s22 1) (LT s24 1) (LT s25 1)) (OR (LT s24 1) (LT s28 1) (LT s30 1)) (OR (LT s24 1) (LT s26 1) (LT s30 1)) (OR (LT s22 1) (LT s23 1) (LT s24 1)) (OR (LT s24 1) (LT s26 1) (LT s27 1)) (OR (LT s23 1) (LT s24 1) (LT s29 1)) (OR (LT s23 1) (LT s24 1) (LT s30 1)) (OR (LT s23 1) (LT s24 1) (LT s27 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 4473 reset in 1125 ms.
Product exploration explored 100000 steps with 4469 reset in 1151 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 90 transition count 468
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 : [(F (G p1)), (F (G p0)), p1, p0]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA PermAdmissibility-PT-05-05 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property PermAdmissibility-PT-05-05 finished in 3807 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(!p0)))], workingDir=/home/mcc/execution]
Support contains 17 out of 104 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 91 transition count 468
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 91 transition count 468
Applied a total of 26 rules in 5 ms. Remains 91 /104 variables (removed 13) and now considering 468/592 (removed 124) transitions.
// Phase 1: matrix 468 rows 91 cols
[2021-05-14 13:28:11] [INFO ] Computed 16 place invariants in 3 ms
[2021-05-14 13:28:11] [INFO ] Implicit Places using invariants in 65 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 66 ms to find 1 implicit places.
// Phase 1: matrix 468 rows 90 cols
[2021-05-14 13:28:11] [INFO ] Computed 15 place invariants in 3 ms
[2021-05-14 13:28:11] [INFO ] Dead Transitions using invariants and state equation in 173 ms returned []
Starting structural reductions, iteration 1 : 90/104 places, 468/592 transitions.
Applied a total of 0 rules in 3 ms. Remains 90 /90 variables (removed 0) and now considering 468/468 (removed 0) transitions.
// Phase 1: matrix 468 rows 90 cols
[2021-05-14 13:28:11] [INFO ] Computed 15 place invariants in 2 ms
[2021-05-14 13:28:11] [INFO ] Dead Transitions using invariants and state equation in 175 ms returned []
Finished structural reductions, in 2 iterations. Remains : 90/104 places, 468/592 transitions.
Stuttering acceptance computed with spot in 58 ms :[p0, p0]
Running random walk in product with property : PermAdmissibility-PT-05-06 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (OR (LT s2 1) (LT s13 1) (LT s15 1)) (OR (LT s6 1) (LT s12 1) (LT s15 1)) (OR (LT s3 1) (LT s10 1) (LT s15 1)) (OR (LT s7 1) (LT s8 1) (LT s15 1)) (OR (LT s0 1) (LT s9 1) (LT s15 1)) (OR (LT s7 1) (LT s10 1) (LT s15 1)) (OR (LT s0 1) (LT s8 1) (LT s15 1)) (OR (LT s2 1) (LT s12 1) (LT s15 1)) (OR (LT s6 1) (LT s13 1) (LT s15 1)) (OR (LT s3 1) (LT s9 1) (LT s15 1)) (OR (LT s7 1) (LT s15 1) (LT s16 1)) (OR (LT s6 1) (LT s10 1) (LT s15 1)) (OR (LT s7 1) (LT s11 1) (LT s15 1)) (OR (LT s1 1) (LT s14 1) (LT s15 1)) (OR (LT s4 1) (LT s10 1) (LT s15 1)) (OR (LT s1 1) (LT s9 1) (LT s15 1)) (OR (LT s0 1) (LT s12 1) (LT s15 1)) (OR (LT s6 1) (LT s15 1) (LT s16 1)) (OR (LT s0 1) (LT s11 1) (LT s15 1)) (OR (LT s3 1) (LT s12 1) (LT s15 1)) (OR (LT s5 1) (LT s13 1) (LT s15 1)) (OR (LT s4 1) (LT s9 1) (LT s15 1)) (OR (LT s1 1) (LT s8 1) (LT s15 1)) (OR (LT s0 1) (LT s15 1) (LT s16 1)) (OR (LT s6 1) (LT s11 1) (LT s15 1)) (OR (LT s2 1) (LT s14 1) (LT s15 1)) (OR (LT s3 1) (LT s11 1) (LT s15 1)) (OR (LT s5 1) (LT s14 1) (LT s15 1)) (OR (LT s0 1) (LT s10 1) (LT s15 1)) (OR (LT s4 1) (LT s8 1) (LT s15 1)) (OR (LT s7 1) (LT s9 1) (LT s15 1)) (OR (LT s3 1) (LT s15 1) (LT s16 1)) (OR (LT s7 1) (LT s14 1) (LT s15 1)) (OR (LT s4 1) (LT s13 1) (LT s15 1)) (OR (LT s0 1) (LT s14 1) (LT s15 1)) (OR (LT s4 1) (LT s12 1) (LT s15 1)) (OR (LT s5 1) (LT s9 1) (LT s15 1)) (OR (LT s2 1) (LT s8 1) (LT s15 1)) (OR (LT s1 1) (LT s11 1) (LT s15 1)) (OR (LT s5 1) (LT s15 1) (LT s16 1)) (OR (LT s0 1) (LT s13 1) (LT s15 1)) (OR (LT s1 1) (LT s10 1) (LT s15 1)) (OR (LT s4 1) (LT s11 1) (LT s15 1)) (OR (LT s4 1) (LT s14 1) (LT s15 1)) (OR (LT s2 1) (LT s15 1) (LT s16 1)) (OR (LT s5 1) (LT s8 1) (LT s15 1)) (OR (LT s5 1) (LT s12 1) (LT s15 1)) (OR (LT s3 1) (LT s13 1) (LT s15 1)) (OR (LT s3 1) (LT s8 1) (LT s15 1)) (OR (LT s4 1) (LT s15 1) (LT s16 1)) (OR (LT s2 1) (LT s11 1) (LT s15 1)) (OR (LT s6 1) (LT s14 1) (LT s15 1)) (OR (LT s6 1) (LT s9 1) (LT s15 1)) (OR (LT s1 1) (LT s13 1) (LT s15 1)) (OR (LT s7 1) (LT s12 1) (LT s15 1)) (OR (LT s2 1) (LT s10 1) (LT s15 1)) (OR (LT s3 1) (LT s14 1) (LT s15 1)) (OR (LT s5 1) (LT s11 1) (LT s15 1)) (OR (LT s1 1) (LT s15 1) (LT s16 1)) (OR (LT s6 1) (LT s8 1) (LT s15 1)) (OR (LT s2 1) (LT s9 1) (LT s15 1)) (OR (LT s1 1) (LT s12 1) (LT s15 1)) (OR (LT s7 1) (LT s13 1) (LT s15 1)) (OR (LT s5 1) (LT s10 1) (LT s15 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 2251 reset in 917 ms.
Product exploration explored 100000 steps with 2237 reset in 949 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 90 transition count 468
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 : [(F (G p0)), p0]
Stuttering acceptance computed with spot in 48 ms :[p0, p0]
Product exploration explored 100000 steps with 2242 reset in 915 ms.
Product exploration explored 100000 steps with 2238 reset in 936 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 45 ms :[p0, p0]
Support contains 17 out of 90 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 90/90 places, 468/468 transitions.
Applied a total of 0 rules in 15 ms. Remains 90 /90 variables (removed 0) and now considering 468/468 (removed 0) transitions.
[2021-05-14 13:28:16] [INFO ] Redundant transitions in 26 ms returned []
// Phase 1: matrix 468 rows 90 cols
[2021-05-14 13:28:16] [INFO ] Computed 15 place invariants in 2 ms
[2021-05-14 13:28:16] [INFO ] Dead Transitions using invariants and state equation in 150 ms returned []
Finished structural reductions, in 1 iterations. Remains : 90/90 places, 468/468 transitions.
Product exploration explored 100000 steps with 2230 reset in 1087 ms.
Product exploration explored 100000 steps with 2260 reset in 1034 ms.
[2021-05-14 13:28:18] [INFO ] Flatten gal took : 34 ms
[2021-05-14 13:28:18] [INFO ] Flatten gal took : 33 ms
[2021-05-14 13:28:18] [INFO ] Time to serialize gal into /tmp/LTL16467137771784992361.gal : 5 ms
[2021-05-14 13:28:18] [INFO ] Time to serialize properties into /tmp/LTL8590654725827416590.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL16467137771784992361.gal, -t, CGAL, -LTL, /tmp/LTL8590654725827416590.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL16467137771784992361.gal -t CGAL -LTL /tmp/LTL8590654725827416590.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((aux16_2>=1)&&(aux14_6>=1))&&(c20>=1))||(((aux16_6>=1)&&(aux14_4>=1))&&(c20>=1)))||(((aux16_3>=1)&&(aux14_2>=1))&&(c20>=1)))||(((aux16_7>=1)&&(aux14_0>=1))&&(c20>=1)))||(((aux16_0>=1)&&(aux14_1>=1))&&(c20>=1)))||(((aux16_7>=1)&&(aux14_2>=1))&&(c20>=1)))||(((aux16_0>=1)&&(aux14_0>=1))&&(c20>=1)))||(((aux16_2>=1)&&(aux14_4>=1))&&(c20>=1)))||(((aux16_6>=1)&&(aux14_6>=1))&&(c20>=1)))||(((aux16_3>=1)&&(aux14_1>=1))&&(c20>=1)))||(((aux16_7>=1)&&(c20>=1))&&(aux14_7>=1)))||(((aux16_6>=1)&&(aux14_2>=1))&&(c20>=1)))||(((aux16_7>=1)&&(aux14_3>=1))&&(c20>=1)))||(((aux16_1>=1)&&(aux14_5>=1))&&(c20>=1)))||(((aux16_4>=1)&&(aux14_2>=1))&&(c20>=1)))||(((aux16_1>=1)&&(aux14_1>=1))&&(c20>=1)))||(((aux16_0>=1)&&(aux14_4>=1))&&(c20>=1)))||(((aux16_6>=1)&&(c20>=1))&&(aux14_7>=1)))||(((aux16_0>=1)&&(aux14_3>=1))&&(c20>=1)))||(((aux16_3>=1)&&(aux14_4>=1))&&(c20>=1)))||(((aux16_5>=1)&&(aux14_6>=1))&&(c20>=1)))||(((aux16_4>=1)&&(aux14_1>=1))&&(c20>=1)))||(((aux16_1>=1)&&(aux14_0>=1))&&(c20>=1)))||(((aux16_0>=1)&&(c20>=1))&&(aux14_7>=1)))||(((aux16_6>=1)&&(aux14_3>=1))&&(c20>=1)))||(((aux16_2>=1)&&(aux14_5>=1))&&(c20>=1)))||(((aux16_3>=1)&&(aux14_3>=1))&&(c20>=1)))||(((aux16_5>=1)&&(aux14_5>=1))&&(c20>=1)))||(((aux16_0>=1)&&(aux14_2>=1))&&(c20>=1)))||(((aux16_4>=1)&&(aux14_0>=1))&&(c20>=1)))||(((aux16_7>=1)&&(aux14_1>=1))&&(c20>=1)))||(((aux16_3>=1)&&(c20>=1))&&(aux14_7>=1)))||(((aux16_7>=1)&&(aux14_5>=1))&&(c20>=1)))||(((aux16_4>=1)&&(aux14_6>=1))&&(c20>=1)))||(((aux16_0>=1)&&(aux14_5>=1))&&(c20>=1)))||(((aux16_4>=1)&&(aux14_4>=1))&&(c20>=1)))||(((aux16_5>=1)&&(aux14_1>=1))&&(c20>=1)))||(((aux16_2>=1)&&(aux14_0>=1))&&(c20>=1)))||(((aux16_1>=1)&&(aux14_3>=1))&&(c20>=1)))||(((aux16_5>=1)&&(c20>=1))&&(aux14_7>=1)))||(((aux16_0>=1)&&(aux14_6>=1))&&(c20>=1)))||(((aux16_1>=1)&&(aux14_2>=1))&&(c20>=1)))||(((aux16_4>=1)&&(aux14_3>=1))&&(c20>=1)))||(((aux16_4>=1)&&(aux14_5>=1))&&(c20>=1)))||(((aux16_2>=1)&&(c20>=1))&&(aux14_7>=1)))||(((aux16_5>=1)&&(aux14_0>=1))&&(c20>=1)))||(((aux16_5>=1)&&(aux14_4>=1))&&(c20>=1)))||(((aux16_3>=1)&&(aux14_6>=1))&&(c20>=1)))||(((aux16_3>=1)&&(aux14_0>=1))&&(c20>=1)))||(((aux16_4>=1)&&(c20>=1))&&(aux14_7>=1)))||(((aux16_2>=1)&&(aux14_3>=1))&&(c20>=1)))||(((aux16_6>=1)&&(aux14_5>=1))&&(c20>=1)))||(((aux16_6>=1)&&(aux14_1>=1))&&(c20>=1)))||(((aux16_1>=1)&&(aux14_6>=1))&&(c20>=1)))||(((aux16_7>=1)&&(aux14_4>=1))&&(c20>=1)))||(((aux16_2>=1)&&(aux14_2>=1))&&(c20>=1)))||(((aux16_3>=1)&&(aux14_5>=1))&&(c20>=1)))||(((aux16_5>=1)&&(aux14_3>=1))&&(c20>=1)))||(((aux16_1>=1)&&(c20>=1))&&(aux14_7>=1)))||(((aux16_6>=1)&&(aux14_0>=1))&&(c20>=1)))||(((aux16_2>=1)&&(aux14_1>=1))&&(c20>=1)))||(((aux16_1>=1)&&(aux14_4>=1))&&(c20>=1)))||(((aux16_7>=1)&&(aux14_6>=1))&&(c20>=1)))||(((aux16_5>=1)&&(aux14_2>=1))&&(c20>=1)))"))))
Formula 0 simplified : !XF"((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((aux16_2>=1)&&(aux14_6>=1))&&(c20>=1))||(((aux16_6>=1)&&(aux14_4>=1))&&(c20>=1)))||(((aux16_3>=1)&&(aux14_2>=1))&&(c20>=1)))||(((aux16_7>=1)&&(aux14_0>=1))&&(c20>=1)))||(((aux16_0>=1)&&(aux14_1>=1))&&(c20>=1)))||(((aux16_7>=1)&&(aux14_2>=1))&&(c20>=1)))||(((aux16_0>=1)&&(aux14_0>=1))&&(c20>=1)))||(((aux16_2>=1)&&(aux14_4>=1))&&(c20>=1)))||(((aux16_6>=1)&&(aux14_6>=1))&&(c20>=1)))||(((aux16_3>=1)&&(aux14_1>=1))&&(c20>=1)))||(((aux16_7>=1)&&(c20>=1))&&(aux14_7>=1)))||(((aux16_6>=1)&&(aux14_2>=1))&&(c20>=1)))||(((aux16_7>=1)&&(aux14_3>=1))&&(c20>=1)))||(((aux16_1>=1)&&(aux14_5>=1))&&(c20>=1)))||(((aux16_4>=1)&&(aux14_2>=1))&&(c20>=1)))||(((aux16_1>=1)&&(aux14_1>=1))&&(c20>=1)))||(((aux16_0>=1)&&(aux14_4>=1))&&(c20>=1)))||(((aux16_6>=1)&&(c20>=1))&&(aux14_7>=1)))||(((aux16_0>=1)&&(aux14_3>=1))&&(c20>=1)))||(((aux16_3>=1)&&(aux14_4>=1))&&(c20>=1)))||(((aux16_5>=1)&&(aux14_6>=1))&&(c20>=1)))||(((aux16_4>=1)&&(aux14_1>=1))&&(c20>=1)))||(((aux16_1>=1)&&(aux14_0>=1))&&(c20>=1)))||(((aux16_0>=1)&&(c20>=1))&&(aux14_7>=1)))||(((aux16_6>=1)&&(aux14_3>=1))&&(c20>=1)))||(((aux16_2>=1)&&(aux14_5>=1))&&(c20>=1)))||(((aux16_3>=1)&&(aux14_3>=1))&&(c20>=1)))||(((aux16_5>=1)&&(aux14_5>=1))&&(c20>=1)))||(((aux16_0>=1)&&(aux14_2>=1))&&(c20>=1)))||(((aux16_4>=1)&&(aux14_0>=1))&&(c20>=1)))||(((aux16_7>=1)&&(aux14_1>=1))&&(c20>=1)))||(((aux16_3>=1)&&(c20>=1))&&(aux14_7>=1)))||(((aux16_7>=1)&&(aux14_5>=1))&&(c20>=1)))||(((aux16_4>=1)&&(aux14_6>=1))&&(c20>=1)))||(((aux16_0>=1)&&(aux14_5>=1))&&(c20>=1)))||(((aux16_4>=1)&&(aux14_4>=1))&&(c20>=1)))||(((aux16_5>=1)&&(aux14_1>=1))&&(c20>=1)))||(((aux16_2>=1)&&(aux14_0>=1))&&(c20>=1)))||(((aux16_1>=1)&&(aux14_3>=1))&&(c20>=1)))||(((aux16_5>=1)&&(c20>=1))&&(aux14_7>=1)))||(((aux16_0>=1)&&(aux14_6>=1))&&(c20>=1)))||(((aux16_1>=1)&&(aux14_2>=1))&&(c20>=1)))||(((aux16_4>=1)&&(aux14_3>=1))&&(c20>=1)))||(((aux16_4>=1)&&(aux14_5>=1))&&(c20>=1)))||(((aux16_2>=1)&&(c20>=1))&&(aux14_7>=1)))||(((aux16_5>=1)&&(aux14_0>=1))&&(c20>=1)))||(((aux16_5>=1)&&(aux14_4>=1))&&(c20>=1)))||(((aux16_3>=1)&&(aux14_6>=1))&&(c20>=1)))||(((aux16_3>=1)&&(aux14_0>=1))&&(c20>=1)))||(((aux16_4>=1)&&(c20>=1))&&(aux14_7>=1)))||(((aux16_2>=1)&&(aux14_3>=1))&&(c20>=1)))||(((aux16_6>=1)&&(aux14_5>=1))&&(c20>=1)))||(((aux16_6>=1)&&(aux14_1>=1))&&(c20>=1)))||(((aux16_1>=1)&&(aux14_6>=1))&&(c20>=1)))||(((aux16_7>=1)&&(aux14_4>=1))&&(c20>=1)))||(((aux16_2>=1)&&(aux14_2>=1))&&(c20>=1)))||(((aux16_3>=1)&&(aux14_5>=1))&&(c20>=1)))||(((aux16_5>=1)&&(aux14_3>=1))&&(c20>=1)))||(((aux16_1>=1)&&(c20>=1))&&(aux14_7>=1)))||(((aux16_6>=1)&&(aux14_0>=1))&&(c20>=1)))||(((aux16_2>=1)&&(aux14_1>=1))&&(c20>=1)))||(((aux16_1>=1)&&(aux14_4>=1))&&(c20>=1)))||(((aux16_7>=1)&&(aux14_6>=1))&&(c20>=1)))||(((aux16_5>=1)&&(aux14_2>=1))&&(c20>=1)))"
Detected timeout of ITS tools.
[2021-05-14 13:28:33] [INFO ] Flatten gal took : 29 ms
[2021-05-14 13:28:33] [INFO ] Applying decomposition
[2021-05-14 13:28:33] [INFO ] Flatten gal took : 26 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph7623655518616890496.txt, -o, /tmp/graph7623655518616890496.bin, -w, /tmp/graph7623655518616890496.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph7623655518616890496.bin, -l, -1, -v, -w, /tmp/graph7623655518616890496.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 13:28:33] [INFO ] Decomposing Gal with order
[2021-05-14 13:28:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 13:28:33] [INFO ] Removed a total of 511 redundant transitions.
[2021-05-14 13:28:33] [INFO ] Flatten gal took : 70 ms
[2021-05-14 13:28:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 88 labels/synchronizations in 5 ms.
[2021-05-14 13:28:33] [INFO ] Time to serialize gal into /tmp/LTL12993571531080089354.gal : 3 ms
[2021-05-14 13:28:33] [INFO ] Time to serialize properties into /tmp/LTL14877114282033319784.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTL12993571531080089354.gal, -t, CGAL, -LTL, /tmp/LTL14877114282033319784.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL12993571531080089354.gal -t CGAL -LTL /tmp/LTL14877114282033319784.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((u3.aux16_2>=1)&&(u1.aux14_6>=1))&&(u0.c20>=1))||(((u3.aux16_6>=1)&&(u1.aux14_4>=1))&&(u0.c20>=1)))||(((u3.aux16_3>=1)&&(u1.aux14_2>=1))&&(u0.c20>=1)))||(((u3.aux16_7>=1)&&(u1.aux14_0>=1))&&(u0.c20>=1)))||(((u3.aux16_0>=1)&&(u1.aux14_1>=1))&&(u0.c20>=1)))||(((u3.aux16_7>=1)&&(u1.aux14_2>=1))&&(u0.c20>=1)))||(((u3.aux16_0>=1)&&(u1.aux14_0>=1))&&(u0.c20>=1)))||(((u3.aux16_2>=1)&&(u1.aux14_4>=1))&&(u0.c20>=1)))||(((u3.aux16_6>=1)&&(u1.aux14_6>=1))&&(u0.c20>=1)))||(((u3.aux16_3>=1)&&(u1.aux14_1>=1))&&(u0.c20>=1)))||(((u3.aux16_7>=1)&&(u0.c20>=1))&&(u1.aux14_7>=1)))||(((u3.aux16_6>=1)&&(u1.aux14_2>=1))&&(u0.c20>=1)))||(((u3.aux16_7>=1)&&(u1.aux14_3>=1))&&(u0.c20>=1)))||(((u3.aux16_1>=1)&&(u1.aux14_5>=1))&&(u0.c20>=1)))||(((u3.aux16_4>=1)&&(u1.aux14_2>=1))&&(u0.c20>=1)))||(((u3.aux16_1>=1)&&(u1.aux14_1>=1))&&(u0.c20>=1)))||(((u3.aux16_0>=1)&&(u1.aux14_4>=1))&&(u0.c20>=1)))||(((u3.aux16_6>=1)&&(u0.c20>=1))&&(u1.aux14_7>=1)))||(((u3.aux16_0>=1)&&(u1.aux14_3>=1))&&(u0.c20>=1)))||(((u3.aux16_3>=1)&&(u1.aux14_4>=1))&&(u0.c20>=1)))||(((u3.aux16_5>=1)&&(u1.aux14_6>=1))&&(u0.c20>=1)))||(((u3.aux16_4>=1)&&(u1.aux14_1>=1))&&(u0.c20>=1)))||(((u3.aux16_1>=1)&&(u1.aux14_0>=1))&&(u0.c20>=1)))||(((u3.aux16_0>=1)&&(u0.c20>=1))&&(u1.aux14_7>=1)))||(((u3.aux16_6>=1)&&(u1.aux14_3>=1))&&(u0.c20>=1)))||(((u3.aux16_2>=1)&&(u1.aux14_5>=1))&&(u0.c20>=1)))||(((u3.aux16_3>=1)&&(u1.aux14_3>=1))&&(u0.c20>=1)))||(((u3.aux16_5>=1)&&(u1.aux14_5>=1))&&(u0.c20>=1)))||(((u3.aux16_0>=1)&&(u1.aux14_2>=1))&&(u0.c20>=1)))||(((u3.aux16_4>=1)&&(u1.aux14_0>=1))&&(u0.c20>=1)))||(((u3.aux16_7>=1)&&(u1.aux14_1>=1))&&(u0.c20>=1)))||(((u3.aux16_3>=1)&&(u0.c20>=1))&&(u1.aux14_7>=1)))||(((u3.aux16_7>=1)&&(u1.aux14_5>=1))&&(u0.c20>=1)))||(((u3.aux16_4>=1)&&(u1.aux14_6>=1))&&(u0.c20>=1)))||(((u3.aux16_0>=1)&&(u1.aux14_5>=1))&&(u0.c20>=1)))||(((u3.aux16_4>=1)&&(u1.aux14_4>=1))&&(u0.c20>=1)))||(((u3.aux16_5>=1)&&(u1.aux14_1>=1))&&(u0.c20>=1)))||(((u3.aux16_2>=1)&&(u1.aux14_0>=1))&&(u0.c20>=1)))||(((u3.aux16_1>=1)&&(u1.aux14_3>=1))&&(u0.c20>=1)))||(((u3.aux16_5>=1)&&(u0.c20>=1))&&(u1.aux14_7>=1)))||(((u3.aux16_0>=1)&&(u1.aux14_6>=1))&&(u0.c20>=1)))||(((u3.aux16_1>=1)&&(u1.aux14_2>=1))&&(u0.c20>=1)))||(((u3.aux16_4>=1)&&(u1.aux14_3>=1))&&(u0.c20>=1)))||(((u3.aux16_4>=1)&&(u1.aux14_5>=1))&&(u0.c20>=1)))||(((u3.aux16_2>=1)&&(u0.c20>=1))&&(u1.aux14_7>=1)))||(((u3.aux16_5>=1)&&(u1.aux14_0>=1))&&(u0.c20>=1)))||(((u3.aux16_5>=1)&&(u1.aux14_4>=1))&&(u0.c20>=1)))||(((u3.aux16_3>=1)&&(u1.aux14_6>=1))&&(u0.c20>=1)))||(((u3.aux16_3>=1)&&(u1.aux14_0>=1))&&(u0.c20>=1)))||(((u3.aux16_4>=1)&&(u0.c20>=1))&&(u1.aux14_7>=1)))||(((u3.aux16_2>=1)&&(u1.aux14_3>=1))&&(u0.c20>=1)))||(((u3.aux16_6>=1)&&(u1.aux14_5>=1))&&(u0.c20>=1)))||(((u3.aux16_6>=1)&&(u1.aux14_1>=1))&&(u0.c20>=1)))||(((u3.aux16_1>=1)&&(u1.aux14_6>=1))&&(u0.c20>=1)))||(((u3.aux16_7>=1)&&(u1.aux14_4>=1))&&(u0.c20>=1)))||(((u3.aux16_2>=1)&&(u1.aux14_2>=1))&&(u0.c20>=1)))||(((u3.aux16_3>=1)&&(u1.aux14_5>=1))&&(u0.c20>=1)))||(((u3.aux16_5>=1)&&(u1.aux14_3>=1))&&(u0.c20>=1)))||(((u3.aux16_1>=1)&&(u0.c20>=1))&&(u1.aux14_7>=1)))||(((u3.aux16_6>=1)&&(u1.aux14_0>=1))&&(u0.c20>=1)))||(((u3.aux16_2>=1)&&(u1.aux14_1>=1))&&(u0.c20>=1)))||(((u3.aux16_1>=1)&&(u1.aux14_4>=1))&&(u0.c20>=1)))||(((u3.aux16_7>=1)&&(u1.aux14_6>=1))&&(u0.c20>=1)))||(((u3.aux16_5>=1)&&(u1.aux14_2>=1))&&(u0.c20>=1)))"))))
Formula 0 simplified : !XF"((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((u3.aux16_2>=1)&&(u1.aux14_6>=1))&&(u0.c20>=1))||(((u3.aux16_6>=1)&&(u1.aux14_4>=1))&&(u0.c20>=1)))||(((u3.aux16_3>=1)&&(u1.aux14_2>=1))&&(u0.c20>=1)))||(((u3.aux16_7>=1)&&(u1.aux14_0>=1))&&(u0.c20>=1)))||(((u3.aux16_0>=1)&&(u1.aux14_1>=1))&&(u0.c20>=1)))||(((u3.aux16_7>=1)&&(u1.aux14_2>=1))&&(u0.c20>=1)))||(((u3.aux16_0>=1)&&(u1.aux14_0>=1))&&(u0.c20>=1)))||(((u3.aux16_2>=1)&&(u1.aux14_4>=1))&&(u0.c20>=1)))||(((u3.aux16_6>=1)&&(u1.aux14_6>=1))&&(u0.c20>=1)))||(((u3.aux16_3>=1)&&(u1.aux14_1>=1))&&(u0.c20>=1)))||(((u3.aux16_7>=1)&&(u0.c20>=1))&&(u1.aux14_7>=1)))||(((u3.aux16_6>=1)&&(u1.aux14_2>=1))&&(u0.c20>=1)))||(((u3.aux16_7>=1)&&(u1.aux14_3>=1))&&(u0.c20>=1)))||(((u3.aux16_1>=1)&&(u1.aux14_5>=1))&&(u0.c20>=1)))||(((u3.aux16_4>=1)&&(u1.aux14_2>=1))&&(u0.c20>=1)))||(((u3.aux16_1>=1)&&(u1.aux14_1>=1))&&(u0.c20>=1)))||(((u3.aux16_0>=1)&&(u1.aux14_4>=1))&&(u0.c20>=1)))||(((u3.aux16_6>=1)&&(u0.c20>=1))&&(u1.aux14_7>=1)))||(((u3.aux16_0>=1)&&(u1.aux14_3>=1))&&(u0.c20>=1)))||(((u3.aux16_3>=1)&&(u1.aux14_4>=1))&&(u0.c20>=1)))||(((u3.aux16_5>=1)&&(u1.aux14_6>=1))&&(u0.c20>=1)))||(((u3.aux16_4>=1)&&(u1.aux14_1>=1))&&(u0.c20>=1)))||(((u3.aux16_1>=1)&&(u1.aux14_0>=1))&&(u0.c20>=1)))||(((u3.aux16_0>=1)&&(u0.c20>=1))&&(u1.aux14_7>=1)))||(((u3.aux16_6>=1)&&(u1.aux14_3>=1))&&(u0.c20>=1)))||(((u3.aux16_2>=1)&&(u1.aux14_5>=1))&&(u0.c20>=1)))||(((u3.aux16_3>=1)&&(u1.aux14_3>=1))&&(u0.c20>=1)))||(((u3.aux16_5>=1)&&(u1.aux14_5>=1))&&(u0.c20>=1)))||(((u3.aux16_0>=1)&&(u1.aux14_2>=1))&&(u0.c20>=1)))||(((u3.aux16_4>=1)&&(u1.aux14_0>=1))&&(u0.c20>=1)))||(((u3.aux16_7>=1)&&(u1.aux14_1>=1))&&(u0.c20>=1)))||(((u3.aux16_3>=1)&&(u0.c20>=1))&&(u1.aux14_7>=1)))||(((u3.aux16_7>=1)&&(u1.aux14_5>=1))&&(u0.c20>=1)))||(((u3.aux16_4>=1)&&(u1.aux14_6>=1))&&(u0.c20>=1)))||(((u3.aux16_0>=1)&&(u1.aux14_5>=1))&&(u0.c20>=1)))||(((u3.aux16_4>=1)&&(u1.aux14_4>=1))&&(u0.c20>=1)))||(((u3.aux16_5>=1)&&(u1.aux14_1>=1))&&(u0.c20>=1)))||(((u3.aux16_2>=1)&&(u1.aux14_0>=1))&&(u0.c20>=1)))||(((u3.aux16_1>=1)&&(u1.aux14_3>=1))&&(u0.c20>=1)))||(((u3.aux16_5>=1)&&(u0.c20>=1))&&(u1.aux14_7>=1)))||(((u3.aux16_0>=1)&&(u1.aux14_6>=1))&&(u0.c20>=1)))||(((u3.aux16_1>=1)&&(u1.aux14_2>=1))&&(u0.c20>=1)))||(((u3.aux16_4>=1)&&(u1.aux14_3>=1))&&(u0.c20>=1)))||(((u3.aux16_4>=1)&&(u1.aux14_5>=1))&&(u0.c20>=1)))||(((u3.aux16_2>=1)&&(u0.c20>=1))&&(u1.aux14_7>=1)))||(((u3.aux16_5>=1)&&(u1.aux14_0>=1))&&(u0.c20>=1)))||(((u3.aux16_5>=1)&&(u1.aux14_4>=1))&&(u0.c20>=1)))||(((u3.aux16_3>=1)&&(u1.aux14_6>=1))&&(u0.c20>=1)))||(((u3.aux16_3>=1)&&(u1.aux14_0>=1))&&(u0.c20>=1)))||(((u3.aux16_4>=1)&&(u0.c20>=1))&&(u1.aux14_7>=1)))||(((u3.aux16_2>=1)&&(u1.aux14_3>=1))&&(u0.c20>=1)))||(((u3.aux16_6>=1)&&(u1.aux14_5>=1))&&(u0.c20>=1)))||(((u3.aux16_6>=1)&&(u1.aux14_1>=1))&&(u0.c20>=1)))||(((u3.aux16_1>=1)&&(u1.aux14_6>=1))&&(u0.c20>=1)))||(((u3.aux16_7>=1)&&(u1.aux14_4>=1))&&(u0.c20>=1)))||(((u3.aux16_2>=1)&&(u1.aux14_2>=1))&&(u0.c20>=1)))||(((u3.aux16_3>=1)&&(u1.aux14_5>=1))&&(u0.c20>=1)))||(((u3.aux16_5>=1)&&(u1.aux14_3>=1))&&(u0.c20>=1)))||(((u3.aux16_1>=1)&&(u0.c20>=1))&&(u1.aux14_7>=1)))||(((u3.aux16_6>=1)&&(u1.aux14_0>=1))&&(u0.c20>=1)))||(((u3.aux16_2>=1)&&(u1.aux14_1>=1))&&(u0.c20>=1)))||(((u3.aux16_1>=1)&&(u1.aux14_4>=1))&&(u0.c20>=1)))||(((u3.aux16_7>=1)&&(u1.aux14_6>=1))&&(u0.c20>=1)))||(((u3.aux16_5>=1)&&(u1.aux14_2>=1))&&(u0.c20>=1)))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16992018497982277845
[2021-05-14 13:28:48] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16992018497982277845
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin16992018497982277845]
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin16992018497982277845] killed by timeout after 1 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin16992018497982277845] killed by timeout after 1 SECONDS
at fr.lip6.move.gal.application.LTSminRunner$1.run(LTSminRunner.java:79)
at java.base/java.lang.Thread.run(Thread.java:834)
Treatment of property PermAdmissibility-PT-05-06 finished in 38613 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X((p0&&F((p1&&X(p2))))))], workingDir=/home/mcc/execution]
Support contains 52 out of 104 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 104/104 places, 592/592 transitions.
Applied a total of 0 rules in 3 ms. Remains 104 /104 variables (removed 0) and now considering 592/592 (removed 0) transitions.
// Phase 1: matrix 592 rows 104 cols
[2021-05-14 13:28:49] [INFO ] Computed 16 place invariants in 3 ms
[2021-05-14 13:28:50] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 592 rows 104 cols
[2021-05-14 13:28:50] [INFO ] Computed 16 place invariants in 4 ms
[2021-05-14 13:28:50] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 380 ms to find 0 implicit places.
// Phase 1: matrix 592 rows 104 cols
[2021-05-14 13:28:50] [INFO ] Computed 16 place invariants in 3 ms
[2021-05-14 13:28:50] [INFO ] Dead Transitions using invariants and state equation in 196 ms returned []
Finished structural reductions, in 1 iterations. Remains : 104/104 places, 592/592 transitions.
Stuttering acceptance computed with spot in 144 ms :[(NOT p2), (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p0) (NOT p2)), (OR (NOT p1) (NOT p2) (NOT p0)), true]
Running random walk in product with property : PermAdmissibility-PT-05-07 automaton TGBA [mat=[[{ cond=(AND p1 (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p1:(OR (AND (GEQ s3 1) (GEQ s12 1) (GEQ s17 1)) (AND (GEQ s1 1) (GEQ s8 1) (GEQ s17 1)) (AND (GEQ s6 1) (GEQ s13 1) (GEQ s17 1)) (AND (GEQ s7 1) (GEQ s11 1) (GEQ s17 1)) (AND (GEQ s4 1) (GEQ s10 1) (GEQ s17 1)) (AND (GEQ s0 1) (GEQ s10 1) (GEQ s17 1)) (AND (GEQ s4 1) (GEQ s8 1) (GEQ s17 1)) (AND (GEQ s5 1) (GEQ s16 1) (GEQ s17 1)) (AND (GEQ s6 1) (GEQ s12 1) (GEQ s17 1)) (AND (GEQ s1 1) (GEQ s9 1) (GEQ s17 1)) (AND (GEQ s7 1) (GEQ s9 1) (GEQ s17 1)) (AND (GEQ s3 1) (GEQ s11 1) (GEQ s17 1)) (AND (GEQ s2 1) (GEQ s14 1) (GEQ s17 1)) (AND (GEQ s7 1) (GEQ s10 1) (GEQ s17 1)) (AND (GEQ s0 1) (GEQ s11 1) (GEQ s17 1)) (AND (GEQ s4 1) (GEQ s9 1) (GEQ s17 1)) (AND (GEQ s7 1) (GEQ s8 1) (GEQ s17 1)) (AND (GEQ s6 1) (GEQ s11 1) (GEQ s17 1)) (AND (GEQ s3 1) (GEQ s10 1) (GEQ s17 1)) (AND (GEQ s4 1) (GEQ s16 1) (GEQ s17 1)) (AND (GEQ s3 1) (GEQ s9 1) (GEQ s17 1)) (AND (GEQ s2 1) (GEQ s13 1) (GEQ s17 1)) (AND (GEQ s1 1) (GEQ s16 1) (GEQ s17 1)) (AND (GEQ s0 1) (GEQ s8 1) (GEQ s17 1)) (AND (GEQ s5 1) (GEQ s14 1) (GEQ s17 1)) (AND (GEQ s1 1) (GEQ s14 1) (GEQ s17 1)) (AND (GEQ s5 1) (GEQ s13 1) (GEQ s17 1)) (AND (GEQ s0 1) (GEQ s9 1) (GEQ s17 1)) (AND (GEQ s6 1) (GEQ s10 1) (GEQ s17 1)) (AND (GEQ s2 1) (GEQ s12 1) (GEQ s17 1)) (AND (GEQ s7 1) (GEQ s16 1) (GEQ s17 1)) (AND (GEQ s4 1) (GEQ s14 1) (GEQ s17 1)) (AND (GEQ s5 1) (GEQ s11 1) (GEQ s17 1)) (AND (GEQ s1 1) (GEQ s13 1) (GEQ s17 1)) (AND (GEQ s6 1) (GEQ s9 1) (GEQ s17 1)) (AND (GEQ s5 1) (GEQ s12 1) (GEQ s17 1)) (AND (GEQ s0 1) (GEQ s16 1) (GEQ s17 1)) (AND (GEQ s2 1) (GEQ s9 1) (GEQ s17 1)) (AND (GEQ s2 1) (GEQ s11 1) (GEQ s17 1)) (AND (GEQ s5 1) (GEQ s10 1) (GEQ s17 1)) (AND (GEQ s4 1) (GEQ s13 1) (GEQ s17 1)) (AND (GEQ s3 1) (GEQ s8 1) (GEQ s17 1)) (AND (GEQ s1 1) (GEQ s12 1) (GEQ s17 1)) (AND (GEQ s6 1) (GEQ s8 1) (GEQ s17 1)) (AND (GEQ s3 1) (GEQ s16 1) (GEQ s17 1)) (AND (GEQ s2 1) (GEQ s10 1) (GEQ s17 1)) (AND (GEQ s7 1) (GEQ s14 1) (GEQ s17 1)) (AND (GEQ s1 1) (GEQ s10 1) (GEQ s17 1)) (AND (GEQ s6 1) (GEQ s16 1) (GEQ s17 1)) (AND (GEQ s5 1) (GEQ s9 1) (GEQ s17 1)) (AND (GEQ s4 1) (GEQ s12 1) (GEQ s17 1)) (AND (GEQ s0 1) (GEQ s14 1) (GEQ s17 1)) (AND (GEQ s7 1) (GEQ s13 1) (GEQ s17 1)) (AND (GEQ s0 1) (GEQ s12 1) (GEQ s17 1)) (AND (GEQ s2 1) (GEQ s16 1) (GEQ s17 1)) (AND (GEQ s3 1) (GEQ s13 1) (GEQ s17 1)) (AND (GEQ s5 1) (GEQ s8 1) (GEQ s17 1)) (AND (GEQ s6 1) (GEQ s14 1) (GEQ s17 1)) (AND (GEQ s1 1) (GEQ s11 1) (GEQ s17 1)) (AND (GEQ s4 1) (GEQ s11 1) (GEQ s17 1)) (AND (GEQ s2 1) (GEQ s8 1) (GEQ s17 1)) (AND (GEQ s3 1) (GEQ s14 1) (GEQ s17 1)) (AND (GEQ s7 1) (GEQ s12 1) (GEQ s17 1)) (AND (GEQ s0 1) (GEQ s13 1) (GEQ s17 1))), p2:(AND (OR (AND (GEQ s38 1) (GEQ s41 1) (GEQ s42 1)) (AND (GEQ s38 1) (GEQ s39 1) (GEQ s44 1)) (AND (GEQ s38 1) (GEQ s39 1) (GEQ s43 1)) (AND (GEQ s38 1) (GEQ s39 1) (GEQ s41 1)) (AND (GEQ s36 1) (GEQ s38 1) (GEQ s42 1)) (AND (GEQ s38 1) (GEQ s42 1) (GEQ s43 1)) (AND (GEQ s36 1) (GEQ s38 1) (GEQ s40 1)) (AND (GEQ s38 1) (GEQ s40 1) (GEQ s43 1)) (AND (GEQ s36 1) (GEQ s38 1) (GEQ s39 1)) (AND (GEQ s38 1) (GEQ s42 1) (GEQ s44 1)) (AND (GEQ s38 1) (GEQ s40 1) (GEQ s44 1)) (AND (GEQ s36 1) (GEQ s37 1) (GEQ s38 1)) (AND (GEQ s38 1) (GEQ s40 1) (GEQ s41 1)) (AND (GEQ s37 1) (GEQ s38 1) (GEQ s43 1)) (AND (GEQ s37 1) (GEQ s38 1) (GEQ s44 1)) (AND (GEQ s37 1) (GEQ s38 1) (GEQ s41 1))) (OR (AND (GEQ s23 1) (GEQ s30 1) (GEQ s31 1)) (AND (GEQ s19 1) (GEQ s29 1) (GEQ s30 1)) (AND (GEQ s22 1) (GEQ s27 1) (GEQ s30 1)) (AND (GEQ s28 1) (GEQ s30 1) (GEQ s34 1)) (AND (GEQ s19 1) (GEQ s30 1) (GEQ s32 1)) (AND (GEQ s28 1) (GEQ s30 1) (GEQ s32 1)) (AND (GEQ s19 1) (GEQ s30 1) (GEQ s34 1)) (AND (GEQ s20 1) (GEQ s26 1) (GEQ s30 1)) (AND (GEQ s23 1) (GEQ s30 1) (GEQ s33 1)) (AND (GEQ s23 1) (GEQ s26 1) (GEQ s30 1)) (AND (GEQ s20 1) (GEQ s27 1) (GEQ s30 1)) (AND (GEQ s25 1) (GEQ s28 1) (GEQ s30 1)) (AND (GEQ s21 1) (GEQ s30 1) (GEQ s34 1)) (AND (GEQ s21 1) (GEQ s30 1) (GEQ s32 1)) (AND (GEQ s23 1) (GEQ s25 1) (GEQ s30 1)) (AND (GEQ s28 1) (GEQ s29 1) (GEQ s30 1)) (AND (GEQ s18 1) (GEQ s30 1) (GEQ s34 1)) (AND (GEQ s18 1) (GEQ s30 1) (GEQ s32 1)) (AND (GEQ s24 1) (GEQ s30 1) (GEQ s34 1)) (AND (GEQ s22 1) (GEQ s30 1) (GEQ s31 1)) (AND (GEQ s19 1) (GEQ s27 1) (GEQ s30 1)) (AND (GEQ s22 1) (GEQ s30 1) (GEQ s33 1)) (AND (GEQ s22 1) (GEQ s25 1) (GEQ s30 1)) (AND (GEQ s24 1) (GEQ s30 1) (GEQ s32 1)) (AND (GEQ s18 1) (GEQ s29 1) (GEQ s30 1)) (AND (GEQ s19 1) (GEQ s26 1) (GEQ s30 1)) (AND (GEQ s20 1) (GEQ s30 1) (GEQ s33 1)) (AND (GEQ s20 1) (GEQ s30 1) (GEQ s31 1)) (AND (GEQ s21 1) (GEQ s29 1) (GEQ s30 1)) (AND (GEQ s21 1) (GEQ s27 1) (GEQ s30 1)) (AND (GEQ s20 1) (GEQ s25 1) (GEQ s30 1)) (AND (GEQ s22 1) (GEQ s26 1) (GEQ s30 1)) (AND (GEQ s24 1) (GEQ s29 1) (GEQ s30 1)) (AND (GEQ s23 1) (GEQ s30 1) (GEQ s32 1)) (AND (GEQ s27 1) (GEQ s28 1) (GEQ s30 1)) (AND (GEQ s18 1) (GEQ s27 1) (GEQ s30 1)) (AND (GEQ s24 1) (GEQ s27 1) (GEQ s30 1)) (AND (GEQ s21 1) (GEQ s25 1) (GEQ s30 1)) (AND (GEQ s19 1) (GEQ s30 1) (GEQ s31 1)) (AND (GEQ s28 1) (GEQ s30 1) (GEQ s33 1)) (AND (GEQ s19 1) (GEQ s30 1) (GEQ s33 1)) (AND (GEQ s28 1) (GEQ s30 1) (GEQ s31 1)) (AND (GEQ s23 1) (GEQ s30 1) (GEQ s34 1)) (AND (GEQ s24 1) (GEQ s26 1) (GEQ s30 1)) (AND (GEQ s19 1) (GEQ s25 1) (GEQ s30 1)) (AND (GEQ s23 1) (GEQ s29 1) (GEQ s30 1)) (AND (GEQ s21 1) (GEQ s30 1) (GEQ s33 1)) (AND (GEQ s21 1) (GEQ s26 1) (GEQ s30 1)) (AND (GEQ s21 1) (GEQ s30 1) (GEQ s31 1)) (AND (GEQ s18 1) (GEQ s30 1) (GEQ s33 1)) (AND (GEQ s18 1) (GEQ s30 1) (GEQ s31 1)) (AND (GEQ s18 1) (GEQ s25 1) (GEQ s30 1)) (AND (GEQ s24 1) (GEQ s30 1) (GEQ s33 1)) (AND (GEQ s22 1) (GEQ s30 1) (GEQ s32 1)) (AND (GEQ s24 1) (GEQ s30 1) (GEQ s31 1)) (AND (GEQ s22 1) (GEQ s30 1) (GEQ s34 1)) (AND (GEQ s20 1) (GEQ s30 1) (GEQ s34 1)) (AND (GEQ s20 1) (GEQ s30 1) (GEQ s32 1)) (AND (GEQ s22 1) (GEQ s29 1) (GEQ s30 1)) (AND (GEQ s18 1) (GEQ s26 1) (GEQ s30 1)) (AND (GEQ s24 1) (GEQ s25 1) (GEQ s30 1)) (AND (GEQ s26 1) (GEQ s28 1) (GEQ s30 1)) (AND (GEQ s23 1) (GEQ s27 1) (GEQ s30 1)) (AND (GEQ s20 1) (GEQ s29 1) (GEQ s30 1)))), p0:(OR (AND (GEQ s64 1) (GEQ s72 1) (GEQ s75 1)) (AND (GEQ s64 1) (GEQ s72 1) (GEQ s76 1)) (AND (GEQ s61 1) (GEQ s64 1) (GEQ s74 1)) (AND (GEQ s61 1) (GEQ s64 1) (GEQ s73 1)) (AND (GEQ s61 1) (GEQ s64 1) (GEQ s72 1)) (AND (GEQ s61 1) (GEQ s64 1) (GEQ s71 1)) (AND (GEQ s62 1) (GEQ s64 1) (GEQ s71 1)) (AND (GEQ s62 1) (GEQ s64 1) (GEQ s73 1)) (AND (GEQ s62 1) (GEQ s64 1) (GEQ s72 1)) (AND (GEQ s64 1) (GEQ s73 1) (GEQ s75 1)) (AND (GEQ s64 1) (GEQ s73 1) (GEQ s76 1)) (AND (GEQ s64 1) (GEQ s71 1) (GEQ s75 1)) (AND (GEQ s64 1) (GEQ s71 1) (GEQ s76 1)) (AND (GEQ s64 1) (GEQ s74 1) (GEQ s76 1)) (AND (GEQ s64 1) (GEQ s74 1) (GEQ s75 1)) (AND (GEQ s62 1) (GEQ s64 1) (GEQ s74 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, 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 0 ms.
FORMULA PermAdmissibility-PT-05-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-07 finished in 744 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F(G(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 78 transition count 344
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 78 transition count 344
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 74 place count 56 transition count 122
Iterating global reduction 0 with 22 rules applied. Total rules applied 96 place count 56 transition count 122
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 98 place count 54 transition count 106
Iterating global reduction 0 with 2 rules applied. Total rules applied 100 place count 54 transition count 106
Applied a total of 100 rules in 15 ms. Remains 54 /104 variables (removed 50) and now considering 106/592 (removed 486) transitions.
// Phase 1: matrix 106 rows 54 cols
[2021-05-14 13:28:50] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-14 13:28:50] [INFO ] Implicit Places using invariants in 42 ms returned [0, 5, 18, 26]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 59 ms to find 4 implicit places.
[2021-05-14 13:28:50] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 106 rows 50 cols
[2021-05-14 13:28:50] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 13:28:50] [INFO ] Dead Transitions using invariants and state equation in 105 ms returned []
Starting structural reductions, iteration 1 : 50/104 places, 106/592 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 50 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 49 transition count 105
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 49 transition count 104
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 48 transition count 104
Applied a total of 4 rules in 6 ms. Remains 48 /50 variables (removed 2) and now considering 104/106 (removed 2) transitions.
// Phase 1: matrix 104 rows 48 cols
[2021-05-14 13:28:50] [INFO ] Computed 12 place invariants in 0 ms
[2021-05-14 13:28:50] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 104 rows 48 cols
[2021-05-14 13:28:50] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 13:28:51] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 144 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 48/104 places, 104/592 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-05-08 automaton TGBA [mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s16 1) (LT s37 1) (LT s39 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 1408 reset in 329 ms.
Product exploration explored 100000 steps with 1408 reset in 346 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 48 transition count 104
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 : [(F (G p0)), p0]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA PermAdmissibility-PT-05-08 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property PermAdmissibility-PT-05-08 finished in 2070 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(F((p0||G(p1))))], workingDir=/home/mcc/execution]
Support contains 6 out of 104 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 78 transition count 344
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 78 transition count 344
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 74 place count 56 transition count 114
Iterating global reduction 0 with 22 rules applied. Total rules applied 96 place count 56 transition count 114
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 99 place count 53 transition count 90
Iterating global reduction 0 with 3 rules applied. Total rules applied 102 place count 53 transition count 90
Applied a total of 102 rules in 13 ms. Remains 53 /104 variables (removed 51) and now considering 90/592 (removed 502) transitions.
// Phase 1: matrix 90 rows 53 cols
[2021-05-14 13:28:52] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-14 13:28:52] [INFO ] Implicit Places using invariants in 40 ms returned [0, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 41 ms to find 2 implicit places.
[2021-05-14 13:28:52] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 90 rows 51 cols
[2021-05-14 13:28:52] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-14 13:28:52] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Starting structural reductions, iteration 1 : 51/104 places, 90/592 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2021-05-14 13:28:52] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 90 rows 51 cols
[2021-05-14 13:28:52] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-14 13:28:52] [INFO ] Dead Transitions using invariants and state equation in 37 ms returned []
Finished structural reductions, in 2 iterations. Remains : 51/104 places, 90/592 transitions.
Stuttering acceptance computed with spot in 26 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-PT-05-09 automaton TGBA [mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}]], initial=0, aps=[p1:(AND (GEQ s17 1) (GEQ s37 1) (GEQ s40 1)), p0:(AND (GEQ s9 1) (GEQ s14 1) (GEQ s21 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 845 steps with 31 reset in 3 ms.
FORMULA PermAdmissibility-PT-05-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-09 finished in 177 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(((G(p1)||(X(p2) U ((p3&&X(p2))||X(G(p2))))||p0) U p4))], workingDir=/home/mcc/execution]
Support contains 10 out of 104 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 80 transition count 352
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 80 transition count 352
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 66 place count 62 transition count 146
Iterating global reduction 0 with 18 rules applied. Total rules applied 84 place count 62 transition count 146
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 61 transition count 138
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 61 transition count 138
Applied a total of 86 rules in 18 ms. Remains 61 /104 variables (removed 43) and now considering 138/592 (removed 454) transitions.
// Phase 1: matrix 138 rows 61 cols
[2021-05-14 13:28:52] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-14 13:28:52] [INFO ] Implicit Places using invariants in 43 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
// Phase 1: matrix 138 rows 60 cols
[2021-05-14 13:28:52] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-14 13:28:53] [INFO ] Dead Transitions using invariants and state equation in 64 ms returned []
Starting structural reductions, iteration 1 : 60/104 places, 138/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 60 cols
[2021-05-14 13:28:53] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-14 13:28:53] [INFO ] Dead Transitions using invariants and state equation in 53 ms returned []
Finished structural reductions, in 2 iterations. Remains : 60/104 places, 138/592 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p4), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), true, (NOT p1)]
Running random walk in product with property : PermAdmissibility-PT-05-10 automaton TGBA [mat=[[{ cond=(NOT p4), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p4) (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p4) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p4) (NOT p0) p1 (NOT p3)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p4) (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 5}, { cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 6}], [{ cond=(NOT p2), acceptance={} source=2 dest: 5}], [{ cond=p1, acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p4:(AND (GEQ s1 1) (GEQ s3 1) (GEQ s6 1)), p0:(OR (LT s27 1) (LT s33 1) (LT s47 1)), p1:(AND (GEQ s27 1) (GEQ s34 1) (GEQ s47 1)), p3:(OR (LT s20 1) (LT s45 1) (LT s49 1)), p2:(OR (LT s27 1) (LT s33 1) (LT s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 59 steps with 2 reset in 1 ms.
FORMULA PermAdmissibility-PT-05-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-10 finished in 387 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !((X(p0)||(p1 U ((p1&&(p2 U (G(p2)||((F(!p2)||p4)&&p3))))||G(p1)))))], workingDir=/home/mcc/execution]
Support contains 8 out of 104 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 80 transition count 352
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 80 transition count 352
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 70 place count 58 transition count 122
Iterating global reduction 0 with 22 rules applied. Total rules applied 92 place count 58 transition count 122
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 94 place count 56 transition count 106
Iterating global reduction 0 with 2 rules applied. Total rules applied 96 place count 56 transition count 106
Applied a total of 96 rules in 5 ms. Remains 56 /104 variables (removed 48) and now considering 106/592 (removed 486) transitions.
// Phase 1: matrix 106 rows 56 cols
[2021-05-14 13:28:53] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-14 13:28:53] [INFO ] Implicit Places using invariants in 34 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
// Phase 1: matrix 106 rows 55 cols
[2021-05-14 13:28:53] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-14 13:28:53] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Starting structural reductions, iteration 1 : 55/104 places, 106/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 55 /55 variables (removed 0) and now considering 106/106 (removed 0) transitions.
// Phase 1: matrix 106 rows 55 cols
[2021-05-14 13:28:53] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-14 13:28:53] [INFO ] Dead Transitions using invariants and state equation in 58 ms returned []
Finished structural reductions, in 2 iterations. Remains : 55/104 places, 106/592 transitions.
Stuttering acceptance computed with spot in 196 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p2)), (NOT p1), (AND (NOT p3) (NOT p2) (NOT p1))]
Running random walk in product with property : PermAdmissibility-PT-05-11 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p3) p2 p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p3) p2 (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=3 dest: 6}, { cond=(AND (NOT p3) p2 p1 (NOT p0)), acceptance={} source=3 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p3) (NOT p2) p1 (NOT p0)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p3) p2 p1 (NOT p0)), acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 0}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p3) p2 p1), acceptance={} source=6 dest: 7}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=7 dest: 6}, { cond=(AND (NOT p3) p2 p1), acceptance={} source=7 dest: 7}]], initial=2, aps=[p0:(AND (GEQ s5 1) (GEQ s7 1) (GEQ s8 1)), p1:(OR (LT s26 1) (LT s32 1) (LT s42 1)), p3:(AND (GEQ s26 1) (GEQ s28 1) (GEQ s31 1)), p2:(AND (GEQ s26 1) (GEQ s28 1) (GEQ s31 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-05-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-11 finished in 360 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(X(G(p0))))], workingDir=/home/mcc/execution]
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 78 transition count 344
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 76 place count 54 transition count 108
Iterating global reduction 0 with 24 rules applied. Total rules applied 100 place count 54 transition count 108
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 102 place count 52 transition count 92
Iterating global reduction 0 with 2 rules applied. Total rules applied 104 place count 52 transition count 92
Applied a total of 104 rules in 4 ms. Remains 52 /104 variables (removed 52) and now considering 92/592 (removed 500) transitions.
// Phase 1: matrix 92 rows 52 cols
[2021-05-14 13:28:53] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-14 13:28:53] [INFO ] Implicit Places using invariants in 34 ms returned [0, 5, 18, 25]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 35 ms to find 4 implicit places.
// Phase 1: matrix 92 rows 48 cols
[2021-05-14 13:28:53] [INFO ] Computed 12 place invariants in 1 ms
[2021-05-14 13:28:53] [INFO ] Dead Transitions using invariants and state equation in 45 ms returned []
Starting structural reductions, iteration 1 : 48/104 places, 92/592 transitions.
Applied a total of 0 rules in 0 ms. Remains 48 /48 variables (removed 0) and now considering 92/92 (removed 0) transitions.
// Phase 1: matrix 92 rows 48 cols
[2021-05-14 13:28:53] [INFO ] Computed 12 place invariants in 2 ms
[2021-05-14 13:28:53] [INFO ] Dead Transitions using invariants and state equation in 49 ms returned []
Finished structural reductions, in 2 iterations. Remains : 48/104 places, 92/592 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-05-12 automaton TGBA [mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s20 1) (LT s22 1) (LT s25 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 92 steps with 1 reset in 1 ms.
FORMULA PermAdmissibility-PT-05-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-12 finished in 221 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(F(((p1 U G(p2))&&p0))))], workingDir=/home/mcc/execution]
Support contains 10 out of 104 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 81 transition count 358
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 81 transition count 358
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 64 place count 63 transition count 152
Iterating global reduction 0 with 18 rules applied. Total rules applied 82 place count 63 transition count 152
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 62 transition count 144
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 62 transition count 144
Applied a total of 84 rules in 4 ms. Remains 62 /104 variables (removed 42) and now considering 144/592 (removed 448) transitions.
// Phase 1: matrix 144 rows 62 cols
[2021-05-14 13:28:53] [INFO ] Computed 16 place invariants in 2 ms
[2021-05-14 13:28:53] [INFO ] Implicit Places using invariants in 39 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
// Phase 1: matrix 144 rows 61 cols
[2021-05-14 13:28:53] [INFO ] Computed 15 place invariants in 0 ms
[2021-05-14 13:28:53] [INFO ] Dead Transitions using invariants and state equation in 59 ms returned []
Starting structural reductions, iteration 1 : 61/104 places, 144/592 transitions.
Applied a total of 0 rules in 0 ms. Remains 61 /61 variables (removed 0) and now considering 144/144 (removed 0) transitions.
// Phase 1: matrix 144 rows 61 cols
[2021-05-14 13:28:53] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-14 13:28:54] [INFO ] Dead Transitions using invariants and state equation in 56 ms returned []
Finished structural reductions, in 2 iterations. Remains : 61/104 places, 144/592 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p2), (NOT p2)]
Running random walk in product with property : PermAdmissibility-PT-05-13 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}, { cond=(AND p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=3 dest: 2}, { cond=(AND p0 p2 p1), acceptance={} source=3 dest: 2}, { cond=(OR (AND (NOT p0) p2) (AND p2 (NOT p1))), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s28 1) (GEQ s31 1) (GEQ s36 1)), p2:(AND (GEQ s1 1) (GEQ s6 1) (GEQ s7 1)), p1:(AND (GEQ s2 1) (GEQ s4 1) (GEQ s7 1) (GEQ s28 1) (GEQ s37 1) (GEQ s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-PT-05-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-13 finished in 298 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(G(F(p0)))], workingDir=/home/mcc/execution]
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 78 transition count 344
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 78 transition count 344
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 74 place count 56 transition count 114
Iterating global reduction 0 with 22 rules applied. Total rules applied 96 place count 56 transition count 114
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 99 place count 53 transition count 90
Iterating global reduction 0 with 3 rules applied. Total rules applied 102 place count 53 transition count 90
Applied a total of 102 rules in 10 ms. Remains 53 /104 variables (removed 51) and now considering 90/592 (removed 502) transitions.
// Phase 1: matrix 90 rows 53 cols
[2021-05-14 13:28:54] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-14 13:28:54] [INFO ] Implicit Places using invariants in 39 ms returned [0, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 40 ms to find 2 implicit places.
[2021-05-14 13:28:54] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 90 rows 51 cols
[2021-05-14 13:28:54] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-14 13:28:54] [INFO ] Dead Transitions using invariants and state equation in 44 ms returned []
Starting structural reductions, iteration 1 : 51/104 places, 90/592 transitions.
Applied a total of 0 rules in 3 ms. Remains 51 /51 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2021-05-14 13:28:54] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 90 rows 51 cols
[2021-05-14 13:28:54] [INFO ] Computed 14 place invariants in 1 ms
[2021-05-14 13:28:54] [INFO ] Dead Transitions using invariants and state equation in 36 ms returned []
Finished structural reductions, in 2 iterations. Remains : 51/104 places, 90/592 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-05-14 automaton TGBA [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:(OR (LT s17 1) (LT s37 1) (LT s41 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]]
Product exploration explored 100000 steps with 1440 reset in 305 ms.
Product exploration explored 100000 steps with 1480 reset in 324 ms.
Complete graph has no SCC; deadlocks are unavoidable. place count 51 transition count 90
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 : [(F (G p0)), p0]
Property proved to be true thanks to knowledge :(F (G p0))
FORMULA PermAdmissibility-PT-05-14 TRUE TECHNIQUES STRUCTURAL INITIAL_STATE
Treatment of property PermAdmissibility-PT-05-14 finished in 888 ms.
Running Spot : CommandLine [args=[/home/mcc/BenchKit/bin//..//ltl2tgba, --hoaf=tv, -f, !(X(G((p0&&(F(p2)||p1)))))], workingDir=/home/mcc/execution]
Support contains 6 out of 104 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 104/104 places, 592/592 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 80 transition count 352
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 80 transition count 352
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 66 place count 62 transition count 146
Iterating global reduction 0 with 18 rules applied. Total rules applied 84 place count 62 transition count 146
Applied a total of 84 rules in 7 ms. Remains 62 /104 variables (removed 42) and now considering 146/592 (removed 446) transitions.
// Phase 1: matrix 146 rows 62 cols
[2021-05-14 13:28:55] [INFO ] Computed 16 place invariants in 1 ms
[2021-05-14 13:28:55] [INFO ] Implicit Places using invariants in 43 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
// Phase 1: matrix 146 rows 61 cols
[2021-05-14 13:28:55] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-14 13:28:55] [INFO ] Dead Transitions using invariants and state equation in 61 ms returned []
Starting structural reductions, iteration 1 : 61/104 places, 146/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 61 /61 variables (removed 0) and now considering 146/146 (removed 0) transitions.
// Phase 1: matrix 146 rows 61 cols
[2021-05-14 13:28:55] [INFO ] Computed 15 place invariants in 1 ms
[2021-05-14 13:28:55] [INFO ] Dead Transitions using invariants and state equation in 62 ms returned []
Finished structural reductions, in 2 iterations. Remains : 61/104 places, 146/592 transitions.
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p2)]
Running random walk in product with property : PermAdmissibility-PT-05-15 automaton TGBA [mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s5 1) (LT s7 1) (LT s8 1)), p1:(OR (LT s22 1) (LT s32 1) (LT s51 1)), p2:(OR (LT s22 1) (LT s32 1) (LT s51 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 206 steps with 2 reset in 1 ms.
FORMULA PermAdmissibility-PT-05-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-15 finished in 281 ms.
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6262525796506487088
[2021-05-14 13:28:55] [INFO ] Computing symmetric may disable matrix : 592 transitions.
[2021-05-14 13:28:55] [INFO ] Computation of Complete disable matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 13:28:55] [INFO ] Applying decomposition
[2021-05-14 13:28:55] [INFO ] Computing symmetric may enable matrix : 592 transitions.
[2021-05-14 13:28:55] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 13:28:55] [INFO ] Flatten gal took : 31 ms
Converted graph to binary with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/convert-linux64, -i, /tmp/graph8152455258034491466.txt, -o, /tmp/graph8152455258034491466.bin, -w, /tmp/graph8152455258034491466.weights], workingDir=null]
Built communities with : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202104292328/bin/louvain-linux64, /tmp/graph8152455258034491466.bin, -l, -1, -v, -w, /tmp/graph8152455258034491466.weights, -q, 0, -e, 0.001], workingDir=null]
[2021-05-14 13:28:55] [INFO ] Decomposing Gal with order
[2021-05-14 13:28:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2021-05-14 13:28:55] [INFO ] Computing Do-Not-Accords matrix : 592 transitions.
[2021-05-14 13:28:55] [INFO ] Computation of Completed DNA matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2021-05-14 13:28:55] [INFO ] Built C files in 174ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6262525796506487088
Running compilation step : CommandLine [args=[gcc, -c, -I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/include/, -I., -std=c99, -fPIC, -O2, model.c], workingDir=/tmp/ltsmin6262525796506487088]
[2021-05-14 13:28:55] [INFO ] Removed a total of 547 redundant transitions.
[2021-05-14 13:28:55] [INFO ] Flatten gal took : 123 ms
[2021-05-14 13:28:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 204 labels/synchronizations in 9 ms.
[2021-05-14 13:28:55] [INFO ] Time to serialize gal into /tmp/LTLFireability7466674705290066087.gal : 3 ms
[2021-05-14 13:28:55] [INFO ] Time to serialize properties into /tmp/LTLFireability13250904720320372749.ltl : 0 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability7466674705290066087.gal, -t, CGAL, -LTL, /tmp/LTLFireability13250904720320372749.ltl, -c, -stutter-deadlock], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability7466674705290066087.gal -t CGAL -LTL /tmp/LTLFireability13250904720320372749.ltl -c -stutter-deadlock
Read 1 LTL properties
Checking formula 0 : !((X(F("((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((u3.aux16_2>=1)&&(u0.aux14_6>=1))&&(u0.c20>=1))||(((u3.aux16_6>=1)&&(u0.aux14_4>=1))&&(u0.c20>=1)))||(((u3.aux16_3>=1)&&(u0.aux14_2>=1))&&(u0.c20>=1)))||(((u3.aux16_7>=1)&&(u0.aux14_0>=1))&&(u0.c20>=1)))||(((u3.aux16_0>=1)&&(u0.aux14_1>=1))&&(u0.c20>=1)))||(((u3.aux16_7>=1)&&(u0.aux14_2>=1))&&(u0.c20>=1)))||(((u3.aux16_0>=1)&&(u0.aux14_0>=1))&&(u0.c20>=1)))||(((u3.aux16_2>=1)&&(u0.aux14_4>=1))&&(u0.c20>=1)))||(((u3.aux16_6>=1)&&(u0.aux14_6>=1))&&(u0.c20>=1)))||(((u3.aux16_3>=1)&&(u0.aux14_1>=1))&&(u0.c20>=1)))||(((u3.aux16_7>=1)&&(u0.c20>=1))&&(u0.aux14_7>=1)))||(((u3.aux16_6>=1)&&(u0.aux14_2>=1))&&(u0.c20>=1)))||(((u3.aux16_7>=1)&&(u0.aux14_3>=1))&&(u0.c20>=1)))||(((u3.aux16_1>=1)&&(u0.aux14_5>=1))&&(u0.c20>=1)))||(((u3.aux16_4>=1)&&(u0.aux14_2>=1))&&(u0.c20>=1)))||(((u3.aux16_1>=1)&&(u0.aux14_1>=1))&&(u0.c20>=1)))||(((u3.aux16_0>=1)&&(u0.aux14_4>=1))&&(u0.c20>=1)))||(((u3.aux16_6>=1)&&(u0.c20>=1))&&(u0.aux14_7>=1)))||(((u3.aux16_0>=1)&&(u0.aux14_3>=1))&&(u0.c20>=1)))||(((u3.aux16_3>=1)&&(u0.aux14_4>=1))&&(u0.c20>=1)))||(((u3.aux16_5>=1)&&(u0.aux14_6>=1))&&(u0.c20>=1)))||(((u3.aux16_4>=1)&&(u0.aux14_1>=1))&&(u0.c20>=1)))||(((u3.aux16_1>=1)&&(u0.aux14_0>=1))&&(u0.c20>=1)))||(((u3.aux16_0>=1)&&(u0.c20>=1))&&(u0.aux14_7>=1)))||(((u3.aux16_6>=1)&&(u0.aux14_3>=1))&&(u0.c20>=1)))||(((u3.aux16_2>=1)&&(u0.aux14_5>=1))&&(u0.c20>=1)))||(((u3.aux16_3>=1)&&(u0.aux14_3>=1))&&(u0.c20>=1)))||(((u3.aux16_5>=1)&&(u0.aux14_5>=1))&&(u0.c20>=1)))||(((u3.aux16_0>=1)&&(u0.aux14_2>=1))&&(u0.c20>=1)))||(((u3.aux16_4>=1)&&(u0.aux14_0>=1))&&(u0.c20>=1)))||(((u3.aux16_7>=1)&&(u0.aux14_1>=1))&&(u0.c20>=1)))||(((u3.aux16_3>=1)&&(u0.c20>=1))&&(u0.aux14_7>=1)))||(((u3.aux16_7>=1)&&(u0.aux14_5>=1))&&(u0.c20>=1)))||(((u3.aux16_4>=1)&&(u0.aux14_6>=1))&&(u0.c20>=1)))||(((u3.aux16_0>=1)&&(u0.aux14_5>=1))&&(u0.c20>=1)))||(((u3.aux16_4>=1)&&(u0.aux14_4>=1))&&(u0.c20>=1)))||(((u3.aux16_5>=1)&&(u0.aux14_1>=1))&&(u0.c20>=1)))||(((u3.aux16_2>=1)&&(u0.aux14_0>=1))&&(u0.c20>=1)))||(((u3.aux16_1>=1)&&(u0.aux14_3>=1))&&(u0.c20>=1)))||(((u3.aux16_5>=1)&&(u0.c20>=1))&&(u0.aux14_7>=1)))||(((u3.aux16_0>=1)&&(u0.aux14_6>=1))&&(u0.c20>=1)))||(((u3.aux16_1>=1)&&(u0.aux14_2>=1))&&(u0.c20>=1)))||(((u3.aux16_4>=1)&&(u0.aux14_3>=1))&&(u0.c20>=1)))||(((u3.aux16_4>=1)&&(u0.aux14_5>=1))&&(u0.c20>=1)))||(((u3.aux16_2>=1)&&(u0.c20>=1))&&(u0.aux14_7>=1)))||(((u3.aux16_5>=1)&&(u0.aux14_0>=1))&&(u0.c20>=1)))||(((u3.aux16_5>=1)&&(u0.aux14_4>=1))&&(u0.c20>=1)))||(((u3.aux16_3>=1)&&(u0.aux14_6>=1))&&(u0.c20>=1)))||(((u3.aux16_3>=1)&&(u0.aux14_0>=1))&&(u0.c20>=1)))||(((u3.aux16_4>=1)&&(u0.c20>=1))&&(u0.aux14_7>=1)))||(((u3.aux16_2>=1)&&(u0.aux14_3>=1))&&(u0.c20>=1)))||(((u3.aux16_6>=1)&&(u0.aux14_5>=1))&&(u0.c20>=1)))||(((u3.aux16_6>=1)&&(u0.aux14_1>=1))&&(u0.c20>=1)))||(((u3.aux16_1>=1)&&(u0.aux14_6>=1))&&(u0.c20>=1)))||(((u3.aux16_7>=1)&&(u0.aux14_4>=1))&&(u0.c20>=1)))||(((u3.aux16_2>=1)&&(u0.aux14_2>=1))&&(u0.c20>=1)))||(((u3.aux16_3>=1)&&(u0.aux14_5>=1))&&(u0.c20>=1)))||(((u3.aux16_5>=1)&&(u0.aux14_3>=1))&&(u0.c20>=1)))||(((u3.aux16_1>=1)&&(u0.c20>=1))&&(u0.aux14_7>=1)))||(((u3.aux16_6>=1)&&(u0.aux14_0>=1))&&(u0.c20>=1)))||(((u3.aux16_2>=1)&&(u0.aux14_1>=1))&&(u0.c20>=1)))||(((u3.aux16_1>=1)&&(u0.aux14_4>=1))&&(u0.c20>=1)))||(((u3.aux16_7>=1)&&(u0.aux14_6>=1))&&(u0.c20>=1)))||(((u3.aux16_5>=1)&&(u0.aux14_2>=1))&&(u0.c20>=1)))"))))
Formula 0 simplified : !XF"((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((u3.aux16_2>=1)&&(u0.aux14_6>=1))&&(u0.c20>=1))||(((u3.aux16_6>=1)&&(u0.aux14_4>=1))&&(u0.c20>=1)))||(((u3.aux16_3>=1)&&(u0.aux14_2>=1))&&(u0.c20>=1)))||(((u3.aux16_7>=1)&&(u0.aux14_0>=1))&&(u0.c20>=1)))||(((u3.aux16_0>=1)&&(u0.aux14_1>=1))&&(u0.c20>=1)))||(((u3.aux16_7>=1)&&(u0.aux14_2>=1))&&(u0.c20>=1)))||(((u3.aux16_0>=1)&&(u0.aux14_0>=1))&&(u0.c20>=1)))||(((u3.aux16_2>=1)&&(u0.aux14_4>=1))&&(u0.c20>=1)))||(((u3.aux16_6>=1)&&(u0.aux14_6>=1))&&(u0.c20>=1)))||(((u3.aux16_3>=1)&&(u0.aux14_1>=1))&&(u0.c20>=1)))||(((u3.aux16_7>=1)&&(u0.c20>=1))&&(u0.aux14_7>=1)))||(((u3.aux16_6>=1)&&(u0.aux14_2>=1))&&(u0.c20>=1)))||(((u3.aux16_7>=1)&&(u0.aux14_3>=1))&&(u0.c20>=1)))||(((u3.aux16_1>=1)&&(u0.aux14_5>=1))&&(u0.c20>=1)))||(((u3.aux16_4>=1)&&(u0.aux14_2>=1))&&(u0.c20>=1)))||(((u3.aux16_1>=1)&&(u0.aux14_1>=1))&&(u0.c20>=1)))||(((u3.aux16_0>=1)&&(u0.aux14_4>=1))&&(u0.c20>=1)))||(((u3.aux16_6>=1)&&(u0.c20>=1))&&(u0.aux14_7>=1)))||(((u3.aux16_0>=1)&&(u0.aux14_3>=1))&&(u0.c20>=1)))||(((u3.aux16_3>=1)&&(u0.aux14_4>=1))&&(u0.c20>=1)))||(((u3.aux16_5>=1)&&(u0.aux14_6>=1))&&(u0.c20>=1)))||(((u3.aux16_4>=1)&&(u0.aux14_1>=1))&&(u0.c20>=1)))||(((u3.aux16_1>=1)&&(u0.aux14_0>=1))&&(u0.c20>=1)))||(((u3.aux16_0>=1)&&(u0.c20>=1))&&(u0.aux14_7>=1)))||(((u3.aux16_6>=1)&&(u0.aux14_3>=1))&&(u0.c20>=1)))||(((u3.aux16_2>=1)&&(u0.aux14_5>=1))&&(u0.c20>=1)))||(((u3.aux16_3>=1)&&(u0.aux14_3>=1))&&(u0.c20>=1)))||(((u3.aux16_5>=1)&&(u0.aux14_5>=1))&&(u0.c20>=1)))||(((u3.aux16_0>=1)&&(u0.aux14_2>=1))&&(u0.c20>=1)))||(((u3.aux16_4>=1)&&(u0.aux14_0>=1))&&(u0.c20>=1)))||(((u3.aux16_7>=1)&&(u0.aux14_1>=1))&&(u0.c20>=1)))||(((u3.aux16_3>=1)&&(u0.c20>=1))&&(u0.aux14_7>=1)))||(((u3.aux16_7>=1)&&(u0.aux14_5>=1))&&(u0.c20>=1)))||(((u3.aux16_4>=1)&&(u0.aux14_6>=1))&&(u0.c20>=1)))||(((u3.aux16_0>=1)&&(u0.aux14_5>=1))&&(u0.c20>=1)))||(((u3.aux16_4>=1)&&(u0.aux14_4>=1))&&(u0.c20>=1)))||(((u3.aux16_5>=1)&&(u0.aux14_1>=1))&&(u0.c20>=1)))||(((u3.aux16_2>=1)&&(u0.aux14_0>=1))&&(u0.c20>=1)))||(((u3.aux16_1>=1)&&(u0.aux14_3>=1))&&(u0.c20>=1)))||(((u3.aux16_5>=1)&&(u0.c20>=1))&&(u0.aux14_7>=1)))||(((u3.aux16_0>=1)&&(u0.aux14_6>=1))&&(u0.c20>=1)))||(((u3.aux16_1>=1)&&(u0.aux14_2>=1))&&(u0.c20>=1)))||(((u3.aux16_4>=1)&&(u0.aux14_3>=1))&&(u0.c20>=1)))||(((u3.aux16_4>=1)&&(u0.aux14_5>=1))&&(u0.c20>=1)))||(((u3.aux16_2>=1)&&(u0.c20>=1))&&(u0.aux14_7>=1)))||(((u3.aux16_5>=1)&&(u0.aux14_0>=1))&&(u0.c20>=1)))||(((u3.aux16_5>=1)&&(u0.aux14_4>=1))&&(u0.c20>=1)))||(((u3.aux16_3>=1)&&(u0.aux14_6>=1))&&(u0.c20>=1)))||(((u3.aux16_3>=1)&&(u0.aux14_0>=1))&&(u0.c20>=1)))||(((u3.aux16_4>=1)&&(u0.c20>=1))&&(u0.aux14_7>=1)))||(((u3.aux16_2>=1)&&(u0.aux14_3>=1))&&(u0.c20>=1)))||(((u3.aux16_6>=1)&&(u0.aux14_5>=1))&&(u0.c20>=1)))||(((u3.aux16_6>=1)&&(u0.aux14_1>=1))&&(u0.c20>=1)))||(((u3.aux16_1>=1)&&(u0.aux14_6>=1))&&(u0.c20>=1)))||(((u3.aux16_7>=1)&&(u0.aux14_4>=1))&&(u0.c20>=1)))||(((u3.aux16_2>=1)&&(u0.aux14_2>=1))&&(u0.c20>=1)))||(((u3.aux16_3>=1)&&(u0.aux14_5>=1))&&(u0.c20>=1)))||(((u3.aux16_5>=1)&&(u0.aux14_3>=1))&&(u0.c20>=1)))||(((u3.aux16_1>=1)&&(u0.c20>=1))&&(u0.aux14_7>=1)))||(((u3.aux16_6>=1)&&(u0.aux14_0>=1))&&(u0.c20>=1)))||(((u3.aux16_2>=1)&&(u0.aux14_1>=1))&&(u0.c20>=1)))||(((u3.aux16_1>=1)&&(u0.aux14_4>=1))&&(u0.c20>=1)))||(((u3.aux16_7>=1)&&(u0.aux14_6>=1))&&(u0.c20>=1)))||(((u3.aux16_5>=1)&&(u0.aux14_2>=1))&&(u0.c20>=1)))"
Compilation finished in 3939 ms.
Running link step : CommandLine [args=[gcc, -shared, -o, gal.so, model.o], workingDir=/tmp/ltsmin6262525796506487088]
Link finished in 48 ms.
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>(!(LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin6262525796506487088]
WARNING : LTSmin timed out (>240 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>(!(LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin6262525796506487088]
Retrying LTSmin with larger timeout 1920 s
Running LTSmin : CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>(!(LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin6262525796506487088]
Detected timeout of ITS tools.
[2021-05-14 13:49:30] [INFO ] Flatten gal took : 75 ms
[2021-05-14 13:49:30] [INFO ] Time to serialize gal into /tmp/LTLFireability8696924723239116518.gal : 3 ms
[2021-05-14 13:49:30] [INFO ] Time to serialize properties into /tmp/LTLFireability258752146347517091.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability8696924723239116518.gal, -t, CGAL, -LTL, /tmp/LTLFireability258752146347517091.ltl, -c, -stutter-deadlock, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability8696924723239116518.gal -t CGAL -LTL /tmp/LTLFireability258752146347517091.ltl -c -stutter-deadlock --gen-order FOLLOW
Read 1 LTL properties
Checking formula 0 : !((X(F("((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((aux16_2>=1)&&(aux14_6>=1))&&(c20>=1))||(((aux16_6>=1)&&(aux14_4>=1))&&(c20>=1)))||(((aux16_3>=1)&&(aux14_2>=1))&&(c20>=1)))||(((aux16_7>=1)&&(aux14_0>=1))&&(c20>=1)))||(((aux16_0>=1)&&(aux14_1>=1))&&(c20>=1)))||(((aux16_7>=1)&&(aux14_2>=1))&&(c20>=1)))||(((aux16_0>=1)&&(aux14_0>=1))&&(c20>=1)))||(((aux16_2>=1)&&(aux14_4>=1))&&(c20>=1)))||(((aux16_6>=1)&&(aux14_6>=1))&&(c20>=1)))||(((aux16_3>=1)&&(aux14_1>=1))&&(c20>=1)))||(((aux16_7>=1)&&(c20>=1))&&(aux14_7>=1)))||(((aux16_6>=1)&&(aux14_2>=1))&&(c20>=1)))||(((aux16_7>=1)&&(aux14_3>=1))&&(c20>=1)))||(((aux16_1>=1)&&(aux14_5>=1))&&(c20>=1)))||(((aux16_4>=1)&&(aux14_2>=1))&&(c20>=1)))||(((aux16_1>=1)&&(aux14_1>=1))&&(c20>=1)))||(((aux16_0>=1)&&(aux14_4>=1))&&(c20>=1)))||(((aux16_6>=1)&&(c20>=1))&&(aux14_7>=1)))||(((aux16_0>=1)&&(aux14_3>=1))&&(c20>=1)))||(((aux16_3>=1)&&(aux14_4>=1))&&(c20>=1)))||(((aux16_5>=1)&&(aux14_6>=1))&&(c20>=1)))||(((aux16_4>=1)&&(aux14_1>=1))&&(c20>=1)))||(((aux16_1>=1)&&(aux14_0>=1))&&(c20>=1)))||(((aux16_0>=1)&&(c20>=1))&&(aux14_7>=1)))||(((aux16_6>=1)&&(aux14_3>=1))&&(c20>=1)))||(((aux16_2>=1)&&(aux14_5>=1))&&(c20>=1)))||(((aux16_3>=1)&&(aux14_3>=1))&&(c20>=1)))||(((aux16_5>=1)&&(aux14_5>=1))&&(c20>=1)))||(((aux16_0>=1)&&(aux14_2>=1))&&(c20>=1)))||(((aux16_4>=1)&&(aux14_0>=1))&&(c20>=1)))||(((aux16_7>=1)&&(aux14_1>=1))&&(c20>=1)))||(((aux16_3>=1)&&(c20>=1))&&(aux14_7>=1)))||(((aux16_7>=1)&&(aux14_5>=1))&&(c20>=1)))||(((aux16_4>=1)&&(aux14_6>=1))&&(c20>=1)))||(((aux16_0>=1)&&(aux14_5>=1))&&(c20>=1)))||(((aux16_4>=1)&&(aux14_4>=1))&&(c20>=1)))||(((aux16_5>=1)&&(aux14_1>=1))&&(c20>=1)))||(((aux16_2>=1)&&(aux14_0>=1))&&(c20>=1)))||(((aux16_1>=1)&&(aux14_3>=1))&&(c20>=1)))||(((aux16_5>=1)&&(c20>=1))&&(aux14_7>=1)))||(((aux16_0>=1)&&(aux14_6>=1))&&(c20>=1)))||(((aux16_1>=1)&&(aux14_2>=1))&&(c20>=1)))||(((aux16_4>=1)&&(aux14_3>=1))&&(c20>=1)))||(((aux16_4>=1)&&(aux14_5>=1))&&(c20>=1)))||(((aux16_2>=1)&&(c20>=1))&&(aux14_7>=1)))||(((aux16_5>=1)&&(aux14_0>=1))&&(c20>=1)))||(((aux16_5>=1)&&(aux14_4>=1))&&(c20>=1)))||(((aux16_3>=1)&&(aux14_6>=1))&&(c20>=1)))||(((aux16_3>=1)&&(aux14_0>=1))&&(c20>=1)))||(((aux16_4>=1)&&(c20>=1))&&(aux14_7>=1)))||(((aux16_2>=1)&&(aux14_3>=1))&&(c20>=1)))||(((aux16_6>=1)&&(aux14_5>=1))&&(c20>=1)))||(((aux16_6>=1)&&(aux14_1>=1))&&(c20>=1)))||(((aux16_1>=1)&&(aux14_6>=1))&&(c20>=1)))||(((aux16_7>=1)&&(aux14_4>=1))&&(c20>=1)))||(((aux16_2>=1)&&(aux14_2>=1))&&(c20>=1)))||(((aux16_3>=1)&&(aux14_5>=1))&&(c20>=1)))||(((aux16_5>=1)&&(aux14_3>=1))&&(c20>=1)))||(((aux16_1>=1)&&(c20>=1))&&(aux14_7>=1)))||(((aux16_6>=1)&&(aux14_0>=1))&&(c20>=1)))||(((aux16_2>=1)&&(aux14_1>=1))&&(c20>=1)))||(((aux16_1>=1)&&(aux14_4>=1))&&(c20>=1)))||(((aux16_7>=1)&&(aux14_6>=1))&&(c20>=1)))||(((aux16_5>=1)&&(aux14_2>=1))&&(c20>=1)))"))))
Formula 0 simplified : !XF"((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((aux16_2>=1)&&(aux14_6>=1))&&(c20>=1))||(((aux16_6>=1)&&(aux14_4>=1))&&(c20>=1)))||(((aux16_3>=1)&&(aux14_2>=1))&&(c20>=1)))||(((aux16_7>=1)&&(aux14_0>=1))&&(c20>=1)))||(((aux16_0>=1)&&(aux14_1>=1))&&(c20>=1)))||(((aux16_7>=1)&&(aux14_2>=1))&&(c20>=1)))||(((aux16_0>=1)&&(aux14_0>=1))&&(c20>=1)))||(((aux16_2>=1)&&(aux14_4>=1))&&(c20>=1)))||(((aux16_6>=1)&&(aux14_6>=1))&&(c20>=1)))||(((aux16_3>=1)&&(aux14_1>=1))&&(c20>=1)))||(((aux16_7>=1)&&(c20>=1))&&(aux14_7>=1)))||(((aux16_6>=1)&&(aux14_2>=1))&&(c20>=1)))||(((aux16_7>=1)&&(aux14_3>=1))&&(c20>=1)))||(((aux16_1>=1)&&(aux14_5>=1))&&(c20>=1)))||(((aux16_4>=1)&&(aux14_2>=1))&&(c20>=1)))||(((aux16_1>=1)&&(aux14_1>=1))&&(c20>=1)))||(((aux16_0>=1)&&(aux14_4>=1))&&(c20>=1)))||(((aux16_6>=1)&&(c20>=1))&&(aux14_7>=1)))||(((aux16_0>=1)&&(aux14_3>=1))&&(c20>=1)))||(((aux16_3>=1)&&(aux14_4>=1))&&(c20>=1)))||(((aux16_5>=1)&&(aux14_6>=1))&&(c20>=1)))||(((aux16_4>=1)&&(aux14_1>=1))&&(c20>=1)))||(((aux16_1>=1)&&(aux14_0>=1))&&(c20>=1)))||(((aux16_0>=1)&&(c20>=1))&&(aux14_7>=1)))||(((aux16_6>=1)&&(aux14_3>=1))&&(c20>=1)))||(((aux16_2>=1)&&(aux14_5>=1))&&(c20>=1)))||(((aux16_3>=1)&&(aux14_3>=1))&&(c20>=1)))||(((aux16_5>=1)&&(aux14_5>=1))&&(c20>=1)))||(((aux16_0>=1)&&(aux14_2>=1))&&(c20>=1)))||(((aux16_4>=1)&&(aux14_0>=1))&&(c20>=1)))||(((aux16_7>=1)&&(aux14_1>=1))&&(c20>=1)))||(((aux16_3>=1)&&(c20>=1))&&(aux14_7>=1)))||(((aux16_7>=1)&&(aux14_5>=1))&&(c20>=1)))||(((aux16_4>=1)&&(aux14_6>=1))&&(c20>=1)))||(((aux16_0>=1)&&(aux14_5>=1))&&(c20>=1)))||(((aux16_4>=1)&&(aux14_4>=1))&&(c20>=1)))||(((aux16_5>=1)&&(aux14_1>=1))&&(c20>=1)))||(((aux16_2>=1)&&(aux14_0>=1))&&(c20>=1)))||(((aux16_1>=1)&&(aux14_3>=1))&&(c20>=1)))||(((aux16_5>=1)&&(c20>=1))&&(aux14_7>=1)))||(((aux16_0>=1)&&(aux14_6>=1))&&(c20>=1)))||(((aux16_1>=1)&&(aux14_2>=1))&&(c20>=1)))||(((aux16_4>=1)&&(aux14_3>=1))&&(c20>=1)))||(((aux16_4>=1)&&(aux14_5>=1))&&(c20>=1)))||(((aux16_2>=1)&&(c20>=1))&&(aux14_7>=1)))||(((aux16_5>=1)&&(aux14_0>=1))&&(c20>=1)))||(((aux16_5>=1)&&(aux14_4>=1))&&(c20>=1)))||(((aux16_3>=1)&&(aux14_6>=1))&&(c20>=1)))||(((aux16_3>=1)&&(aux14_0>=1))&&(c20>=1)))||(((aux16_4>=1)&&(c20>=1))&&(aux14_7>=1)))||(((aux16_2>=1)&&(aux14_3>=1))&&(c20>=1)))||(((aux16_6>=1)&&(aux14_5>=1))&&(c20>=1)))||(((aux16_6>=1)&&(aux14_1>=1))&&(c20>=1)))||(((aux16_1>=1)&&(aux14_6>=1))&&(c20>=1)))||(((aux16_7>=1)&&(aux14_4>=1))&&(c20>=1)))||(((aux16_2>=1)&&(aux14_2>=1))&&(c20>=1)))||(((aux16_3>=1)&&(aux14_5>=1))&&(c20>=1)))||(((aux16_5>=1)&&(aux14_3>=1))&&(c20>=1)))||(((aux16_1>=1)&&(c20>=1))&&(aux14_7>=1)))||(((aux16_6>=1)&&(aux14_0>=1))&&(c20>=1)))||(((aux16_2>=1)&&(aux14_1>=1))&&(c20>=1)))||(((aux16_1>=1)&&(aux14_4>=1))&&(c20>=1)))||(((aux16_7>=1)&&(aux14_6>=1))&&(c20>=1)))||(((aux16_5>=1)&&(aux14_2>=1))&&(c20>=1)))"
WARNING : LTSmin timed out (>1920 s) on command CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202104292328/bin/pins2lts-mc-linux64, ./gal.so, --threads=8, --when, --ltl, X(<>(!(LTLAPp0==true))), --buchi-type=spotba], workingDir=/tmp/ltsmin6262525796506487088]
Detected timeout of ITS tools.
[2021-05-14 14:10:05] [INFO ] Flatten gal took : 41 ms
[2021-05-14 14:10:05] [INFO ] Input system was already deterministic with 592 transitions.
[2021-05-14 14:10:05] [INFO ] Transformed 104 places.
[2021-05-14 14:10:05] [INFO ] Transformed 592 transitions.
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/pinvar, /home/mcc/execution/gspn], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : CommandLine [args=[/home/mcc/BenchKit/bin//..//greatspn//bin/RGMEDD2, /home/mcc/execution/gspn, -META, -varord-only], workingDir=/home/mcc/execution]
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2021-05-14 14:10:05] [INFO ] Time to serialize gal into /tmp/LTLFireability10023185498760756941.gal : 3 ms
[2021-05-14 14:10:05] [INFO ] Time to serialize properties into /tmp/LTLFireability544147126309739213.ltl : 1 ms
Invoking ITS tools like this :CommandLine [args=[/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64, --gc-threshold, 2000000, -i, /tmp/LTLFireability10023185498760756941.gal, -t, CGAL, -LTL, /tmp/LTLFireability544147126309739213.ltl, -c, -stutter-deadlock, --load-order, /home/mcc/execution/model.ord, --gen-order, FOLLOW], workingDir=/home/mcc/execution]

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202104292328/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireability10023185498760756941.gal -t CGAL -LTL /tmp/LTLFireability544147126309739213.ltl -c -stutter-deadlock --load-order /home/mcc/execution/model.ord --gen-order FOLLOW
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(F("((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((aux16_2>=1)&&(aux14_6>=1))&&(c20>=1))||(((aux16_6>=1)&&(aux14_4>=1))&&(c20>=1)))||(((aux16_3>=1)&&(aux14_2>=1))&&(c20>=1)))||(((aux16_7>=1)&&(aux14_0>=1))&&(c20>=1)))||(((aux16_0>=1)&&(aux14_1>=1))&&(c20>=1)))||(((aux16_7>=1)&&(aux14_2>=1))&&(c20>=1)))||(((aux16_0>=1)&&(aux14_0>=1))&&(c20>=1)))||(((aux16_2>=1)&&(aux14_4>=1))&&(c20>=1)))||(((aux16_6>=1)&&(aux14_6>=1))&&(c20>=1)))||(((aux16_3>=1)&&(aux14_1>=1))&&(c20>=1)))||(((aux16_7>=1)&&(c20>=1))&&(aux14_7>=1)))||(((aux16_6>=1)&&(aux14_2>=1))&&(c20>=1)))||(((aux16_7>=1)&&(aux14_3>=1))&&(c20>=1)))||(((aux16_1>=1)&&(aux14_5>=1))&&(c20>=1)))||(((aux16_4>=1)&&(aux14_2>=1))&&(c20>=1)))||(((aux16_1>=1)&&(aux14_1>=1))&&(c20>=1)))||(((aux16_0>=1)&&(aux14_4>=1))&&(c20>=1)))||(((aux16_6>=1)&&(c20>=1))&&(aux14_7>=1)))||(((aux16_0>=1)&&(aux14_3>=1))&&(c20>=1)))||(((aux16_3>=1)&&(aux14_4>=1))&&(c20>=1)))||(((aux16_5>=1)&&(aux14_6>=1))&&(c20>=1)))||(((aux16_4>=1)&&(aux14_1>=1))&&(c20>=1)))||(((aux16_1>=1)&&(aux14_0>=1))&&(c20>=1)))||(((aux16_0>=1)&&(c20>=1))&&(aux14_7>=1)))||(((aux16_6>=1)&&(aux14_3>=1))&&(c20>=1)))||(((aux16_2>=1)&&(aux14_5>=1))&&(c20>=1)))||(((aux16_3>=1)&&(aux14_3>=1))&&(c20>=1)))||(((aux16_5>=1)&&(aux14_5>=1))&&(c20>=1)))||(((aux16_0>=1)&&(aux14_2>=1))&&(c20>=1)))||(((aux16_4>=1)&&(aux14_0>=1))&&(c20>=1)))||(((aux16_7>=1)&&(aux14_1>=1))&&(c20>=1)))||(((aux16_3>=1)&&(c20>=1))&&(aux14_7>=1)))||(((aux16_7>=1)&&(aux14_5>=1))&&(c20>=1)))||(((aux16_4>=1)&&(aux14_6>=1))&&(c20>=1)))||(((aux16_0>=1)&&(aux14_5>=1))&&(c20>=1)))||(((aux16_4>=1)&&(aux14_4>=1))&&(c20>=1)))||(((aux16_5>=1)&&(aux14_1>=1))&&(c20>=1)))||(((aux16_2>=1)&&(aux14_0>=1))&&(c20>=1)))||(((aux16_1>=1)&&(aux14_3>=1))&&(c20>=1)))||(((aux16_5>=1)&&(c20>=1))&&(aux14_7>=1)))||(((aux16_0>=1)&&(aux14_6>=1))&&(c20>=1)))||(((aux16_1>=1)&&(aux14_2>=1))&&(c20>=1)))||(((aux16_4>=1)&&(aux14_3>=1))&&(c20>=1)))||(((aux16_4>=1)&&(aux14_5>=1))&&(c20>=1)))||(((aux16_2>=1)&&(c20>=1))&&(aux14_7>=1)))||(((aux16_5>=1)&&(aux14_0>=1))&&(c20>=1)))||(((aux16_5>=1)&&(aux14_4>=1))&&(c20>=1)))||(((aux16_3>=1)&&(aux14_6>=1))&&(c20>=1)))||(((aux16_3>=1)&&(aux14_0>=1))&&(c20>=1)))||(((aux16_4>=1)&&(c20>=1))&&(aux14_7>=1)))||(((aux16_2>=1)&&(aux14_3>=1))&&(c20>=1)))||(((aux16_6>=1)&&(aux14_5>=1))&&(c20>=1)))||(((aux16_6>=1)&&(aux14_1>=1))&&(c20>=1)))||(((aux16_1>=1)&&(aux14_6>=1))&&(c20>=1)))||(((aux16_7>=1)&&(aux14_4>=1))&&(c20>=1)))||(((aux16_2>=1)&&(aux14_2>=1))&&(c20>=1)))||(((aux16_3>=1)&&(aux14_5>=1))&&(c20>=1)))||(((aux16_5>=1)&&(aux14_3>=1))&&(c20>=1)))||(((aux16_1>=1)&&(c20>=1))&&(aux14_7>=1)))||(((aux16_6>=1)&&(aux14_0>=1))&&(c20>=1)))||(((aux16_2>=1)&&(aux14_1>=1))&&(c20>=1)))||(((aux16_1>=1)&&(aux14_4>=1))&&(c20>=1)))||(((aux16_7>=1)&&(aux14_6>=1))&&(c20>=1)))||(((aux16_5>=1)&&(aux14_2>=1))&&(c20>=1)))"))))
Formula 0 simplified : !XF"((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((aux16_2>=1)&&(aux14_6>=1))&&(c20>=1))||(((aux16_6>=1)&&(aux14_4>=1))&&(c20>=1)))||(((aux16_3>=1)&&(aux14_2>=1))&&(c20>=1)))||(((aux16_7>=1)&&(aux14_0>=1))&&(c20>=1)))||(((aux16_0>=1)&&(aux14_1>=1))&&(c20>=1)))||(((aux16_7>=1)&&(aux14_2>=1))&&(c20>=1)))||(((aux16_0>=1)&&(aux14_0>=1))&&(c20>=1)))||(((aux16_2>=1)&&(aux14_4>=1))&&(c20>=1)))||(((aux16_6>=1)&&(aux14_6>=1))&&(c20>=1)))||(((aux16_3>=1)&&(aux14_1>=1))&&(c20>=1)))||(((aux16_7>=1)&&(c20>=1))&&(aux14_7>=1)))||(((aux16_6>=1)&&(aux14_2>=1))&&(c20>=1)))||(((aux16_7>=1)&&(aux14_3>=1))&&(c20>=1)))||(((aux16_1>=1)&&(aux14_5>=1))&&(c20>=1)))||(((aux16_4>=1)&&(aux14_2>=1))&&(c20>=1)))||(((aux16_1>=1)&&(aux14_1>=1))&&(c20>=1)))||(((aux16_0>=1)&&(aux14_4>=1))&&(c20>=1)))||(((aux16_6>=1)&&(c20>=1))&&(aux14_7>=1)))||(((aux16_0>=1)&&(aux14_3>=1))&&(c20>=1)))||(((aux16_3>=1)&&(aux14_4>=1))&&(c20>=1)))||(((aux16_5>=1)&&(aux14_6>=1))&&(c20>=1)))||(((aux16_4>=1)&&(aux14_1>=1))&&(c20>=1)))||(((aux16_1>=1)&&(aux14_0>=1))&&(c20>=1)))||(((aux16_0>=1)&&(c20>=1))&&(aux14_7>=1)))||(((aux16_6>=1)&&(aux14_3>=1))&&(c20>=1)))||(((aux16_2>=1)&&(aux14_5>=1))&&(c20>=1)))||(((aux16_3>=1)&&(aux14_3>=1))&&(c20>=1)))||(((aux16_5>=1)&&(aux14_5>=1))&&(c20>=1)))||(((aux16_0>=1)&&(aux14_2>=1))&&(c20>=1)))||(((aux16_4>=1)&&(aux14_0>=1))&&(c20>=1)))||(((aux16_7>=1)&&(aux14_1>=1))&&(c20>=1)))||(((aux16_3>=1)&&(c20>=1))&&(aux14_7>=1)))||(((aux16_7>=1)&&(aux14_5>=1))&&(c20>=1)))||(((aux16_4>=1)&&(aux14_6>=1))&&(c20>=1)))||(((aux16_0>=1)&&(aux14_5>=1))&&(c20>=1)))||(((aux16_4>=1)&&(aux14_4>=1))&&(c20>=1)))||(((aux16_5>=1)&&(aux14_1>=1))&&(c20>=1)))||(((aux16_2>=1)&&(aux14_0>=1))&&(c20>=1)))||(((aux16_1>=1)&&(aux14_3>=1))&&(c20>=1)))||(((aux16_5>=1)&&(c20>=1))&&(aux14_7>=1)))||(((aux16_0>=1)&&(aux14_6>=1))&&(c20>=1)))||(((aux16_1>=1)&&(aux14_2>=1))&&(c20>=1)))||(((aux16_4>=1)&&(aux14_3>=1))&&(c20>=1)))||(((aux16_4>=1)&&(aux14_5>=1))&&(c20>=1)))||(((aux16_2>=1)&&(c20>=1))&&(aux14_7>=1)))||(((aux16_5>=1)&&(aux14_0>=1))&&(c20>=1)))||(((aux16_5>=1)&&(aux14_4>=1))&&(c20>=1)))||(((aux16_3>=1)&&(aux14_6>=1))&&(c20>=1)))||(((aux16_3>=1)&&(aux14_0>=1))&&(c20>=1)))||(((aux16_4>=1)&&(c20>=1))&&(aux14_7>=1)))||(((aux16_2>=1)&&(aux14_3>=1))&&(c20>=1)))||(((aux16_6>=1)&&(aux14_5>=1))&&(c20>=1)))||(((aux16_6>=1)&&(aux14_1>=1))&&(c20>=1)))||(((aux16_1>=1)&&(aux14_6>=1))&&(c20>=1)))||(((aux16_7>=1)&&(aux14_4>=1))&&(c20>=1)))||(((aux16_2>=1)&&(aux14_2>=1))&&(c20>=1)))||(((aux16_3>=1)&&(aux14_5>=1))&&(c20>=1)))||(((aux16_5>=1)&&(aux14_3>=1))&&(c20>=1)))||(((aux16_1>=1)&&(c20>=1))&&(aux14_7>=1)))||(((aux16_6>=1)&&(aux14_0>=1))&&(c20>=1)))||(((aux16_2>=1)&&(aux14_1>=1))&&(c20>=1)))||(((aux16_1>=1)&&(aux14_4>=1))&&(c20>=1)))||(((aux16_7>=1)&&(aux14_6>=1))&&(c20>=1)))||(((aux16_5>=1)&&(aux14_2>=1))&&(c20>=1)))"

BK_TIME_CONFINEMENT_REACHED

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="PermAdmissibility-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-4028"
echo " Executing tool itstools"
echo " Input is PermAdmissibility-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 r140-tall-162089128000525"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-PT-05.tgz
mv PermAdmissibility-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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;