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.r268-smll-171654407000124.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 itstools
Input is PermAdmissibility-COL-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r268-smll-171654407000124
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 7.5K Apr 12 09:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 12 09:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 09:09 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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 3.8K Apr 23 07:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 09:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Apr 12 09:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Apr 12 09:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 12 09:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 23 07:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 54K 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-COL-05-LTLFireability-00
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-01
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-02
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-03
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-04
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-05
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-06
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-07
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-08
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-09
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-10
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-11
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-12
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-13
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-14
FORMULA_NAME PermAdmissibility-COL-05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716673908210

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PermAdmissibility-COL-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202405141337
[2024-05-25 21:51:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-25 21:51:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 21:51:50] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-25 21:51:51] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-25 21:51:51] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1039 ms
[2024-05-25 21:51:51] [INFO ] Imported 40 HL places and 16 HL transitions for a total of 208 PT places and 1024.0 transition bindings in 27 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
[2024-05-25 21:51:51] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions 83 arcs in 7 ms.
[2024-05-25 21:51:51] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 5 formulas.
FORMULA PermAdmissibility-COL-05-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-05-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-05-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-05-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-05-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 11 properties that can be checked using skeleton over-approximation.
Computed a total of 40 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 40 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Reduction of identical properties reduced properties to check from 15 to 13
RANDOM walk for 287 steps (0 resets) in 35 ms. (7 steps per ms) remains 0/13 properties
[2024-05-25 21:51:51] [INFO ] Flatten gal took : 29 ms
[2024-05-25 21:51:51] [INFO ] Flatten gal took : 9 ms
Symmetric sort wr.t. initial and guards and successors and join/free detected :input
Symmetric sort wr.t. initial detected :input
Symmetric sort wr.t. initial and guards detected :input
Applying symmetric unfolding of full symmetric sort :input domain size was 8
[2024-05-25 21:51:51] [INFO ] Unfolded HLPN to a Petri net with 40 places and 16 transitions 83 arcs in 19 ms.
[2024-05-25 21:51:51] [INFO ] Unfolded 11 HLPN properties in 1 ms.
Support contains 27 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 32 transition count 16
Applied a total of 8 rules in 20 ms. Remains 32 /40 variables (removed 8) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 32 cols
[2024-05-25 21:51:52] [INFO ] Computed 16 invariants in 17 ms
[2024-05-25 21:51:52] [INFO ] Implicit Places using invariants in 246 ms returned [24, 28]
[2024-05-25 21:51:52] [INFO ] Actually due to overlaps returned [24]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 291 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/40 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 330 ms. Remains : 31/40 places, 16/16 transitions.
Support contains 27 out of 31 places after structural reductions.
[2024-05-25 21:51:52] [INFO ] Flatten gal took : 5 ms
[2024-05-25 21:51:52] [INFO ] Flatten gal took : 6 ms
[2024-05-25 21:51:52] [INFO ] Input system was already deterministic with 16 transitions.
Support contains 26 out of 31 places (down from 27) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 14 to 12
RANDOM walk for 292 steps (0 resets) in 25 ms. (11 steps per ms) remains 0/12 properties
Computed a total of 31 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 31 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(F(p1))||p0))))'
Support contains 9 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 30 transition count 16
Applied a total of 1 rules in 6 ms. Remains 30 /31 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 30 cols
[2024-05-25 21:51:52] [INFO ] Computed 14 invariants in 8 ms
[2024-05-25 21:51:52] [INFO ] Implicit Places using invariants in 98 ms returned [4, 6, 12, 15, 16, 17, 19, 26]
[2024-05-25 21:51:52] [INFO ] Actually due to overlaps returned [4, 12, 15, 17, 26]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 100 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 25/31 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 107 ms. Remains : 25/31 places, 16/16 transitions.
Stuttering acceptance computed with spot in 283 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-COL-05-LTLFireability-00
Product exploration explored 100000 steps with 13450 reset in 428 ms.
Product exploration explored 100000 steps with 13386 reset in 225 ms.
Computed a total of 25 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 25 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 173 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
RANDOM walk for 30035 steps (309 resets) in 231 ms. (129 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p1) (NOT p0)))), (F (NOT (OR p1 (NOT p0)))), (F (NOT (OR (NOT p1) (NOT p0))))]
Knowledge based reduction with 9 factoid took 437 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), false, false]
// Phase 1: matrix 16 rows 25 cols
[2024-05-25 21:51:55] [INFO ] Computed 9 invariants in 3 ms
[2024-05-25 21:51:55] [INFO ] [Real]Absence check using 0 positive and 9 generalized place invariants in 8 ms returned sat
[2024-05-25 21:51:55] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-25 21:51:55] [INFO ] Computed and/alt/rep : 15/29/15 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-25 21:51:55] [INFO ] Added : 9 causal constraints over 2 iterations in 35 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 9 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 16/16 transitions.
Graph (complete) has 46 edges and 25 vertex of which 23 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 21 transition count 12
Applied a total of 2 rules in 11 ms. Remains 21 /25 variables (removed 4) and now considering 12/16 (removed 4) transitions.
// Phase 1: matrix 12 rows 21 cols
[2024-05-25 21:51:55] [INFO ] Computed 9 invariants in 1 ms
[2024-05-25 21:51:55] [INFO ] Implicit Places using invariants in 45 ms returned [5, 11, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 46 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 18/25 places, 12/16 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 18 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 17 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 17 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 15 transition count 9
Applied a total of 6 rules in 6 ms. Remains 15 /18 variables (removed 3) and now considering 9/12 (removed 3) transitions.
// Phase 1: matrix 9 rows 15 cols
[2024-05-25 21:51:55] [INFO ] Computed 6 invariants in 1 ms
[2024-05-25 21:51:55] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-25 21:51:55] [INFO ] Invariant cache hit.
[2024-05-25 21:51:55] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 72 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 15/25 places, 9/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 135 ms. Remains : 15/25 places, 9/16 transitions.
Computed a total of 15 stabilizing places and 9 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 15 transition count 9
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 11 factoid took 707 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 238 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
RANDOM walk for 32563 steps (590 resets) in 135 ms. (239 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p1) p0))), (X p1), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p1) p0)))), (F (G (NOT p1))), (F (G (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 11 factoid took 818 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter insensitive) to 5 states, 11 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 239 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
[2024-05-25 21:51:58] [INFO ] Invariant cache hit.
[2024-05-25 21:51:58] [INFO ] [Real]Absence check using 0 positive and 6 generalized place invariants in 5 ms returned sat
[2024-05-25 21:51:58] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-25 21:51:58] [INFO ] Computed and/alt/rep : 8/16/8 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-25 21:51:58] [INFO ] Added : 8 causal constraints over 2 iterations in 24 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Product exploration explored 100000 steps with 15572 reset in 238 ms.
Product exploration explored 100000 steps with 15609 reset in 225 ms.
Built C files in :
/tmp/ltsmin18015504971723275686
[2024-05-25 21:51:58] [INFO ] Computing symmetric may disable matrix : 9 transitions.
[2024-05-25 21:51:58] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 21:51:58] [INFO ] Computing symmetric may enable matrix : 9 transitions.
[2024-05-25 21:51:58] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 21:51:58] [INFO ] Computing Do-Not-Accords matrix : 9 transitions.
[2024-05-25 21:51:58] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 21:51:58] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18015504971723275686
Running compilation step : cd /tmp/ltsmin18015504971723275686;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 475 ms.
Running link step : cd /tmp/ltsmin18015504971723275686;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 71 ms.
Running LTSmin : cd /tmp/ltsmin18015504971723275686;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9404025610825342313.hoa' '--buchi-type=spotba'
LTSmin run took 124 ms.
FORMULA PermAdmissibility-COL-05-LTLFireability-00 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-05-LTLFireability-00 finished in 6767 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(F(G(p1))&&(p2 U p3))))'
Support contains 12 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 16/16 transitions.
Graph (complete) has 77 edges and 31 vertex of which 28 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 4 ms. Remains 27 /31 variables (removed 4) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 27 cols
[2024-05-25 21:51:59] [INFO ] Computed 13 invariants in 1 ms
[2024-05-25 21:51:59] [INFO ] Implicit Places using invariants in 82 ms returned [4, 6, 12, 15, 16]
[2024-05-25 21:51:59] [INFO ] Actually due to overlaps returned [4, 12, 15]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 85 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 24/31 places, 14/16 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 13
Applied a total of 2 rules in 4 ms. Remains 23 /24 variables (removed 1) and now considering 13/14 (removed 1) transitions.
// Phase 1: matrix 13 rows 23 cols
[2024-05-25 21:51:59] [INFO ] Computed 10 invariants in 1 ms
[2024-05-25 21:51:59] [INFO ] Implicit Places using invariants in 47 ms returned [5, 12]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 49 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/31 places, 13/16 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 21 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 20 transition count 12
Applied a total of 2 rules in 4 ms. Remains 20 /21 variables (removed 1) and now considering 12/13 (removed 1) transitions.
// Phase 1: matrix 12 rows 20 cols
[2024-05-25 21:51:59] [INFO ] Computed 8 invariants in 1 ms
[2024-05-25 21:51:59] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-25 21:51:59] [INFO ] Invariant cache hit.
[2024-05-25 21:51:59] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 20/31 places, 12/16 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 241 ms. Remains : 20/31 places, 12/16 transitions.
Stuttering acceptance computed with spot in 313 ms :[(OR (AND (NOT p0) (NOT p3)) (AND (NOT p0) (NOT p1))), true, (NOT p0), (NOT p1), (NOT p3), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : PermAdmissibility-COL-05-LTLFireability-02
Entered a terminal (fully accepting) state of product in 13 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-05-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-05-LTLFireability-02 finished in 574 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 16/16 transitions.
Graph (complete) has 77 edges and 31 vertex of which 4 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.1 ms
Discarding 27 places :
Also discarding 14 output transitions
Drop transitions (Output transitions of discarded places.) removed 14 transitions
Applied a total of 1 rules in 2 ms. Remains 4 /31 variables (removed 27) and now considering 2/16 (removed 14) transitions.
// Phase 1: matrix 2 rows 4 cols
[2024-05-25 21:52:00] [INFO ] Computed 2 invariants in 0 ms
[2024-05-25 21:52:00] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-25 21:52:00] [INFO ] Invariant cache hit.
[2024-05-25 21:52:00] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-05-25 21:52:00] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-05-25 21:52:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/6 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6/6 variables, and 6 constraints, problems are : Problem set: 0 solved, 1 unsolved in 48 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/6 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/6 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/6 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6/6 variables, and 7 constraints, problems are : Problem set: 0 solved, 1 unsolved in 43 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 117ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 124ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/31 places, 2/16 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 180 ms. Remains : 4/31 places, 2/16 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-05-LTLFireability-04
Stuttering criterion allowed to conclude after 30 steps with 7 reset in 5 ms.
FORMULA PermAdmissibility-COL-05-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-05-LTLFireability-04 finished in 292 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((!p0&&F((G(F(p1))||(F(p1)&&p2))))))'
Support contains 6 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 16/16 transitions.
Graph (complete) has 77 edges and 31 vertex of which 12 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.1 ms
Discarding 19 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Ensure Unique test removed 1 places
Applied a total of 1 rules in 4 ms. Remains 11 /31 variables (removed 20) and now considering 6/16 (removed 10) transitions.
// Phase 1: matrix 6 rows 11 cols
[2024-05-25 21:52:00] [INFO ] Computed 5 invariants in 1 ms
[2024-05-25 21:52:00] [INFO ] Implicit Places using invariants in 40 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 42 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/31 places, 6/16 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 10 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 9 transition count 5
Applied a total of 2 rules in 1 ms. Remains 9 /10 variables (removed 1) and now considering 5/6 (removed 1) transitions.
// Phase 1: matrix 5 rows 9 cols
[2024-05-25 21:52:00] [INFO ] Computed 4 invariants in 1 ms
[2024-05-25 21:52:00] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-25 21:52:00] [INFO ] Invariant cache hit.
[2024-05-25 21:52:00] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/31 places, 5/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 131 ms. Remains : 9/31 places, 5/16 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p1) p0), (NOT p1), (NOT p1)]
Running random walk in product with property : PermAdmissibility-COL-05-LTLFireability-07
Product exploration explored 100000 steps with 7629 reset in 308 ms.
Product exploration explored 100000 steps with 7546 reset in 341 ms.
Computed a total of 9 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 9 transition count 5
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (F (G (NOT p0))), (F (G p1)), (F (G (NOT p2)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 12 factoid took 30 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-05-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-05-LTLFireability-07 finished in 1032 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(F(p1))||p0))))'
Support contains 6 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 16/16 transitions.
Graph (complete) has 77 edges and 31 vertex of which 20 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.0 ms
Discarding 11 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 1 ms. Remains 18 /31 variables (removed 13) and now considering 10/16 (removed 6) transitions.
// Phase 1: matrix 10 rows 18 cols
[2024-05-25 21:52:01] [INFO ] Computed 8 invariants in 1 ms
[2024-05-25 21:52:01] [INFO ] Implicit Places using invariants in 45 ms returned [8, 9, 12, 14]
[2024-05-25 21:52:01] [INFO ] Actually due to overlaps returned [8, 9, 12]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 47 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/31 places, 10/16 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 14 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 13 transition count 8
Applied a total of 2 rules in 2 ms. Remains 13 /15 variables (removed 2) and now considering 8/10 (removed 2) transitions.
// Phase 1: matrix 8 rows 13 cols
[2024-05-25 21:52:01] [INFO ] Computed 5 invariants in 0 ms
[2024-05-25 21:52:01] [INFO ] Implicit Places using invariants in 27 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 28 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/31 places, 8/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 80 ms. Remains : 12/31 places, 8/16 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-COL-05-LTLFireability-08
Product exploration explored 100000 steps with 3116 reset in 240 ms.
Product exploration explored 100000 steps with 3096 reset in 205 ms.
Computed a total of 12 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 12 transition count 8
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 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1)), (F (G p0)), (F (G p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 21 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-05-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-05-LTLFireability-08 finished in 675 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(!p0)&&F(p1)&&F(G(p2)))))'
Support contains 9 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 16/16 transitions.
Graph (complete) has 77 edges and 31 vertex of which 28 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 2 ms. Remains 26 /31 variables (removed 5) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 26 cols
[2024-05-25 21:52:02] [INFO ] Computed 12 invariants in 1 ms
[2024-05-25 21:52:02] [INFO ] Implicit Places using invariants in 60 ms returned [4, 6, 12, 13, 16, 18]
[2024-05-25 21:52:02] [INFO ] Actually due to overlaps returned [4, 12, 13, 16]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 62 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 22/31 places, 14/16 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 21 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 20 transition count 12
Applied a total of 2 rules in 2 ms. Remains 20 /22 variables (removed 2) and now considering 12/14 (removed 2) transitions.
// Phase 1: matrix 12 rows 20 cols
[2024-05-25 21:52:02] [INFO ] Computed 8 invariants in 1 ms
[2024-05-25 21:52:02] [INFO ] Implicit Places using invariants in 47 ms returned [5, 12]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 48 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/31 places, 12/16 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 18 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 17 transition count 11
Applied a total of 2 rules in 2 ms. Remains 17 /18 variables (removed 1) and now considering 11/12 (removed 1) transitions.
// Phase 1: matrix 11 rows 17 cols
[2024-05-25 21:52:02] [INFO ] Computed 6 invariants in 0 ms
[2024-05-25 21:52:02] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-25 21:52:02] [INFO ] Invariant cache hit.
[2024-05-25 21:52:02] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 17/31 places, 11/16 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 194 ms. Remains : 17/31 places, 11/16 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p1) (NOT p2) p0), p0, (NOT p1), (NOT p2)]
Running random walk in product with property : PermAdmissibility-COL-05-LTLFireability-09
Stuttering criterion allowed to conclude after 88 steps with 2 reset in 0 ms.
FORMULA PermAdmissibility-COL-05-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-05-LTLFireability-09 finished in 368 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p1)&&p0))))'
Support contains 6 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 16/16 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 29 transition count 16
Applied a total of 2 rules in 1 ms. Remains 29 /31 variables (removed 2) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 29 cols
[2024-05-25 21:52:02] [INFO ] Computed 13 invariants in 1 ms
[2024-05-25 21:52:02] [INFO ] Implicit Places using invariants in 58 ms returned [4, 5, 6, 7, 12, 13, 16, 18, 25]
[2024-05-25 21:52:02] [INFO ] Actually due to overlaps returned [4, 5, 12, 13, 16, 25]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 59 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/31 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61 ms. Remains : 23/31 places, 16/16 transitions.
Stuttering acceptance computed with spot in 117 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : PermAdmissibility-COL-05-LTLFireability-10
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-05-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-05-LTLFireability-10 finished in 191 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&F((p0&&X(p0))))))'
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 16/16 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 29 transition count 16
Applied a total of 2 rules in 1 ms. Remains 29 /31 variables (removed 2) and now considering 16/16 (removed 0) transitions.
[2024-05-25 21:52:02] [INFO ] Invariant cache hit.
[2024-05-25 21:52:02] [INFO ] Implicit Places using invariants in 66 ms returned [4, 5, 6, 7, 12, 13, 14, 15, 22, 24, 25]
[2024-05-25 21:52:02] [INFO ] Actually due to overlaps returned [4, 5, 12, 13, 14, 22, 25]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 67 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/31 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 69 ms. Remains : 22/31 places, 16/16 transitions.
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-05-LTLFireability-11
Product exploration explored 100000 steps with 33333 reset in 89 ms.
Product exploration explored 100000 steps with 33333 reset in 101 ms.
Computed a total of 22 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 22 transition count 16
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 (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 16 ms. Reduced automaton from 6 states, 8 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PermAdmissibility-COL-05-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-05-LTLFireability-11 finished in 517 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(F(p1))&&p0))))'
Support contains 6 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 16/16 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 30 transition count 16
Applied a total of 1 rules in 2 ms. Remains 30 /31 variables (removed 1) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 30 cols
[2024-05-25 21:52:03] [INFO ] Computed 14 invariants in 1 ms
[2024-05-25 21:52:03] [INFO ] Implicit Places using invariants in 95 ms returned [4, 6, 12, 15, 16, 17, 19, 23, 25, 26]
[2024-05-25 21:52:03] [INFO ] Actually due to overlaps returned [4, 12, 15, 17, 23, 26]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 96 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 24/31 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 99 ms. Remains : 24/31 places, 16/16 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-COL-05-LTLFireability-13
Product exploration explored 100000 steps with 25308 reset in 114 ms.
Product exploration explored 100000 steps with 25424 reset in 122 ms.
Computed a total of 24 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 24 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 213 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 28 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (F (G (NOT p1))), (F (G p0))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F p1)]
Knowledge based reduction with 4 factoid took 285 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (NOT p1), (NOT p1)]
// Phase 1: matrix 16 rows 24 cols
[2024-05-25 21:52:04] [INFO ] Computed 8 invariants in 1 ms
[2024-05-25 21:52:04] [INFO ] [Real]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-25 21:52:04] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-25 21:52:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:52:04] [INFO ] [Nat]Absence check using 0 positive and 8 generalized place invariants in 3 ms returned sat
[2024-05-25 21:52:04] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-25 21:52:04] [INFO ] Computed and/alt/rep : 15/27/15 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-25 21:52:04] [INFO ] Added : 15 causal constraints over 3 iterations in 34 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 24 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 16/16 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2024-05-25 21:52:04] [INFO ] Invariant cache hit.
[2024-05-25 21:52:04] [INFO ] Implicit Places using invariants in 49 ms returned [5, 13, 15, 20]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 52 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 56 ms. Remains : 20/24 places, 16/16 transitions.
Computed a total of 20 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p1), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 28 steps (0 resets) in 4 ms. (5 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (F (G (NOT p1)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 182 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (NOT p1), (NOT p1)]
// Phase 1: matrix 16 rows 20 cols
[2024-05-25 21:52:05] [INFO ] Computed 4 invariants in 2 ms
[2024-05-25 21:52:05] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-25 21:52:05] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-25 21:52:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 21:52:05] [INFO ] [Nat]Absence check using 0 positive and 4 generalized place invariants in 2 ms returned sat
[2024-05-25 21:52:05] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-25 21:52:05] [INFO ] Computed and/alt/rep : 15/19/15 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-25 21:52:05] [INFO ] Added : 0 causal constraints over 0 iterations in 11 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 136 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 25357 reset in 83 ms.
Product exploration explored 100000 steps with 25436 reset in 87 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 3 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 16/16 transitions.
Graph (complete) has 25 edges and 20 vertex of which 6 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.0 ms
Discarding 14 places :
Also discarding 12 output transitions
Drop transitions (Output transitions of discarded places.) removed 12 transitions
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 1 place count 6 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 6 transition count 4
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 3 ms. Remains 6 /20 variables (removed 14) and now considering 4/16 (removed 12) transitions.
[2024-05-25 21:52:06] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 4 rows 6 cols
[2024-05-25 21:52:06] [INFO ] Computed 2 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem TDEAD1 is UNSAT
At refinement iteration 3 (OVERLAPS) 4/10 variables, 6/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/10 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/10 variables, and 8 constraints, problems are : Problem set: 1 solved, 2 unsolved in 55 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/6 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/10 variables, 6/8 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 2/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/10 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/10 variables, and 10 constraints, problems are : Problem set: 1 solved, 2 unsolved in 55 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 116ms problems are : Problem set: 1 solved, 2 unsolved
Search for dead transitions found 1 dead transitions in 116ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 6/20 places, 3/16 transitions.
Graph (complete) has 4 edges and 6 vertex of which 5 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 5 /6 variables (removed 1) and now considering 3/3 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/20 places, 3/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 129 ms. Remains : 5/20 places, 3/16 transitions.
Built C files in :
/tmp/ltsmin5262622364720132656
[2024-05-25 21:52:06] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5262622364720132656
Running compilation step : cd /tmp/ltsmin5262622364720132656;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 129 ms.
Running link step : cd /tmp/ltsmin5262622364720132656;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin5262622364720132656;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17714011393381672044.hoa' '--buchi-type=spotba'
LTSmin run took 295 ms.
FORMULA PermAdmissibility-COL-05-LTLFireability-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-05-LTLFireability-13 finished in 4080 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(!p0))'
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 31/31 places, 16/16 transitions.
Graph (complete) has 77 edges and 31 vertex of which 12 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.1 ms
Discarding 19 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Ensure Unique test removed 2 places
Applied a total of 1 rules in 2 ms. Remains 10 /31 variables (removed 21) and now considering 6/16 (removed 10) transitions.
// Phase 1: matrix 6 rows 10 cols
[2024-05-25 21:52:07] [INFO ] Computed 4 invariants in 1 ms
[2024-05-25 21:52:07] [INFO ] Implicit Places using invariants in 32 ms returned [4, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/31 places, 6/16 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 8 transition count 4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 6 transition count 4
Applied a total of 4 rules in 2 ms. Remains 6 /8 variables (removed 2) and now considering 4/6 (removed 2) transitions.
// Phase 1: matrix 4 rows 6 cols
[2024-05-25 21:52:07] [INFO ] Computed 2 invariants in 1 ms
[2024-05-25 21:52:07] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-25 21:52:07] [INFO ] Invariant cache hit.
[2024-05-25 21:52:07] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/31 places, 4/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 98 ms. Remains : 6/31 places, 4/16 transitions.
Stuttering acceptance computed with spot in 40 ms :[p0]
Running random walk in product with property : PermAdmissibility-COL-05-LTLFireability-14
Product exploration explored 100000 steps with 15684 reset in 101 ms.
Product exploration explored 100000 steps with 15655 reset in 124 ms.
Computed a total of 6 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 4
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 (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 110 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[p0]
RANDOM walk for 52 steps (0 resets) in 4 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 140 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[p0]
Stuttering acceptance computed with spot in 49 ms :[p0]
[2024-05-25 21:52:08] [INFO ] Invariant cache hit.
[2024-05-25 21:52:08] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-25 21:52:08] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-25 21:52:08] [INFO ] Computed and/alt/rep : 3/7/3 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-25 21:52:08] [INFO ] Added : 3 causal constraints over 1 iterations in 9 ms. Result :sat
Could not prove EG p0
Support contains 3 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 4/4 transitions.
Applied a total of 0 rules in 1 ms. Remains 6 /6 variables (removed 0) and now considering 4/4 (removed 0) transitions.
[2024-05-25 21:52:08] [INFO ] Invariant cache hit.
[2024-05-25 21:52:08] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-25 21:52:08] [INFO ] Invariant cache hit.
[2024-05-25 21:52:08] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
[2024-05-25 21:52:08] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-25 21:52:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4/9 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 1/10 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/10 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/10 variables, and 8 constraints, problems are : Problem set: 0 solved, 3 unsolved in 50 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 4/9 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 1/10 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/10 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/10 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/10 variables, and 11 constraints, problems are : Problem set: 0 solved, 3 unsolved in 56 ms.
Refiners :[Generalized P Invariants (flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 110ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 110ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 174 ms. Remains : 6/6 places, 4/4 transitions.
Computed a total of 6 stabilizing places and 4 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 transition count 4
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 (G p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 127 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[p0]
RANDOM walk for 52 steps (0 resets) in 4 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 158 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[p0]
Stuttering acceptance computed with spot in 33 ms :[p0]
[2024-05-25 21:52:08] [INFO ] Invariant cache hit.
[2024-05-25 21:52:08] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-25 21:52:08] [INFO ] [Real]Absence check using state equation in 3 ms returned sat
[2024-05-25 21:52:08] [INFO ] Computed and/alt/rep : 3/7/3 causal constraints (skipped 0 transitions) in 0 ms.
[2024-05-25 21:52:08] [INFO ] Added : 3 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 46 ms :[p0]
Product exploration explored 100000 steps with 15726 reset in 66 ms.
Product exploration explored 100000 steps with 15797 reset in 68 ms.
Built C files in :
/tmp/ltsmin889509305816445508
[2024-05-25 21:52:09] [INFO ] Computing symmetric may disable matrix : 4 transitions.
[2024-05-25 21:52:09] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 21:52:09] [INFO ] Computing symmetric may enable matrix : 4 transitions.
[2024-05-25 21:52:09] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 21:52:09] [INFO ] Computing Do-Not-Accords matrix : 4 transitions.
[2024-05-25 21:52:09] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-25 21:52:09] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin889509305816445508
Running compilation step : cd /tmp/ltsmin889509305816445508;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 151 ms.
Running link step : cd /tmp/ltsmin889509305816445508;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin889509305816445508;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1276824087365965054.hoa' '--buchi-type=spotba'
LTSmin run took 343 ms.
FORMULA PermAdmissibility-COL-05-LTLFireability-14 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-05-LTLFireability-14 finished in 2271 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(F(p1))&&p0)))'
Support contains 6 out of 31 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 16/16 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 29 transition count 16
Applied a total of 2 rules in 2 ms. Remains 29 /31 variables (removed 2) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 29 cols
[2024-05-25 21:52:09] [INFO ] Computed 13 invariants in 1 ms
[2024-05-25 21:52:09] [INFO ] Implicit Places using invariants in 60 ms returned [5, 7, 12, 13, 14, 15, 16, 18, 25]
[2024-05-25 21:52:09] [INFO ] Actually due to overlaps returned [5, 12, 13, 14, 16, 25]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 62 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 23/31 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 23 /23 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64 ms. Remains : 23/31 places, 16/16 transitions.
Stuttering acceptance computed with spot in 99 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : PermAdmissibility-COL-05-LTLFireability-15
Product exploration explored 100000 steps with 2485 reset in 103 ms.
Product exploration explored 100000 steps with 2497 reset in 114 ms.
Computed a total of 23 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 23 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 169 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 292 steps (0 resets) in 5 ms. (48 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 7 factoid took 202 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
// Phase 1: matrix 16 rows 23 cols
[2024-05-25 21:52:10] [INFO ] Computed 7 invariants in 2 ms
[2024-05-25 21:52:10] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 4 ms returned sat
[2024-05-25 21:52:10] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-05-25 21:52:10] [INFO ] Computed and/alt/rep : 15/29/15 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 21:52:10] [INFO ] Added : 7 causal constraints over 2 iterations in 20 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-25 21:52:10] [INFO ] Invariant cache hit.
[2024-05-25 21:52:10] [INFO ] [Real]Absence check using 0 positive and 7 generalized place invariants in 4 ms returned sat
[2024-05-25 21:52:10] [INFO ] [Real]Absence check using state equation in 30 ms returned sat
[2024-05-25 21:52:10] [INFO ] Computed and/alt/rep : 15/29/15 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-25 21:52:10] [INFO ] Added : 15 causal constraints over 3 iterations in 36 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 6 out of 23 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 23/23 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 23 /23 variables (removed 0) and now considering 16/16 (removed 0) transitions.
[2024-05-25 21:52:10] [INFO ] Invariant cache hit.
[2024-05-25 21:52:10] [INFO ] Implicit Places using invariants in 50 ms returned [6, 11, 13]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 52 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/23 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 54 ms. Remains : 20/23 places, 16/16 transitions.
Computed a total of 20 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 16
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 172 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 292 steps (0 resets) in 7 ms. (36 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT p1))), (F (G (NOT p0))), (F (G (NOT p1)))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 7 factoid took 241 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
// Phase 1: matrix 16 rows 20 cols
[2024-05-25 21:52:11] [INFO ] Computed 4 invariants in 0 ms
[2024-05-25 21:52:11] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 21:52:11] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-25 21:52:11] [INFO ] Computed and/alt/rep : 15/23/15 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-25 21:52:11] [INFO ] Added : 7 causal constraints over 2 iterations in 16 ms. Result :sat
Could not prove EG (NOT p0)
[2024-05-25 21:52:11] [INFO ] Invariant cache hit.
[2024-05-25 21:52:11] [INFO ] [Real]Absence check using 0 positive and 4 generalized place invariants in 1 ms returned sat
[2024-05-25 21:52:11] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-25 21:52:11] [INFO ] Computed and/alt/rep : 15/23/15 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-25 21:52:11] [INFO ] Added : 15 causal constraints over 3 iterations in 18 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 82 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 2474 reset in 116 ms.
Product exploration explored 100000 steps with 2491 reset in 164 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 81 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Support contains 6 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 16/16 transitions.
Graph (complete) has 29 edges and 20 vertex of which 18 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 18 transition count 14
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 5 Pre rules applied. Total rules applied 3 place count 18 transition count 14
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 8 place count 18 transition count 14
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 11 place count 15 transition count 11
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 14 place count 15 transition count 11
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 14 rules in 10 ms. Remains 15 /20 variables (removed 5) and now considering 11/16 (removed 5) transitions.
[2024-05-25 21:52:12] [INFO ] Redundant transitions in 0 ms returned []
Running 10 sub problems to find dead transitions.
// Phase 1: matrix 11 rows 15 cols
[2024-05-25 21:52:12] [INFO ] Computed 4 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/14 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD7 is UNSAT
At refinement iteration 2 (OVERLAPS) 11/25 variables, 14/18 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/18 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 1/26 variables, 1/19 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/19 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/26 variables, 0/19 constraints. Problems are: Problem set: 4 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 26/26 variables, and 19 constraints, problems are : Problem set: 4 solved, 6 unsolved in 166 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 3/13 variables, 4/4 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 11/24 variables, 13/17 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 6/23 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/23 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 2/26 variables, 2/25 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/26 variables, 0/25 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/26 variables, 0/25 constraints. Problems are: Problem set: 4 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 26/26 variables, and 25 constraints, problems are : Problem set: 4 solved, 6 unsolved in 166 ms.
Refiners :[Generalized P Invariants (flows): 4/4 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 6/10 constraints, Known Traps: 0/0 constraints]
After SMT, in 342ms problems are : Problem set: 4 solved, 6 unsolved
Search for dead transitions found 4 dead transitions in 343ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 15/20 places, 7/16 transitions.
Graph (complete) has 18 edges and 15 vertex of which 11 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 11 /15 variables (removed 4) and now considering 7/7 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/20 places, 7/16 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 362 ms. Remains : 11/20 places, 7/16 transitions.
Built C files in :
/tmp/ltsmin10152153509827697651
[2024-05-25 21:52:12] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10152153509827697651
Running compilation step : cd /tmp/ltsmin10152153509827697651;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 184 ms.
Running link step : cd /tmp/ltsmin10152153509827697651;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin10152153509827697651;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1732437048673153247.hoa' '--buchi-type=spotba'
LTSmin run took 502 ms.
FORMULA PermAdmissibility-COL-05-LTLFireability-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-05-LTLFireability-15 finished in 4152 ms.
All properties solved by simple procedures.
Total runtime 23427 ms.

BK_STOP 1716673934116

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PermAdmissibility-COL-05"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is PermAdmissibility-COL-05, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r268-smll-171654407000124"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/PermAdmissibility-COL-05.tgz
mv PermAdmissibility-COL-05 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;