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.r024-tall-165251918900716.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 CircularTrains-PT-012, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918900716
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 264K
-rw-r--r-- 1 mcc users 7.5K Apr 30 07:15 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 30 07:15 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 30 07:15 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 30 07:15 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 9 07:13 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:13 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 9 07:13 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 07:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 07:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 9.2K May 10 09:33 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 CircularTrains-PT-012-LTLFireability-00
FORMULA_NAME CircularTrains-PT-012-LTLFireability-01
FORMULA_NAME CircularTrains-PT-012-LTLFireability-02
FORMULA_NAME CircularTrains-PT-012-LTLFireability-03
FORMULA_NAME CircularTrains-PT-012-LTLFireability-04
FORMULA_NAME CircularTrains-PT-012-LTLFireability-05
FORMULA_NAME CircularTrains-PT-012-LTLFireability-06
FORMULA_NAME CircularTrains-PT-012-LTLFireability-07
FORMULA_NAME CircularTrains-PT-012-LTLFireability-08
FORMULA_NAME CircularTrains-PT-012-LTLFireability-09
FORMULA_NAME CircularTrains-PT-012-LTLFireability-10
FORMULA_NAME CircularTrains-PT-012-LTLFireability-11
FORMULA_NAME CircularTrains-PT-012-LTLFireability-12
FORMULA_NAME CircularTrains-PT-012-LTLFireability-13
FORMULA_NAME CircularTrains-PT-012-LTLFireability-14
FORMULA_NAME CircularTrains-PT-012-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1652681363756

Running Version 202205111006
[2022-05-16 06:09:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 06:09:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 06:09:25] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2022-05-16 06:09:25] [INFO ] Transformed 24 places.
[2022-05-16 06:09:25] [INFO ] Transformed 12 transitions.
[2022-05-16 06:09:25] [INFO ] Parsed PT model containing 24 places and 12 transitions in 142 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CircularTrains-PT-012-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-012-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 8 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 24 cols
[2022-05-16 06:09:25] [INFO ] Computed 13 place invariants in 11 ms
[2022-05-16 06:09:25] [INFO ] Implicit Places using invariants in 110 ms returned []
// Phase 1: matrix 12 rows 24 cols
[2022-05-16 06:09:25] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-16 06:09:25] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
// Phase 1: matrix 12 rows 24 cols
[2022-05-16 06:09:25] [INFO ] Computed 13 place invariants in 9 ms
[2022-05-16 06:09:25] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 24/24 places, 12/12 transitions.
Support contains 24 out of 24 places after structural reductions.
[2022-05-16 06:09:25] [INFO ] Flatten gal took : 16 ms
[2022-05-16 06:09:25] [INFO ] Flatten gal took : 4 ms
[2022-05-16 06:09:25] [INFO ] Input system was already deterministic with 12 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 208 ms. (steps per millisecond=48 ) properties (out of 19) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 12 rows 24 cols
[2022-05-16 06:09:26] [INFO ] Computed 13 place invariants in 10 ms
[2022-05-16 06:09:26] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2022-05-16 06:09:26] [INFO ] [Real]Absence check using 5 positive and 8 generalized place invariants in 3 ms returned sat
[2022-05-16 06:09:26] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 14 simplifications.
FORMULA CircularTrains-PT-012-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0 U p1))||G((G(X(p2))||p1))))'
Support contains 6 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 24 cols
[2022-05-16 06:09:26] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 06:09:26] [INFO ] Implicit Places using invariants in 49 ms returned [5, 20, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 51 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 21 /21 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 21/24 places, 12/12 transitions.
Stuttering acceptance computed with spot in 336 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CircularTrains-PT-012-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=5 dest: 5}]], initial=2, aps=[p1:(AND (GEQ s4 1) (GEQ s9 1)), p0:(AND (GEQ s2 1) (GEQ s7 1)), p2:(OR (AND (GEQ s14 1) (GEQ s18 1)) (AND (GEQ s2 1) (GEQ s7 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 3 ms.
FORMULA CircularTrains-PT-012-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-012-LTLFireability-00 finished in 455 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((X(G(X(X(p1))))&&p0))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 10 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 24 cols
[2022-05-16 06:09:26] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 06:09:26] [INFO ] Implicit Places using invariants in 35 ms returned [5, 15, 20, 21]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 36 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/24 places, 12/12 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 20 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 19 transition count 11
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 19 transition count 8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 16 transition count 8
Applied a total of 8 rules in 8 ms. Remains 16 /20 variables (removed 4) and now considering 8/12 (removed 4) transitions.
// Phase 1: matrix 8 rows 16 cols
[2022-05-16 06:09:26] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 06:09:26] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 8 rows 16 cols
[2022-05-16 06:09:26] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 06:09:26] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/24 places, 8/12 transitions.
Finished structural reductions, in 2 iterations. Remains : 16/24 places, 8/12 transitions.
Stuttering acceptance computed with spot in 468 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-012-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 3}, { cond=p0, acceptance={0} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 5}, { cond=p0, acceptance={0} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 7}, { cond=p0, acceptance={0} source=4 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 5}, { cond=(AND p0 p1), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=6 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=6 dest: 7}, { cond=(AND p0 p1), acceptance={} source=6 dest: 8}], [{ cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=7 dest: 5}, { cond=(AND p0 p1), acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0} source=7 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 7}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=8 dest: 7}, { cond=(AND p0 p1), acceptance={} source=8 dest: 8}, { cond=(AND p0 (NOT p1)), acceptance={0} source=8 dest: 8}]], initial=0, aps=[p0:(AND (GEQ s9 1) (GEQ s13 1) (GEQ s1 1) (GEQ s6 1)), p1:(AND (GEQ s1 1) (GEQ s6 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null, null, null][true, true, true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 223 ms.
Stack based approach found an accepted trace after 27 steps with 0 reset with depth 28 and stack size 28 in 1 ms.
FORMULA CircularTrains-PT-012-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property CircularTrains-PT-012-LTLFireability-01 finished in 828 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((F(p0)||p1))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 24 cols
[2022-05-16 06:09:27] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-16 06:09:27] [INFO ] Implicit Places using invariants in 52 ms returned [5, 15, 20, 21]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 54 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/24 places, 12/12 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 20 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 19 transition count 11
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2 place count 19 transition count 8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 8 place count 16 transition count 8
Applied a total of 8 rules in 3 ms. Remains 16 /20 variables (removed 4) and now considering 8/12 (removed 4) transitions.
// Phase 1: matrix 8 rows 16 cols
[2022-05-16 06:09:27] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-16 06:09:27] [INFO ] Implicit Places using invariants in 32 ms returned []
// Phase 1: matrix 8 rows 16 cols
[2022-05-16 06:09:27] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 06:09:27] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/24 places, 8/12 transitions.
Finished structural reductions, in 2 iterations. Remains : 16/24 places, 8/12 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CircularTrains-PT-012-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s5 1) (GEQ s14 1)), p1:(AND (GEQ s9 1) (GEQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 18542 reset in 115 ms.
Product exploration explored 100000 steps with 18630 reset in 130 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 60 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 8 rows 16 cols
[2022-05-16 06:09:28] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 06:09:28] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-16 06:09:28] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 2 ms returned sat
[2022-05-16 06:09:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:09:28] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-16 06:09:28] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 06:09:28] [INFO ] Added : 2 causal constraints over 1 iterations in 10 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 16 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16/16 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 16 /16 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 16 cols
[2022-05-16 06:09:28] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 06:09:28] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 8 rows 16 cols
[2022-05-16 06:09:28] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 06:09:28] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
[2022-05-16 06:09:28] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 16 cols
[2022-05-16 06:09:28] [INFO ] Computed 9 place invariants in 3 ms
[2022-05-16 06:09:28] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16/16 places, 8/8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 142 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 8 rows 16 cols
[2022-05-16 06:09:29] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 06:09:29] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-16 06:09:29] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 2 ms returned sat
[2022-05-16 06:09:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:09:29] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-16 06:09:29] [INFO ] Computed and/alt/rep : 4/8/4 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-16 06:09:29] [INFO ] Added : 2 causal constraints over 1 iterations in 4 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 18459 reset in 88 ms.
Product exploration explored 100000 steps with 18529 reset in 94 ms.
Built C files in :
/tmp/ltsmin14468976909399268861
[2022-05-16 06:09:29] [INFO ] Computing symmetric may disable matrix : 8 transitions.
[2022-05-16 06:09:29] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:09:29] [INFO ] Computing symmetric may enable matrix : 8 transitions.
[2022-05-16 06:09:29] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:09:29] [INFO ] Computing Do-Not-Accords matrix : 8 transitions.
[2022-05-16 06:09:29] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-16 06:09:29] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14468976909399268861
Running compilation step : cd /tmp/ltsmin14468976909399268861;'/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 182 ms.
Running link step : cd /tmp/ltsmin14468976909399268861;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin14468976909399268861;'/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/stateBased7562709246467394265.hoa' '--buchi-type=spotba'
LTSmin run took 115 ms.
FORMULA CircularTrains-PT-012-LTLFireability-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-012-LTLFireability-02 finished in 2259 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p1)||(X((!p2 U (G(!p2)||p3)))&&!p2)||p0))))'
Support contains 6 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 24 cols
[2022-05-16 06:09:29] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 06:09:30] [INFO ] Implicit Places using invariants in 40 ms returned [5, 15, 20]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 41 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 21/24 places, 12/12 transitions.
Stuttering acceptance computed with spot in 287 ms :[true, (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) (NOT p1) p2)), (NOT p1), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2), (OR (AND (NOT p0) (NOT p1) p2) (AND p2 (NOT p3)))]
Running random walk in product with property : CircularTrains-PT-012-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND p2 (NOT p1) (NOT p3)), acceptance={} source=1 dest: 0}, { cond=(OR (AND (NOT p0) (NOT p2) p1) (AND (NOT p0) (NOT p2) p3)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) p2 p1) (AND (NOT p0) p2 p3)), acceptance={} source=1 dest: 2}, { cond=(OR (AND p0 p1) (AND p0 p3)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 2}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(AND p2 (NOT p3)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p3), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=5 dest: 2}, { cond=(AND p0 p3), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=5 dest: 5}]], initial=3, aps=[p2:(AND (GEQ s4 1) (GEQ s9 1)), p1:(OR (LT s13 1) (LT s18 1)), p3:(OR (LT s13 1) (LT s18 1)), p0:(OR (LT s3 1) (LT s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 144 ms.
Product exploration explored 100000 steps with 0 reset in 148 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 p3 (NOT p0)), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) p2 p1) (AND (NOT p0) p2 p3))))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p2) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR (AND (NOT p0) (NOT p2) p1) (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2) p1) (AND (NOT p0) (NOT p2) p3))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (OR (AND p0 p1) (AND p0 p3)))), (X (X (NOT (OR (AND p0 p1) (AND p0 p3))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 6 factoid took 654 ms. Reduced automaton from 6 states, 19 edges and 4 AP to 6 states, 19 edges and 4 AP.
Stuttering acceptance computed with spot in 211 ms :[true, (OR (AND (NOT p0) (NOT p1) p2) (AND p2 (NOT p3))), (NOT p1), (OR (AND (NOT p1) p2 (NOT p3)) (AND (NOT p0) (NOT p1) p2)), (AND (NOT p0) (NOT p1) p2), (AND (NOT p0) (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 313 ms. (steps per millisecond=31 ) properties (out of 17) seen :11
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 12 rows 21 cols
[2022-05-16 06:09:32] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-16 06:09:32] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2022-05-16 06:09:32] [INFO ] [Real]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-16 06:09:32] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:4
[2022-05-16 06:09:32] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2022-05-16 06:09:32] [INFO ] [Nat]Absence check using 6 positive and 4 generalized place invariants in 1 ms returned sat
[2022-05-16 06:09:32] [INFO ] After 32ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :0
Fused 6 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 6 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 p3 (NOT p0)), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND p2 (NOT p1) (NOT p3))))), (X (X (NOT (OR (AND (NOT p0) p2 p1) (AND (NOT p0) p2 p3))))), (X (X (NOT (AND (NOT p0) p2)))), (G (NOT (AND (NOT p3) (NOT p1) p2))), (G (NOT (AND (NOT p0) p2))), (G (NOT (AND p1 (NOT p0) p2))), (G (NOT (AND (NOT p3) p2))), (G (NOT (AND p3 (NOT p0) p2))), (G (NOT (OR (AND p3 (NOT p0) p2) (AND p1 (NOT p0) p2))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p2) (NOT p1) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (OR (AND (NOT p0) (NOT p2) p1) (AND (NOT p0) (NOT p2) p3)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2) p1) (AND (NOT p0) (NOT p2) p3))))), (X (X (AND (NOT p0) (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (OR (AND p0 p1) (AND p0 p3)))), (X (X (NOT (OR (AND p0 p1) (AND p0 p3))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F (AND p1 p0)), (F (NOT (AND p1 (NOT p0) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p2)))), (F (AND p3 p0)), (F (NOT (AND p3 (NOT p0) (NOT p2)))), (F (OR (AND p3 p0) (AND p1 p0))), (F (NOT (OR (AND p3 (NOT p0) (NOT p2)) (AND p1 (NOT p0) (NOT p2))))), (F (NOT p1)), (F p0), (F (AND (NOT p3) (NOT p2))), (F (AND (NOT p3) (NOT p1) (NOT p2)))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p3) p2)))
Knowledge based reduction with 12 factoid took 940 ms. Reduced automaton from 6 states, 19 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA CircularTrains-PT-012-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CircularTrains-PT-012-LTLFireability-03 finished in 3243 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (!(F(!p1) U X(p0))&&X(p2))))'
Support contains 6 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 24 cols
[2022-05-16 06:09:33] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-16 06:09:33] [INFO ] Implicit Places using invariants in 31 ms returned [15, 20, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 33 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 21/24 places, 12/12 transitions.
Stuttering acceptance computed with spot in 402 ms :[(OR (NOT p2) p0), p0, false, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND p0 (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CircularTrains-PT-012-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}, { cond=true, acceptance={} source=0 dest: 4}, { cond=p1, acceptance={} source=0 dest: 5}], [{ cond=p0, acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 2}, { cond=p0, acceptance={0, 1} source=1 dest: 4}, { cond=(AND p1 p0), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=4 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={0, 1} source=5 dest: 1}, { cond=(NOT p1), acceptance={0} source=5 dest: 2}, { cond=p1, acceptance={} source=5 dest: 5}, { cond=p1, acceptance={1} source=5 dest: 7}], [{ cond=(NOT p0), acceptance={0, 1} source=6 dest: 6}], [{ cond=(AND (NOT p1) p0), acceptance={0, 1} source=7 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=7 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=7 dest: 4}, { cond=(AND p1 p0), acceptance={} source=7 dest: 5}, { cond=(AND p1 p0), acceptance={1} source=7 dest: 7}, { cond=(AND p1 p0), acceptance={1} source=7 dest: 8}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=8 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=8 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=8 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0, 1} source=8 dest: 4}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=8 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=8 dest: 7}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={1} source=8 dest: 8}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=8 dest: 9}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=9 dest: 6}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=9 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=10 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={} source=10 dest: 10}]], initial=0, aps=[p1:(AND (GEQ s9 1) (GEQ s12 1)), p0:(AND (GEQ s1 1) (GEQ s6 1)), p2:(AND (GEQ s5 1) (GEQ s20 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 26409 reset in 148 ms.
Product exploration explored 100000 steps with 26645 reset in 163 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT p0)), (X (AND p1 (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT p1)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 4 factoid took 1059 ms. Reduced automaton from 11 states, 41 edges and 3 AP to 11 states, 39 edges and 3 AP.
Stuttering acceptance computed with spot in 437 ms :[(OR (NOT p2) p0), p0, false, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND p0 (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Finished random walk after 10 steps, including 0 resets, run visited all 9 properties in 1 ms. (steps per millisecond=10 )
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p1 p0)), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT p0)), (X (AND p1 (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT p1)), (X p1), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (NOT p1))), (X (X p1)), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (NOT p0)), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 4 factoid took 1289 ms. Reduced automaton from 11 states, 39 edges and 3 AP to 11 states, 39 edges and 3 AP.
Stuttering acceptance computed with spot in 464 ms :[(OR (NOT p2) p0), p0, false, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND p0 (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 447 ms :[(OR (NOT p2) p0), p0, false, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND p0 (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 12 rows 21 cols
[2022-05-16 06:09:37] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 06:09:37] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2022-05-16 06:09:37] [INFO ] [Real]Absence check using 7 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-16 06:09:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:09:37] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2022-05-16 06:09:37] [INFO ] Computed and/alt/rep : 8/12/8 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 06:09:37] [INFO ] Added : 5 causal constraints over 1 iterations in 16 ms. Result :sat
Could not prove EG (NOT p2)
// Phase 1: matrix 12 rows 21 cols
[2022-05-16 06:09:37] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 06:09:37] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-16 06:09:37] [INFO ] [Real]Absence check using 7 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-16 06:09:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:09:37] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-16 06:09:37] [INFO ] Computed and/alt/rep : 8/12/8 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 06:09:37] [INFO ] Added : 5 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG p0
Support contains 6 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 21 cols
[2022-05-16 06:09:37] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 06:09:37] [INFO ] Implicit Places using invariants in 22 ms returned []
// Phase 1: matrix 12 rows 21 cols
[2022-05-16 06:09:37] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 06:09:37] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
// Phase 1: matrix 12 rows 21 cols
[2022-05-16 06:09:37] [INFO ] Computed 10 place invariants in 2 ms
[2022-05-16 06:09:37] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 12/12 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT p0)), (X (NOT p1)), (X p1), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
Knowledge based reduction with 3 factoid took 954 ms. Reduced automaton from 11 states, 39 edges and 3 AP to 11 states, 39 edges and 3 AP.
Stuttering acceptance computed with spot in 359 ms :[(OR (NOT p2) p0), p0, false, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND p0 (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Finished random walk after 14 steps, including 0 resets, run visited all 9 properties in 2 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 p1))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT p0)), (X (NOT p1)), (X p1), (X (AND (NOT p0) p1 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p0) p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (F (AND (NOT p0) p1)), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND (NOT p0) (NOT p2))), (F (NOT p0)), (F (NOT (AND p0 p1))), (F (AND p0 (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 3 factoid took 984 ms. Reduced automaton from 11 states, 39 edges and 3 AP to 11 states, 39 edges and 3 AP.
Stuttering acceptance computed with spot in 415 ms :[(OR (NOT p2) p0), p0, false, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND p0 (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 449 ms :[(OR (NOT p2) p0), p0, false, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND p0 (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 12 rows 21 cols
[2022-05-16 06:09:41] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 06:09:41] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-16 06:09:41] [INFO ] [Real]Absence check using 7 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-16 06:09:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:09:41] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-16 06:09:41] [INFO ] Computed and/alt/rep : 8/12/8 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 06:09:41] [INFO ] Added : 5 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p2)
// Phase 1: matrix 12 rows 21 cols
[2022-05-16 06:09:41] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 06:09:41] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-16 06:09:41] [INFO ] [Real]Absence check using 7 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-16 06:09:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:09:41] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-16 06:09:41] [INFO ] Computed and/alt/rep : 8/12/8 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 06:09:41] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 381 ms :[(OR (NOT p2) p0), p0, false, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND p0 (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 26739 reset in 111 ms.
Product exploration explored 100000 steps with 26383 reset in 148 ms.
Applying partial POR strategy [false, false, false, true, false, false, true, false, false, true, true]
Stuttering acceptance computed with spot in 448 ms :[(OR (NOT p2) p0), p0, false, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND p0 (NOT p1)), (NOT p0), (AND p0 (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 12/12 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 21 transition count 12
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 3 rules in 3 ms. Remains 21 /21 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2022-05-16 06:09:42] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 21 cols
[2022-05-16 06:09:42] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 06:09:42] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/21 places, 12/12 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 12/12 transitions.
Product exploration explored 100000 steps with 26875 reset in 134 ms.
Product exploration explored 100000 steps with 26900 reset in 140 ms.
Built C files in :
/tmp/ltsmin1997022644214275259
[2022-05-16 06:09:42] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1997022644214275259
Running compilation step : cd /tmp/ltsmin1997022644214275259;'/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 90 ms.
Running link step : cd /tmp/ltsmin1997022644214275259;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin1997022644214275259;'/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/stateBased12185347638270452769.hoa' '--buchi-type=spotba'
LTSmin run took 230 ms.
FORMULA CircularTrains-PT-012-LTLFireability-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-012-LTLFireability-04 finished in 9941 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!G((F(p0)||!p1)) U (G(p1)&&p2)))'
Support contains 6 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 24 cols
[2022-05-16 06:09:43] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 06:09:43] [INFO ] Implicit Places using invariants in 35 ms returned [5, 20, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 36 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/24 places, 12/12 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 21 transition count 10
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 19 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 18 transition count 9
Applied a total of 6 rules in 1 ms. Remains 18 /21 variables (removed 3) and now considering 9/12 (removed 3) transitions.
// Phase 1: matrix 9 rows 18 cols
[2022-05-16 06:09:43] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 06:09:43] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 9 rows 18 cols
[2022-05-16 06:09:43] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 06:09:43] [INFO ] Implicit Places using invariants and state equation in 28 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 : 18/24 places, 9/12 transitions.
Finished structural reductions, in 2 iterations. Remains : 18/24 places, 9/12 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) p0), p0, (NOT p1)]
Running random walk in product with property : CircularTrains-PT-012-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p2) p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND p2 p1), acceptance={} source=0 dest: 3}], [{ cond=(OR (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s12 1) (GEQ s16 1)), p1:(AND (GEQ s1 1) (GEQ s6 1)), p0:(AND (GEQ s2 1) (GEQ s13 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 97 ms.
Stack based approach found an accepted trace after 20 steps with 0 reset with depth 21 and stack size 21 in 0 ms.
FORMULA CircularTrains-PT-012-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property CircularTrains-PT-012-LTLFireability-05 finished in 375 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(F(G((F(G(p0))||(X(p0)&&p1))))))))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 24 cols
[2022-05-16 06:09:43] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 06:09:43] [INFO ] Implicit Places using invariants in 36 ms returned [5, 15, 20]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 37 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/24 places, 12/12 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 21 transition count 10
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 19 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 18 transition count 9
Applied a total of 6 rules in 1 ms. Remains 18 /21 variables (removed 3) and now considering 9/12 (removed 3) transitions.
// Phase 1: matrix 9 rows 18 cols
[2022-05-16 06:09:43] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 06:09:43] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 9 rows 18 cols
[2022-05-16 06:09:43] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 06:09:43] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 18/24 places, 9/12 transitions.
Finished structural reductions, in 2 iterations. Remains : 18/24 places, 9/12 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-012-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s12 1) (GEQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 93 ms.
Stack based approach found an accepted trace after 18 steps with 0 reset with depth 19 and stack size 19 in 1 ms.
FORMULA CircularTrains-PT-012-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property CircularTrains-PT-012-LTLFireability-06 finished in 245 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 24 cols
[2022-05-16 06:09:43] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-16 06:09:43] [INFO ] Implicit Places using invariants in 32 ms returned [5, 15, 20, 21]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 33 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 20 /20 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 20/24 places, 12/12 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-012-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 21376 reset in 75 ms.
Product exploration explored 100000 steps with 20912 reset in 78 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 129 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (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 : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 140 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 20 cols
[2022-05-16 06:09:44] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-16 06:09:44] [INFO ] Implicit Places using invariants in 37 ms returned []
// Phase 1: matrix 12 rows 20 cols
[2022-05-16 06:09:44] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 06:09:44] [INFO ] Implicit Places using invariants and state equation in 29 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
// Phase 1: matrix 12 rows 20 cols
[2022-05-16 06:09:44] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 06:09:44] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 12/12 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 114 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 105 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 21158 reset in 71 ms.
Product exploration explored 100000 steps with 20893 reset in 84 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 12/12 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 20 transition count 12
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 4 rules in 5 ms. Remains 20 /20 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2022-05-16 06:09:45] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 20 cols
[2022-05-16 06:09:45] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 06:09:45] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/20 places, 12/12 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 12/12 transitions.
Product exploration explored 100000 steps with 24977 reset in 103 ms.
Product exploration explored 100000 steps with 25002 reset in 104 ms.
Built C files in :
/tmp/ltsmin10290248879338343991
[2022-05-16 06:09:45] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10290248879338343991
Running compilation step : cd /tmp/ltsmin10290248879338343991;'/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 82 ms.
Running link step : cd /tmp/ltsmin10290248879338343991;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin10290248879338343991;'/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/stateBased12197729990174144125.hoa' '--buchi-type=spotba'
LTSmin run took 152 ms.
FORMULA CircularTrains-PT-012-LTLFireability-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-012-LTLFireability-07 finished in 2219 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G((false U G(p0)))&&G(F(p0))))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 24 cols
[2022-05-16 06:09:45] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-16 06:09:46] [INFO ] Implicit Places using invariants in 32 ms returned [5, 15, 20, 21]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 33 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/24 places, 12/12 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 9
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 17 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 16 transition count 8
Applied a total of 8 rules in 1 ms. Remains 16 /20 variables (removed 4) and now considering 8/12 (removed 4) transitions.
// Phase 1: matrix 8 rows 16 cols
[2022-05-16 06:09:46] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 06:09:46] [INFO ] Implicit Places using invariants in 21 ms returned []
// Phase 1: matrix 8 rows 16 cols
[2022-05-16 06:09:46] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 06:09:46] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 16/24 places, 8/12 transitions.
Finished structural reductions, in 2 iterations. Remains : 16/24 places, 8/12 transitions.
Stuttering acceptance computed with spot in 39 ms :[true, (NOT p0)]
Running random walk in product with property : CircularTrains-PT-012-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (GEQ s11 1) (GEQ s15 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CircularTrains-PT-012-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-012-LTLFireability-09 finished in 150 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))&&X(F(p1))))'
Support contains 4 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 24 cols
[2022-05-16 06:09:46] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 06:09:46] [INFO ] Implicit Places using invariants in 30 ms returned [5, 20, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 31 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/24 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 21/24 places, 12/12 transitions.
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : CircularTrains-PT-012-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s5 1)), p1:(AND (GEQ s14 1) (GEQ s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 13951 reset in 92 ms.
Product exploration explored 100000 steps with 13975 reset in 105 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 344 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Finished random walk after 4 steps, including 0 resets, run visited all 5 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) p0))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT p1))), (X (X p1)), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 519 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
// Phase 1: matrix 12 rows 21 cols
[2022-05-16 06:09:47] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 06:09:47] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-16 06:09:47] [INFO ] [Real]Absence check using 7 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-16 06:09:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:09:47] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2022-05-16 06:09:47] [INFO ] Computed and/alt/rep : 8/12/8 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 06:09:47] [INFO ] Added : 5 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 12/12 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 21 cols
[2022-05-16 06:09:47] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 06:09:47] [INFO ] Implicit Places using invariants in 28 ms returned []
// Phase 1: matrix 12 rows 21 cols
[2022-05-16 06:09:47] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 06:09:47] [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.
// Phase 1: matrix 12 rows 21 cols
[2022-05-16 06:09:48] [INFO ] Computed 10 place invariants in 14 ms
[2022-05-16 06:09:48] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 12/12 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 350 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Finished random walk after 8 steps, including 0 resets, run visited all 5 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (NOT p1))), (X (X p1)), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 351 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
// Phase 1: matrix 12 rows 21 cols
[2022-05-16 06:09:49] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 06:09:49] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-16 06:09:49] [INFO ] [Real]Absence check using 7 positive and 3 generalized place invariants in 1 ms returned sat
[2022-05-16 06:09:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:09:49] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-16 06:09:49] [INFO ] Computed and/alt/rep : 8/12/8 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 06:09:49] [INFO ] Added : 5 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 13918 reset in 96 ms.
Product exploration explored 100000 steps with 14115 reset in 102 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 120 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Support contains 4 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 12/12 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 21 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 21 transition count 12
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 3 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2022-05-16 06:09:49] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 21 cols
[2022-05-16 06:09:49] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 06:09:49] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/21 places, 12/12 transitions.
Finished structural reductions, in 1 iterations. Remains : 21/21 places, 12/12 transitions.
Product exploration explored 100000 steps with 16363 reset in 110 ms.
Product exploration explored 100000 steps with 16256 reset in 114 ms.
Built C files in :
/tmp/ltsmin15757817010444537383
[2022-05-16 06:09:49] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15757817010444537383
Running compilation step : cd /tmp/ltsmin15757817010444537383;'/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 63 ms.
Running link step : cd /tmp/ltsmin15757817010444537383;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 21 ms.
Running LTSmin : cd /tmp/ltsmin15757817010444537383;'/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/stateBased14049136534175925055.hoa' '--buchi-type=spotba'
LTSmin run took 252 ms.
FORMULA CircularTrains-PT-012-LTLFireability-11 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-012-LTLFireability-11 finished in 4203 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0) U (!(F(p1)||p2)||X(G(p3)))))))'
Support contains 8 out of 24 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 2 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 24 cols
[2022-05-16 06:09:50] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-16 06:09:50] [INFO ] Implicit Places using invariants in 36 ms returned [5, 15, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 38 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 21/24 places, 12/12 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 21 transition count 10
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 19 transition count 10
Applied a total of 4 rules in 2 ms. Remains 19 /21 variables (removed 2) and now considering 10/12 (removed 2) transitions.
// Phase 1: matrix 10 rows 19 cols
[2022-05-16 06:09:50] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 06:09:50] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 10 rows 19 cols
[2022-05-16 06:09:50] [INFO ] Computed 10 place invariants in 0 ms
[2022-05-16 06:09:50] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 19/24 places, 10/12 transitions.
Finished structural reductions, in 2 iterations. Remains : 19/24 places, 10/12 transitions.
Stuttering acceptance computed with spot in 356 ms :[(OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), (AND (NOT p0) p1 (NOT p3)), (AND p1 (NOT p3)), (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2 (NOT p3))), (OR (AND p1 (NOT p3)) (AND p2 (NOT p3))), false, (OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) p2 (NOT p3)))]
Running random walk in product with property : CircularTrains-PT-012-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=0 dest: 3}, { cond=(OR p2 p1), acceptance={} source=0 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) p3), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={1, 2} source=1 dest: 1}, { cond=(AND p1 (NOT p0) p3), acceptance={0, 1} source=1 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={0, 1, 2} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p0) (NOT p3)), acceptance={2} source=1 dest: 5}, { cond=(AND p1 (NOT p0) (NOT p3)), acceptance={0, 2} source=1 dest: 6}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p3), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p3)), acceptance={1, 2} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND p1 p3), acceptance={0, 1} source=2 dest: 4}, { cond=(AND p1 (NOT p3)), acceptance={0, 1, 2} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0) p3), acceptance={1} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) (NOT p3)), acceptance={1, 2} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0) p3), acceptance={0} source=3 dest: 3}, { cond=(OR (AND p2 (NOT p0) p3) (AND p1 (NOT p0) p3)), acceptance={0, 1} source=3 dest: 3}, { cond=(OR (AND p2 (NOT p0) (NOT p3)) (AND p1 (NOT p0) (NOT p3))), acceptance={0, 1, 2} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p3)), acceptance={0, 2} source=3 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p3), acceptance={1} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={1, 2} source=4 dest: 2}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={} source=4 dest: 3}, { cond=(OR (AND p2 p3) (AND p1 p3)), acceptance={0, 1} source=4 dest: 4}, { cond=(OR (AND p2 (NOT p3)) (AND p1 (NOT p3))), acceptance={0, 1, 2} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) p3), acceptance={1, 2} source=5 dest: 1}, { cond=(AND p1 (NOT p0) p3), acceptance={0, 1, 2} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p3), acceptance={2} source=5 dest: 5}, { cond=(AND p1 (NOT p0) p3), acceptance={0, 2} source=5 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={1, 2} source=6 dest: 1}, { cond=(OR (AND p2 (NOT p0)) (AND p1 (NOT p0))), acceptance={0, 1, 2} source=6 dest: 3}, { cond=(NOT p0), acceptance={0, 2} source=6 dest: 6}]], initial=0, aps=[p2:(AND (GEQ s10 1) (GEQ s14 1)), p1:(AND (GEQ s1 1) (GEQ s5 1)), p0:(AND (GEQ s12 1) (GEQ s18 1)), p3:(AND (GEQ s0 1) (GEQ s17 1))], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 10190 reset in 157 ms.
Stack based approach found an accepted trace after 1195 steps with 117 reset with depth 12 and stack size 12 in 2 ms.
FORMULA CircularTrains-PT-012-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property CircularTrains-PT-012-LTLFireability-12 finished in 633 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p0)||F(p1))&&(G(p1)||X(p2)))))'
Support contains 6 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 24 cols
[2022-05-16 06:09:50] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-16 06:09:51] [INFO ] Implicit Places using invariants in 35 ms returned [5, 15, 20, 21]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 35 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 20/24 places, 12/12 transitions.
Stuttering acceptance computed with spot in 289 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p2)), true, (NOT p1)]
Running random walk in product with property : CircularTrains-PT-012-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(NOT p1), acceptance={} source=1 dest: 4}, { cond=p1, acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 6}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 6}, { cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p1), acceptance={} source=7 dest: 6}, { cond=p1, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s12 1) (GEQ s18 1)), p1:(AND (GEQ s1 1) (GEQ s5 1)), p2:(AND (GEQ s6 1) (GEQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA CircularTrains-PT-012-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-012-LTLFireability-13 finished in 349 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 24 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 24/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 24 cols
[2022-05-16 06:09:51] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-16 06:09:51] [INFO ] Implicit Places using invariants in 43 ms returned [5, 15, 20, 21]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 44 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/24 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 12/12 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 20/24 places, 12/12 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-012-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (LT s12 1) (LT s18 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 21502 reset in 71 ms.
Product exploration explored 100000 steps with 21530 reset in 96 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 88 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 97 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 12 rows 20 cols
[2022-05-16 06:09:52] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 06:09:52] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-16 06:09:52] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-16 06:09:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:09:52] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2022-05-16 06:09:52] [INFO ] Computed and/alt/rep : 8/12/8 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 06:09:52] [INFO ] Added : 5 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 12/12 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 12/12 (removed 0) transitions.
// Phase 1: matrix 12 rows 20 cols
[2022-05-16 06:09:52] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 06:09:52] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 12 rows 20 cols
[2022-05-16 06:09:52] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 06:09:52] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
// Phase 1: matrix 12 rows 20 cols
[2022-05-16 06:09:52] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 06:09:52] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 12/12 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 262 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (NOT p0), (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)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 106 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 3 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 12 rows 20 cols
[2022-05-16 06:09:53] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 06:09:53] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-16 06:09:53] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 0 ms returned sat
[2022-05-16 06:09:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:09:53] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-16 06:09:53] [INFO ] Computed and/alt/rep : 8/12/8 causal constraints (skipped 0 transitions) in 0 ms.
[2022-05-16 06:09:53] [INFO ] Added : 5 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 21408 reset in 72 ms.
Product exploration explored 100000 steps with 21451 reset in 77 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 12/12 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 20 transition count 12
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 4 rules in 4 ms. Remains 20 /20 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2022-05-16 06:09:53] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 20 cols
[2022-05-16 06:09:53] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 06:09:53] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 20/20 places, 12/12 transitions.
Finished structural reductions, in 1 iterations. Remains : 20/20 places, 12/12 transitions.
Product exploration explored 100000 steps with 21940 reset in 96 ms.
Product exploration explored 100000 steps with 21961 reset in 112 ms.
Built C files in :
/tmp/ltsmin3868354187678221026
[2022-05-16 06:09:53] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3868354187678221026
Running compilation step : cd /tmp/ltsmin3868354187678221026;'/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 74 ms.
Running link step : cd /tmp/ltsmin3868354187678221026;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin3868354187678221026;'/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/stateBased17087523586867962066.hoa' '--buchi-type=spotba'
LTSmin run took 163 ms.
FORMULA CircularTrains-PT-012-LTLFireability-14 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-012-LTLFireability-14 finished in 2714 ms.
All properties solved by simple procedures.
Total runtime 29070 ms.

BK_STOP 1652681394169

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ 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 LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@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="CircularTrains-PT-012"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is CircularTrains-PT-012, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r024-tall-165251918900716"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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