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-171654422000102.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-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r285-smll-171654422000102
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.8M
-rw-r--r-- 1 mcc users 11K Apr 12 09:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Apr 12 09:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 52K Apr 12 09:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 268K Apr 12 09:09 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.7K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 18K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 72K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 12 09:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 154K Apr 12 09:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 113K Apr 12 09:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 575K Apr 12 09:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.4K 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-02-LTLCardinality-00
FORMULA_NAME PermAdmissibility-PT-02-LTLCardinality-01
FORMULA_NAME PermAdmissibility-PT-02-LTLCardinality-02
FORMULA_NAME PermAdmissibility-PT-02-LTLCardinality-03
FORMULA_NAME PermAdmissibility-PT-02-LTLCardinality-04
FORMULA_NAME PermAdmissibility-PT-02-LTLCardinality-05
FORMULA_NAME PermAdmissibility-PT-02-LTLCardinality-06
FORMULA_NAME PermAdmissibility-PT-02-LTLCardinality-07
FORMULA_NAME PermAdmissibility-PT-02-LTLCardinality-08
FORMULA_NAME PermAdmissibility-PT-02-LTLCardinality-09
FORMULA_NAME PermAdmissibility-PT-02-LTLCardinality-10
FORMULA_NAME PermAdmissibility-PT-02-LTLCardinality-11
FORMULA_NAME PermAdmissibility-PT-02-LTLCardinality-12
FORMULA_NAME PermAdmissibility-PT-02-LTLCardinality-13
FORMULA_NAME PermAdmissibility-PT-02-LTLCardinality-14
FORMULA_NAME PermAdmissibility-PT-02-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716851742771

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=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-PT-02
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-27 23:15:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-27 23:15:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 23:15:45] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2024-05-27 23:15:45] [INFO ] Transformed 168 places.
[2024-05-27 23:15:45] [INFO ] Transformed 592 transitions.
[2024-05-27 23:15:45] [INFO ] Parsed PT model containing 168 places and 592 transitions and 3456 arcs in 271 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA PermAdmissibility-PT-02-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-02-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-02-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-02-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-PT-02-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 78 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 592/592 transitions.
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 130 transition count 592
Applied a total of 38 rules in 34 ms. Remains 130 /168 variables (removed 38) and now considering 592/592 (removed 0) transitions.
// Phase 1: matrix 592 rows 130 cols
[2024-05-27 23:15:46] [INFO ] Computed 19 invariants in 42 ms
[2024-05-27 23:15:46] [INFO ] Implicit Places using invariants in 569 ms returned []
[2024-05-27 23:15:46] [INFO ] Invariant cache hit.
[2024-05-27 23:15:48] [INFO ] Implicit Places using invariants and state equation in 1466 ms returned []
Implicit Place search using SMT with State Equation took 2087 ms to find 0 implicit places.
[2024-05-27 23:15:48] [INFO ] Invariant cache hit.
[2024-05-27 23:15:48] [INFO ] Dead Transitions using invariants and state equation in 588 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 130/168 places, 592/592 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2713 ms. Remains : 130/168 places, 592/592 transitions.
Support contains 78 out of 130 places after structural reductions.
[2024-05-27 23:15:49] [INFO ] Flatten gal took : 138 ms
[2024-05-27 23:15:49] [INFO ] Flatten gal took : 84 ms
[2024-05-27 23:15:49] [INFO ] Input system was already deterministic with 592 transitions.
Support contains 77 out of 130 places (down from 78) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 211 resets, run finished after 432 ms. (steps per millisecond=23 ) properties (out of 23) seen :21
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 59 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-27 23:15:50] [INFO ] Invariant cache hit.
[2024-05-27 23:15:50] [INFO ] [Real]Absence check using 0 positive and 19 generalized place invariants in 10 ms returned sat
[2024-05-27 23:15:50] [INFO ] After 103ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:1
[2024-05-27 23:15:50] [INFO ] [Nat]Absence check using 0 positive and 19 generalized place invariants in 9 ms returned sat
[2024-05-27 23:15:50] [INFO ] After 294ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 11 simplifications.
Computed a total of 130 stabilizing places and 592 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 130 transition count 592
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA PermAdmissibility-PT-02-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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' '!(((p0||G(!p1)) U X(p2)))'
Support contains 20 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 592/592 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 104 transition count 592
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 39 place count 91 transition count 468
Iterating global reduction 1 with 13 rules applied. Total rules applied 52 place count 91 transition count 468
Applied a total of 52 rules in 24 ms. Remains 91 /130 variables (removed 39) and now considering 468/592 (removed 124) transitions.
// Phase 1: matrix 468 rows 91 cols
[2024-05-27 23:15:51] [INFO ] Computed 16 invariants in 8 ms
[2024-05-27 23:15:51] [INFO ] Implicit Places using invariants in 143 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 146 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 90/130 places, 468/592 transitions.
Applied a total of 0 rules in 8 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 178 ms. Remains : 90/130 places, 468/592 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 525 ms :[(NOT p2), (NOT p2), (AND p1 (NOT p2)), (NOT p2), true, p1]
Running random walk in product with property : PermAdmissibility-PT-02-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(OR p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(OR (AND p0 (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ 3 (ADD s0 s1 s2 s3 s4 s5 s6 s7)), p1:(OR (LEQ 3 (ADD s8 s9 s10 s11 s12 s13 s14 s16)) (LEQ 3 (ADD s82 s83))), p2:(OR (LEQ 3 (ADD s0 s1 s2 s3 s4 s5 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA PermAdmissibility-PT-02-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLCardinality-00 finished in 785 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(G(p0)))'
Support contains 1 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 592/592 transitions.
Graph (complete) has 1235 edges and 130 vertex of which 104 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.9 ms
Discarding 26 places :
Also discarding 0 output transitions
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 27 place count 78 transition count 344
Iterating global reduction 0 with 26 rules applied. Total rules applied 53 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 77 place count 54 transition count 108
Iterating global reduction 0 with 24 rules applied. Total rules applied 101 place count 54 transition count 108
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 104 place count 51 transition count 84
Iterating global reduction 0 with 3 rules applied. Total rules applied 107 place count 51 transition count 84
Applied a total of 107 rules in 66 ms. Remains 51 /130 variables (removed 79) and now considering 84/592 (removed 508) transitions.
// Phase 1: matrix 84 rows 51 cols
[2024-05-27 23:15:51] [INFO ] Computed 16 invariants in 2 ms
[2024-05-27 23:15:51] [INFO ] Implicit Places using invariants in 135 ms returned [0, 5, 18, 25]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 140 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/130 places, 84/592 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 47 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 46 transition count 83
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 46 transition count 82
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 45 transition count 82
Applied a total of 4 rules in 18 ms. Remains 45 /47 variables (removed 2) and now considering 82/84 (removed 2) transitions.
// Phase 1: matrix 82 rows 45 cols
[2024-05-27 23:15:51] [INFO ] Computed 12 invariants in 3 ms
[2024-05-27 23:15:52] [INFO ] Implicit Places using invariants in 135 ms returned []
[2024-05-27 23:15:52] [INFO ] Invariant cache hit.
[2024-05-27 23:15:52] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 45/130 places, 82/592 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 533 ms. Remains : 45/130 places, 82/592 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-02-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT 1 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3448 reset in 430 ms.
Product exploration explored 100000 steps with 3448 reset in 300 ms.
Computed a total of 45 stabilizing places and 82 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 45 transition count 82
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 135 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(NOT p0)]
Finished random walk after 34 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=17 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 127 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Support contains 1 out of 45 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 45/45 places, 82/82 transitions.
Applied a total of 0 rules in 6 ms. Remains 45 /45 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2024-05-27 23:15:53] [INFO ] Invariant cache hit.
[2024-05-27 23:15:53] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-27 23:15:53] [INFO ] Invariant cache hit.
[2024-05-27 23:15:53] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
[2024-05-27 23:15:53] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-27 23:15:53] [INFO ] Invariant cache hit.
[2024-05-27 23:15:54] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 388 ms. Remains : 45/45 places, 82/82 transitions.
Computed a total of 45 stabilizing places and 82 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 45 transition count 82
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 114 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Finished random walk after 34 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=17 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 161 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Product exploration explored 100000 steps with 3448 reset in 281 ms.
Product exploration explored 100000 steps with 3448 reset in 354 ms.
Built C files in :
/tmp/ltsmin4559160089101521058
[2024-05-27 23:15:55] [INFO ] Computing symmetric may disable matrix : 82 transitions.
[2024-05-27 23:15:55] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 23:15:55] [INFO ] Computing symmetric may enable matrix : 82 transitions.
[2024-05-27 23:15:55] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 23:15:55] [INFO ] Computing Do-Not-Accords matrix : 82 transitions.
[2024-05-27 23:15:55] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 23:15:55] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4559160089101521058
Running compilation step : cd /tmp/ltsmin4559160089101521058;'/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 483 ms.
Running link step : cd /tmp/ltsmin4559160089101521058;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 65 ms.
Running LTSmin : cd /tmp/ltsmin4559160089101521058;'/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/stateBased10649094824879251028.hoa' '--buchi-type=spotba'
LTSmin run took 606 ms.
FORMULA PermAdmissibility-PT-02-LTLCardinality-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-PT-02-LTLCardinality-02 finished in 4724 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(((G(p0)||X(F(p1))) U X(p2))))'
Support contains 25 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 592/592 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 120 transition count 592
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 23 place count 107 transition count 468
Iterating global reduction 1 with 13 rules applied. Total rules applied 36 place count 107 transition count 468
Applied a total of 36 rules in 18 ms. Remains 107 /130 variables (removed 23) and now considering 468/592 (removed 124) transitions.
// Phase 1: matrix 468 rows 107 cols
[2024-05-27 23:15:56] [INFO ] Computed 18 invariants in 9 ms
[2024-05-27 23:15:56] [INFO ] Implicit Places using invariants in 220 ms returned [33]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 223 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 106/130 places, 468/592 transitions.
Applied a total of 0 rules in 5 ms. Remains 106 /106 variables (removed 0) and now considering 468/468 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 247 ms. Remains : 106/130 places, 468/592 transitions.
Stuttering acceptance computed with spot in 369 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-PT-02-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ (ADD s26 s27 s28 s29 s30 s31 s32 s33) s90), p2:(LEQ (ADD s73 s74 s75 s76) (ADD s17 s18 s19 s20 s21 s22 s23 s24)), p1:(GT 3 (ADD s38 s43 s45 s46))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 26251 reset in 524 ms.
Product exploration explored 100000 steps with 26242 reset in 418 ms.
Computed a total of 106 stabilizing places and 468 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 106 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 p0 p2 p1), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 19 factoid took 3006 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 313 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 212 resets, run finished after 449 ms. (steps per millisecond=22 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 468 rows 106 cols
[2024-05-27 23:16:02] [INFO ] Computed 17 invariants in 4 ms
[2024-05-27 23:16:02] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-27 23:16:02] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 9 ms returned sat
[2024-05-27 23:16:02] [INFO ] After 54ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p1))), (F (AND p0 (NOT p2) (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) (NOT p2) p1)), (F (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (F (NOT p2)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 21 factoid took 9733 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 184 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Support contains 25 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 468/468 transitions.
Applied a total of 0 rules in 43 ms. Remains 106 /106 variables (removed 0) and now considering 468/468 (removed 0) transitions.
[2024-05-27 23:16:12] [INFO ] Invariant cache hit.
[2024-05-27 23:16:12] [INFO ] Implicit Places using invariants in 185 ms returned []
[2024-05-27 23:16:12] [INFO ] Invariant cache hit.
[2024-05-27 23:16:13] [INFO ] Implicit Places using invariants and state equation in 631 ms returned []
Implicit Place search using SMT with State Equation took 820 ms to find 0 implicit places.
[2024-05-27 23:16:13] [INFO ] Redundant transitions in 38 ms returned []
[2024-05-27 23:16:13] [INFO ] Invariant cache hit.
[2024-05-27 23:16:13] [INFO ] Dead Transitions using invariants and state equation in 399 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1308 ms. Remains : 106/106 places, 468/468 transitions.
Computed a total of 106 stabilizing places and 468 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 106 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 p0 p2 p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 1395 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 173 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Incomplete random walk after 10001 steps, including 213 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-27 23:16:15] [INFO ] Invariant cache hit.
[2024-05-27 23:16:15] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 23:16:15] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 10 ms returned sat
[2024-05-27 23:16:15] [INFO ] After 62ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (NOT p1)), (F (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (F (NOT p2))]
Knowledge based reduction with 15 factoid took 3610 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 211 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 165 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 178 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Product exploration explored 100000 steps with 5534 reset in 776 ms.
Product exploration explored 100000 steps with 5528 reset in 475 ms.
Built C files in :
/tmp/ltsmin10934089409441847
[2024-05-27 23:16:21] [INFO ] Computing symmetric may disable matrix : 468 transitions.
[2024-05-27 23:16:21] [INFO ] Computation of Complete disable matrix. took 15 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 23:16:21] [INFO ] Computing symmetric may enable matrix : 468 transitions.
[2024-05-27 23:16:21] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 23:16:21] [INFO ] Computing Do-Not-Accords matrix : 468 transitions.
[2024-05-27 23:16:21] [INFO ] Computation of Completed DNA matrix. took 32 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 23:16:21] [INFO ] Built C files in 168ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10934089409441847
Running compilation step : cd /tmp/ltsmin10934089409441847;'/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 2128 ms.
Running link step : cd /tmp/ltsmin10934089409441847;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin10934089409441847;'/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/stateBased11662701793425310736.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 25 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 468/468 transitions.
Applied a total of 0 rules in 19 ms. Remains 106 /106 variables (removed 0) and now considering 468/468 (removed 0) transitions.
[2024-05-27 23:16:36] [INFO ] Invariant cache hit.
[2024-05-27 23:16:36] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-27 23:16:36] [INFO ] Invariant cache hit.
[2024-05-27 23:16:37] [INFO ] Implicit Places using invariants and state equation in 671 ms returned []
Implicit Place search using SMT with State Equation took 844 ms to find 0 implicit places.
[2024-05-27 23:16:37] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-27 23:16:37] [INFO ] Invariant cache hit.
[2024-05-27 23:16:37] [INFO ] Dead Transitions using invariants and state equation in 316 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1200 ms. Remains : 106/106 places, 468/468 transitions.
Built C files in :
/tmp/ltsmin12753354576648609116
[2024-05-27 23:16:37] [INFO ] Computing symmetric may disable matrix : 468 transitions.
[2024-05-27 23:16:37] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 23:16:37] [INFO ] Computing symmetric may enable matrix : 468 transitions.
[2024-05-27 23:16:37] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 23:16:37] [INFO ] Computing Do-Not-Accords matrix : 468 transitions.
[2024-05-27 23:16:37] [INFO ] Computation of Completed DNA matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 23:16:37] [INFO ] Built C files in 72ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12753354576648609116
Running compilation step : cd /tmp/ltsmin12753354576648609116;'/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 1841 ms.
Running link step : cd /tmp/ltsmin12753354576648609116;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin12753354576648609116;'/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/stateBased10720957159506006488.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 23:16:52] [INFO ] Flatten gal took : 46 ms
[2024-05-27 23:16:52] [INFO ] Flatten gal took : 43 ms
[2024-05-27 23:16:52] [INFO ] Time to serialize gal into /tmp/LTL4578752073609191423.gal : 11 ms
[2024-05-27 23:16:52] [INFO ] Time to serialize properties into /tmp/LTL13858815675904448119.prop : 0 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/LTL4578752073609191423.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8202551123390402782.hoa' '-atoms' '/tmp/LTL13858815675904448119.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/LTL13858815675904448119.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8202551123390402782.hoa
Detected timeout of ITS tools.
[2024-05-27 23:17:07] [INFO ] Flatten gal took : 35 ms
[2024-05-27 23:17:07] [INFO ] Flatten gal took : 33 ms
[2024-05-27 23:17:08] [INFO ] Time to serialize gal into /tmp/LTL17664526770618514573.gal : 5 ms
[2024-05-27 23:17:08] [INFO ] Time to serialize properties into /tmp/LTL26166039092349626.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/LTL17664526770618514573.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL26166039092349626.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...274
Read 1 LTL properties
Checking formula 0 : !((G(((G("((((out6_1+out6_2)+(out6_0+out6_6))+((out6_5+out6_4)+(out6_3+out6_7)))<=c9)"))||(X(F("(((aux6_0+aux6_5)+(aux6_1+aux6_4))<3)"...276
Formula 0 simplified : F((F!"((((out6_1+out6_2)+(out6_0+out6_6))+((out6_5+out6_4)+(out6_3+out6_7)))<=c9)" & XG!"(((aux6_0+aux6_5)+(aux6_1+aux6_4))<3)") R X...265
Detected timeout of ITS tools.
[2024-05-27 23:17:23] [INFO ] Flatten gal took : 27 ms
[2024-05-27 23:17:23] [INFO ] Applying decomposition
[2024-05-27 23:17:23] [INFO ] Flatten gal took : 26 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/graph4390125131109342210.txt' '-o' '/tmp/graph4390125131109342210.bin' '-w' '/tmp/graph4390125131109342210.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4390125131109342210.bin' '-l' '-1' '-v' '-w' '/tmp/graph4390125131109342210.weights' '-q' '0' '-e' '0.001'
[2024-05-27 23:17:23] [INFO ] Decomposing Gal with order
[2024-05-27 23:17:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 23:17:23] [INFO ] Removed a total of 671 redundant transitions.
[2024-05-27 23:17:23] [INFO ] Flatten gal took : 146 ms
[2024-05-27 23:17:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 122 labels/synchronizations in 16 ms.
[2024-05-27 23:17:23] [INFO ] Time to serialize gal into /tmp/LTL13191628798000693353.gal : 11 ms
[2024-05-27 23:17:23] [INFO ] Time to serialize properties into /tmp/LTL14263193817912636861.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/LTL13191628798000693353.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14263193817912636861.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 : !((G(((G("((((gu1.out6_1+gu1.out6_2)+(gu1.out6_0+gu1.out6_6))+((gu1.out6_5+gu1.out6_4)+(gu1.out6_3+gu1.out6_7)))<=gu1.c9)"))||(X(F("((...392
Formula 0 simplified : F((F!"((((gu1.out6_1+gu1.out6_2)+(gu1.out6_0+gu1.out6_6))+((gu1.out6_5+gu1.out6_4)+(gu1.out6_3+gu1.out6_7)))<=gu1.c9)" & XG!"(((gi3....381
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11192526420403879171
[2024-05-27 23:17:38] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11192526420403879171
Running compilation step : cd /tmp/ltsmin11192526420403879171;'/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 1289 ms.
Running link step : cd /tmp/ltsmin11192526420403879171;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin11192526420403879171;'/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' '[]((([]((LTLAPp0==true))||X(<>((LTLAPp1==true)))) U X((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PermAdmissibility-PT-02-LTLCardinality-03 finished in 117306 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(G((p0||F(p1)))))'
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 592/592 transitions.
Graph (complete) has 1235 edges and 130 vertex of which 6 are kept as prefixes of interest. Removing 124 places using SCC suffix rule.3 ms
Discarding 124 places :
Also discarding 584 output transitions
Drop transitions removed 584 transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 5 transition count 4
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 5 transition count 4
Applied a total of 3 rules in 10 ms. Remains 5 /130 variables (removed 125) and now considering 4/592 (removed 588) transitions.
// Phase 1: matrix 4 rows 5 cols
[2024-05-27 23:17:53] [INFO ] Computed 2 invariants in 0 ms
[2024-05-27 23:17:53] [INFO ] Implicit Places using invariants in 29 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 31 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/130 places, 4/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 4/4 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 42 ms. Remains : 4/130 places, 4/592 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-PT-02-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 1 (ADD s2 s3)), p1:(LEQ 3 (ADD s2 s3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-02-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLCardinality-04 finished in 147 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)||G((p1||F(p2))))))'
Support contains 17 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 592/592 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 104 transition count 592
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 45 place count 85 transition count 372
Iterating global reduction 1 with 19 rules applied. Total rules applied 64 place count 85 transition count 372
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 74 place count 75 transition count 262
Iterating global reduction 1 with 10 rules applied. Total rules applied 84 place count 75 transition count 262
Applied a total of 84 rules in 8 ms. Remains 75 /130 variables (removed 55) and now considering 262/592 (removed 330) transitions.
// Phase 1: matrix 262 rows 75 cols
[2024-05-27 23:17:53] [INFO ] Computed 16 invariants in 2 ms
[2024-05-27 23:17:54] [INFO ] Implicit Places using invariants in 105 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 106 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 74/130 places, 262/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 74 /74 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 117 ms. Remains : 74/130 places, 262/592 transitions.
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) p1)]
Running random walk in product with property : PermAdmissibility-PT-02-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ 2 (ADD s37 s38 s50 s51)), p1:(GT 2 (ADD s16 s21 s23 s24)), p2:(GT s65 (ADD s4 s5 s6 s7 s8 s9 s10 s12))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 6648 steps with 492 reset in 26 ms.
FORMULA PermAdmissibility-PT-02-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLCardinality-05 finished in 374 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(X((p0||X(p1)))))'
Support contains 17 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 592/592 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 112 transition count 592
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 32 place count 98 transition count 368
Iterating global reduction 1 with 14 rules applied. Total rules applied 46 place count 98 transition count 368
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 60 place count 84 transition count 242
Iterating global reduction 1 with 14 rules applied. Total rules applied 74 place count 84 transition count 242
Applied a total of 74 rules in 7 ms. Remains 84 /130 variables (removed 46) and now considering 242/592 (removed 350) transitions.
// Phase 1: matrix 242 rows 84 cols
[2024-05-27 23:17:54] [INFO ] Computed 17 invariants in 5 ms
[2024-05-27 23:17:54] [INFO ] Implicit Places using invariants in 129 ms returned [0, 11, 39, 50]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 131 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/130 places, 242/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 242/242 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 140 ms. Remains : 80/130 places, 242/592 transitions.
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true]
Running random walk in product with property : PermAdmissibility-PT-02-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p0:(LEQ (ADD s0 s1 s2 s3 s4 s5 s6 s8) (ADD s19 s20 s21 s22 s24 s25 s26 s27)), p1:(LEQ 1 s74)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 182 ms.
Product exploration explored 100000 steps with 33333 reset in 219 ms.
Computed a total of 80 stabilizing places and 242 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 80 transition count 242
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 p0 (NOT p1)), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 14 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-02-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-02-LTLCardinality-06 finished in 867 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(X(G(p0))))'
Support contains 1 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 592/592 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 104 transition count 592
Discarding 26 places :
Symmetric choice reduction at 1 with 26 rule applications. Total rules 52 place count 78 transition count 344
Iterating global reduction 1 with 26 rules applied. Total rules applied 78 place count 78 transition count 344
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 102 place count 54 transition count 108
Iterating global reduction 1 with 24 rules applied. Total rules applied 126 place count 54 transition count 108
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 129 place count 51 transition count 84
Iterating global reduction 1 with 3 rules applied. Total rules applied 132 place count 51 transition count 84
Applied a total of 132 rules in 7 ms. Remains 51 /130 variables (removed 79) and now considering 84/592 (removed 508) transitions.
// Phase 1: matrix 84 rows 51 cols
[2024-05-27 23:17:55] [INFO ] Computed 16 invariants in 1 ms
[2024-05-27 23:17:55] [INFO ] Implicit Places using invariants in 115 ms returned [0, 5, 18, 25]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 117 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 47/130 places, 84/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 47 /47 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 126 ms. Remains : 47/130 places, 84/592 transitions.
Stuttering acceptance computed with spot in 164 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-02-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GT 2 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 127 steps with 3 reset in 0 ms.
FORMULA PermAdmissibility-PT-02-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLCardinality-09 finished in 307 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(G(p0)))'
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 592/592 transitions.
Graph (complete) has 1235 edges and 130 vertex of which 87 are kept as prefixes of interest. Removing 43 places using SCC suffix rule.3 ms
Discarding 43 places :
Also discarding 128 output transitions
Drop transitions removed 128 transitions
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 13 place count 75 transition count 342
Iterating global reduction 0 with 12 rules applied. Total rules applied 25 place count 75 transition count 342
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 49 place count 51 transition count 106
Iterating global reduction 0 with 24 rules applied. Total rules applied 73 place count 51 transition count 106
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 75 place count 49 transition count 90
Iterating global reduction 0 with 2 rules applied. Total rules applied 77 place count 49 transition count 90
Applied a total of 77 rules in 21 ms. Remains 49 /130 variables (removed 81) and now considering 90/592 (removed 502) transitions.
// Phase 1: matrix 90 rows 49 cols
[2024-05-27 23:17:55] [INFO ] Computed 14 invariants in 3 ms
[2024-05-27 23:17:55] [INFO ] Implicit Places using invariants in 116 ms returned [0, 15, 23]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 118 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/130 places, 90/592 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 46 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 45 transition count 89
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 45 transition count 88
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 44 transition count 88
Applied a total of 4 rules in 14 ms. Remains 44 /46 variables (removed 2) and now considering 88/90 (removed 2) transitions.
// Phase 1: matrix 88 rows 44 cols
[2024-05-27 23:17:55] [INFO ] Computed 11 invariants in 1 ms
[2024-05-27 23:17:55] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-27 23:17:55] [INFO ] Invariant cache hit.
[2024-05-27 23:17:55] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 44/130 places, 88/592 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 403 ms. Remains : 44/130 places, 88/592 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-02-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s35 s4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4000 reset in 271 ms.
Product exploration explored 100000 steps with 4000 reset in 342 ms.
Computed a total of 44 stabilizing places and 88 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 44 transition count 88
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 135 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Finished random walk after 25 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=25 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 168 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Support contains 2 out of 44 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 44/44 places, 88/88 transitions.
Applied a total of 0 rules in 2 ms. Remains 44 /44 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2024-05-27 23:17:57] [INFO ] Invariant cache hit.
[2024-05-27 23:17:57] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-05-27 23:17:57] [INFO ] Invariant cache hit.
[2024-05-27 23:17:57] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2024-05-27 23:17:57] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-27 23:17:57] [INFO ] Invariant cache hit.
[2024-05-27 23:17:57] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 365 ms. Remains : 44/44 places, 88/88 transitions.
Computed a total of 44 stabilizing places and 88 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 44 transition count 88
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 91 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 25 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=25 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 114 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 55 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4000 reset in 354 ms.
Product exploration explored 100000 steps with 4000 reset in 402 ms.
Built C files in :
/tmp/ltsmin5607699098733764923
[2024-05-27 23:17:58] [INFO ] Computing symmetric may disable matrix : 88 transitions.
[2024-05-27 23:17:58] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 23:17:58] [INFO ] Computing symmetric may enable matrix : 88 transitions.
[2024-05-27 23:17:58] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 23:17:58] [INFO ] Computing Do-Not-Accords matrix : 88 transitions.
[2024-05-27 23:17:58] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 23:17:58] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5607699098733764923
Running compilation step : cd /tmp/ltsmin5607699098733764923;'/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 305 ms.
Running link step : cd /tmp/ltsmin5607699098733764923;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin5607699098733764923;'/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/stateBased8708321850676178228.hoa' '--buchi-type=spotba'
LTSmin run took 406 ms.
FORMULA PermAdmissibility-PT-02-LTLCardinality-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-PT-02-LTLCardinality-12 finished in 4065 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)))'
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 592/592 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 105 transition count 592
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 49 place count 81 transition count 348
Iterating global reduction 1 with 24 rules applied. Total rules applied 73 place count 81 transition count 348
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 93 place count 61 transition count 144
Iterating global reduction 1 with 20 rules applied. Total rules applied 113 place count 61 transition count 144
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 114 place count 60 transition count 136
Iterating global reduction 1 with 1 rules applied. Total rules applied 115 place count 60 transition count 136
Applied a total of 115 rules in 10 ms. Remains 60 /130 variables (removed 70) and now considering 136/592 (removed 456) transitions.
// Phase 1: matrix 136 rows 60 cols
[2024-05-27 23:17:59] [INFO ] Computed 16 invariants in 1 ms
[2024-05-27 23:17:59] [INFO ] Implicit Places using invariants in 101 ms returned [0, 6, 22, 30]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 104 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 56/130 places, 136/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 56 /56 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 116 ms. Remains : 56/130 places, 136/592 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-PT-02-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s10 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 197 ms.
Product exploration explored 100000 steps with 50000 reset in 213 ms.
Computed a total of 56 stabilizing places and 136 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 56 transition count 136
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 20 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-PT-02-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-PT-02-LTLCardinality-13 finished in 693 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((X(F(p0))&&F(p1)&&(p2||G(p1)))))'
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 130/130 places, 592/592 transitions.
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 106 transition count 592
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 48 place count 82 transition count 348
Iterating global reduction 1 with 24 rules applied. Total rules applied 72 place count 82 transition count 348
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 91 place count 63 transition count 154
Iterating global reduction 1 with 19 rules applied. Total rules applied 110 place count 63 transition count 154
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 111 place count 62 transition count 146
Iterating global reduction 1 with 1 rules applied. Total rules applied 112 place count 62 transition count 146
Applied a total of 112 rules in 12 ms. Remains 62 /130 variables (removed 68) and now considering 146/592 (removed 446) transitions.
// Phase 1: matrix 146 rows 62 cols
[2024-05-27 23:18:00] [INFO ] Computed 16 invariants in 1 ms
[2024-05-27 23:18:00] [INFO ] Implicit Places using invariants in 134 ms returned [0, 7, 23, 33]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 135 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 58/130 places, 146/592 transitions.
Applied a total of 0 rules in 1 ms. Remains 58 /58 variables (removed 0) and now considering 146/146 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 148 ms. Remains : 58/130 places, 146/592 transitions.
Stuttering acceptance computed with spot in 250 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-PT-02-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=0 dest: 0}, { cond=(OR p1 p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={} source=3 dest: 3}, { cond=(AND p1 p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(GT 1 s2), p2:(GT s24 s5), p0:(LEQ 1 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 32 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-PT-02-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-PT-02-LTLCardinality-15 finished in 419 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(((G(p0)||X(F(p1))) U X(p2))))'
Found a Lengthening insensitive property : PermAdmissibility-PT-02-LTLCardinality-03
Stuttering acceptance computed with spot in 282 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 25 out of 130 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 130/130 places, 592/592 transitions.
Graph (complete) has 1235 edges and 130 vertex of which 120 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 0 output transitions
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 14 place count 107 transition count 468
Iterating global reduction 0 with 13 rules applied. Total rules applied 27 place count 107 transition count 468
Applied a total of 27 rules in 17 ms. Remains 107 /130 variables (removed 23) and now considering 468/592 (removed 124) transitions.
// Phase 1: matrix 468 rows 107 cols
[2024-05-27 23:18:01] [INFO ] Computed 18 invariants in 10 ms
[2024-05-27 23:18:01] [INFO ] Implicit Places using invariants in 208 ms returned [33]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 211 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 106/130 places, 468/592 transitions.
Applied a total of 0 rules in 10 ms. Remains 106 /106 variables (removed 0) and now considering 468/468 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 238 ms. Remains : 106/130 places, 468/592 transitions.
Running random walk in product with property : PermAdmissibility-PT-02-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 1}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(LEQ (ADD s26 s27 s28 s29 s30 s31 s32 s33) s90), p2:(LEQ (ADD s73 s74 s75 s76) (ADD s17 s18 s19 s20 s21 s22 s23 s24)), p1:(GT 3 (ADD s38 s43 s45 s46))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 26349 reset in 317 ms.
Product exploration explored 100000 steps with 26358 reset in 336 ms.
Computed a total of 106 stabilizing places and 468 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 106 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 p0 p2 p1), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 19 factoid took 2548 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 219 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 212 resets, run finished after 291 ms. (steps per millisecond=34 ) properties (out of 9) seen :7
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 468 rows 106 cols
[2024-05-27 23:18:05] [INFO ] Computed 17 invariants in 3 ms
[2024-05-27 23:18:05] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-27 23:18:05] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 6 ms returned sat
[2024-05-27 23:18:05] [INFO ] After 45ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p1))), (F (AND p0 (NOT p2) (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) (NOT p2) p1)), (F (OR (AND (NOT p0) p2) (AND (NOT p0) p1))), (F (NOT p2)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 21 factoid took 10535 ms. Reduced automaton from 5 states, 13 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 204 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 187 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Support contains 25 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 468/468 transitions.
Applied a total of 0 rules in 14 ms. Remains 106 /106 variables (removed 0) and now considering 468/468 (removed 0) transitions.
[2024-05-27 23:18:16] [INFO ] Invariant cache hit.
[2024-05-27 23:18:16] [INFO ] Implicit Places using invariants in 224 ms returned []
[2024-05-27 23:18:16] [INFO ] Invariant cache hit.
[2024-05-27 23:18:17] [INFO ] Implicit Places using invariants and state equation in 596 ms returned []
Implicit Place search using SMT with State Equation took 829 ms to find 0 implicit places.
[2024-05-27 23:18:17] [INFO ] Redundant transitions in 5 ms returned []
[2024-05-27 23:18:17] [INFO ] Invariant cache hit.
[2024-05-27 23:18:17] [INFO ] Dead Transitions using invariants and state equation in 505 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1360 ms. Remains : 106/106 places, 468/468 transitions.
Computed a total of 106 stabilizing places and 468 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 106 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 p0 p2 p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 1436 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 313 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Incomplete random walk after 10001 steps, including 211 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-27 23:18:19] [INFO ] Invariant cache hit.
[2024-05-27 23:18:19] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 23:18:19] [INFO ] [Nat]Absence check using 0 positive and 17 generalized place invariants in 7 ms returned sat
[2024-05-27 23:18:19] [INFO ] After 39ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p2) (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p1) (NOT p2))), (F (NOT p1)), (F (OR (AND (NOT p0) p1) (AND (NOT p0) p2))), (F (NOT p2))]
Knowledge based reduction with 15 factoid took 3765 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 4 states, 9 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 194 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 203 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Stuttering acceptance computed with spot in 196 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Product exploration explored 100000 steps with 5537 reset in 447 ms.
Product exploration explored 100000 steps with 5536 reset in 473 ms.
Built C files in :
/tmp/ltsmin12082130096467098536
[2024-05-27 23:18:25] [INFO ] Computing symmetric may disable matrix : 468 transitions.
[2024-05-27 23:18:25] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 23:18:25] [INFO ] Computing symmetric may enable matrix : 468 transitions.
[2024-05-27 23:18:25] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 23:18:25] [INFO ] Computing Do-Not-Accords matrix : 468 transitions.
[2024-05-27 23:18:25] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 23:18:25] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12082130096467098536
Running compilation step : cd /tmp/ltsmin12082130096467098536;'/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 1857 ms.
Running link step : cd /tmp/ltsmin12082130096467098536;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin12082130096467098536;'/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/stateBased1242751369303418293.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 25 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 468/468 transitions.
Applied a total of 0 rules in 12 ms. Remains 106 /106 variables (removed 0) and now considering 468/468 (removed 0) transitions.
[2024-05-27 23:18:40] [INFO ] Invariant cache hit.
[2024-05-27 23:18:40] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-27 23:18:40] [INFO ] Invariant cache hit.
[2024-05-27 23:18:41] [INFO ] Implicit Places using invariants and state equation in 759 ms returned []
Implicit Place search using SMT with State Equation took 925 ms to find 0 implicit places.
[2024-05-27 23:18:41] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-27 23:18:41] [INFO ] Invariant cache hit.
[2024-05-27 23:18:41] [INFO ] Dead Transitions using invariants and state equation in 453 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1403 ms. Remains : 106/106 places, 468/468 transitions.
Built C files in :
/tmp/ltsmin3642070501311454995
[2024-05-27 23:18:41] [INFO ] Computing symmetric may disable matrix : 468 transitions.
[2024-05-27 23:18:41] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 23:18:41] [INFO ] Computing symmetric may enable matrix : 468 transitions.
[2024-05-27 23:18:41] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 23:18:41] [INFO ] Computing Do-Not-Accords matrix : 468 transitions.
[2024-05-27 23:18:41] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 23:18:41] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3642070501311454995
Running compilation step : cd /tmp/ltsmin3642070501311454995;'/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 2138 ms.
Running link step : cd /tmp/ltsmin3642070501311454995;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin3642070501311454995;'/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/stateBased4761880125342659903.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 23:18:56] [INFO ] Flatten gal took : 35 ms
[2024-05-27 23:18:56] [INFO ] Flatten gal took : 31 ms
[2024-05-27 23:18:56] [INFO ] Time to serialize gal into /tmp/LTL12897051647690437631.gal : 6 ms
[2024-05-27 23:18:56] [INFO ] Time to serialize properties into /tmp/LTL16738475439279356386.prop : 0 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/LTL12897051647690437631.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2577230726481943244.hoa' '-atoms' '/tmp/LTL16738475439279356386.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...319
Loading property file /tmp/LTL16738475439279356386.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2577230726481943244.hoa
Detected timeout of ITS tools.
[2024-05-27 23:19:12] [INFO ] Flatten gal took : 26 ms
[2024-05-27 23:19:12] [INFO ] Flatten gal took : 26 ms
[2024-05-27 23:19:12] [INFO ] Time to serialize gal into /tmp/LTL2778046593931661434.gal : 5 ms
[2024-05-27 23:19:12] [INFO ] Time to serialize properties into /tmp/LTL13225268640254718087.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/LTL2778046593931661434.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13225268640254718087.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 : !((G(((G("((((out6_1+out6_2)+(out6_0+out6_6))+((out6_5+out6_4)+(out6_3+out6_7)))<=c9)"))||(X(F("(((aux6_0+aux6_5)+(aux6_1+aux6_4))<3)"...276
Formula 0 simplified : F((F!"((((out6_1+out6_2)+(out6_0+out6_6))+((out6_5+out6_4)+(out6_3+out6_7)))<=c9)" & XG!"(((aux6_0+aux6_5)+(aux6_1+aux6_4))<3)") R X...265
Detected timeout of ITS tools.
[2024-05-27 23:19:27] [INFO ] Flatten gal took : 28 ms
[2024-05-27 23:19:27] [INFO ] Applying decomposition
[2024-05-27 23:19:27] [INFO ] Flatten gal took : 28 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/graph4268060910913918359.txt' '-o' '/tmp/graph4268060910913918359.bin' '-w' '/tmp/graph4268060910913918359.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4268060910913918359.bin' '-l' '-1' '-v' '-w' '/tmp/graph4268060910913918359.weights' '-q' '0' '-e' '0.001'
[2024-05-27 23:19:27] [INFO ] Decomposing Gal with order
[2024-05-27 23:19:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 23:19:27] [INFO ] Removed a total of 662 redundant transitions.
[2024-05-27 23:19:27] [INFO ] Flatten gal took : 82 ms
[2024-05-27 23:19:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 142 labels/synchronizations in 11 ms.
[2024-05-27 23:19:27] [INFO ] Time to serialize gal into /tmp/LTL5480154286441310245.gal : 4 ms
[2024-05-27 23:19:27] [INFO ] Time to serialize properties into /tmp/LTL6283663686501848343.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/LTL5480154286441310245.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6283663686501848343.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...275
Read 1 LTL properties
Checking formula 0 : !((G(((G("((((gu1.out6_1+gu1.out6_2)+(gu1.out6_0+gu1.out6_6))+((gu1.out6_5+gu1.out6_4)+(gu1.out6_3+gu1.out6_7)))<=gu1.c9)"))||(X(F("((...376
Formula 0 simplified : F((F!"((((gu1.out6_1+gu1.out6_2)+(gu1.out6_0+gu1.out6_6))+((gu1.out6_5+gu1.out6_4)+(gu1.out6_3+gu1.out6_7)))<=gu1.c9)" & XG!"(((gu2....365
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1883927150887453754
[2024-05-27 23:19:42] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1883927150887453754
Running compilation step : cd /tmp/ltsmin1883927150887453754;'/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 1419 ms.
Running link step : cd /tmp/ltsmin1883927150887453754;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin1883927150887453754;'/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' '[]((([]((LTLAPp0==true))||X(<>((LTLAPp1==true)))) U X((LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property PermAdmissibility-PT-02-LTLCardinality-03 finished in 116993 ms.
[2024-05-27 23:19:57] [INFO ] Flatten gal took : 43 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8178000447499377928
[2024-05-27 23:19:57] [INFO ] Computing symmetric may disable matrix : 592 transitions.
[2024-05-27 23:19:57] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 23:19:57] [INFO ] Applying decomposition
[2024-05-27 23:19:57] [INFO ] Computing symmetric may enable matrix : 592 transitions.
[2024-05-27 23:19:57] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 23:19:57] [INFO ] Flatten gal took : 33 ms
[2024-05-27 23:19:57] [INFO ] Computing Do-Not-Accords matrix : 592 transitions.
[2024-05-27 23:19:57] [INFO ] Computation of Completed DNA matrix. took 11 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 23:19:57] [INFO ] Built C files in 126ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8178000447499377928
Running compilation step : cd /tmp/ltsmin8178000447499377928;'/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/graph12529799993342804833.txt' '-o' '/tmp/graph12529799993342804833.bin' '-w' '/tmp/graph12529799993342804833.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12529799993342804833.bin' '-l' '-1' '-v' '-w' '/tmp/graph12529799993342804833.weights' '-q' '0' '-e' '0.001'
[2024-05-27 23:19:57] [INFO ] Decomposing Gal with order
[2024-05-27 23:19:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 23:19:58] [INFO ] Removed a total of 575 redundant transitions.
[2024-05-27 23:19:58] [INFO ] Flatten gal took : 149 ms
[2024-05-27 23:19:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 168 labels/synchronizations in 21 ms.
[2024-05-27 23:19:58] [INFO ] Time to serialize gal into /tmp/LTLCardinality14341955043600399165.gal : 9 ms
[2024-05-27 23:19:58] [INFO ] Time to serialize properties into /tmp/LTLCardinality6341153629101431943.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/LTLCardinality14341955043600399165.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6341153629101431943.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...298
Read 1 LTL properties
Checking formula 0 : !((G(((G("((((gu0.out6_1+gu0.out6_2)+(gu0.out6_0+gu0.out6_6))+((gu0.out6_5+gu0.out6_4)+(gu0.out6_3+gu0.out6_7)))<=gu0.c9)"))||(X(F("((...376
Formula 0 simplified : F((F!"((((gu0.out6_1+gu0.out6_2)+(gu0.out6_0+gu0.out6_6))+((gu0.out6_5+gu0.out6_4)+(gu0.out6_3+gu0.out6_7)))<=gu0.c9)" & XG!"(((gu2....365
Compilation finished in 2414 ms.
Running link step : cd /tmp/ltsmin8178000447499377928;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin8178000447499377928;'/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' '[]((([]((LTLAPp0==true))||X(<>((LTLAPp1==true)))) U X((LTLAPp2==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.018: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.018: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.026: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.062: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.062: LTL layer: formula: []((([]((LTLAPp0==true))||X(<>((LTLAPp1==true)))) U X((LTLAPp2==true))))
pins2lts-mc-linux64( 2/ 8), 0.062: "[]((([]((LTLAPp0==true))||X(<>((LTLAPp1==true)))) U X((LTLAPp2==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.063: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.080: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.097: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.100: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.104: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.104: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.106: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.112: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.116: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.200: DFS-FIFO for weak LTL, using special progress label 596
pins2lts-mc-linux64( 0/ 8), 0.200: There are 597 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.200: State length is 131, there are 605 groups
pins2lts-mc-linux64( 0/ 8), 0.200: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.200: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.200: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.200: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.263: ~22 levels ~960 states ~3696 transitions
pins2lts-mc-linux64( 4/ 8), 0.301: ~22 levels ~1920 states ~5520 transitions
pins2lts-mc-linux64( 5/ 8), 0.377: ~22 levels ~3840 states ~13200 transitions
pins2lts-mc-linux64( 2/ 8), 0.500: ~22 levels ~7680 states ~18240 transitions
pins2lts-mc-linux64( 4/ 8), 0.764: ~22 levels ~15360 states ~41648 transitions
pins2lts-mc-linux64( 4/ 8), 1.264: ~22 levels ~30720 states ~81920 transitions
pins2lts-mc-linux64( 4/ 8), 2.217: ~22 levels ~61440 states ~157696 transitions
pins2lts-mc-linux64( 6/ 8), 3.854: ~22 levels ~122880 states ~330368 transitions
pins2lts-mc-linux64( 1/ 8), 6.331: ~22 levels ~245760 states ~625136 transitions
pins2lts-mc-linux64( 1/ 8), 10.126: ~22 levels ~491520 states ~1236576 transitions
pins2lts-mc-linux64( 0/ 8), 16.708: ~22 levels ~983040 states ~2609504 transitions
pins2lts-mc-linux64( 1/ 8), 29.333: ~22 levels ~1966080 states ~5297744 transitions
pins2lts-mc-linux64( 4/ 8), 54.176: ~22 levels ~3932160 states ~10127968 transitions
pins2lts-mc-linux64( 4/ 8), 103.322: ~22 levels ~7864320 states ~20040048 transitions
pins2lts-mc-linux64( 4/ 8), 203.934: ~22 levels ~15728640 states ~41418848 transitions
pins2lts-mc-linux64( 4/ 8), 416.022: ~22 levels ~31457280 states ~85306144 transitions
pins2lts-mc-linux64( 6/ 8), 962.882: ~22 levels ~62914560 states ~186337888 transitions
pins2lts-mc-linux64( 7/ 8), 1053.860: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1054.038:
pins2lts-mc-linux64( 0/ 8), 1054.039: mean standard work distribution: 2.7% (states) 5.0% (transitions)
pins2lts-mc-linux64( 0/ 8), 1054.039:
pins2lts-mc-linux64( 0/ 8), 1054.039: Explored 65982618 states 209868474 transitions, fanout: 3.181
pins2lts-mc-linux64( 0/ 8), 1054.039: Total exploration time 1053.830 sec (1053.670 sec minimum, 1053.696 sec on average)
pins2lts-mc-linux64( 0/ 8), 1054.039: States per second: 62612, Transitions per second: 199148
pins2lts-mc-linux64( 0/ 8), 1054.039:
pins2lts-mc-linux64( 0/ 8), 1054.039: Progress states detected: 68235522
pins2lts-mc-linux64( 0/ 8), 1054.039: Redundant explorations: -50.8390
pins2lts-mc-linux64( 0/ 8), 1054.039:
pins2lts-mc-linux64( 0/ 8), 1054.039: Queue width: 8B, total height: 68235942, memory: 520.60MB
pins2lts-mc-linux64( 0/ 8), 1054.039: Tree memory: 1044.8MB, 8.2 B/state, compr.: 1.6%
pins2lts-mc-linux64( 0/ 8), 1054.039: Tree fill ratio (roots/leafs): 99.0%/8.0%
pins2lts-mc-linux64( 0/ 8), 1054.039: Stored 700 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1054.039: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1054.039: Est. total memory use: 1565.4MB (~1544.6MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8178000447499377928;'/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' '[]((([]((LTLAPp0==true))||X(<>((LTLAPp1==true)))) U X((LTLAPp2==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin8178000447499377928;'/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' '[]((([]((LTLAPp0==true))||X(<>((LTLAPp1==true)))) U X((LTLAPp2==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-27 23:41:22] [INFO ] Flatten gal took : 26 ms
[2024-05-27 23:41:22] [INFO ] Time to serialize gal into /tmp/LTLCardinality9442988182773364377.gal : 6 ms
[2024-05-27 23:41:22] [INFO ] Time to serialize properties into /tmp/LTLCardinality10029773979421522635.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/LTLCardinality9442988182773364377.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10029773979421522635.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...298
Read 1 LTL properties
Checking formula 0 : !((G(((G("((((out6_1+out6_2)+(out6_0+out6_6))+((out6_5+out6_4)+(out6_3+out6_7)))<=c9)"))||(X(F("(((aux6_0+aux6_5)+(aux6_1+aux6_4))<3)"...276
Formula 0 simplified : F((F!"((((out6_1+out6_2)+(out6_0+out6_6))+((out6_5+out6_4)+(out6_3+out6_7)))<=c9)" & XG!"(((aux6_0+aux6_5)+(aux6_1+aux6_4))<3)") R X...265
Detected timeout of ITS tools.
[2024-05-28 00:02:51] [INFO ] Flatten gal took : 517 ms
[2024-05-28 00:02:55] [INFO ] Input system was already deterministic with 592 transitions.
[2024-05-28 00:02:56] [INFO ] Transformed 130 places.
[2024-05-28 00:02:56] [INFO ] Transformed 592 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 00:03:01] [INFO ] Time to serialize gal into /tmp/LTLCardinality1676501974354586611.gal : 15 ms
[2024-05-28 00:03:01] [INFO ] Time to serialize properties into /tmp/LTLCardinality3383631624902547436.ltl : 5 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/LTLCardinality1676501974354586611.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3383631624902547436.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...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(((G("((((out6_1+out6_2)+(out6_0+out6_6))+((out6_5+out6_4)+(out6_3+out6_7)))<=c9)"))||(X(F("(((aux6_0+aux6_5)+(aux6_1+aux6_4))<3)"...276
Formula 0 simplified : F((F!"((((out6_1+out6_2)+(out6_0+out6_6))+((out6_5+out6_4)+(out6_3+out6_7)))<=c9)" & XG!"(((aux6_0+aux6_5)+(aux6_1+aux6_4))<3)") R X...265
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 170220 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16024004 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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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-02"
export BK_EXAMINATION="LTLCardinality"
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-02, examination is LTLCardinality"
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-171654422000102"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-PT-02.tgz
mv PermAdmissibility-PT-02 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;