Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r150-smll-165276998700355.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is PermAdmissibility-COL-02, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r150-smll-165276998700355
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 288K
-rw-r--r-- 1 mcc users 7.0K Apr 29 12:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Apr 29 12:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Apr 29 12:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Apr 29 12:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 9 08:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 9 08:23 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_pt
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 5 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 54K May 10 09:34 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-02-LTLCardinality-00
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-01
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-02
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-03
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-04
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-05
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-06
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-07
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-08
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-09
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-10
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-11
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-12
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-13
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-14
FORMULA_NAME PermAdmissibility-COL-02-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653067099522

Running Version 202205111006
[2022-05-20 17:18:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 17:18:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 17:18:21] [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.
[2022-05-20 17:18:22] [WARNING] Using fallBack plugin, rng conformance not checked
[2022-05-20 17:18:23] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 1303 ms
[2022-05-20 17:18:23] [INFO ] Imported 40 HL places and 16 HL transitions for a total of 208 PT places and 1024.0 transition bindings in 46 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 32 ms.
Working with output stream class java.io.PrintStream
FORMULA PermAdmissibility-COL-02-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-02-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-20 17:18:23] [INFO ] Built PT skeleton of HLPN with 40 places and 16 transitions 83 arcs in 12 ms.
[2022-05-20 17:18:23] [INFO ] Skeletonized 14 HLPN properties in 1 ms.
Initial state reduction rules removed 1 formulas.
FORMULA PermAdmissibility-COL-02-LTLCardinality-01 TRUE 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 13 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).
Incomplete random walk after 10000 steps, including 209 resets, run finished after 450 ms. (steps per millisecond=22 ) properties (out of 23) seen :20
Incomplete Best-First random walk after 10000 steps, including 132 resets, run finished after 238 ms. (steps per millisecond=42 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 158 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 128 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 16 rows 40 cols
[2022-05-20 17:18:24] [INFO ] Computed 24 place invariants in 8 ms
[2022-05-20 17:18:24] [INFO ] [Real]Absence check using 0 positive and 24 generalized place invariants in 13 ms returned sat
[2022-05-20 17:18:24] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2022-05-20 17:18:24] [INFO ] [Nat]Absence check using 0 positive and 24 generalized place invariants in 22 ms returned sat
[2022-05-20 17:18:24] [INFO ] After 113ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
[2022-05-20 17:18:25] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
[2022-05-20 17:18:25] [INFO ] Flatten gal took : 44 ms
FORMULA PermAdmissibility-COL-02-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PermAdmissibility-COL-02-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-20 17:18:25] [INFO ] Flatten gal took : 13 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
[2022-05-20 17:18:25] [INFO ] Unfolded HLPN to a Petri net with 40 places and 16 transitions 83 arcs in 16 ms.
[2022-05-20 17:18:25] [INFO ] Unfolded 11 HLPN properties in 0 ms.
Support contains 22 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 16/16 transitions.
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 34 transition count 16
Applied a total of 6 rules in 17 ms. Remains 34 /40 variables (removed 6) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 34 cols
[2022-05-20 17:18:25] [INFO ] Computed 18 place invariants in 4 ms
[2022-05-20 17:18:25] [INFO ] Implicit Places using invariants in 144 ms returned [15, 17, 18, 29, 30]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 160 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 29/40 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 29 /29 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 29/40 places, 16/16 transitions.
Support contains 22 out of 29 places after structural reductions.
[2022-05-20 17:18:25] [INFO ] Flatten gal took : 7 ms
[2022-05-20 17:18:25] [INFO ] Flatten gal took : 8 ms
[2022-05-20 17:18:25] [INFO ] Input system was already deterministic with 16 transitions.
Incomplete random walk after 10000 steps, including 208 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 19) seen :18
Incomplete Best-First random walk after 10001 steps, including 131 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 16 rows 29 cols
[2022-05-20 17:18:25] [INFO ] Computed 13 place invariants in 6 ms
[2022-05-20 17:18:25] [INFO ] [Real]Absence check using 0 positive and 13 generalized place invariants in 11 ms returned sat
[2022-05-20 17:18:25] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 1 atomic propositions for a total of 11 simplifications.
Computed a total of 29 stabilizing places and 16 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 29 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 : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||p0)))'
Support contains 2 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 16/16 transitions.
Graph (complete) has 56 edges and 29 vertex of which 9 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Applied a total of 1 rules in 5 ms. Remains 9 /29 variables (removed 20) and now considering 6/16 (removed 10) transitions.
// Phase 1: matrix 6 rows 9 cols
[2022-05-20 17:18:25] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 17:18:25] [INFO ] Implicit Places using invariants in 45 ms returned [2, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 46 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/29 places, 6/16 transitions.
Graph (complete) has 7 edges and 7 vertex of which 6 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 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 1 place count 5 transition count 3
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 3 place count 4 transition count 3
Applied a total of 3 rules in 5 ms. Remains 4 /7 variables (removed 3) and now considering 3/6 (removed 3) transitions.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 17:18:25] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 17:18:25] [INFO ] Implicit Places using invariants in 19 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 17:18:25] [INFO ] Computed 1 place invariants in 3 ms
[2022-05-20 17:18:25] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/29 places, 3/16 transitions.
Finished structural reductions, in 2 iterations. Remains : 4/29 places, 3/16 transitions.
Stuttering acceptance computed with spot in 205 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-02-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s2 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22233 reset in 368 ms.
Product exploration explored 100000 steps with 22223 reset in 292 ms.
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 172 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 167 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 17:18:27] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 17:18:27] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-20 17:18:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 17:18:27] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-20 17:18:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 17:18:27] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-20 17:18:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 17:18:27] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-20 17:18:27] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-20 17:18:27] [INFO ] Added : 2 causal constraints over 1 iterations in 55 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 3/3 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 17:18:27] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 17:18:27] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 17:18:27] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 17:18:27] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
[2022-05-20 17:18:27] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 17:18:27] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 17:18:27] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 4/4 places, 3/3 transitions.
Computed a total of 4 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 4 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 200 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 131 ms :[(NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 175 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
// Phase 1: matrix 3 rows 4 cols
[2022-05-20 17:18:28] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 17:18:28] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-20 17:18:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 17:18:28] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-20 17:18:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 17:18:28] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-20 17:18:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 17:18:28] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-20 17:18:28] [INFO ] Computed and/alt/rep : 2/2/2 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-20 17:18:28] [INFO ] Added : 2 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22224 reset in 132 ms.
Product exploration explored 100000 steps with 22270 reset in 368 ms.
Built C files in :
/tmp/ltsmin16984894639423773742
[2022-05-20 17:18:28] [INFO ] Computing symmetric may disable matrix : 3 transitions.
[2022-05-20 17:18:28] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 17:18:28] [INFO ] Computing symmetric may enable matrix : 3 transitions.
[2022-05-20 17:18:28] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 17:18:28] [INFO ] Computing Do-Not-Accords matrix : 3 transitions.
[2022-05-20 17:18:28] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 17:18:28] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16984894639423773742
Running compilation step : cd /tmp/ltsmin16984894639423773742;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 337 ms.
Running link step : cd /tmp/ltsmin16984894639423773742;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin16984894639423773742;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10802817574664719566.hoa' '--buchi-type=spotba'
LTSmin run took 97 ms.
FORMULA PermAdmissibility-COL-02-LTLCardinality-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-02-LTLCardinality-02 finished in 3637 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 16/16 transitions.
Graph (complete) has 56 edges and 29 vertex of which 14 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 6 output transitions
Drop transitions removed 6 transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 14 transition count 8
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 12 transition count 8
Applied a total of 5 rules in 6 ms. Remains 12 /29 variables (removed 17) and now considering 8/16 (removed 8) transitions.
// Phase 1: matrix 8 rows 12 cols
[2022-05-20 17:18:29] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 17:18:29] [INFO ] Implicit Places using invariants in 48 ms returned [2, 5]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 50 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/29 places, 8/16 transitions.
Reduce places removed 1 places and 1 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 9 transition count 5
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 7 transition count 5
Applied a total of 4 rules in 2 ms. Remains 7 /10 variables (removed 3) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 7 cols
[2022-05-20 17:18:29] [INFO ] Computed 2 place invariants in 4 ms
[2022-05-20 17:18:29] [INFO ] Implicit Places using invariants in 33 ms returned []
// Phase 1: matrix 5 rows 7 cols
[2022-05-20 17:18:29] [INFO ] Computed 2 place invariants in 2 ms
[2022-05-20 17:18:29] [INFO ] Implicit Places using invariants and state equation in 36 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 : 7/29 places, 5/16 transitions.
Finished structural reductions, in 2 iterations. Remains : 7/29 places, 5/16 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-02-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s3 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-COL-02-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-02-LTLCardinality-03 finished in 201 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 16/16 transitions.
Graph (complete) has 56 edges and 29 vertex of which 26 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 26 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 24 transition count 14
Applied a total of 5 rules in 4 ms. Remains 24 /29 variables (removed 5) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 24 cols
[2022-05-20 17:18:29] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-20 17:18:29] [INFO ] Implicit Places using invariants in 58 ms returned [4, 6, 8, 11, 14, 15, 16, 20]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 61 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/29 places, 14/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 15 transition count 5
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 7 transition count 5
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 16 place count 7 transition count 3
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 20 place count 5 transition count 3
Applied a total of 20 rules in 3 ms. Remains 5 /16 variables (removed 11) and now considering 3/14 (removed 11) transitions.
// Phase 1: matrix 3 rows 5 cols
[2022-05-20 17:18:29] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-20 17:18:29] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 3 rows 5 cols
[2022-05-20 17:18:29] [INFO ] Computed 2 place invariants in 3 ms
[2022-05-20 17:18:29] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/29 places, 3/16 transitions.
Finished structural reductions, in 2 iterations. Remains : 5/29 places, 3/16 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-02-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s0 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-02-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-02-LTLCardinality-04 finished in 232 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X(p1)))'
Support contains 3 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 16/16 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 26 transition count 16
Applied a total of 3 rules in 2 ms. Remains 26 /29 variables (removed 3) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 26 cols
[2022-05-20 17:18:29] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-20 17:18:29] [INFO ] Implicit Places using invariants in 77 ms returned [4, 7, 8, 13, 16, 17, 18, 22]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 82 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/29 places, 16/16 transitions.
Applied a total of 0 rules in 0 ms. Remains 18 /18 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 18/29 places, 16/16 transitions.
Stuttering acceptance computed with spot in 269 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-02-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GT 3 s5), p1:(GT s15 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 221 steps with 6 reset in 1 ms.
FORMULA PermAdmissibility-COL-02-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-02-LTLCardinality-05 finished in 371 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(G(F(p0))))))'
Support contains 2 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 16/16 transitions.
Graph (complete) has 56 edges and 29 vertex of which 26 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 26 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 24 transition count 14
Applied a total of 5 rules in 3 ms. Remains 24 /29 variables (removed 5) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 24 cols
[2022-05-20 17:18:30] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-20 17:18:30] [INFO ] Implicit Places using invariants in 89 ms returned [4, 6, 8, 11, 14, 15, 16, 20]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 91 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 16/29 places, 14/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 15 transition count 5
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 7 transition count 5
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 16 place count 7 transition count 3
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 20 place count 5 transition count 3
Applied a total of 20 rules in 2 ms. Remains 5 /16 variables (removed 11) and now considering 3/14 (removed 11) transitions.
// Phase 1: matrix 3 rows 5 cols
[2022-05-20 17:18:30] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-20 17:18:30] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 3 rows 5 cols
[2022-05-20 17:18:30] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-20 17:18:30] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/29 places, 3/16 transitions.
Finished structural reductions, in 2 iterations. Remains : 5/29 places, 3/16 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-02-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s0 s2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 17832 reset in 124 ms.
Product exploration explored 100000 steps with 17858 reset in 176 ms.
Computed a total of 5 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 210 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 191 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 3 rows 5 cols
[2022-05-20 17:18:31] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-20 17:18:31] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-20 17:18:31] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-20 17:18:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 17:18:31] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-20 17:18:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 17:18:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-20 17:18:31] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-20 17:18:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 17:18:31] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-20 17:18:31] [INFO ] Computed and/alt/rep : 2/4/2 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-20 17:18:31] [INFO ] Added : 2 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 3/3 transitions.
Applied a total of 0 rules in 2 ms. Remains 5 /5 variables (removed 0) and now considering 3/3 (removed 0) transitions.
// Phase 1: matrix 3 rows 5 cols
[2022-05-20 17:18:31] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-20 17:18:31] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 3 rows 5 cols
[2022-05-20 17:18:31] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-20 17:18:31] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2022-05-20 17:18:31] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 3 rows 5 cols
[2022-05-20 17:18:31] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-20 17:18:31] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 3/3 transitions.
Computed a total of 5 stabilizing places and 3 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 5 transition count 3
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 168 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 209 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 3 rows 5 cols
[2022-05-20 17:18:32] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-20 17:18:32] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-20 17:18:32] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-20 17:18:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 17:18:32] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-20 17:18:32] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 17:18:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-20 17:18:32] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-20 17:18:32] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 17:18:32] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2022-05-20 17:18:32] [INFO ] Computed and/alt/rep : 2/4/2 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-20 17:18:32] [INFO ] Added : 2 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 17869 reset in 71 ms.
Product exploration explored 100000 steps with 17818 reset in 79 ms.
Built C files in :
/tmp/ltsmin13777211070251690701
[2022-05-20 17:18:32] [INFO ] Computing symmetric may disable matrix : 3 transitions.
[2022-05-20 17:18:32] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 17:18:32] [INFO ] Computing symmetric may enable matrix : 3 transitions.
[2022-05-20 17:18:32] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 17:18:32] [INFO ] Computing Do-Not-Accords matrix : 3 transitions.
[2022-05-20 17:18:32] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 17:18:32] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13777211070251690701
Running compilation step : cd /tmp/ltsmin13777211070251690701;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 79 ms.
Running link step : cd /tmp/ltsmin13777211070251690701;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin13777211070251690701;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9456737035719659005.hoa' '--buchi-type=spotba'
LTSmin run took 46 ms.
FORMULA PermAdmissibility-COL-02-LTLCardinality-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-02-LTLCardinality-06 finished in 2609 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0)||p1) U G(X(p2))))'
Support contains 5 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 16/16 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 26 transition count 16
Applied a total of 3 rules in 1 ms. Remains 26 /29 variables (removed 3) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 26 cols
[2022-05-20 17:18:32] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-20 17:18:32] [INFO ] Implicit Places using invariants in 52 ms returned [4, 6, 7, 13, 17, 22]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 54 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/29 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 2 iterations. Remains : 20/29 places, 16/16 transitions.
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-02-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(LEQ 1 s13), p0:(LEQ s0 s5), p2:(LEQ s9 s12)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 3066 reset in 134 ms.
Product exploration explored 100000 steps with 3074 reset in 104 ms.
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 p1) p0 p2), (X p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (G p2))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 848 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0)]
Incomplete random walk after 10001 steps, including 208 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10000 steps, including 128 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 16 rows 20 cols
[2022-05-20 17:18:34] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 17:18:34] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 17:18:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-20 17:18:34] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 2 ms returned sat
[2022-05-20 17:18:34] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 17:18:34] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-05-20 17:18:34] [INFO ] After 64ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 20 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=10 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND (NOT p1) p0 p2), (X p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (G p2))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2)), (F (AND p1 p2 (NOT p0))), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p2) (NOT p0)))]
Knowledge based reduction with 13 factoid took 867 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0)]
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0)]
Support contains 5 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 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.
// Phase 1: matrix 16 rows 20 cols
[2022-05-20 17:18:35] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 17:18:35] [INFO ] Implicit Places using invariants in 59 ms returned []
// Phase 1: matrix 16 rows 20 cols
[2022-05-20 17:18:35] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 17:18:35] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 126 ms to find 0 implicit places.
// Phase 1: matrix 16 rows 20 cols
[2022-05-20 17:18:35] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 17:18:35] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/20 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 p1) p2 p0), (X p2), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X p2)), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (G p2)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 960 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0)]
Incomplete random walk after 10001 steps, including 207 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 128 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 16 rows 20 cols
[2022-05-20 17:18:37] [INFO ] Computed 4 place invariants in 1 ms
[2022-05-20 17:18:37] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 17:18:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-05-20 17:18:37] [INFO ] [Nat]Absence check using 1 positive and 3 generalized place invariants in 2 ms returned sat
[2022-05-20 17:18:37] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 17:18:37] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 9 ms.
[2022-05-20 17:18:37] [INFO ] After 67ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 20 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=10 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (NOT (AND p1 p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X p2)), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1)))), (F (G p2)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2)), (F (AND p1 (NOT p0) p2)), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 13 factoid took 1241 ms. Reduced automaton from 3 states, 6 edges and 3 AP to 3 states, 6 edges and 3 AP.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0)]
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0)]
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0)]
Product exploration explored 100000 steps with 3072 reset in 151 ms.
Product exploration explored 100000 steps with 3073 reset in 202 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0)]
Support contains 5 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 16/16 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 16
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 20 transition count 16
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 6 place count 20 transition count 16
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 19 transition count 15
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 19 transition count 15
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 8 rules in 18 ms. Remains 19 /20 variables (removed 1) and now considering 15/16 (removed 1) transitions.
[2022-05-20 17:18:39] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 15 rows 19 cols
[2022-05-20 17:18:39] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-20 17:18:39] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 19/20 places, 15/16 transitions.
Finished structural reductions, in 1 iterations. Remains : 19/20 places, 15/16 transitions.
Product exploration explored 100000 steps with 3078 reset in 168 ms.
Product exploration explored 100000 steps with 3079 reset in 209 ms.
Built C files in :
/tmp/ltsmin9114480398317646117
[2022-05-20 17:18:40] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9114480398317646117
Running compilation step : cd /tmp/ltsmin9114480398317646117;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 158 ms.
Running link step : cd /tmp/ltsmin9114480398317646117;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin9114480398317646117;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3910798095163213156.hoa' '--buchi-type=spotba'
LTSmin run took 685 ms.
FORMULA PermAdmissibility-COL-02-LTLCardinality-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-02-LTLCardinality-07 finished in 8258 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))&&F(p1))))'
Support contains 3 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 16/16 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 25 transition count 16
Applied a total of 4 rules in 1 ms. Remains 25 /29 variables (removed 4) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 25 cols
[2022-05-20 17:18:41] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-20 17:18:41] [INFO ] Implicit Places using invariants in 85 ms returned [5, 6, 7, 12, 16, 17, 21]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 87 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 18/29 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 18 /18 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 18/29 places, 16/16 transitions.
Stuttering acceptance computed with spot in 194 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-COL-02-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p0:(GT s13 s3), p1:(LEQ 2 s11)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA PermAdmissibility-COL-02-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-02-LTLCardinality-09 finished in 297 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)||F(G(p1)))))'
Support contains 3 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 16/16 transitions.
Graph (complete) has 56 edges and 29 vertex of which 25 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 25 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 23 transition count 14
Applied a total of 5 rules in 3 ms. Remains 23 /29 variables (removed 6) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 23 cols
[2022-05-20 17:18:41] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-20 17:18:41] [INFO ] Implicit Places using invariants in 69 ms returned [3, 5, 7, 10, 13, 14, 15, 19]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 70 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 15/29 places, 14/16 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 14 transition count 7
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 8 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 7 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 14 place count 7 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 16 place count 6 transition count 5
Applied a total of 16 rules in 4 ms. Remains 6 /15 variables (removed 9) and now considering 5/14 (removed 9) transitions.
// Phase 1: matrix 5 rows 6 cols
[2022-05-20 17:18:41] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 17:18:41] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2022-05-20 17:18:41] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 17:18:41] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/29 places, 5/16 transitions.
Finished structural reductions, in 2 iterations. Remains : 6/29 places, 5/16 transitions.
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : PermAdmissibility-COL-02-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(GT s2 s0), p0:(LEQ 2 s1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 19526 reset in 132 ms.
Product exploration explored 100000 steps with 19529 reset in 163 ms.
Computed a total of 6 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 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 p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 5 factoid took 375 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p1) (NOT p0))]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 5 factoid took 432 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p1) (NOT p0))]
// Phase 1: matrix 5 rows 6 cols
[2022-05-20 17:18:42] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 17:18:42] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-20 17:18:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 17:18:42] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-20 17:18:42] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 17:18:42] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-20 17:18:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 17:18:42] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2022-05-20 17:18:42] [INFO ] Computed and/alt/rep : 4/6/4 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-20 17:18:42] [INFO ] Added : 1 causal constraints over 1 iterations in 9 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Support contains 3 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
// Phase 1: matrix 5 rows 6 cols
[2022-05-20 17:18:42] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 17:18:43] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2022-05-20 17:18:43] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 17:18:43] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 52 ms to find 0 implicit places.
[2022-05-20 17:18:43] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 5 rows 6 cols
[2022-05-20 17:18:43] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-20 17:18:43] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 6/6 places, 5/5 transitions.
Computed a total of 6 stabilizing places and 5 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 6 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 p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 5 factoid took 439 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p1) (NOT p0))]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (F (G (NOT p1))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 5 factoid took 381 ms. Reduced automaton from 1 states, 2 edges and 2 AP to 1 states, 2 edges and 2 AP.
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p1) (NOT p0))]
// Phase 1: matrix 5 rows 6 cols
[2022-05-20 17:18:44] [INFO ] Computed 1 place invariants in 1 ms
[2022-05-20 17:18:44] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-20 17:18:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 17:18:44] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2022-05-20 17:18:44] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 17:18:44] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-20 17:18:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 17:18:44] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2022-05-20 17:18:44] [INFO ] Computed and/alt/rep : 4/6/4 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-20 17:18:44] [INFO ] Added : 1 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0))
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 19535 reset in 138 ms.
Product exploration explored 100000 steps with 19490 reset in 150 ms.
Built C files in :
/tmp/ltsmin17496538988363959132
[2022-05-20 17:18:44] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2022-05-20 17:18:44] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 17:18:44] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2022-05-20 17:18:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 17:18:44] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2022-05-20 17:18:44] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 17:18:44] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17496538988363959132
Running compilation step : cd /tmp/ltsmin17496538988363959132;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 128 ms.
Running link step : cd /tmp/ltsmin17496538988363959132;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin17496538988363959132;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17425316403293967076.hoa' '--buchi-type=spotba'
LTSmin run took 100 ms.
FORMULA PermAdmissibility-COL-02-LTLCardinality-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-02-LTLCardinality-10 finished in 3416 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0) U (F(p1)&&(p2||G(p1))))))'
Support contains 5 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 16/16 transitions.
Graph (complete) has 56 edges and 29 vertex of which 22 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Applied a total of 1 rules in 3 ms. Remains 22 /29 variables (removed 7) and now considering 14/16 (removed 2) transitions.
// Phase 1: matrix 14 rows 22 cols
[2022-05-20 17:18:44] [INFO ] Computed 8 place invariants in 1 ms
[2022-05-20 17:18:44] [INFO ] Implicit Places using invariants in 70 ms returned [2, 4, 9, 13, 14]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 85 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 17/29 places, 14/16 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 17 transition count 12
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 15 transition count 10
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 13 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 8 place count 13 transition count 9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 10 place count 12 transition count 9
Applied a total of 10 rules in 3 ms. Remains 12 /17 variables (removed 5) and now considering 9/14 (removed 5) transitions.
// Phase 1: matrix 9 rows 12 cols
[2022-05-20 17:18:44] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 17:18:44] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 9 rows 12 cols
[2022-05-20 17:18:44] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-20 17:18:45] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/29 places, 9/16 transitions.
Finished structural reductions, in 2 iterations. Remains : 12/29 places, 9/16 transitions.
Stuttering acceptance computed with spot in 225 ms :[(NOT p1), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PermAdmissibility-COL-02-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ 1 s0), p2:(LEQ s10 s6), p0:(GT s1 s3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 7214 reset in 222 ms.
Product exploration explored 100000 steps with 7201 reset in 324 ms.
Computed a total of 12 stabilizing places and 9 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 12 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) p2 (NOT p0)), (X (AND (NOT p1) p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 1237 ms. Reduced automaton from 5 states, 14 edges and 3 AP to 5 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 233 ms :[(NOT p1), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Finished random walk after 406 steps, including 14 resets, run visited all 9 properties in 10 ms. (steps per millisecond=40 )
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (AND (NOT p1) p2)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) p2))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0), (F (AND p1 (NOT p0) (NOT p2))), (F p1), (F (AND p1 (NOT p2))), (F (AND (NOT p1) (NOT p0) (NOT p2))), (F (NOT (AND (NOT p1) p2))), (F (AND (NOT p1) (NOT p2))), (F (AND p1 (NOT p0))), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 22 factoid took 1745 ms. Reduced automaton from 5 states, 14 edges and 3 AP to 5 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 273 ms :[(NOT p1), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 238 ms :[(NOT p1), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 9 rows 12 cols
[2022-05-20 17:18:49] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 17:18:49] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-20 17:18:49] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-20 17:18:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 17:18:49] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-20 17:18:49] [INFO ] Computed and/alt/rep : 8/10/8 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-20 17:18:49] [INFO ] Added : 6 causal constraints over 2 iterations in 36 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 5 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 9/9 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 9/9 (removed 0) transitions.
// Phase 1: matrix 9 rows 12 cols
[2022-05-20 17:18:49] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 17:18:49] [INFO ] Implicit Places using invariants in 34 ms returned []
// Phase 1: matrix 9 rows 12 cols
[2022-05-20 17:18:49] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 17:18:49] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 73 ms to find 0 implicit places.
[2022-05-20 17:18:49] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 9 rows 12 cols
[2022-05-20 17:18:49] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 17:18:49] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 12/12 places, 9/9 transitions.
Computed a total of 12 stabilizing places and 9 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 12 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) p2), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 22 factoid took 1314 ms. Reduced automaton from 5 states, 14 edges and 3 AP to 5 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 258 ms :[(NOT p1), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Finished random walk after 4057 steps, including 146 resets, run visited all 9 properties in 18 ms. (steps per millisecond=225 )
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p2)))), (X (NOT p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p1) (G (NOT p1)))), (F (G (NOT p0))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) (NOT p2) p1)), (F p1), (F (AND (NOT p2) p1)), (F (AND (NOT p0) (NOT p2) (NOT p1))), (F (NOT (AND p2 (NOT p1)))), (F (AND (NOT p2) (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 22 factoid took 1621 ms. Reduced automaton from 5 states, 14 edges and 3 AP to 5 states, 14 edges and 3 AP.
Stuttering acceptance computed with spot in 401 ms :[(NOT p1), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 246 ms :[(NOT p1), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 9 rows 12 cols
[2022-05-20 17:18:53] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 17:18:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2022-05-20 17:18:53] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2022-05-20 17:18:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 17:18:53] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2022-05-20 17:18:53] [INFO ] Computed and/alt/rep : 8/10/8 causal constraints (skipped 0 transitions) in 2 ms.
[2022-05-20 17:18:53] [INFO ] Added : 6 causal constraints over 2 iterations in 16 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 218 ms :[(NOT p1), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 7186 reset in 137 ms.
Product exploration explored 100000 steps with 7178 reset in 174 ms.
Built C files in :
/tmp/ltsmin15324545372636546136
[2022-05-20 17:18:54] [INFO ] Computing symmetric may disable matrix : 9 transitions.
[2022-05-20 17:18:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 17:18:54] [INFO ] Computing symmetric may enable matrix : 9 transitions.
[2022-05-20 17:18:54] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 17:18:54] [INFO ] Computing Do-Not-Accords matrix : 9 transitions.
[2022-05-20 17:18:54] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 17:18:54] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15324545372636546136
Running compilation step : cd /tmp/ltsmin15324545372636546136;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 100 ms.
Running link step : cd /tmp/ltsmin15324545372636546136;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin15324545372636546136;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7760666046263486256.hoa' '--buchi-type=spotba'
LTSmin run took 60 ms.
FORMULA PermAdmissibility-COL-02-LTLCardinality-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property PermAdmissibility-COL-02-LTLCardinality-12 finished in 9800 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(p0))))'
Support contains 2 out of 29 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 16/16 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 25 transition count 16
Applied a total of 4 rules in 2 ms. Remains 25 /29 variables (removed 4) and now considering 16/16 (removed 0) transitions.
// Phase 1: matrix 16 rows 25 cols
[2022-05-20 17:18:54] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-20 17:18:54] [INFO ] Implicit Places using invariants in 65 ms returned [3, 5, 6, 7, 12, 15, 16, 17, 21]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 66 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 16/29 places, 16/16 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 16/16 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 16/29 places, 16/16 transitions.
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-02-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GT s15 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PermAdmissibility-COL-02-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PermAdmissibility-COL-02-LTLCardinality-13 finished in 199 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 29 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 29/29 places, 16/16 transitions.
Graph (complete) has 56 edges and 29 vertex of which 9 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.1 ms
Discarding 20 places :
Also discarding 10 output transitions
Drop transitions removed 10 transitions
Applied a total of 1 rules in 2 ms. Remains 9 /29 variables (removed 20) and now considering 6/16 (removed 10) transitions.
// Phase 1: matrix 6 rows 9 cols
[2022-05-20 17:18:54] [INFO ] Computed 3 place invariants in 1 ms
[2022-05-20 17:18:54] [INFO ] Implicit Places using invariants in 47 ms returned [5]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 48 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/29 places, 6/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 7 transition count 4
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 6 transition count 4
Applied a total of 2 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
[2022-05-20 17:18:54] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-20 17:18:54] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 4 rows 6 cols
[2022-05-20 17:18:54] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-20 17:18:54] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/29 places, 4/16 transitions.
Finished structural reductions, in 2 iterations. Remains : 6/29 places, 4/16 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : PermAdmissibility-COL-02-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LEQ s4 s2) (LEQ 1 s4))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 33333 reset in 120 ms.
Product exploration explored 100000 steps with 33333 reset in 125 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 : [(NOT p0), (X (NOT p0)), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 4 factoid took 95 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA PermAdmissibility-COL-02-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PermAdmissibility-COL-02-LTLCardinality-14 finished in 526 ms.
All properties solved by simple procedures.
Total runtime 33660 ms.

BK_STOP 1653067135877

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-02"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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