Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r285-smll-171654422000108.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
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 r285-smll-171654422000108
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 11K Apr 12 09:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K Apr 12 09:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 57K Apr 12 09:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 296K Apr 12 09:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.9K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 31K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 54K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 09:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 130K Apr 12 09:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 115K Apr 12 09:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 590K Apr 12 09:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.5K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 336K May 18 16:43 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-LTLFireability-00
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-01
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-02
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-03
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-04
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-05
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-06
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-07
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-08
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-09
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-10
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-11
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-12
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-13
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-14
FORMULA_NAME PermAdmissibility-PT-05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716859019368

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-PT-05
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-28 01:17:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 01:17:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 01:17:02] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2024-05-28 01:17:02] [INFO ] Transformed 168 places.
[2024-05-28 01:17:02] [INFO ] Transformed 592 transitions.
[2024-05-28 01:17:02] [INFO ] Parsed PT model containing 168 places and 592 transitions and 3456 arcs in 251 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA PermAdmissibility-PT-05-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-05-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-05-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-05-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-05-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-05-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 64 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, 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
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 77 place count 91 transition count 468
Iterating global reduction 1 with 13 rules applied. Total rules applied 90 place count 91 transition count 468
Applied a total of 90 rules in 47 ms. Remains 91 /168 variables (removed 77) and now considering 468/592 (removed 124) transitions.
// Phase 1: matrix 468 rows 91 cols
[2024-05-28 01:17:02] [INFO ] Computed 16 invariants in 35 ms
[2024-05-28 01:17:02] [INFO ] Implicit Places using invariants in 299 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 346 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/168 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.
Finished structural reductions in LTL mode , in 2 iterations and 398 ms. Remains : 90/168 places, 468/592 transitions.
Support contains 64 out of 90 places after structural reductions.
[2024-05-28 01:17:03] [INFO ] Flatten gal took : 119 ms
[2024-05-28 01:17:03] [INFO ] Flatten gal took : 70 ms
[2024-05-28 01:17:03] [INFO ] Input system was already deterministic with 468 transitions.
Finished random walk after 3997 steps, including 41 resets, run visited all 17 properties in 162 ms. (steps per millisecond=24 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 90 stabilizing places and 468 stable transitions
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 (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(p1))||p0))))'
Support contains 39 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 468/468 transitions.
Applied a total of 0 rules in 6 ms. Remains 90 /90 variables (removed 0) and now considering 468/468 (removed 0) transitions.
// Phase 1: matrix 468 rows 90 cols
[2024-05-28 01:17:04] [INFO ] Computed 15 invariants in 8 ms
[2024-05-28 01:17:04] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-28 01:17:04] [INFO ] Invariant cache hit.
[2024-05-28 01:17:04] [INFO ] Implicit Places using invariants and state equation in 391 ms returned []
Implicit Place search using SMT with State Equation took 539 ms to find 0 implicit places.
[2024-05-28 01:17:04] [INFO ] Invariant cache hit.
[2024-05-28 01:17:05] [INFO ] Dead Transitions using invariants and state equation in 340 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 887 ms. Remains : 90/90 places, 468/468 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 332 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-PT-05-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s31 1) (GEQ s72 1) (GEQ s79 1)) (AND (GEQ s46 1) (GEQ s49 1) (GEQ s79 1)) (AND (GEQ s34 1) (GEQ s73 1) (GEQ s79 1)) (AND (GEQ s34 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 13719 reset in 1399 ms.
Product exploration explored 100000 steps with 13697 reset in 1175 ms.
Computed a total of 90 stabilizing places and 468 stable transitions
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 (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 261 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Finished random walk after 7171 steps, including 74 resets, run visited all 4 properties in 51 ms. (steps per millisecond=140 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 296 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
[2024-05-28 01:17:09] [INFO ] Invariant cache hit.
[2024-05-28 01:17:11] [INFO ] [Real]Absence check using 0 positive and 15 generalized place invariants in 27 ms returned sat
[2024-05-28 01:17:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 01:17:11] [INFO ] [Real]Absence check using state equation in 199 ms returned sat
[2024-05-28 01:17:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 01:17:12] [INFO ] [Nat]Absence check using 0 positive and 15 generalized place invariants in 30 ms returned sat
[2024-05-28 01:17:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 01:17:13] [INFO ] [Nat]Absence check using state equation in 198 ms returned sat
[2024-05-28 01:17:13] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 436 transitions) in 108 ms.
[2024-05-28 01:17:13] [INFO ] Added : 17 causal constraints over 6 iterations in 355 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 39 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 468/468 transitions.
Graph (complete) has 723 edges and 90 vertex of which 86 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.4 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Applied a total of 1 rules in 35 ms. Remains 86 /90 variables (removed 4) and now considering 464/468 (removed 4) transitions.
// Phase 1: matrix 464 rows 86 cols
[2024-05-28 01:17:13] [INFO ] Computed 14 invariants in 7 ms
[2024-05-28 01:17:13] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-28 01:17:13] [INFO ] Invariant cache hit.
[2024-05-28 01:17:14] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
[2024-05-28 01:17:14] [INFO ] Redundant transitions in 32 ms returned []
[2024-05-28 01:17:14] [INFO ] Invariant cache hit.
[2024-05-28 01:17:14] [INFO ] Dead Transitions using invariants and state equation in 289 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/90 places, 464/468 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 764 ms. Remains : 86/90 places, 464/468 transitions.
Computed a total of 86 stabilizing places and 464 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 86 transition count 464
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 225 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 185 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Finished random walk after 1136 steps, including 13 resets, run visited all 4 properties in 11 ms. (steps per millisecond=103 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 11 factoid took 505 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 189 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
[2024-05-28 01:17:15] [INFO ] Invariant cache hit.
[2024-05-28 01:17:17] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 28 ms returned sat
[2024-05-28 01:17:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 01:17:17] [INFO ] [Real]Absence check using state equation in 204 ms returned sat
[2024-05-28 01:17:17] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 01:17:19] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 19 ms returned sat
[2024-05-28 01:17:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 01:17:19] [INFO ] [Nat]Absence check using state equation in 134 ms returned sat
[2024-05-28 01:17:19] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 432 transitions) in 57 ms.
[2024-05-28 01:17:19] [INFO ] Added : 14 causal constraints over 5 iterations in 219 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Product exploration explored 100000 steps with 14814 reset in 1179 ms.
Product exploration explored 100000 steps with 14878 reset in 1209 ms.
Built C files in :
/tmp/ltsmin12277786924195321223
[2024-05-28 01:17:22] [INFO ] Computing symmetric may disable matrix : 464 transitions.
[2024-05-28 01:17:22] [INFO ] Computation of Complete disable matrix. took 12 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 01:17:22] [INFO ] Computing symmetric may enable matrix : 464 transitions.
[2024-05-28 01:17:22] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 01:17:22] [INFO ] Computing Do-Not-Accords matrix : 464 transitions.
[2024-05-28 01:17:22] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 01:17:22] [INFO ] Built C files in 159ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12277786924195321223
Running compilation step : cd /tmp/ltsmin12277786924195321223;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2006 ms.
Running link step : cd /tmp/ltsmin12277786924195321223;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin12277786924195321223;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7270983099677079158.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 39 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 464/464 transitions.
Applied a total of 0 rules in 27 ms. Remains 86 /86 variables (removed 0) and now considering 464/464 (removed 0) transitions.
[2024-05-28 01:17:37] [INFO ] Invariant cache hit.
[2024-05-28 01:17:38] [INFO ] Implicit Places using invariants in 652 ms returned []
[2024-05-28 01:17:38] [INFO ] Invariant cache hit.
[2024-05-28 01:17:38] [INFO ] Implicit Places using invariants and state equation in 335 ms returned []
Implicit Place search using SMT with State Equation took 996 ms to find 0 implicit places.
[2024-05-28 01:17:38] [INFO ] Redundant transitions in 9 ms returned []
[2024-05-28 01:17:38] [INFO ] Invariant cache hit.
[2024-05-28 01:17:38] [INFO ] Dead Transitions using invariants and state equation in 311 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1351 ms. Remains : 86/86 places, 464/464 transitions.
Built C files in :
/tmp/ltsmin14805443062957036083
[2024-05-28 01:17:38] [INFO ] Computing symmetric may disable matrix : 464 transitions.
[2024-05-28 01:17:38] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 01:17:38] [INFO ] Computing symmetric may enable matrix : 464 transitions.
[2024-05-28 01:17:38] [INFO ] Computation of Complete enable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 01:17:38] [INFO ] Computing Do-Not-Accords matrix : 464 transitions.
[2024-05-28 01:17:38] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 01:17:38] [INFO ] Built C files in 92ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14805443062957036083
Running compilation step : cd /tmp/ltsmin14805443062957036083;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1886 ms.
Running link step : cd /tmp/ltsmin14805443062957036083;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin14805443062957036083;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12784548375719297039.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 01:17:53] [INFO ] Flatten gal took : 50 ms
[2024-05-28 01:17:53] [INFO ] Flatten gal took : 46 ms
[2024-05-28 01:17:53] [INFO ] Time to serialize gal into /tmp/LTL2417068788136085566.gal : 7 ms
[2024-05-28 01:17:53] [INFO ] Time to serialize properties into /tmp/LTL3669596690106334465.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2417068788136085566.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16693585307156574849.hoa' '-atoms' '/tmp/LTL3669596690106334465.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL3669596690106334465.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16693585307156574849.hoa
Detected timeout of ITS tools.
[2024-05-28 01:18:09] [INFO ] Flatten gal took : 40 ms
[2024-05-28 01:18:09] [INFO ] Flatten gal took : 37 ms
[2024-05-28 01:18:09] [INFO ] Time to serialize gal into /tmp/LTL12537260702340152773.gal : 4 ms
[2024-05-28 01:18:09] [INFO ] Time to serialize properties into /tmp/LTL1245833656258987837.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12537260702340152773.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1245833656258987837.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(F(((((((((G(F("(((((in4_6>=1)&&(in2_2>=1))&&(c8>=1))||(((in4_7>=1)&&(in2_3>=1))&&(c8>=1)))||((((in4_7>=1)&&(in2_2>=1))&&(c8>=1))|...5856
Formula 0 simplified : XG(!"(((((((((aux12_0>=1)&&(aux10_1>=1))&&(c16>=1))||(((aux15_5>=1)&&(aux13_7>=1))&&(c17>=1)))||((((aux15_3>=1)&&(aux13_3>=1))&&(c17...5832
Detected timeout of ITS tools.
[2024-05-28 01:18:24] [INFO ] Flatten gal took : 37 ms
[2024-05-28 01:18:24] [INFO ] Applying decomposition
[2024-05-28 01:18:24] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2740461841826663686.txt' '-o' '/tmp/graph2740461841826663686.bin' '-w' '/tmp/graph2740461841826663686.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2740461841826663686.bin' '-l' '-1' '-v' '-w' '/tmp/graph2740461841826663686.weights' '-q' '0' '-e' '0.001'
[2024-05-28 01:18:24] [INFO ] Decomposing Gal with order
[2024-05-28 01:18:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 01:18:24] [INFO ] Removed a total of 444 redundant transitions.
[2024-05-28 01:18:24] [INFO ] Flatten gal took : 190 ms
[2024-05-28 01:18:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 216 labels/synchronizations in 22 ms.
[2024-05-28 01:18:24] [INFO ] Time to serialize gal into /tmp/LTL14255980982136366576.gal : 10 ms
[2024-05-28 01:18:24] [INFO ] Time to serialize properties into /tmp/LTL11049056069232997165.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14255980982136366576.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11049056069232997165.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((X(F(((((((((G(F("(((((i1.u2.in4_6>=1)&&(i1.u5.in2_2>=1))&&(i1.u5.c8>=1))||(((i1.u5.in4_7>=1)&&(i1.u5.in2_3>=1))&&(i1.u5.c8>=1)))||(...7464
Formula 0 simplified : XG(!"(((((((((u1.aux12_0>=1)&&(u1.aux10_1>=1))&&(u1.c16>=1))||(((i3.u0.aux15_5>=1)&&(i3.u0.aux13_7>=1))&&(u1.c17>=1)))||((((i3.u0.au...7440
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin8617047867389047145
[2024-05-28 01:18:39] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8617047867389047145
Running compilation step : cd /tmp/ltsmin8617047867389047145;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1244 ms.
Running link step : cd /tmp/ltsmin8617047867389047145;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin8617047867389047145;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(([](<>((LTLAPp1==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PermAdmissibility-PT-05-LTLFireability-00 finished in 110758 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(F(G(p1))&&(p2 U p3))))'
Support contains 48 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 468/468 transitions.
Graph (complete) has 723 edges and 90 vertex of which 86 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.3 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Applied a total of 1 rules in 20 ms. Remains 86 /90 variables (removed 4) and now considering 464/468 (removed 4) transitions.
[2024-05-28 01:18:54] [INFO ] Invariant cache hit.
[2024-05-28 01:18:55] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-28 01:18:55] [INFO ] Invariant cache hit.
[2024-05-28 01:18:55] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
[2024-05-28 01:18:55] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-28 01:18:55] [INFO ] Invariant cache hit.
[2024-05-28 01:18:55] [INFO ] Dead Transitions using invariants and state equation in 279 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/90 places, 464/468 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 766 ms. Remains : 86/90 places, 464/468 transitions.
Stuttering acceptance computed with spot in 262 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), true, (NOT p0), (NOT p1), (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : PermAdmissibility-PT-05-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p0) p3) (AND (NOT p0) p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=0 dest: 4}, { cond=(OR (AND p0 p3) (AND p0 p2)), acceptance={} source=0 dest: 5}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p3) p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=6 dest: 4}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (OR (LT s29 1) (LT s67 1) (LT s76 1)) (OR (LT s32 1) (LT s68 1) (LT s76 1)) (OR (LT s32 1) (LT s49 1) (LT s76 1)) (OR (LT s32 1) (LT s69 1) (LT s7...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 18 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-05-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLFireability-02 finished in 1056 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 5 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 468/468 transitions.
Graph (complete) has 723 edges and 90 vertex of which 6 are kept as prefixes of interest. Removing 84 places using SCC suffix rule.2 ms
Discarding 84 places :
Also discarding 460 output transitions
Drop transitions removed 460 transitions
Applied a total of 1 rules in 4 ms. Remains 6 /90 variables (removed 84) and now considering 8/468 (removed 460) transitions.
// Phase 1: matrix 8 rows 6 cols
[2024-05-28 01:18:55] [INFO ] Computed 2 invariants in 0 ms
[2024-05-28 01:18:55] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-28 01:18:55] [INFO ] Invariant cache hit.
[2024-05-28 01:18:56] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2024-05-28 01:18:56] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 01:18:56] [INFO ] Invariant cache hit.
[2024-05-28 01:18:56] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/90 places, 8/468 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 85 ms. Remains : 6/90 places, 8/468 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s3 1) (GEQ s5 1)) (AND (GEQ s1 1) (GEQ s3 1) (GEQ s4 1)) (AND (GEQ s0 1) (GEQ s3 1) (GEQ s4 1)) (AND (GEQ s0 1) (GEQ s3 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 52 steps with 11 reset in 0 ms.
FORMULA PermAdmissibility-PT-05-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLFireability-04 finished in 176 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F((G(F(p1))||(!p1&&F(p1))))&&p0)))'
Support contains 14 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 468/468 transitions.
Graph (complete) has 723 edges and 90 vertex of which 22 are kept as prefixes of interest. Removing 68 places using SCC suffix rule.2 ms
Discarding 68 places :
Also discarding 420 output transitions
Drop transitions removed 420 transitions
Applied a total of 1 rules in 5 ms. Remains 22 /90 variables (removed 68) and now considering 48/468 (removed 420) transitions.
// Phase 1: matrix 48 rows 22 cols
[2024-05-28 01:18:56] [INFO ] Computed 6 invariants in 0 ms
[2024-05-28 01:18:56] [INFO ] Implicit Places using invariants in 34 ms returned []
[2024-05-28 01:18:56] [INFO ] Invariant cache hit.
[2024-05-28 01:18:56] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
[2024-05-28 01:18:56] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 01:18:56] [INFO ] Invariant cache hit.
[2024-05-28 01:18:56] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/90 places, 48/468 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 152 ms. Remains : 22/90 places, 48/468 transitions.
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-PT-05-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(AND (OR (LT s2 1) (LT s4 1) (LT s7 1)) (OR (LT s2 1) (LT s4 1) (LT s8 1)) (OR (LT s0 1) (LT s2 1) (LT s6 1)) (OR (LT s0 1) (LT s2 1) (LT s5 1)) (OR (L...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 7415 reset in 513 ms.
Product exploration explored 100000 steps with 7434 reset in 541 ms.
Computed a total of 22 stabilizing places and 48 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 48
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (F (G p1)), (F (G p0))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0))), (X (X p0))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 20 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-05-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-05-LTLFireability-07 finished in 1414 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G((p1||X(p1)))))))'
Support contains 6 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 468/468 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 77 transition count 344
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 77 transition count 344
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 48 place count 55 transition count 114
Iterating global reduction 0 with 22 rules applied. Total rules applied 70 place count 55 transition count 114
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 53 transition count 98
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 53 transition count 98
Applied a total of 74 rules in 19 ms. Remains 53 /90 variables (removed 37) and now considering 98/468 (removed 370) transitions.
// Phase 1: matrix 98 rows 53 cols
[2024-05-28 01:18:57] [INFO ] Computed 15 invariants in 6 ms
[2024-05-28 01:18:57] [INFO ] Implicit Places using invariants in 72 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 73 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/90 places, 98/468 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 93 ms. Remains : 52/90 places, 98/468 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s17 1) (GEQ s38 1) (GEQ s42 1)), p1:(AND (GEQ s34 1) (GEQ s37 1) (GEQ s47 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-05-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLFireability-08 finished in 309 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 6 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 468/468 transitions.
Graph (complete) has 723 edges and 90 vertex of which 50 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.2 ms
Discarding 40 places :
Also discarding 260 output transitions
Drop transitions removed 260 transitions
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 13 place count 38 transition count 88
Iterating global reduction 0 with 12 rules applied. Total rules applied 25 place count 38 transition count 88
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 29 place count 34 transition count 60
Iterating global reduction 0 with 4 rules applied. Total rules applied 33 place count 34 transition count 60
Applied a total of 33 rules in 14 ms. Remains 34 /90 variables (removed 56) and now considering 60/468 (removed 408) transitions.
// Phase 1: matrix 60 rows 34 cols
[2024-05-28 01:18:57] [INFO ] Computed 10 invariants in 0 ms
[2024-05-28 01:18:57] [INFO ] Implicit Places using invariants in 44 ms returned []
[2024-05-28 01:18:57] [INFO ] Invariant cache hit.
[2024-05-28 01:18:57] [INFO ] Implicit Places using invariants and state equation in 84 ms returned []
Implicit Place search using SMT with State Equation took 130 ms to find 0 implicit places.
[2024-05-28 01:18:57] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 01:18:57] [INFO ] Invariant cache hit.
[2024-05-28 01:18:58] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/90 places, 60/468 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 205 ms. Remains : 34/90 places, 60/468 transitions.
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s10 1) (GEQ s19 1)), p1:(OR (LT s13 1) (LT s14 1) (LT s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 50 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-05-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLFireability-09 finished in 333 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(F((!p0&&G(!p1))) U (p2 U p1)))))'
Support contains 9 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 468/468 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 77 transition count 344
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 77 transition count 344
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 48 place count 55 transition count 122
Iterating global reduction 0 with 22 rules applied. Total rules applied 70 place count 55 transition count 122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 54 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 54 transition count 114
Applied a total of 72 rules in 9 ms. Remains 54 /90 variables (removed 36) and now considering 114/468 (removed 354) transitions.
// Phase 1: matrix 114 rows 54 cols
[2024-05-28 01:18:58] [INFO ] Computed 15 invariants in 2 ms
[2024-05-28 01:18:58] [INFO ] Implicit Places using invariants in 69 ms returned [4, 18, 25]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 70 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/90 places, 114/468 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 114/114 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 81 ms. Remains : 51/90 places, 114/468 transitions.
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p1)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s25 1) (GEQ s31 1) (GEQ s42 1)), p1:(AND (GEQ s12 1) (GEQ s16 1) (GEQ s20 1)), p2:(AND (GEQ s44 1) (GEQ s48 1) (GEQ s50 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1646 reset in 553 ms.
Product exploration explored 100000 steps with 1623 reset in 450 ms.
Computed a total of 51 stabilizing places and 114 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 51 transition count 114
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 324 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 225 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=112 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (F (G (NOT p0))), (F (G (NOT p1))), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 8 factoid took 452 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
// Phase 1: matrix 114 rows 51 cols
[2024-05-28 01:19:00] [INFO ] Computed 12 invariants in 1 ms
[2024-05-28 01:19:00] [INFO ] [Real]Absence check using 0 positive and 12 generalized place invariants in 7 ms returned sat
[2024-05-28 01:19:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 01:19:00] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2024-05-28 01:19:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 01:19:00] [INFO ] [Nat]Absence check using 0 positive and 12 generalized place invariants in 6 ms returned sat
[2024-05-28 01:19:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 01:19:00] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-05-28 01:19:00] [INFO ] Computed and/alt/rep : 23/131/23 causal constraints (skipped 87 transitions) in 12 ms.
[2024-05-28 01:19:00] [INFO ] Added : 13 causal constraints over 3 iterations in 58 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 6 out of 51 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 114/114 transitions.
Graph (complete) has 237 edges and 51 vertex of which 41 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.0 ms
Discarding 10 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 5 place count 37 transition count 80
Iterating global reduction 0 with 4 rules applied. Total rules applied 9 place count 37 transition count 80
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 12 place count 34 transition count 64
Iterating global reduction 0 with 3 rules applied. Total rules applied 15 place count 34 transition count 64
Applied a total of 15 rules in 8 ms. Remains 34 /51 variables (removed 17) and now considering 64/114 (removed 50) transitions.
// Phase 1: matrix 64 rows 34 cols
[2024-05-28 01:19:00] [INFO ] Computed 10 invariants in 1 ms
[2024-05-28 01:19:00] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-28 01:19:00] [INFO ] Invariant cache hit.
[2024-05-28 01:19:00] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 117 ms to find 0 implicit places.
[2024-05-28 01:19:00] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 01:19:00] [INFO ] Invariant cache hit.
[2024-05-28 01:19:00] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 34/51 places, 64/114 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 202 ms. Remains : 34/51 places, 64/114 transitions.
Computed a total of 34 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 34 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 112 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 153 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=76 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1)))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 5 factoid took 141 ms. Reduced automaton from 1 states, 1 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 43 ms :[(AND (NOT p0) (NOT p1))]
[2024-05-28 01:19:01] [INFO ] Invariant cache hit.
[2024-05-28 01:19:01] [INFO ] [Real]Absence check using 0 positive and 10 generalized place invariants in 5 ms returned sat
[2024-05-28 01:19:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 01:19:01] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-28 01:19:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 01:19:01] [INFO ] [Nat]Absence check using 0 positive and 10 generalized place invariants in 6 ms returned sat
[2024-05-28 01:19:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 01:19:01] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-28 01:19:01] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 32 transitions) in 6 ms.
[2024-05-28 01:19:01] [INFO ] Added : 19 causal constraints over 4 iterations in 48 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Stuttering criterion allowed to conclude after 120 steps with 4 reset in 1 ms.
FORMULA PermAdmissibility-PT-05-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLFireability-10 finished in 3525 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(G(p0))))))'
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 468/468 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 77 transition count 344
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 77 transition count 344
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 48 place count 55 transition count 114
Iterating global reduction 0 with 22 rules applied. Total rules applied 70 place count 55 transition count 114
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 73 place count 52 transition count 90
Iterating global reduction 0 with 3 rules applied. Total rules applied 76 place count 52 transition count 90
Applied a total of 76 rules in 9 ms. Remains 52 /90 variables (removed 38) and now considering 90/468 (removed 378) transitions.
// Phase 1: matrix 90 rows 52 cols
[2024-05-28 01:19:01] [INFO ] Computed 15 invariants in 1 ms
[2024-05-28 01:19:01] [INFO ] Implicit Places using invariants in 89 ms returned [4]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 91 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/90 places, 90/468 transitions.
Applied a total of 0 rules in 0 ms. Remains 51 /51 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 101 ms. Remains : 51/90 places, 90/468 transitions.
Stuttering acceptance computed with spot in 227 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s17 1) (LT s26 1) (LT s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 34 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-05-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLFireability-12 finished in 344 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 6 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 468/468 transitions.
Graph (complete) has 723 edges and 90 vertex of which 86 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 12 place count 75 transition count 348
Iterating global reduction 0 with 11 rules applied. Total rules applied 23 place count 75 transition count 348
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 43 place count 55 transition count 128
Iterating global reduction 0 with 20 rules applied. Total rules applied 63 place count 55 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 64 place count 54 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 65 place count 54 transition count 120
Applied a total of 65 rules in 20 ms. Remains 54 /90 variables (removed 36) and now considering 120/468 (removed 348) transitions.
// Phase 1: matrix 120 rows 54 cols
[2024-05-28 01:19:02] [INFO ] Computed 14 invariants in 2 ms
[2024-05-28 01:19:03] [INFO ] Implicit Places using invariants in 1277 ms returned []
[2024-05-28 01:19:03] [INFO ] Invariant cache hit.
[2024-05-28 01:19:03] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 1428 ms to find 0 implicit places.
[2024-05-28 01:19:03] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 01:19:03] [INFO ] Invariant cache hit.
[2024-05-28 01:19:03] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 54/90 places, 120/468 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1535 ms. Remains : 54/90 places, 120/468 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s22 1) (GEQ s27 1) (GEQ s43 1) (GEQ s1 1) (GEQ s3 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 70 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-05-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLFireability-13 finished in 1631 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 468/468 transitions.
Graph (complete) has 723 edges and 90 vertex of which 68 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.1 ms
Discarding 22 places :
Also discarding 132 output transitions
Drop transitions removed 132 transitions
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 27 place count 42 transition count 90
Iterating global reduction 0 with 26 rules applied. Total rules applied 53 place count 42 transition count 90
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 58 place count 37 transition count 58
Iterating global reduction 0 with 5 rules applied. Total rules applied 63 place count 37 transition count 58
Applied a total of 63 rules in 11 ms. Remains 37 /90 variables (removed 53) and now considering 58/468 (removed 410) transitions.
// Phase 1: matrix 58 rows 37 cols
[2024-05-28 01:19:03] [INFO ] Computed 12 invariants in 1 ms
[2024-05-28 01:19:03] [INFO ] Implicit Places using invariants in 65 ms returned [11, 20]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 67 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/90 places, 58/468 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 35 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 34 transition count 57
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 34 transition count 56
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 33 transition count 56
Applied a total of 4 rules in 11 ms. Remains 33 /35 variables (removed 2) and now considering 56/58 (removed 2) transitions.
// Phase 1: matrix 56 rows 33 cols
[2024-05-28 01:19:03] [INFO ] Computed 10 invariants in 1 ms
[2024-05-28 01:19:03] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-28 01:19:03] [INFO ] Invariant cache hit.
[2024-05-28 01:19:03] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 161 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 33/90 places, 56/468 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 250 ms. Remains : 33/90 places, 56/468 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-05-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s9 1) (GEQ s13 1) (GEQ s24 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 102 steps with 2 reset in 1 ms.
FORMULA PermAdmissibility-PT-05-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-05-LTLFireability-14 finished in 305 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(p1))||p0))))'
Found a Shortening insensitive property : PermAdmissibility-PT-05-LTLFireability-00
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 39 out of 90 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 90/90 places, 468/468 transitions.
Graph (complete) has 723 edges and 90 vertex of which 86 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Applied a total of 1 rules in 11 ms. Remains 86 /90 variables (removed 4) and now considering 464/468 (removed 4) transitions.
// Phase 1: matrix 464 rows 86 cols
[2024-05-28 01:19:04] [INFO ] Computed 14 invariants in 3 ms
[2024-05-28 01:19:04] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-05-28 01:19:04] [INFO ] Invariant cache hit.
[2024-05-28 01:19:04] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
[2024-05-28 01:19:04] [INFO ] Invariant cache hit.
[2024-05-28 01:19:04] [INFO ] Dead Transitions using invariants and state equation in 238 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 86/90 places, 464/468 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 698 ms. Remains : 86/90 places, 464/468 transitions.
Running random walk in product with property : PermAdmissibility-PT-05-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s27 1) (GEQ s68 1) (GEQ s75 1)) (AND (GEQ s42 1) (GEQ s45 1) (GEQ s75 1)) (AND (GEQ s30 1) (GEQ s69 1) (GEQ s75 1)) (AND (GEQ s30 1) (GEQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 13620 reset in 1061 ms.
Product exploration explored 100000 steps with 13783 reset in 1062 ms.
Computed a total of 86 stabilizing places and 464 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 86 transition count 464
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 137 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Finished random walk after 700 steps, including 8 resets, run visited all 4 properties in 11 ms. (steps per millisecond=63 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 7 factoid took 284 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
[2024-05-28 01:19:08] [INFO ] Invariant cache hit.
[2024-05-28 01:19:09] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 26 ms returned sat
[2024-05-28 01:19:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 01:19:10] [INFO ] [Real]Absence check using state equation in 197 ms returned sat
[2024-05-28 01:19:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 01:19:11] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 19 ms returned sat
[2024-05-28 01:19:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 01:19:11] [INFO ] [Nat]Absence check using state equation in 132 ms returned sat
[2024-05-28 01:19:11] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 432 transitions) in 41 ms.
[2024-05-28 01:19:12] [INFO ] Added : 14 causal constraints over 5 iterations in 196 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 39 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 464/464 transitions.
Applied a total of 0 rules in 12 ms. Remains 86 /86 variables (removed 0) and now considering 464/464 (removed 0) transitions.
[2024-05-28 01:19:12] [INFO ] Invariant cache hit.
[2024-05-28 01:19:12] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-05-28 01:19:12] [INFO ] Invariant cache hit.
[2024-05-28 01:19:12] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 365 ms to find 0 implicit places.
[2024-05-28 01:19:12] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-28 01:19:12] [INFO ] Invariant cache hit.
[2024-05-28 01:19:12] [INFO ] Dead Transitions using invariants and state equation in 241 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 629 ms. Remains : 86/86 places, 464/464 transitions.
Computed a total of 86 stabilizing places and 464 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 86 transition count 464
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 221 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Finished random walk after 873 steps, including 10 resets, run visited all 4 properties in 8 ms. (steps per millisecond=109 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X (NOT (AND p0 p1)))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND p0 p1)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 11 factoid took 476 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 183 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 178 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
[2024-05-28 01:19:14] [INFO ] Invariant cache hit.
[2024-05-28 01:19:15] [INFO ] [Real]Absence check using 0 positive and 14 generalized place invariants in 25 ms returned sat
[2024-05-28 01:19:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-28 01:19:15] [INFO ] [Real]Absence check using state equation in 205 ms returned sat
[2024-05-28 01:19:16] [INFO ] Solution in real domain found non-integer solution.
[2024-05-28 01:19:17] [INFO ] [Nat]Absence check using 0 positive and 14 generalized place invariants in 19 ms returned sat
[2024-05-28 01:19:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-28 01:19:17] [INFO ] [Nat]Absence check using state equation in 150 ms returned sat
[2024-05-28 01:19:17] [INFO ] Computed and/alt/rep : 28/176/28 causal constraints (skipped 432 transitions) in 55 ms.
[2024-05-28 01:19:17] [INFO ] Added : 14 causal constraints over 5 iterations in 210 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Product exploration explored 100000 steps with 14707 reset in 1214 ms.
Product exploration explored 100000 steps with 14719 reset in 1197 ms.
Built C files in :
/tmp/ltsmin8788167942934465900
[2024-05-28 01:19:20] [INFO ] Computing symmetric may disable matrix : 464 transitions.
[2024-05-28 01:19:20] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 01:19:20] [INFO ] Computing symmetric may enable matrix : 464 transitions.
[2024-05-28 01:19:20] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 01:19:20] [INFO ] Computing Do-Not-Accords matrix : 464 transitions.
[2024-05-28 01:19:20] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 01:19:20] [INFO ] Built C files in 77ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8788167942934465900
Running compilation step : cd /tmp/ltsmin8788167942934465900;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1835 ms.
Running link step : cd /tmp/ltsmin8788167942934465900;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin8788167942934465900;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased66391203526686647.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 39 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 464/464 transitions.
Applied a total of 0 rules in 12 ms. Remains 86 /86 variables (removed 0) and now considering 464/464 (removed 0) transitions.
[2024-05-28 01:19:35] [INFO ] Invariant cache hit.
[2024-05-28 01:19:35] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-05-28 01:19:35] [INFO ] Invariant cache hit.
[2024-05-28 01:19:36] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 392 ms to find 0 implicit places.
[2024-05-28 01:19:36] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-28 01:19:36] [INFO ] Invariant cache hit.
[2024-05-28 01:19:36] [INFO ] Dead Transitions using invariants and state equation in 239 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 655 ms. Remains : 86/86 places, 464/464 transitions.
Built C files in :
/tmp/ltsmin13854210062459200509
[2024-05-28 01:19:36] [INFO ] Computing symmetric may disable matrix : 464 transitions.
[2024-05-28 01:19:36] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 01:19:36] [INFO ] Computing symmetric may enable matrix : 464 transitions.
[2024-05-28 01:19:36] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 01:19:36] [INFO ] Computing Do-Not-Accords matrix : 464 transitions.
[2024-05-28 01:19:36] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 01:19:36] [INFO ] Built C files in 75ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13854210062459200509
Running compilation step : cd /tmp/ltsmin13854210062459200509;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1890 ms.
Running link step : cd /tmp/ltsmin13854210062459200509;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin13854210062459200509;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7309080056715282551.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-28 01:19:51] [INFO ] Flatten gal took : 61 ms
[2024-05-28 01:19:51] [INFO ] Flatten gal took : 60 ms
[2024-05-28 01:19:51] [INFO ] Time to serialize gal into /tmp/LTL4185187145592364398.gal : 5 ms
[2024-05-28 01:19:51] [INFO ] Time to serialize properties into /tmp/LTL11814525491794223723.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4185187145592364398.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9425915560625553559.hoa' '-atoms' '/tmp/LTL11814525491794223723.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL11814525491794223723.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9425915560625553559.hoa
Detected timeout of ITS tools.
[2024-05-28 01:20:06] [INFO ] Flatten gal took : 25 ms
[2024-05-28 01:20:06] [INFO ] Flatten gal took : 25 ms
[2024-05-28 01:20:06] [INFO ] Time to serialize gal into /tmp/LTL15720378212494517368.gal : 6 ms
[2024-05-28 01:20:06] [INFO ] Time to serialize properties into /tmp/LTL12098978424728141367.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15720378212494517368.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12098978424728141367.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(F(((((((((G(F("(((((in4_6>=1)&&(in2_2>=1))&&(c8>=1))||(((in4_7>=1)&&(in2_3>=1))&&(c8>=1)))||((((in4_7>=1)&&(in2_2>=1))&&(c8>=1))|...5856
Formula 0 simplified : XG(!"(((((((((aux12_0>=1)&&(aux10_1>=1))&&(c16>=1))||(((aux15_5>=1)&&(aux13_7>=1))&&(c17>=1)))||((((aux15_3>=1)&&(aux13_3>=1))&&(c17...5832
Detected timeout of ITS tools.
[2024-05-28 01:20:21] [INFO ] Flatten gal took : 27 ms
[2024-05-28 01:20:21] [INFO ] Applying decomposition
[2024-05-28 01:20:21] [INFO ] Flatten gal took : 27 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10975305308746553706.txt' '-o' '/tmp/graph10975305308746553706.bin' '-w' '/tmp/graph10975305308746553706.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10975305308746553706.bin' '-l' '-1' '-v' '-w' '/tmp/graph10975305308746553706.weights' '-q' '0' '-e' '0.001'
[2024-05-28 01:20:21] [INFO ] Decomposing Gal with order
[2024-05-28 01:20:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 01:20:22] [INFO ] Removed a total of 433 redundant transitions.
[2024-05-28 01:20:22] [INFO ] Flatten gal took : 100 ms
[2024-05-28 01:20:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 216 labels/synchronizations in 14 ms.
[2024-05-28 01:20:22] [INFO ] Time to serialize gal into /tmp/LTL5152239700550778901.gal : 7 ms
[2024-05-28 01:20:22] [INFO ] Time to serialize properties into /tmp/LTL15916191933722416128.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5152239700550778901.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15916191933722416128.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(F(((((((((G(F("(((((i3.u6.in4_6>=1)&&(i3.u6.in2_2>=1))&&(i3.u6.c8>=1))||(((i3.u6.in4_7>=1)&&(i3.u6.in2_3>=1))&&(i3.u6.c8>=1)))||(...7464
Formula 0 simplified : XG(!"(((((((((u1.aux12_0>=1)&&(u1.aux10_1>=1))&&(u1.c16>=1))||(((i0.u0.aux15_5>=1)&&(i0.u2.aux13_7>=1))&&(u1.c17>=1)))||((((i0.u0.au...7440
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7511470593306902955
[2024-05-28 01:20:37] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7511470593306902955
Running compilation step : cd /tmp/ltsmin7511470593306902955;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1235 ms.
Running link step : cd /tmp/ltsmin7511470593306902955;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin7511470593306902955;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(([](<>((LTLAPp1==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PermAdmissibility-PT-05-LTLFireability-00 finished in 108259 ms.
[2024-05-28 01:20:52] [INFO ] Flatten gal took : 32 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6929007433977008441
[2024-05-28 01:20:52] [INFO ] Computing symmetric may disable matrix : 468 transitions.
[2024-05-28 01:20:52] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 01:20:52] [INFO ] Computing symmetric may enable matrix : 468 transitions.
[2024-05-28 01:20:52] [INFO ] Applying decomposition
[2024-05-28 01:20:52] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 01:20:52] [INFO ] Flatten gal took : 27 ms
[2024-05-28 01:20:52] [INFO ] Computing Do-Not-Accords matrix : 468 transitions.
[2024-05-28 01:20:52] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 01:20:52] [INFO ] Built C files in 91ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6929007433977008441
Running compilation step : cd /tmp/ltsmin6929007433977008441;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph14863925880547460060.txt' '-o' '/tmp/graph14863925880547460060.bin' '-w' '/tmp/graph14863925880547460060.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14863925880547460060.bin' '-l' '-1' '-v' '-w' '/tmp/graph14863925880547460060.weights' '-q' '0' '-e' '0.001'
[2024-05-28 01:20:52] [INFO ] Decomposing Gal with order
[2024-05-28 01:20:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 01:20:52] [INFO ] Removed a total of 304 redundant transitions.
[2024-05-28 01:20:52] [INFO ] Flatten gal took : 66 ms
[2024-05-28 01:20:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 182 labels/synchronizations in 9 ms.
[2024-05-28 01:20:52] [INFO ] Time to serialize gal into /tmp/LTLFireability5098626536037559583.gal : 6 ms
[2024-05-28 01:20:52] [INFO ] Time to serialize properties into /tmp/LTLFireability16822542409594069817.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5098626536037559583.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16822542409594069817.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(F(("((((((((((u1.aux12_6>=1)&&(u1.aux10_6>=1))&&(u1.c16>=1))||(((u1.aux12_7>=1)&&(u1.aux10_0>=1))&&(u1.c16>=1)))||((((u1.aux12_3>...7052
Formula 0 simplified : XG(!"((((((((((u1.aux12_6>=1)&&(u1.aux10_6>=1))&&(u1.c16>=1))||(((u1.aux12_7>=1)&&(u1.aux10_0>=1))&&(u1.c16>=1)))||((((u1.aux12_3>=1...7042
Compilation finished in 1836 ms.
Running link step : cd /tmp/ltsmin6929007433977008441;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin6929007433977008441;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(([](<>((LTLAPp1==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-28 01:42:09] [INFO ] Flatten gal took : 70 ms
[2024-05-28 01:42:09] [INFO ] Time to serialize gal into /tmp/LTLFireability9603484925741580165.gal : 5 ms
[2024-05-28 01:42:09] [INFO ] Time to serialize properties into /tmp/LTLFireability8917442950300775552.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability9603484925741580165.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability8917442950300775552.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((X(F(("((((((((((aux12_6>=1)&&(aux10_6>=1))&&(c16>=1))||(((aux12_7>=1)&&(aux10_0>=1))&&(c16>=1)))||((((aux12_3>=1)&&(aux10_7>=1))&&(...5828
Formula 0 simplified : XG(!"((((((((((aux12_6>=1)&&(aux10_6>=1))&&(c16>=1))||(((aux12_7>=1)&&(aux10_0>=1))&&(c16>=1)))||((((aux12_3>=1)&&(aux10_7>=1))&&(c1...5818
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: Loading model from ./gal.so
pins2lts-mc-linux64( 7/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.019: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.027: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.027: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.050: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.050: LTL layer: formula: X(<>(([](<>((LTLAPp1==true)))||(LTLAPp0==true))))
pins2lts-mc-linux64( 0/ 8), 0.050: "X(<>(([](<>((LTLAPp1==true)))||(LTLAPp0==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.051: Using Spin LTL semantics
pins2lts-mc-linux64( 2/ 8), 0.056: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.061: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.061: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.066: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.069: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.076: buchi has 3 states
pins2lts-mc-linux64( 7/ 8), 0.074: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.076: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.089: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.148: DFS-FIFO for weak LTL, using special progress label 471
pins2lts-mc-linux64( 0/ 8), 0.149: There are 472 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.149: State length is 91, there are 472 groups
pins2lts-mc-linux64( 0/ 8), 0.149: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.149: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.149: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.149: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.171: ~11 levels ~960 states ~1520 transitions
pins2lts-mc-linux64( 2/ 8), 0.191: ~11 levels ~1920 states ~2704 transitions
pins2lts-mc-linux64( 2/ 8), 0.242: ~11 levels ~3840 states ~5512 transitions
pins2lts-mc-linux64( 2/ 8), 0.323: ~11 levels ~7680 states ~11648 transitions
pins2lts-mc-linux64( 5/ 8), 0.489: ~10 levels ~15360 states ~25136 transitions
pins2lts-mc-linux64( 5/ 8), 0.896: ~16 levels ~30720 states ~47008 transitions
pins2lts-mc-linux64( 4/ 8), 1.593: ~16 levels ~61440 states ~86736 transitions
pins2lts-mc-linux64( 4/ 8), 2.712: ~16 levels ~122880 states ~172064 transitions
pins2lts-mc-linux64( 4/ 8), 4.551: ~16 levels ~245760 states ~344728 transitions
pins2lts-mc-linux64( 2/ 8), 7.669: ~15 levels ~491520 states ~616520 transitions
pins2lts-mc-linux64( 2/ 8), 12.442: ~15 levels ~983040 states ~1212104 transitions
pins2lts-mc-linux64( 2/ 8), 20.376: ~15 levels ~1966080 states ~2337816 transitions
pins2lts-mc-linux64( 3/ 8), 37.317: ~15 levels ~3932160 states ~5334496 transitions
pins2lts-mc-linux64( 3/ 8), 77.723: ~15 levels ~7864320 states ~10962640 transitions
pins2lts-mc-linux64( 2/ 8), 158.553: ~15 levels ~15728640 states ~19537168 transitions
pins2lts-mc-linux64( 2/ 8), 316.020: ~15 levels ~31457280 states ~41833152 transitions
pins2lts-mc-linux64( 1/ 8), 648.115: ~16 levels ~62914560 states ~89064800 transitions
pins2lts-mc-linux64( 1/ 8), 1313.036: ~16 levels ~125829120 states ~184000968 transitions
pins2lts-mc-linux64( 0/ 8), 1324.628: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1324.703:
pins2lts-mc-linux64( 0/ 8), 1324.703: mean standard work distribution: 1.8% (states) 1.2% (transitions)
pins2lts-mc-linux64( 0/ 8), 1324.703:
pins2lts-mc-linux64( 0/ 8), 1324.703: Explored 124228785 states 183046488 transitions, fanout: 1.473
pins2lts-mc-linux64( 0/ 8), 1324.703: Total exploration time 1324.520 sec (1324.450 sec minimum, 1324.489 sec on average)
pins2lts-mc-linux64( 0/ 8), 1324.703: States per second: 93792, Transitions per second: 138198
pins2lts-mc-linux64( 0/ 8), 1324.703:
pins2lts-mc-linux64( 0/ 8), 1324.703: Progress states detected: 1611
pins2lts-mc-linux64( 0/ 8), 1324.703: Redundant explorations: -0.0014
pins2lts-mc-linux64( 0/ 8), 1324.703:
pins2lts-mc-linux64( 0/ 8), 1324.703: Queue width: 8B, total height: 2336, memory: 0.02MB
pins2lts-mc-linux64( 0/ 8), 1324.703: Tree memory: 1203.8MB, 10.2 B/state, compr.: 2.8%
pins2lts-mc-linux64( 0/ 8), 1324.703: Tree fill ratio (roots/leafs): 92.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 1324.703: Stored 503 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1324.703: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1324.704: Est. total memory use: 1203.8MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6929007433977008441;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(([](<>((LTLAPp1==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin6929007433977008441;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(<>(([](<>((LTLAPp1==true)))||(LTLAPp0==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-28 02:03:28] [INFO ] Flatten gal took : 937 ms
[2024-05-28 02:03:33] [INFO ] Input system was already deterministic with 468 transitions.
[2024-05-28 02:03:33] [INFO ] Transformed 90 places.
[2024-05-28 02:03:33] [INFO ] Transformed 468 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-28 02:03:33] [INFO ] Time to serialize gal into /tmp/LTLFireability12023045032681452983.gal : 24 ms
[2024-05-28 02:03:33] [INFO ] Time to serialize properties into /tmp/LTLFireability16784592862057534498.ltl : 13 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability12023045032681452983.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16784592862057534498.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(F(("((((((((((aux12_6>=1)&&(aux10_6>=1))&&(c16>=1))||(((aux12_7>=1)&&(aux10_0>=1))&&(c16>=1)))||((((aux12_3>=1)&&(aux10_7>=1))&&(...5828
Formula 0 simplified : XG(!"((((((((((aux12_6>=1)&&(aux10_6>=1))&&(c16>=1))||(((aux12_7>=1)&&(aux10_0>=1))&&(c16>=1)))||((((aux12_3>=1)&&(aux10_7>=1))&&(c1...5818
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 188832 kB
After kill :
MemTotal: 16393216 kB
MemFree: 11867472 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PermAdmissibility-PT-05"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
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 r285-smll-171654422000108"
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 ;