fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r024-tall-165251918900715
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for CircularTrains-PT-012

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
350.380 14878.00 26447.00 208.80 TTTFTFTTFFFFFTTF normal

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-165251918900715.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r024-tall-165251918900715
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME CircularTrains-PT-012-LTLCardinality-01
FORMULA_NAME CircularTrains-PT-012-LTLCardinality-02
FORMULA_NAME CircularTrains-PT-012-LTLCardinality-03
FORMULA_NAME CircularTrains-PT-012-LTLCardinality-04
FORMULA_NAME CircularTrains-PT-012-LTLCardinality-05
FORMULA_NAME CircularTrains-PT-012-LTLCardinality-06
FORMULA_NAME CircularTrains-PT-012-LTLCardinality-07
FORMULA_NAME CircularTrains-PT-012-LTLCardinality-08
FORMULA_NAME CircularTrains-PT-012-LTLCardinality-09
FORMULA_NAME CircularTrains-PT-012-LTLCardinality-10
FORMULA_NAME CircularTrains-PT-012-LTLCardinality-11
FORMULA_NAME CircularTrains-PT-012-LTLCardinality-12
FORMULA_NAME CircularTrains-PT-012-LTLCardinality-13
FORMULA_NAME CircularTrains-PT-012-LTLCardinality-14
FORMULA_NAME CircularTrains-PT-012-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652681339612

Running Version 202205111006
[2022-05-16 06:09:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-16 06:09:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-16 06:09:01] [INFO ] Load time of PNML (sax parser for PT used): 44 ms
[2022-05-16 06:09:01] [INFO ] Transformed 24 places.
[2022-05-16 06:09:01] [INFO ] Transformed 12 transitions.
[2022-05-16 06:09:01] [INFO ] Parsed PT model containing 24 places and 12 transitions in 151 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA CircularTrains-PT-012-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-012-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-012-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-012-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-012-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-012-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 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 9 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:01] [INFO ] Computed 13 place invariants in 12 ms
[2022-05-16 06:09:01] [INFO ] Implicit Places using invariants in 134 ms returned []
// Phase 1: matrix 12 rows 24 cols
[2022-05-16 06:09:01] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 06:09:01] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 204 ms to find 0 implicit places.
// Phase 1: matrix 12 rows 24 cols
[2022-05-16 06:09:01] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 06:09:01] [INFO ] Dead Transitions using invariants and state equation in 36 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 24/24 places, 12/12 transitions.
Support contains 21 out of 24 places after structural reductions.
[2022-05-16 06:09:01] [INFO ] Flatten gal took : 19 ms
[2022-05-16 06:09:01] [INFO ] Flatten gal took : 5 ms
[2022-05-16 06:09:01] [INFO ] Input system was already deterministic with 12 transitions.
Support contains 20 out of 24 places (down from 21) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 461 ms. (steps per millisecond=21 ) properties (out of 22) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 12 rows 24 cols
[2022-05-16 06:09:02] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 06:09:02] [INFO ] [Real]Absence check using 5 positive place invariants in 1 ms returned sat
[2022-05-16 06:09:02] [INFO ] [Real]Absence check using 5 positive and 8 generalized place invariants in 2 ms returned sat
[2022-05-16 06:09:02] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0
Fused 5 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 4 ms.
FORMULA CircularTrains-PT-012-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CircularTrains-PT-012-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 5 atomic propositions for a total of 8 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA CircularTrains-PT-012-LTLCardinality-10 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(F((G(p0)||p1)))&&(p1 U true)))'
Support contains 3 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:02] [INFO ] Computed 13 place invariants in 2 ms
[2022-05-16 06:09:02] [INFO ] Implicit Places using invariants in 62 ms returned [5, 15, 20, 21]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 64 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 269 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CircularTrains-PT-012-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p0:(LEQ 1 s19), p1:(LEQ s11 s5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 36323 reset in 203 ms.
Product exploration explored 100000 steps with 36322 reset in 116 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) p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 244 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))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 12 rows 20 cols
[2022-05-16 06:09:03] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 06:09:03] [INFO ] After 17ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-16 06:09:03] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-16 06:09:03] [INFO ] [Nat]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-16 06:09:03] [INFO ] After 32ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 273 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 2 edges and 1 AP.
Stuttering acceptance computed with spot in 62 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1)]
Support contains 2 out of 20 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 12/12 transitions.
Applied a total of 0 rules in 2 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:04] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 06:09:04] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 12 rows 20 cols
[2022-05-16 06:09:04] [INFO ] Computed 9 place invariants in 5 ms
[2022-05-16 06:09:04] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
// Phase 1: matrix 12 rows 20 cols
[2022-05-16 06:09:04] [INFO ] Computed 9 place invariants in 5 ms
[2022-05-16 06:09:04] [INFO ] Dead Transitions using invariants and state equation in 38 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 : [p1]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 133 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 60 ms :[(NOT p1), (NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p1]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 144 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 53 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 36130 reset in 101 ms.
Product exploration explored 100000 steps with 36315 reset in 121 ms.
Applying partial POR strategy [false, true]
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (NOT p1)]
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 8 ms. Remains 20 /20 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2022-05-16 06:09:05] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 20 cols
[2022-05-16 06:09:05] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 06:09:05] [INFO ] Dead Transitions using invariants and state equation in 27 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 37587 reset in 201 ms.
Product exploration explored 100000 steps with 37835 reset in 157 ms.
Built C files in :
/tmp/ltsmin11398585359536493632
[2022-05-16 06:09:05] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11398585359536493632
Running compilation step : cd /tmp/ltsmin11398585359536493632;'/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 176 ms.
Running link step : cd /tmp/ltsmin11398585359536493632;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin11398585359536493632;'/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/stateBased253653211376718964.hoa' '--buchi-type=spotba'
LTSmin run took 233 ms.
FORMULA CircularTrains-PT-012-LTLCardinality-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-012-LTLCardinality-00 finished in 3583 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 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 3 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:06] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-16 06:09:06] [INFO ] Implicit Places using invariants in 33 ms returned [5, 15, 20]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 34 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 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 19 transition count 9
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
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 8 place count 17 transition count 8
Applied a total of 8 rules in 4 ms. Remains 17 /21 variables (removed 4) and now considering 8/12 (removed 4) transitions.
// Phase 1: matrix 8 rows 17 cols
[2022-05-16 06:09:06] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 06:09:06] [INFO ] Implicit Places using invariants in 24 ms returned []
// Phase 1: matrix 8 rows 17 cols
[2022-05-16 06:09:06] [INFO ] Computed 10 place invariants in 1 ms
[2022-05-16 06:09:06] [INFO ] Implicit Places using invariants and state equation in 29 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 : 17/24 places, 8/12 transitions.
Finished structural reductions, in 2 iterations. Remains : 17/24 places, 8/12 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-012-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s7 s15)], 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 89 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 1 ms.
FORMULA CircularTrains-PT-012-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property CircularTrains-PT-012-LTLCardinality-03 finished in 228 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(X(F((G(p0)&&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 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:06] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 06:09:06] [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 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 20 transition count 10
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 18 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 17 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 6 place count 17 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 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:06] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 06:09:06] [INFO ] Implicit Places using invariants in 25 ms returned []
// Phase 1: matrix 8 rows 16 cols
[2022-05-16 06:09:06] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 06:09:06] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 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 35 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-012-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GT s9 s11)], 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 81 ms.
Stack based approach found an accepted trace after 34 steps with 0 reset with depth 35 and stack size 35 in 0 ms.
FORMULA CircularTrains-PT-012-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property CircularTrains-PT-012-LTLCardinality-05 finished in 232 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (X(p1) U p2)))'
Support contains 5 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 0 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:06] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-16 06:09:06] [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 45 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 104 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : CircularTrains-PT-012-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p2) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p2:(GT s17 s10), p0:(LEQ s4 s5), p1:(LEQ 1 s16)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, 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 22684 reset in 78 ms.
Product exploration explored 100000 steps with 22899 reset in 85 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) p0 (NOT p1)), (X (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p0)))), true, (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0))))]
Knowledge based reduction with 6 factoid took 354 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2))]
Finished random walk after 38 steps, including 0 resets, run visited all 4 properties in 3 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT p1)), (X (NOT (AND (NOT p2) p1))), (X (NOT (AND (NOT p2) (NOT p0)))), true, (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p2) p0)), (X (NOT (AND (NOT p2) p0))), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (AND (NOT p2) p0))), (X (X (NOT (AND (NOT p2) p0)))), (F (AND p1 (NOT p2))), (F (NOT (AND p0 (NOT p2)))), (F p1), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 6 factoid took 703 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2))]
// Phase 1: matrix 12 rows 20 cols
[2022-05-16 06:09:08] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 06:09:08] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-16 06:09:08] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-16 06:09:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:09:08] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-16 06:09:08] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 06:09:08] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-16 06:09:08] [INFO ] [Nat]Absence check using 7 positive and 2 generalized place invariants in 0 ms returned sat
[2022-05-16 06:09:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 06:09:08] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2022-05-16 06:09:08] [INFO ] Computed and/alt/rep : 8/12/8 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 06:09:08] [INFO ] Added : 5 causal constraints over 1 iterations in 9 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 5 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:08] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 06:09:08] [INFO ] Implicit Places using invariants in 23 ms returned []
// Phase 1: matrix 12 rows 20 cols
[2022-05-16 06:09:08] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 06:09:08] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 62 ms to find 0 implicit places.
// Phase 1: matrix 12 rows 20 cols
[2022-05-16 06:09:08] [INFO ] Computed 9 place invariants in 2 ms
[2022-05-16 06:09:08] [INFO ] Dead Transitions using invariants and state equation in 28 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 : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p1)), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), true]
False Knowledge obtained : [(X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2)))))]
Knowledge based reduction with 6 factoid took 371 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2))]
Finished random walk after 6 steps, including 0 resets, run visited all 4 properties in 2 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT p1)), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), true]
False Knowledge obtained : [(X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p2)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (F (AND (NOT p2) p1)), (F (NOT (AND p0 (NOT p2)))), (F p1), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 6 factoid took 435 ms. Reduced automaton from 3 states, 5 edges and 3 AP to 3 states, 5 edges and 3 AP.
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2))]
// Phase 1: matrix 12 rows 20 cols
[2022-05-16 06:09:09] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 06:09:09] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2022-05-16 06:09:09] [INFO ] [Real]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-16 06:09:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-16 06:09:09] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2022-05-16 06:09:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-16 06:09:09] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2022-05-16 06:09:09] [INFO ] [Nat]Absence check using 7 positive and 2 generalized place invariants in 1 ms returned sat
[2022-05-16 06:09:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-16 06:09:09] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2022-05-16 06:09:09] [INFO ] Computed and/alt/rep : 8/12/8 causal constraints (skipped 0 transitions) in 1 ms.
[2022-05-16 06:09:09] [INFO ] Added : 5 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 22759 reset in 88 ms.
Product exploration explored 100000 steps with 22609 reset in 84 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p2), (OR (NOT p1) (NOT p2))]
Support contains 5 out of 20 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 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 20 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 2 place count 20 transition count 12
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 20 transition count 12
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 3 rules in 5 ms. Remains 20 /20 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2022-05-16 06:09:10] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 20 cols
[2022-05-16 06:09:10] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 06:09:10] [INFO ] Dead Transitions using invariants and state equation in 23 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 22715 reset in 75 ms.
Product exploration explored 100000 steps with 22769 reset in 87 ms.
Built C files in :
/tmp/ltsmin12529435390903958983
[2022-05-16 06:09:10] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12529435390903958983
Running compilation step : cd /tmp/ltsmin12529435390903958983;'/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 84 ms.
Running link step : cd /tmp/ltsmin12529435390903958983;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin12529435390903958983;'/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/stateBased16592000960064201286.hoa' '--buchi-type=spotba'
LTSmin run took 138 ms.
FORMULA CircularTrains-PT-012-LTLCardinality-06 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-012-LTLCardinality-06 finished in 3931 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((false U F((!F(p0) U !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:10] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-16 06:09:10] [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 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 20 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 18 transition count 10
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 18 transition count 9
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 17 transition count 9
Applied a total of 6 rules in 3 ms. Remains 17 /20 variables (removed 3) and now considering 9/12 (removed 3) transitions.
// Phase 1: matrix 9 rows 17 cols
[2022-05-16 06:09:10] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 06:09:10] [INFO ] Implicit Places using invariants in 26 ms returned []
// Phase 1: matrix 9 rows 17 cols
[2022-05-16 06:09:10] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 06:09:10] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 17/24 places, 9/12 transitions.
Finished structural reductions, in 2 iterations. Remains : 17/24 places, 9/12 transitions.
Stuttering acceptance computed with spot in 29 ms :[p0]
Running random walk in product with property : CircularTrains-PT-012-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LEQ s15 s0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 19469 reset in 70 ms.
Stack based approach found an accepted trace after 103 steps with 20 reset with depth 9 and stack size 9 in 1 ms.
FORMULA CircularTrains-PT-012-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property CircularTrains-PT-012-LTLCardinality-09 finished in 211 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((F(G(X((false U p0))))&&p1))||X(p2))))'
Support contains 3 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 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:10] [INFO ] Computed 13 place invariants in 0 ms
[2022-05-16 06:09:10] [INFO ] Implicit Places using invariants in 41 ms returned [15, 20, 21]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 43 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 195 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), true, (NOT p0), (OR (AND (NOT p0) p2) (AND (NOT p1) p2))]
Running random walk in product with property : CircularTrains-PT-012-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=5 dest: 4}, { cond=(AND p1 p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(GT 2 s5), p2:(LEQ 1 s15), p0:(LEQ 1 s17)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 9 reset in 93 ms.
Stack based approach found an accepted trace after 44 steps with 2 reset with depth 41 and stack size 41 in 1 ms.
FORMULA CircularTrains-PT-012-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property CircularTrains-PT-012-LTLCardinality-12 finished in 363 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||(X(F(!p0)) U ((p0&&X(F(!p0)))||G(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:11] [INFO ] Computed 13 place invariants in 1 ms
[2022-05-16 06:09:11] [INFO ] Implicit Places using invariants in 44 ms returned [5, 15, 20, 21]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 47 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 166 ms :[p0, p0, false, false, false]
Running random walk in product with property : CircularTrains-PT-012-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(GT s19 s18)], 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][false, false, false, false, false]]
Product exploration explored 100000 steps with 8475 reset in 87 ms.
Product exploration explored 100000 steps with 8501 reset in 129 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 80 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 161 ms :[p0, false, p0, false, false]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 107 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 174 ms :[p0, false, p0, false, false]
Stuttering acceptance computed with spot in 174 ms :[p0, false, p0, false, false]
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:12] [INFO ] Computed 9 place invariants in 1 ms
[2022-05-16 06:09:12] [INFO ] Implicit Places using invariants in 27 ms returned []
// Phase 1: matrix 12 rows 20 cols
[2022-05-16 06:09:12] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 06:09:12] [INFO ] Implicit Places using invariants and state equation in 28 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:12] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 06:09:12] [INFO ] Dead Transitions using invariants and state equation in 22 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 82 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 174 ms :[p0, false, p0, false, false]
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 86 ms. Reduced automaton from 5 states, 6 edges and 1 AP to 5 states, 6 edges and 1 AP.
Stuttering acceptance computed with spot in 236 ms :[p0, false, p0, false, false]
Stuttering acceptance computed with spot in 157 ms :[p0, false, p0, false, false]
Stuttering acceptance computed with spot in 174 ms :[p0, false, p0, false, false]
Product exploration explored 100000 steps with 8516 reset in 99 ms.
Product exploration explored 100000 steps with 8395 reset in 104 ms.
Applying partial POR strategy [true, true, true, false, false]
Stuttering acceptance computed with spot in 165 ms :[p0, false, p0, false, false]
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 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 20 transition count 12
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 3 rules in 3 ms. Remains 20 /20 variables (removed 0) and now considering 12/12 (removed 0) transitions.
[2022-05-16 06:09:13] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 12 rows 20 cols
[2022-05-16 06:09:13] [INFO ] Computed 9 place invariants in 0 ms
[2022-05-16 06:09:13] [INFO ] Dead Transitions using invariants and state equation in 27 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 8697 reset in 109 ms.
Product exploration explored 100000 steps with 8580 reset in 115 ms.
Built C files in :
/tmp/ltsmin10968791912661658136
[2022-05-16 06:09:14] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10968791912661658136
Running compilation step : cd /tmp/ltsmin10968791912661658136;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 79 ms.
Running link step : cd /tmp/ltsmin10968791912661658136;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin10968791912661658136;'/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/stateBased2210945386815684881.hoa' '--buchi-type=spotba'
LTSmin run took 210 ms.
FORMULA CircularTrains-PT-012-LTLCardinality-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-012-LTLCardinality-13 finished in 3242 ms.
All properties solved by simple procedures.
Total runtime 13564 ms.

BK_STOP 1652681354490

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is CircularTrains-PT-012, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r024-tall-165251918900715"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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