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.r168-tall-165277017300891.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 ProductionCell-PT-none, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277017300891
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 308K
-rw-r--r-- 1 mcc users 8.0K Apr 29 13:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 29 13:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 29 13:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Apr 29 13:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 9 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 9 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 9 08:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 5 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 43K May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ProductionCell-PT-none-LTLCardinality-00
FORMULA_NAME ProductionCell-PT-none-LTLCardinality-01
FORMULA_NAME ProductionCell-PT-none-LTLCardinality-02
FORMULA_NAME ProductionCell-PT-none-LTLCardinality-03
FORMULA_NAME ProductionCell-PT-none-LTLCardinality-04
FORMULA_NAME ProductionCell-PT-none-LTLCardinality-05
FORMULA_NAME ProductionCell-PT-none-LTLCardinality-06
FORMULA_NAME ProductionCell-PT-none-LTLCardinality-07
FORMULA_NAME ProductionCell-PT-none-LTLCardinality-08
FORMULA_NAME ProductionCell-PT-none-LTLCardinality-09
FORMULA_NAME ProductionCell-PT-none-LTLCardinality-10
FORMULA_NAME ProductionCell-PT-none-LTLCardinality-11
FORMULA_NAME ProductionCell-PT-none-LTLCardinality-12
FORMULA_NAME ProductionCell-PT-none-LTLCardinality-13
FORMULA_NAME ProductionCell-PT-none-LTLCardinality-14
FORMULA_NAME ProductionCell-PT-none-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1652980852628

Running Version 202205111006
[2022-05-19 17:20:53] [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-19 17:20:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 17:20:53] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2022-05-19 17:20:53] [INFO ] Transformed 176 places.
[2022-05-19 17:20:53] [INFO ] Transformed 134 transitions.
[2022-05-19 17:20:53] [INFO ] Found NUPN structural information;
[2022-05-19 17:20:53] [INFO ] Parsed PT model containing 176 places and 134 transitions in 168 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA ProductionCell-PT-none-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ProductionCell-PT-none-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ProductionCell-PT-none-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ProductionCell-PT-none-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ProductionCell-PT-none-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ProductionCell-PT-none-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ProductionCell-PT-none-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ProductionCell-PT-none-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ProductionCell-PT-none-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 134/134 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 173 transition count 131
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 173 transition count 131
Applied a total of 6 rules in 26 ms. Remains 173 /176 variables (removed 3) and now considering 131/134 (removed 3) transitions.
// Phase 1: matrix 131 rows 173 cols
[2022-05-19 17:20:54] [INFO ] Computed 50 place invariants in 10 ms
[2022-05-19 17:20:54] [INFO ] Implicit Places using invariants in 221 ms returned [36, 42, 58, 62, 127, 133, 134, 138]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 247 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 165/176 places, 131/134 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 164 transition count 129
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 164 transition count 129
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 163 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 163 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 162 transition count 127
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 162 transition count 127
Applied a total of 6 rules in 23 ms. Remains 162 /165 variables (removed 3) and now considering 127/131 (removed 4) transitions.
// Phase 1: matrix 127 rows 162 cols
[2022-05-19 17:20:54] [INFO ] Computed 42 place invariants in 3 ms
[2022-05-19 17:20:54] [INFO ] Implicit Places using invariants in 91 ms returned []
// Phase 1: matrix 127 rows 162 cols
[2022-05-19 17:20:54] [INFO ] Computed 42 place invariants in 3 ms
[2022-05-19 17:20:54] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 256 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 162/176 places, 127/134 transitions.
Finished structural reductions, in 2 iterations. Remains : 162/176 places, 127/134 transitions.
Support contains 26 out of 162 places after structural reductions.
[2022-05-19 17:20:54] [INFO ] Flatten gal took : 36 ms
[2022-05-19 17:20:54] [INFO ] Flatten gal took : 15 ms
[2022-05-19 17:20:54] [INFO ] Input system was already deterministic with 127 transitions.
Support contains 25 out of 162 places (down from 26) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 259 ms. (steps per millisecond=38 ) properties (out of 16) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 127 rows 162 cols
[2022-05-19 17:20:55] [INFO ] Computed 42 place invariants in 5 ms
[2022-05-19 17:20:55] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-19 17:20:55] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2022-05-19 17:20:55] [INFO ] [Nat]Absence check using 33 positive and 9 generalized place invariants in 3 ms returned sat
[2022-05-19 17:20:55] [INFO ] After 48ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA ProductionCell-PT-none-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ProductionCell-PT-none-LTLCardinality-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 5 simplifications.
Computed a total of 21 stabilizing places and 25 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U X(!X(p0)))))'
Support contains 2 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 127/127 transitions.
Applied a total of 0 rules in 3 ms. Remains 162 /162 variables (removed 0) and now considering 127/127 (removed 0) transitions.
// Phase 1: matrix 127 rows 162 cols
[2022-05-19 17:20:55] [INFO ] Computed 42 place invariants in 4 ms
[2022-05-19 17:20:55] [INFO ] Implicit Places using invariants in 81 ms returned []
// Phase 1: matrix 127 rows 162 cols
[2022-05-19 17:20:55] [INFO ] Computed 42 place invariants in 5 ms
[2022-05-19 17:20:55] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
// Phase 1: matrix 127 rows 162 cols
[2022-05-19 17:20:55] [INFO ] Computed 42 place invariants in 1 ms
[2022-05-19 17:20:55] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 162/162 places, 127/127 transitions.
Stuttering acceptance computed with spot in 239 ms :[true, p0, p0, p0, p0]
Running random walk in product with property : ProductionCell-PT-none-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=p0, acceptance={0} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(OR (EQ s45 0) (EQ s42 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 2 ms.
FORMULA ProductionCell-PT-none-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ProductionCell-PT-none-LTLCardinality-03 finished in 573 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(X(p0) U G((G(F(X(G(F(p2)))))||p1))))'
Support contains 4 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 127/127 transitions.
Applied a total of 0 rules in 4 ms. Remains 162 /162 variables (removed 0) and now considering 127/127 (removed 0) transitions.
// Phase 1: matrix 127 rows 162 cols
[2022-05-19 17:20:55] [INFO ] Computed 42 place invariants in 4 ms
[2022-05-19 17:20:56] [INFO ] Implicit Places using invariants in 77 ms returned []
// Phase 1: matrix 127 rows 162 cols
[2022-05-19 17:20:56] [INFO ] Computed 42 place invariants in 2 ms
[2022-05-19 17:20:56] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
// Phase 1: matrix 127 rows 162 cols
[2022-05-19 17:20:56] [INFO ] Computed 42 place invariants in 2 ms
[2022-05-19 17:20:56] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 162/162 places, 127/127 transitions.
Stuttering acceptance computed with spot in 256 ms :[(OR p1 p2), p2, p1, (AND p1 p0)]
Running random walk in product with property : ProductionCell-PT-none-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=p2, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s33 0) (EQ s157 1)), p2:(OR (EQ s33 0) (EQ s157 1)), p0:(OR (EQ s18 0) (EQ s147 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 3 reset in 260 ms.
Stack based approach found an accepted trace after 363 steps with 0 reset with depth 364 and stack size 359 in 1 ms.
FORMULA ProductionCell-PT-none-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ProductionCell-PT-none-LTLCardinality-04 finished in 839 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(G(X(F(p0))))&&F(p1)&&X(p2)))))'
Support contains 6 out of 162 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 162/162 places, 127/127 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 162 transition count 122
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 157 transition count 122
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 10 place count 157 transition count 96
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 62 place count 131 transition count 96
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 80 place count 122 transition count 87
Applied a total of 80 rules in 35 ms. Remains 122 /162 variables (removed 40) and now considering 87/127 (removed 40) transitions.
// Phase 1: matrix 87 rows 122 cols
[2022-05-19 17:20:56] [INFO ] Computed 42 place invariants in 1 ms
[2022-05-19 17:20:56] [INFO ] Implicit Places using invariants in 65 ms returned [20, 21, 69, 70, 71, 72]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 69 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 116/162 places, 87/127 transitions.
Applied a total of 0 rules in 4 ms. Remains 116 /116 variables (removed 0) and now considering 87/87 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 116/162 places, 87/127 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ProductionCell-PT-none-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(OR (EQ s49 0) (EQ s22 1)), p0:(AND (EQ s69 0) (EQ s31 1)), p1:(OR (EQ s11 0) (EQ s46 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 127 reset in 189 ms.
Stack based approach found an accepted trace after 347 steps with 1 reset with depth 346 and stack size 346 in 1 ms.
FORMULA ProductionCell-PT-none-LTLCardinality-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ProductionCell-PT-none-LTLCardinality-05 finished in 430 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(!(p0 U G(p1)) U X(((p2 U p1)&&p2))))'
Support contains 5 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 127/127 transitions.
Applied a total of 0 rules in 4 ms. Remains 162 /162 variables (removed 0) and now considering 127/127 (removed 0) transitions.
// Phase 1: matrix 127 rows 162 cols
[2022-05-19 17:20:57] [INFO ] Computed 42 place invariants in 1 ms
[2022-05-19 17:20:57] [INFO ] Implicit Places using invariants in 63 ms returned []
// Phase 1: matrix 127 rows 162 cols
[2022-05-19 17:20:57] [INFO ] Computed 42 place invariants in 4 ms
[2022-05-19 17:20:57] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
// Phase 1: matrix 127 rows 162 cols
[2022-05-19 17:20:57] [INFO ] Computed 42 place invariants in 1 ms
[2022-05-19 17:20:57] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 162/162 places, 127/127 transitions.
Stuttering acceptance computed with spot in 378 ms :[(AND p1 p2), (AND p1 p2), false, false, true, p1, false, false, (NOT p1), false, (NOT p1)]
Running random walk in product with property : ProductionCell-PT-none-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 p2), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 6}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=p1, acceptance={} source=3 dest: 7}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=6 dest: 5}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=6 dest: 8}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=6 dest: 9}, { cond=(AND p1 p0 p2), acceptance={} source=6 dest: 10}], [{ cond=(AND (NOT p1) p2), acceptance={} source=7 dest: 5}, { cond=(AND p1 p2), acceptance={} source=7 dest: 8}], [{ cond=(NOT p1), acceptance={} source=8 dest: 4}, { cond=p1, acceptance={} source=8 dest: 8}], [{ cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=9 dest: 8}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=9 dest: 10}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=10 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=10 dest: 8}, { cond=(AND p1 p0), acceptance={} source=10 dest: 10}, { cond=(AND (NOT p1) p0), acceptance={0} source=10 dest: 10}]], initial=0, aps=[p1:(OR (EQ s98 0) (EQ s9 1)), p0:(OR (EQ s105 0) (EQ s30 1)), p2:(EQ s65 1)], nbAcceptance=1, 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 33190 reset in 230 ms.
Product exploration explored 100000 steps with 33496 reset in 213 ms.
Computed a total of 21 stabilizing places and 25 stable transitions
Computed a total of 21 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X (NOT (AND p1 p2)))), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X p1)), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 945 ms. Reduced automaton from 11 states, 34 edges and 3 AP to 11 states, 34 edges and 3 AP.
Stuttering acceptance computed with spot in 380 ms :[(AND p1 p2), (AND p1 p2), false, false, true, p1, false, false, (NOT p1), false, (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 269 ms. (steps per millisecond=37 ) properties (out of 14) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 127 rows 162 cols
[2022-05-19 17:21:00] [INFO ] Computed 42 place invariants in 1 ms
[2022-05-19 17:21:00] [INFO ] After 34ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 17:21:00] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2022-05-19 17:21:00] [INFO ] [Nat]Absence check using 33 positive and 9 generalized place invariants in 4 ms returned sat
[2022-05-19 17:21:00] [INFO ] After 65ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 17:21:00] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 3 ms to minimize.
[2022-05-19 17:21:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2022-05-19 17:21:00] [INFO ] After 119ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2022-05-19 17:21:00] [INFO ] After 176ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 5 out of 162 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 162/162 places, 127/127 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 162 transition count 122
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 157 transition count 122
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 10 place count 157 transition count 97
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 60 place count 132 transition count 97
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 78 place count 123 transition count 88
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 81 place count 123 transition count 85
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 84 place count 120 transition count 85
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 88 place count 120 transition count 85
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 119 transition count 84
Applied a total of 89 rules in 22 ms. Remains 119 /162 variables (removed 43) and now considering 84/127 (removed 43) transitions.
Finished structural reductions, in 1 iterations. Remains : 119/162 places, 84/127 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Finished Best-First random walk after 6451 steps, including 1 resets, run visited all 1 properties in 6 ms. (steps per millisecond=1075 )
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (X (NOT (AND p1 p2)))), true, (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X p1)), (X (X (NOT (AND p1 p0 p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0) p2))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) p1 p2)), (F (AND p0 p1 p2)), (F (AND (NOT p1) p2)), (F (AND p1 p2)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT p0)), (F (NOT (AND p0 p1 (NOT p2)))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 18 factoid took 1293 ms. Reduced automaton from 11 states, 34 edges and 3 AP to 11 states, 34 edges and 3 AP.
Stuttering acceptance computed with spot in 394 ms :[(AND p1 p2), (AND p1 p2), false, false, true, p1, false, false, (NOT p1), false, (NOT p1)]
Stuttering acceptance computed with spot in 437 ms :[(AND p1 p2), (AND p1 p2), false, false, true, p1, false, false, (NOT p1), false, (NOT p1)]
Support contains 5 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 127/127 transitions.
Applied a total of 0 rules in 3 ms. Remains 162 /162 variables (removed 0) and now considering 127/127 (removed 0) transitions.
// Phase 1: matrix 127 rows 162 cols
[2022-05-19 17:21:02] [INFO ] Computed 42 place invariants in 3 ms
[2022-05-19 17:21:02] [INFO ] Implicit Places using invariants in 102 ms returned []
// Phase 1: matrix 127 rows 162 cols
[2022-05-19 17:21:02] [INFO ] Computed 42 place invariants in 3 ms
[2022-05-19 17:21:02] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 225 ms to find 0 implicit places.
// Phase 1: matrix 127 rows 162 cols
[2022-05-19 17:21:02] [INFO ] Computed 42 place invariants in 2 ms
[2022-05-19 17:21:02] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 162/162 places, 127/127 transitions.
Computed a total of 21 stabilizing places and 25 stable transitions
Computed a total of 21 stabilizing places and 25 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p1) p2))), (X p1), (X p0), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 18 factoid took 927 ms. Reduced automaton from 11 states, 34 edges and 3 AP to 11 states, 34 edges and 3 AP.
Stuttering acceptance computed with spot in 351 ms :[(AND p1 p2), (AND p1 p2), false, false, true, p1, false, false, (NOT p1), false, (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 233 ms. (steps per millisecond=42 ) properties (out of 14) seen :10
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :2
Running SMT prover for 1 properties.
// Phase 1: matrix 127 rows 162 cols
[2022-05-19 17:21:04] [INFO ] Computed 42 place invariants in 1 ms
[2022-05-19 17:21:04] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-19 17:21:04] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2022-05-19 17:21:04] [INFO ] [Nat]Absence check using 33 positive and 9 generalized place invariants in 4 ms returned sat
[2022-05-19 17:21:04] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-19 17:21:04] [INFO ] After 75ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2022-05-19 17:21:04] [INFO ] After 127ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 5 out of 162 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 162/162 places, 127/127 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 162 transition count 122
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 157 transition count 122
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 10 place count 157 transition count 97
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 60 place count 132 transition count 97
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 78 place count 123 transition count 88
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 81 place count 123 transition count 85
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 84 place count 120 transition count 85
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 88 place count 120 transition count 85
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 119 transition count 84
Applied a total of 89 rules in 20 ms. Remains 119 /162 variables (removed 43) and now considering 84/127 (removed 43) transitions.
Finished structural reductions, in 1 iterations. Remains : 119/162 places, 84/127 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Finished Best-First random walk after 3086 steps, including 0 resets, run visited all 1 properties in 4 ms. (steps per millisecond=771 )
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p1) p2))), (X p1), (X p0), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X p1)), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) p2)), (F (AND (NOT p0) p1 p2)), (F (AND p0 p1 p2)), (F (AND (NOT p1) p2)), (F (AND p1 p2)), (F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1) p2)), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (NOT p0)), (F (NOT (AND p0 p1 (NOT p2)))), (F (AND (NOT p0) p1 (NOT p2)))]
Knowledge based reduction with 18 factoid took 1224 ms. Reduced automaton from 11 states, 34 edges and 3 AP to 11 states, 34 edges and 3 AP.
Stuttering acceptance computed with spot in 452 ms :[(AND p1 p2), (AND p1 p2), false, false, true, p1, false, false, (NOT p1), false, (NOT p1)]
Stuttering acceptance computed with spot in 460 ms :[(AND p1 p2), (AND p1 p2), false, false, true, p1, false, false, (NOT p1), false, (NOT p1)]
Stuttering acceptance computed with spot in 401 ms :[(AND p1 p2), (AND p1 p2), false, false, true, p1, false, false, (NOT p1), false, (NOT p1)]
Product exploration explored 100000 steps with 33317 reset in 216 ms.
Product exploration explored 100000 steps with 33329 reset in 221 ms.
Applying partial POR strategy [false, true, false, false, true, true, true, true, true, true, true]
Stuttering acceptance computed with spot in 371 ms :[(AND p1 p2), (AND p1 p2), false, false, true, p1, false, false, (NOT p1), false, (NOT p1)]
Support contains 5 out of 162 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 162/162 places, 127/127 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 162 transition count 127
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 25 Pre rules applied. Total rules applied 5 place count 162 transition count 128
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 30 place count 162 transition count 128
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 32 place count 160 transition count 126
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 34 place count 160 transition count 126
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 43 place count 160 transition count 126
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 44 place count 159 transition count 125
Deduced a syphon composed of 36 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 45 place count 159 transition count 125
Deduced a syphon composed of 36 places in 0 ms
Applied a total of 45 rules in 29 ms. Remains 159 /162 variables (removed 3) and now considering 125/127 (removed 2) transitions.
[2022-05-19 17:21:08] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 125 rows 159 cols
[2022-05-19 17:21:08] [INFO ] Computed 42 place invariants in 1 ms
[2022-05-19 17:21:08] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 159/162 places, 125/127 transitions.
Finished structural reductions, in 1 iterations. Remains : 159/162 places, 125/127 transitions.
Product exploration explored 100000 steps with 33139 reset in 599 ms.
Product exploration explored 100000 steps with 33276 reset in 584 ms.
Built C files in :
/tmp/ltsmin6529302848275466881
[2022-05-19 17:21:09] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6529302848275466881
Running compilation step : cd /tmp/ltsmin6529302848275466881;'/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 308 ms.
Running link step : cd /tmp/ltsmin6529302848275466881;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin6529302848275466881;'/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/stateBased8386527898043245733.hoa' '--buchi-type=spotba'
LTSmin run took 1628 ms.
FORMULA ProductionCell-PT-none-LTLCardinality-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ProductionCell-PT-none-LTLCardinality-07 finished in 14228 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(F(X(X(F(p0))))))))'
Support contains 2 out of 162 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 162/162 places, 127/127 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 161 transition count 121
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 156 transition count 121
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 27 Pre rules applied. Total rules applied 10 place count 156 transition count 94
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 64 place count 129 transition count 94
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 84 place count 119 transition count 84
Applied a total of 84 rules in 17 ms. Remains 119 /162 variables (removed 43) and now considering 84/127 (removed 43) transitions.
// Phase 1: matrix 84 rows 119 cols
[2022-05-19 17:21:11] [INFO ] Computed 42 place invariants in 1 ms
[2022-05-19 17:21:11] [INFO ] Implicit Places using invariants in 73 ms returned [19, 20, 66, 67, 68, 69]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 73 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 113/162 places, 84/127 transitions.
Applied a total of 0 rules in 4 ms. Remains 113 /113 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 113/162 places, 84/127 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ProductionCell-PT-none-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s48 0) (EQ s42 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 9751 reset in 182 ms.
Product exploration explored 100000 steps with 9767 reset in 183 ms.
Computed a total of 14 stabilizing places and 18 stable transitions
Computed a total of 14 stabilizing places and 18 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Finished random walk after 8 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=8 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 84 rows 113 cols
[2022-05-19 17:21:12] [INFO ] Computed 36 place invariants in 1 ms
[2022-05-19 17:21:12] [INFO ] [Real]Absence check using 30 positive place invariants in 5 ms returned sat
[2022-05-19 17:21:12] [INFO ] [Real]Absence check using 30 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-19 17:21:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 17:21:12] [INFO ] [Real]Absence check using state equation in 43 ms returned sat
[2022-05-19 17:21:12] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 17:21:12] [INFO ] [Nat]Absence check using 30 positive place invariants in 5 ms returned sat
[2022-05-19 17:21:12] [INFO ] [Nat]Absence check using 30 positive and 6 generalized place invariants in 5 ms returned sat
[2022-05-19 17:21:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 17:21:12] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2022-05-19 17:21:12] [INFO ] Computed and/alt/rep : 79/176/79 causal constraints (skipped 2 transitions) in 6 ms.
[2022-05-19 17:21:12] [INFO ] Added : 73 causal constraints over 15 iterations in 146 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 84/84 transitions.
Applied a total of 0 rules in 8 ms. Remains 113 /113 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 113 cols
[2022-05-19 17:21:12] [INFO ] Computed 36 place invariants in 1 ms
[2022-05-19 17:21:12] [INFO ] Implicit Places using invariants in 74 ms returned []
// Phase 1: matrix 84 rows 113 cols
[2022-05-19 17:21:12] [INFO ] Computed 36 place invariants in 0 ms
[2022-05-19 17:21:12] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2022-05-19 17:21:12] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 84 rows 113 cols
[2022-05-19 17:21:12] [INFO ] Computed 36 place invariants in 0 ms
[2022-05-19 17:21:13] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 113/113 places, 84/84 transitions.
Computed a total of 14 stabilizing places and 18 stable transitions
Computed a total of 14 stabilizing places and 18 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Finished random walk after 20 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 134 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 84 rows 113 cols
[2022-05-19 17:21:13] [INFO ] Computed 36 place invariants in 1 ms
[2022-05-19 17:21:13] [INFO ] [Real]Absence check using 30 positive place invariants in 4 ms returned sat
[2022-05-19 17:21:13] [INFO ] [Real]Absence check using 30 positive and 6 generalized place invariants in 1 ms returned sat
[2022-05-19 17:21:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 17:21:13] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2022-05-19 17:21:13] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 17:21:13] [INFO ] [Nat]Absence check using 30 positive place invariants in 5 ms returned sat
[2022-05-19 17:21:13] [INFO ] [Nat]Absence check using 30 positive and 6 generalized place invariants in 2 ms returned sat
[2022-05-19 17:21:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 17:21:13] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2022-05-19 17:21:13] [INFO ] Computed and/alt/rep : 79/176/79 causal constraints (skipped 2 transitions) in 9 ms.
[2022-05-19 17:21:13] [INFO ] Added : 73 causal constraints over 15 iterations in 136 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 9807 reset in 161 ms.
Product exploration explored 100000 steps with 9686 reset in 167 ms.
Built C files in :
/tmp/ltsmin14042646569716912331
[2022-05-19 17:21:14] [INFO ] Computing symmetric may disable matrix : 84 transitions.
[2022-05-19 17:21:14] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 17:21:14] [INFO ] Computing symmetric may enable matrix : 84 transitions.
[2022-05-19 17:21:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 17:21:14] [INFO ] Computing Do-Not-Accords matrix : 84 transitions.
[2022-05-19 17:21:14] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 17:21:14] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14042646569716912331
Running compilation step : cd /tmp/ltsmin14042646569716912331;'/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 189 ms.
Running link step : cd /tmp/ltsmin14042646569716912331;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin14042646569716912331;'/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/stateBased1909418390027226088.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 113 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 113/113 places, 84/84 transitions.
Applied a total of 0 rules in 12 ms. Remains 113 /113 variables (removed 0) and now considering 84/84 (removed 0) transitions.
// Phase 1: matrix 84 rows 113 cols
[2022-05-19 17:21:29] [INFO ] Computed 36 place invariants in 2 ms
[2022-05-19 17:21:29] [INFO ] Implicit Places using invariants in 67 ms returned []
// Phase 1: matrix 84 rows 113 cols
[2022-05-19 17:21:29] [INFO ] Computed 36 place invariants in 2 ms
[2022-05-19 17:21:29] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2022-05-19 17:21:29] [INFO ] Redundant transitions in 1 ms returned []
// Phase 1: matrix 84 rows 113 cols
[2022-05-19 17:21:29] [INFO ] Computed 36 place invariants in 1 ms
[2022-05-19 17:21:29] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 113/113 places, 84/84 transitions.
Built C files in :
/tmp/ltsmin1855040709664547865
[2022-05-19 17:21:29] [INFO ] Computing symmetric may disable matrix : 84 transitions.
[2022-05-19 17:21:29] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 17:21:29] [INFO ] Computing symmetric may enable matrix : 84 transitions.
[2022-05-19 17:21:29] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 17:21:29] [INFO ] Computing Do-Not-Accords matrix : 84 transitions.
[2022-05-19 17:21:29] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-19 17:21:29] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1855040709664547865
Running compilation step : cd /tmp/ltsmin1855040709664547865;'/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 183 ms.
Running link step : cd /tmp/ltsmin1855040709664547865;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin1855040709664547865;'/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/stateBased13478846746033733994.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2022-05-19 17:21:44] [INFO ] Flatten gal took : 8 ms
[2022-05-19 17:21:44] [INFO ] Flatten gal took : 8 ms
[2022-05-19 17:21:44] [INFO ] Time to serialize gal into /tmp/LTL17263752571936678672.gal : 2 ms
[2022-05-19 17:21:44] [INFO ] Time to serialize properties into /tmp/LTL4938652109827037112.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17263752571936678672.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4938652109827037112.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1726375...267
Read 1 LTL properties
Checking formula 0 : !((X(F(G(F(X(X(F("((p75==0)&&(p66==1))")))))))))
Formula 0 simplified : !XFGFXXF"((p75==0)&&(p66==1))"
Reverse transition relation is NOT exact ! Due to transitions t43, t49, t123, t18.t15, t34.t111.t35, t24.t116.t25, Intersection with reachable at each ste...212
Detected timeout of ITS tools.
[2022-05-19 17:21:59] [INFO ] Flatten gal took : 8 ms
[2022-05-19 17:21:59] [INFO ] Applying decomposition
[2022-05-19 17:21:59] [INFO ] Flatten gal took : 7 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph2113394189757989277.txt' '-o' '/tmp/graph2113394189757989277.bin' '-w' '/tmp/graph2113394189757989277.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph2113394189757989277.bin' '-l' '-1' '-v' '-w' '/tmp/graph2113394189757989277.weights' '-q' '0' '-e' '0.001'
[2022-05-19 17:21:59] [INFO ] Decomposing Gal with order
[2022-05-19 17:21:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 17:21:59] [INFO ] Removed a total of 27 redundant transitions.
[2022-05-19 17:21:59] [INFO ] Flatten gal took : 36 ms
[2022-05-19 17:21:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2022-05-19 17:21:59] [INFO ] Time to serialize gal into /tmp/LTL10289979639950341044.gal : 4 ms
[2022-05-19 17:21:59] [INFO ] Time to serialize properties into /tmp/LTL17744827171702120165.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10289979639950341044.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17744827171702120165.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1028997...247
Read 1 LTL properties
Checking formula 0 : !((X(F(G(F(X(X(F("((i6.u15.p75==0)&&(i6.u15.p66==1))")))))))))
Formula 0 simplified : !XFGFXXF"((i6.u15.p75==0)&&(i6.u15.p66==1))"
Reverse transition relation is NOT exact ! Due to transitions t34_t111_t35, t24_t116_t25, u3.t43, u3.t49, i6.u20.t123, i8.u24.t18.t15, Intersection with r...232
4 unique states visited
4 strongly connected components in search stack
5 transitions explored
4 items max in DFS search stack
94 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,0.954667,57328,1,0,110156,1162,1556,106051,552,4265,137573
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ProductionCell-PT-none-LTLCardinality-11 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ProductionCell-PT-none-LTLCardinality-11 finished in 49498 ms.
All properties solved by simple procedures.
Total runtime 67291 ms.

BK_STOP 1652980921060

--------------------
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="ProductionCell-PT-none"
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 ProductionCell-PT-none, 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 r168-tall-165277017300891"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ProductionCell-PT-none.tgz
mv ProductionCell-PT-none 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 ;