Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r150-smll-165276998600268.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 ParamProductionCell-PT-2, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r150-smll-165276998600268
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 432K
-rw-r--r-- 1 mcc users 9.0K Apr 29 17:39 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Apr 29 17:39 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 29 17:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 29 17:38 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 4.0K May 9 08:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K May 9 08:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 9 08:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 08:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 08:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 174K 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 ParamProductionCell-PT-2-LTLFireability-00
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-01
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-02
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-03
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-04
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-05
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-06
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-07
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-08
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-09
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-10
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-11
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-12
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-13
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-14
FORMULA_NAME ParamProductionCell-PT-2-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1653049836627

Running Version 202205111006
[2022-05-20 12:30:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 12:30:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 12:30:38] [INFO ] Load time of PNML (sax parser for PT used): 194 ms
[2022-05-20 12:30:38] [INFO ] Transformed 231 places.
[2022-05-20 12:30:38] [INFO ] Transformed 202 transitions.
[2022-05-20 12:30:38] [INFO ] Found NUPN structural information;
[2022-05-20 12:30:38] [INFO ] Parsed PT model containing 231 places and 202 transitions in 365 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ParamProductionCell-PT-2-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-2-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 56 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 226 transition count 197
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 226 transition count 197
Applied a total of 10 rules in 89 ms. Remains 226 /231 variables (removed 5) and now considering 197/202 (removed 5) transitions.
// Phase 1: matrix 197 rows 226 cols
[2022-05-20 12:30:39] [INFO ] Computed 59 place invariants in 32 ms
[2022-05-20 12:30:40] [INFO ] Implicit Places using invariants in 836 ms returned [18, 19, 24, 31, 35, 36, 41, 42, 59, 64, 73, 78, 98, 113, 118, 119, 163, 165, 166, 192, 195, 201, 202, 206]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 906 ms to find 24 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 202/231 places, 197/202 transitions.
Applied a total of 0 rules in 23 ms. Remains 202 /202 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 202/231 places, 197/202 transitions.
Support contains 56 out of 202 places after structural reductions.
[2022-05-20 12:30:40] [INFO ] Flatten gal took : 104 ms
[2022-05-20 12:30:40] [INFO ] Flatten gal took : 42 ms
[2022-05-20 12:30:40] [INFO ] Input system was already deterministic with 197 transitions.
Finished random walk after 304 steps, including 0 resets, run visited all 31 properties in 117 ms. (steps per millisecond=2 )
FORMULA ParamProductionCell-PT-2-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
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' '!(G(F((G(p0)||p1))))'
Support contains 4 out of 202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 202/202 places, 197/197 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 202 transition count 189
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 194 transition count 189
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 19 Pre rules applied. Total rules applied 16 place count 194 transition count 170
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 54 place count 175 transition count 170
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 174 transition count 169
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 174 transition count 169
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 122 place count 141 transition count 136
Applied a total of 122 rules in 92 ms. Remains 141 /202 variables (removed 61) and now considering 136/197 (removed 61) transitions.
// Phase 1: matrix 136 rows 141 cols
[2022-05-20 12:30:41] [INFO ] Computed 35 place invariants in 4 ms
[2022-05-20 12:30:42] [INFO ] Implicit Places using invariants in 388 ms returned [11, 12, 23, 24, 36, 44, 54, 56, 67, 69, 100, 101, 122, 125, 136]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 391 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 126/202 places, 136/197 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 126 transition count 132
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 122 transition count 131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 121 transition count 131
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 10 place count 121 transition count 130
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 120 transition count 130
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 78 place count 87 transition count 97
Applied a total of 78 rules in 35 ms. Remains 87 /126 variables (removed 39) and now considering 97/136 (removed 39) transitions.
// Phase 1: matrix 97 rows 87 cols
[2022-05-20 12:30:42] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-20 12:30:42] [INFO ] Implicit Places using invariants in 148 ms returned []
// Phase 1: matrix 97 rows 87 cols
[2022-05-20 12:30:42] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-20 12:30:42] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:30:42] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 510 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 87/202 places, 97/197 transitions.
Finished structural reductions, in 2 iterations. Remains : 87/202 places, 97/197 transitions.
Stuttering acceptance computed with spot in 317 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s45 0) (EQ s47 0)), p1:(AND (EQ s0 1) (EQ s73 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 666 reset in 438 ms.
Product exploration explored 100000 steps with 656 reset in 423 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 3 factoid took 301 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 85 steps, including 0 resets, run visited all 2 properties in 5 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 319 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 97/97 transitions.
Applied a total of 0 rules in 9 ms. Remains 87 /87 variables (removed 0) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 87 cols
[2022-05-20 12:30:44] [INFO ] Computed 20 place invariants in 5 ms
[2022-05-20 12:30:45] [INFO ] Implicit Places using invariants in 203 ms returned []
// Phase 1: matrix 97 rows 87 cols
[2022-05-20 12:30:45] [INFO ] Computed 20 place invariants in 3 ms
[2022-05-20 12:30:45] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:30:45] [INFO ] Implicit Places using invariants and state equation in 317 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
[2022-05-20 12:30:45] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 97 rows 87 cols
[2022-05-20 12:30:45] [INFO ] Computed 20 place invariants in 4 ms
[2022-05-20 12:30:45] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 87/87 places, 97/97 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 3 factoid took 396 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 73 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 335 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 662 reset in 242 ms.
Product exploration explored 100000 steps with 661 reset in 550 ms.
Built C files in :
/tmp/ltsmin13784912774869559638
[2022-05-20 12:30:47] [INFO ] Computing symmetric may disable matrix : 97 transitions.
[2022-05-20 12:30:47] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:30:47] [INFO ] Computing symmetric may enable matrix : 97 transitions.
[2022-05-20 12:30:47] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:30:47] [INFO ] Computing Do-Not-Accords matrix : 97 transitions.
[2022-05-20 12:30:47] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:30:47] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13784912774869559638
Running compilation step : cd /tmp/ltsmin13784912774869559638;'/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 455 ms.
Running link step : cd /tmp/ltsmin13784912774869559638;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin13784912774869559638;'/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/stateBased15837431068119108590.hoa' '--buchi-type=spotba'
LTSmin run took 661 ms.
FORMULA ParamProductionCell-PT-2-LTLFireability-00 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-2-LTLFireability-00 finished in 7157 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(X((!(p0 U p1)&&(F(p2)||X(X(F(p3))))))))'
Support contains 9 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 201 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 201 transition count 196
Applied a total of 2 rules in 11 ms. Remains 201 /202 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 201 cols
[2022-05-20 12:30:48] [INFO ] Computed 35 place invariants in 5 ms
[2022-05-20 12:30:49] [INFO ] Implicit Places using invariants in 326 ms returned [15, 16, 38, 39, 55, 67, 88, 100, 102, 144, 174, 192]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 331 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 189/202 places, 196/197 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 187 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 187 transition count 194
Applied a total of 4 rules in 7 ms. Remains 187 /189 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 187 cols
[2022-05-20 12:30:49] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-20 12:30:49] [INFO ] Implicit Places using invariants in 160 ms returned []
// Phase 1: matrix 194 rows 187 cols
[2022-05-20 12:30:49] [INFO ] Computed 23 place invariants in 3 ms
[2022-05-20 12:30:49] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:30:49] [INFO ] Implicit Places using invariants and state equation in 580 ms returned []
Implicit Place search using SMT with State Equation took 747 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 187/202 places, 194/197 transitions.
Finished structural reductions, in 2 iterations. Remains : 187/202 places, 194/197 transitions.
Stuttering acceptance computed with spot in 347 ms :[(OR p1 (AND (NOT p2) (NOT p3))), (OR p1 (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3)), p1, (AND (NOT p2) (NOT p3))]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=p1, acceptance={0} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s132 1) (EQ s133 1) (EQ s137 1)), p2:(OR (EQ s50 0) (EQ s57 0)), p0:(AND (EQ s159 1) (EQ s177 1)), p3:(AND (EQ s80 1) (EQ s83 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 282 ms.
Product exploration explored 100000 steps with 50000 reset in 288 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 p1) p2 (NOT p0) (NOT p3)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p2)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) p2 (NOT p0) (NOT p3))
Knowledge based reduction with 8 factoid took 353 ms. Reduced automaton from 5 states, 8 edges and 4 AP to 1 states, 0 edges and 0 AP.
FORMULA ParamProductionCell-PT-2-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-2-LTLFireability-02 finished in 2399 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((G(p0)||p1))||X(p0))))'
Support contains 6 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 201 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 201 transition count 196
Applied a total of 2 rules in 9 ms. Remains 201 /202 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 201 cols
[2022-05-20 12:30:51] [INFO ] Computed 35 place invariants in 3 ms
[2022-05-20 12:30:51] [INFO ] Implicit Places using invariants in 287 ms returned [15, 16, 38, 39, 55, 67, 88, 100, 102, 143, 144, 171, 192]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 303 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/202 places, 196/197 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 186 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 186 transition count 194
Applied a total of 4 rules in 7 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2022-05-20 12:30:51] [INFO ] Computed 22 place invariants in 4 ms
[2022-05-20 12:30:51] [INFO ] Implicit Places using invariants in 211 ms returned []
// Phase 1: matrix 194 rows 186 cols
[2022-05-20 12:30:51] [INFO ] Computed 22 place invariants in 3 ms
[2022-05-20 12:30:51] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:30:52] [INFO ] Implicit Places using invariants and state equation in 635 ms returned []
Implicit Place search using SMT with State Equation took 848 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/202 places, 194/197 transitions.
Finished structural reductions, in 2 iterations. Remains : 186/202 places, 194/197 transitions.
Stuttering acceptance computed with spot in 249 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=(AND p1 p0), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 5}]], initial=1, aps=[p1:(AND (EQ s80 1) (EQ s83 1) (OR (EQ s160 0) (EQ s175 0))), p0:(AND (EQ s174 1) (EQ s181 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-2-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-2-LTLFireability-04 finished in 1445 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(!(p0 U p1))))'
Support contains 4 out of 202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 202/202 places, 197/197 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 202 transition count 189
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 194 transition count 189
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 16 place count 194 transition count 173
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 48 place count 178 transition count 173
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 49 place count 177 transition count 172
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 177 transition count 172
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 1 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 116 place count 144 transition count 139
Applied a total of 116 rules in 35 ms. Remains 144 /202 variables (removed 58) and now considering 139/197 (removed 58) transitions.
// Phase 1: matrix 139 rows 144 cols
[2022-05-20 12:30:52] [INFO ] Computed 35 place invariants in 2 ms
[2022-05-20 12:30:52] [INFO ] Implicit Places using invariants in 277 ms returned [12, 13, 24, 25, 37, 44, 54, 56, 67, 69, 100, 101, 125, 137]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 301 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/202 places, 139/197 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 130 transition count 135
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 126 transition count 133
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 124 transition count 133
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 12 place count 124 transition count 131
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 16 place count 122 transition count 131
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 80 place count 90 transition count 99
Applied a total of 80 rules in 14 ms. Remains 90 /130 variables (removed 40) and now considering 99/139 (removed 40) transitions.
// Phase 1: matrix 99 rows 90 cols
[2022-05-20 12:30:52] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 12:30:53] [INFO ] Implicit Places using invariants in 152 ms returned []
// Phase 1: matrix 99 rows 90 cols
[2022-05-20 12:30:53] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-20 12:30:53] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:30:53] [INFO ] Implicit Places using invariants and state equation in 332 ms returned []
Implicit Place search using SMT with State Equation took 486 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 90/202 places, 99/197 transitions.
Finished structural reductions, in 2 iterations. Remains : 90/202 places, 99/197 transitions.
Stuttering acceptance computed with spot in 136 ms :[p1, p1]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=p1, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s74 1) (EQ s84 1)), p0:(AND (EQ s2 1) (EQ s73 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1857 reset in 225 ms.
Product exploration explored 100000 steps with 1810 reset in 251 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 p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 276 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 105 ms :[p1, p1]
Finished random walk after 18 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 304 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 96 ms :[p1, p1]
Stuttering acceptance computed with spot in 102 ms :[p1, p1]
Support contains 4 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 99/99 transitions.
Applied a total of 0 rules in 6 ms. Remains 90 /90 variables (removed 0) and now considering 99/99 (removed 0) transitions.
// Phase 1: matrix 99 rows 90 cols
[2022-05-20 12:30:54] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 12:30:55] [INFO ] Implicit Places using invariants in 147 ms returned []
// Phase 1: matrix 99 rows 90 cols
[2022-05-20 12:30:55] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 12:30:55] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:30:55] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 462 ms to find 0 implicit places.
[2022-05-20 12:30:55] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 99 rows 90 cols
[2022-05-20 12:30:55] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 12:30:55] [INFO ] Dead Transitions using invariants and state equation in 114 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 90/90 places, 99/99 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 326 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 72 ms :[p1, p1]
Finished random walk after 24 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 291 ms. Reduced automaton from 2 states, 4 edges and 2 AP to 2 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 100 ms :[p1, p1]
Stuttering acceptance computed with spot in 103 ms :[p1, p1]
Stuttering acceptance computed with spot in 97 ms :[p1, p1]
Product exploration explored 100000 steps with 1771 reset in 242 ms.
Product exploration explored 100000 steps with 1783 reset in 446 ms.
Built C files in :
/tmp/ltsmin11059139353441677302
[2022-05-20 12:30:57] [INFO ] Computing symmetric may disable matrix : 99 transitions.
[2022-05-20 12:30:57] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:30:57] [INFO ] Computing symmetric may enable matrix : 99 transitions.
[2022-05-20 12:30:57] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:30:57] [INFO ] Computing Do-Not-Accords matrix : 99 transitions.
[2022-05-20 12:30:57] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:30:57] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11059139353441677302
Running compilation step : cd /tmp/ltsmin11059139353441677302;'/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 483 ms.
Running link step : cd /tmp/ltsmin11059139353441677302;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin11059139353441677302;'/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/stateBased10752538289728736081.hoa' '--buchi-type=spotba'
LTSmin run took 713 ms.
FORMULA ParamProductionCell-PT-2-LTLFireability-05 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-2-LTLFireability-05 finished in 6016 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((X(p0) U (p1 U p2)))&&((!p1 U p2)||G(p0))))'
Support contains 7 out of 202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 202/202 places, 197/197 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 202 transition count 188
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 193 transition count 188
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 18 place count 193 transition count 170
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 54 place count 175 transition count 170
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 55 place count 174 transition count 169
Iterating global reduction 2 with 1 rules applied. Total rules applied 56 place count 174 transition count 169
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 66 rules applied. Total rules applied 122 place count 141 transition count 136
Applied a total of 122 rules in 19 ms. Remains 141 /202 variables (removed 61) and now considering 136/197 (removed 61) transitions.
// Phase 1: matrix 136 rows 141 cols
[2022-05-20 12:30:58] [INFO ] Computed 35 place invariants in 1 ms
[2022-05-20 12:30:58] [INFO ] Implicit Places using invariants in 178 ms returned [11, 12, 23, 24, 36, 56, 58, 69, 102, 103, 124, 127, 136]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 179 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/202 places, 136/197 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 128 transition count 132
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 124 transition count 132
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 8 place count 124 transition count 131
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 10 place count 123 transition count 131
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 66 place count 95 transition count 103
Applied a total of 66 rules in 10 ms. Remains 95 /128 variables (removed 33) and now considering 103/136 (removed 33) transitions.
// Phase 1: matrix 103 rows 95 cols
[2022-05-20 12:30:58] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 12:30:58] [INFO ] Implicit Places using invariants in 101 ms returned []
// Phase 1: matrix 103 rows 95 cols
[2022-05-20 12:30:58] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 12:30:58] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:30:59] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 95/202 places, 103/197 transitions.
Finished structural reductions, in 2 iterations. Remains : 95/202 places, 103/197 transitions.
Stuttering acceptance computed with spot in 228 ms :[(NOT p0), true, (OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 p0), acceptance={0} source=2 dest: 0}, { cond=(NOT p0), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=4, aps=[p0:(AND (EQ s31 1) (EQ s32 1)), p2:(AND (EQ s43 1) (EQ s78 1)), p1:(AND (EQ s48 1) (EQ s51 1) (EQ s54 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Entered a terminal (fully accepting) state of product in 83 steps with 0 reset in 1 ms.
FORMULA ParamProductionCell-PT-2-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-2-LTLFireability-06 finished in 790 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U G(X(!F((X((F(X(p1))||p1))||p0)))))))'
Support contains 4 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 201 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 201 transition count 196
Applied a total of 2 rules in 7 ms. Remains 201 /202 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 201 cols
[2022-05-20 12:30:59] [INFO ] Computed 35 place invariants in 2 ms
[2022-05-20 12:30:59] [INFO ] Implicit Places using invariants in 301 ms returned [15, 16, 38, 39, 55, 67, 86, 88, 100, 102, 143, 144, 171, 174]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 302 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/202 places, 196/197 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 6 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2022-05-20 12:30:59] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 12:30:59] [INFO ] Implicit Places using invariants in 121 ms returned []
// Phase 1: matrix 194 rows 185 cols
[2022-05-20 12:30:59] [INFO ] Computed 21 place invariants in 4 ms
[2022-05-20 12:30:59] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:31:00] [INFO ] Implicit Places using invariants and state equation in 519 ms returned []
Implicit Place search using SMT with State Equation took 641 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/202 places, 194/197 transitions.
Finished structural reductions, in 2 iterations. Remains : 185/202 places, 194/197 transitions.
Stuttering acceptance computed with spot in 128 ms :[true, (OR p1 p0), (OR p1 p0), (OR p1 p0)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR p0 p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 1}], [{ cond=p0, acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (EQ s76 1) (EQ s79 1)), p1:(AND (EQ s176 1) (EQ s181 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 26 steps with 0 reset in 3 ms.
FORMULA ParamProductionCell-PT-2-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-2-LTLFireability-07 finished in 1112 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(X(G(F(p1))))&&p0)))'
Support contains 4 out of 202 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 202/202 places, 197/197 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 202 transition count 190
Reduce places removed 7 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 195 transition count 189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 194 transition count 189
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 16 place count 194 transition count 169
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 56 place count 174 transition count 169
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 57 place count 173 transition count 168
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 173 transition count 168
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 120 place count 142 transition count 137
Applied a total of 120 rules in 18 ms. Remains 142 /202 variables (removed 60) and now considering 137/197 (removed 60) transitions.
// Phase 1: matrix 137 rows 142 cols
[2022-05-20 12:31:00] [INFO ] Computed 35 place invariants in 1 ms
[2022-05-20 12:31:00] [INFO ] Implicit Places using invariants in 194 ms returned [11, 24, 25, 37, 44, 54, 56, 67, 69, 101, 125, 128, 137]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 195 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 129/202 places, 137/197 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 129 transition count 136
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 128 transition count 136
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 128 transition count 134
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 6 place count 126 transition count 134
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 62 place count 98 transition count 106
Applied a total of 62 rules in 9 ms. Remains 98 /129 variables (removed 31) and now considering 106/137 (removed 31) transitions.
// Phase 1: matrix 106 rows 98 cols
[2022-05-20 12:31:00] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 12:31:00] [INFO ] Implicit Places using invariants in 110 ms returned []
// Phase 1: matrix 106 rows 98 cols
[2022-05-20 12:31:00] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 12:31:00] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:31:01] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 98/202 places, 106/197 transitions.
Finished structural reductions, in 2 iterations. Remains : 98/202 places, 106/197 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s7 1) (EQ s10 1)), p0:(AND (EQ s60 1) (EQ s68 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 1504 reset in 209 ms.
Product exploration explored 100000 steps with 1448 reset in 247 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 p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 231 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Finished random walk after 75 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=18 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), true, (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 6 factoid took 262 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 163 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
// Phase 1: matrix 106 rows 98 cols
[2022-05-20 12:31:02] [INFO ] Computed 22 place invariants in 7 ms
[2022-05-20 12:31:02] [INFO ] [Real]Absence check using 20 positive place invariants in 14 ms returned sat
[2022-05-20 12:31:02] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 5 ms returned sat
[2022-05-20 12:31:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:31:03] [INFO ] [Real]Absence check using state equation in 101 ms returned sat
[2022-05-20 12:31:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:31:03] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2022-05-20 12:31:03] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 2 ms returned sat
[2022-05-20 12:31:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:31:03] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2022-05-20 12:31:03] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:31:03] [INFO ] [Nat]Added 68 Read/Feed constraints in 22 ms returned sat
[2022-05-20 12:31:03] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 4 ms to minimize.
[2022-05-20 12:31:03] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 2 ms to minimize.
[2022-05-20 12:31:03] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 2 ms to minimize.
[2022-05-20 12:31:03] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 2 ms to minimize.
[2022-05-20 12:31:03] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 1 ms to minimize.
[2022-05-20 12:31:03] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 0 ms to minimize.
[2022-05-20 12:31:03] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 0 ms to minimize.
[2022-05-20 12:31:03] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 1 ms to minimize.
[2022-05-20 12:31:03] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2022-05-20 12:31:03] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2022-05-20 12:31:03] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 652 ms
[2022-05-20 12:31:03] [INFO ] Computed and/alt/rep : 104/226/104 causal constraints (skipped 0 transitions) in 12 ms.
[2022-05-20 12:31:04] [INFO ] Added : 88 causal constraints over 18 iterations in 359 ms. Result :sat
Could not prove EG (NOT p1)
// Phase 1: matrix 106 rows 98 cols
[2022-05-20 12:31:04] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 12:31:04] [INFO ] [Real]Absence check using 20 positive place invariants in 10 ms returned sat
[2022-05-20 12:31:04] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 4 ms returned sat
[2022-05-20 12:31:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:31:04] [INFO ] [Real]Absence check using state equation in 106 ms returned sat
[2022-05-20 12:31:04] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:31:04] [INFO ] [Nat]Absence check using 20 positive place invariants in 15 ms returned sat
[2022-05-20 12:31:04] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 4 ms returned sat
[2022-05-20 12:31:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:31:04] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2022-05-20 12:31:04] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:31:04] [INFO ] [Nat]Added 68 Read/Feed constraints in 17 ms returned sat
[2022-05-20 12:31:04] [INFO ] Deduced a trap composed of 3 places in 65 ms of which 1 ms to minimize.
[2022-05-20 12:31:04] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2022-05-20 12:31:04] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2022-05-20 12:31:04] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2022-05-20 12:31:05] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 0 ms to minimize.
[2022-05-20 12:31:05] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
[2022-05-20 12:31:05] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2022-05-20 12:31:05] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 0 ms to minimize.
[2022-05-20 12:31:05] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 1 ms to minimize.
[2022-05-20 12:31:05] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2022-05-20 12:31:05] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 1 ms to minimize.
[2022-05-20 12:31:05] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 795 ms
[2022-05-20 12:31:05] [INFO ] Computed and/alt/rep : 104/226/104 causal constraints (skipped 0 transitions) in 14 ms.
[2022-05-20 12:31:05] [INFO ] Added : 82 causal constraints over 17 iterations in 285 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 98/98 places, 106/106 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 106/106 (removed 0) transitions.
// Phase 1: matrix 106 rows 98 cols
[2022-05-20 12:31:05] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 12:31:05] [INFO ] Implicit Places using invariants in 149 ms returned []
// Phase 1: matrix 106 rows 98 cols
[2022-05-20 12:31:05] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-20 12:31:06] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:31:06] [INFO ] Implicit Places using invariants and state equation in 351 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
// Phase 1: matrix 106 rows 98 cols
[2022-05-20 12:31:06] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 12:31:06] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 98/98 places, 106/106 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 230 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Finished random walk after 92 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=46 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p0))), true, (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 6 factoid took 318 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 189 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
// Phase 1: matrix 106 rows 98 cols
[2022-05-20 12:31:07] [INFO ] Computed 22 place invariants in 0 ms
[2022-05-20 12:31:07] [INFO ] [Real]Absence check using 20 positive place invariants in 13 ms returned sat
[2022-05-20 12:31:07] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 4 ms returned sat
[2022-05-20 12:31:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:31:07] [INFO ] [Real]Absence check using state equation in 114 ms returned sat
[2022-05-20 12:31:07] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:31:08] [INFO ] [Nat]Absence check using 20 positive place invariants in 13 ms returned sat
[2022-05-20 12:31:08] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 3 ms returned sat
[2022-05-20 12:31:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:31:08] [INFO ] [Nat]Absence check using state equation in 96 ms returned sat
[2022-05-20 12:31:08] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:31:08] [INFO ] [Nat]Added 68 Read/Feed constraints in 21 ms returned sat
[2022-05-20 12:31:08] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 2 ms to minimize.
[2022-05-20 12:31:08] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 1 ms to minimize.
[2022-05-20 12:31:08] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2022-05-20 12:31:08] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2022-05-20 12:31:08] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 1 ms to minimize.
[2022-05-20 12:31:08] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2022-05-20 12:31:08] [INFO ] Deduced a trap composed of 7 places in 72 ms of which 1 ms to minimize.
[2022-05-20 12:31:08] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 0 ms to minimize.
[2022-05-20 12:31:08] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2022-05-20 12:31:08] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2022-05-20 12:31:08] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 657 ms
[2022-05-20 12:31:08] [INFO ] Computed and/alt/rep : 104/226/104 causal constraints (skipped 0 transitions) in 12 ms.
[2022-05-20 12:31:09] [INFO ] Added : 88 causal constraints over 18 iterations in 359 ms. Result :sat
Could not prove EG (NOT p1)
// Phase 1: matrix 106 rows 98 cols
[2022-05-20 12:31:09] [INFO ] Computed 22 place invariants in 4 ms
[2022-05-20 12:31:09] [INFO ] [Real]Absence check using 20 positive place invariants in 12 ms returned sat
[2022-05-20 12:31:09] [INFO ] [Real]Absence check using 20 positive and 2 generalized place invariants in 4 ms returned sat
[2022-05-20 12:31:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:31:09] [INFO ] [Real]Absence check using state equation in 108 ms returned sat
[2022-05-20 12:31:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:31:09] [INFO ] [Nat]Absence check using 20 positive place invariants in 14 ms returned sat
[2022-05-20 12:31:09] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 3 ms returned sat
[2022-05-20 12:31:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:31:09] [INFO ] [Nat]Absence check using state equation in 102 ms returned sat
[2022-05-20 12:31:09] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:31:09] [INFO ] [Nat]Added 68 Read/Feed constraints in 16 ms returned sat
[2022-05-20 12:31:09] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2022-05-20 12:31:09] [INFO ] Deduced a trap composed of 6 places in 65 ms of which 0 ms to minimize.
[2022-05-20 12:31:09] [INFO ] Deduced a trap composed of 5 places in 63 ms of which 1 ms to minimize.
[2022-05-20 12:31:10] [INFO ] Deduced a trap composed of 5 places in 65 ms of which 3 ms to minimize.
[2022-05-20 12:31:10] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 1 ms to minimize.
[2022-05-20 12:31:10] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 1 ms to minimize.
[2022-05-20 12:31:10] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 1 ms to minimize.
[2022-05-20 12:31:10] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 5 ms to minimize.
[2022-05-20 12:31:10] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 0 ms to minimize.
[2022-05-20 12:31:10] [INFO ] Deduced a trap composed of 14 places in 60 ms of which 1 ms to minimize.
[2022-05-20 12:31:10] [INFO ] Deduced a trap composed of 28 places in 62 ms of which 1 ms to minimize.
[2022-05-20 12:31:10] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 856 ms
[2022-05-20 12:31:10] [INFO ] Computed and/alt/rep : 104/226/104 causal constraints (skipped 0 transitions) in 14 ms.
[2022-05-20 12:31:10] [INFO ] Added : 82 causal constraints over 17 iterations in 342 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 1464 reset in 204 ms.
Product exploration explored 100000 steps with 1476 reset in 234 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 191 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Support contains 4 out of 98 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 106/106 transitions.
Applied a total of 0 rules in 5 ms. Remains 98 /98 variables (removed 0) and now considering 106/106 (removed 0) transitions.
[2022-05-20 12:31:12] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 106 rows 98 cols
[2022-05-20 12:31:12] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 12:31:12] [INFO ] Dead Transitions using invariants and state equation in 193 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 98/98 places, 106/106 transitions.
Product exploration explored 100000 steps with 1500 reset in 334 ms.
Product exploration explored 100000 steps with 1499 reset in 325 ms.
Built C files in :
/tmp/ltsmin9402505869782570558
[2022-05-20 12:31:12] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9402505869782570558
Running compilation step : cd /tmp/ltsmin9402505869782570558;'/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 292 ms.
Running link step : cd /tmp/ltsmin9402505869782570558;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin9402505869782570558;'/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/stateBased12232734091560974127.hoa' '--buchi-type=spotba'
LTSmin run took 575 ms.
FORMULA ParamProductionCell-PT-2-LTLFireability-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-2-LTLFireability-08 finished in 13420 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 201 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 201 transition count 196
Applied a total of 2 rules in 6 ms. Remains 201 /202 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 201 cols
[2022-05-20 12:31:13] [INFO ] Computed 35 place invariants in 5 ms
[2022-05-20 12:31:14] [INFO ] Implicit Places using invariants in 275 ms returned [15, 16, 38, 39, 55, 67, 86, 88, 100, 102, 143, 144, 171, 174, 192]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 277 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/202 places, 196/197 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 184 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 184 transition count 194
Applied a total of 4 rules in 11 ms. Remains 184 /186 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 184 cols
[2022-05-20 12:31:14] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-20 12:31:14] [INFO ] Implicit Places using invariants in 178 ms returned []
// Phase 1: matrix 194 rows 184 cols
[2022-05-20 12:31:14] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-20 12:31:14] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:31:14] [INFO ] Implicit Places using invariants and state equation in 558 ms returned []
Implicit Place search using SMT with State Equation took 751 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 184/202 places, 194/197 transitions.
Finished structural reductions, in 2 iterations. Remains : 184/202 places, 194/197 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(NEQ s41 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 393 ms.
Product exploration explored 100000 steps with 50000 reset in 401 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ParamProductionCell-PT-2-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-2-LTLFireability-09 finished in 2031 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F((p1 U p2)))&&p0)))'
Support contains 4 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 201 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 201 transition count 196
Applied a total of 2 rules in 17 ms. Remains 201 /202 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 201 cols
[2022-05-20 12:31:15] [INFO ] Computed 35 place invariants in 2 ms
[2022-05-20 12:31:16] [INFO ] Implicit Places using invariants in 218 ms returned [15, 16, 38, 39, 67, 86, 88, 102, 143, 144, 171, 174, 192]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 229 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/202 places, 196/197 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 186 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 186 transition count 194
Applied a total of 4 rules in 4 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2022-05-20 12:31:16] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 12:31:16] [INFO ] Implicit Places using invariants in 112 ms returned []
// Phase 1: matrix 194 rows 186 cols
[2022-05-20 12:31:16] [INFO ] Computed 22 place invariants in 1 ms
[2022-05-20 12:31:16] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:31:16] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/202 places, 194/197 transitions.
Finished structural reductions, in 2 iterations. Remains : 186/202 places, 194/197 transitions.
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s92 1) (EQ s99 1)), p2:(OR (AND (EQ s51 1) (EQ s53 1)) (AND (EQ s92 1) (EQ s99 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-2-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-2-LTLFireability-10 finished in 1051 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(F(F(X(G(p0)))))||(X(p1)&&p2))))'
Support contains 6 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 201 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 201 transition count 196
Applied a total of 2 rules in 6 ms. Remains 201 /202 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 201 cols
[2022-05-20 12:31:16] [INFO ] Computed 35 place invariants in 2 ms
[2022-05-20 12:31:17] [INFO ] Implicit Places using invariants in 318 ms returned [16, 38, 39, 55, 67, 86, 88, 102, 144, 171, 174, 192]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 319 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 189/202 places, 196/197 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 187 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 187 transition count 194
Applied a total of 4 rules in 5 ms. Remains 187 /189 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 187 cols
[2022-05-20 12:31:17] [INFO ] Computed 23 place invariants in 1 ms
[2022-05-20 12:31:17] [INFO ] Implicit Places using invariants in 194 ms returned []
// Phase 1: matrix 194 rows 187 cols
[2022-05-20 12:31:17] [INFO ] Computed 23 place invariants in 2 ms
[2022-05-20 12:31:17] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:31:18] [INFO ] Implicit Places using invariants and state equation in 610 ms returned []
Implicit Place search using SMT with State Equation took 807 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 187/202 places, 194/197 transitions.
Finished structural reductions, in 2 iterations. Remains : 187/202 places, 194/197 transitions.
Stuttering acceptance computed with spot in 194 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p2:(OR (EQ s4 0) (EQ s15 0)), p1:(OR (EQ s76 0) (EQ s92 0)), p0:(AND (EQ s134 1) (EQ s137 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 324 ms.
Product exploration explored 100000 steps with 33333 reset in 359 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 p2 p1 (NOT p0)), (X p2), (X (X p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p1))
Knowledge based reduction with 4 factoid took 77 ms. Reduced automaton from 4 states, 6 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA ParamProductionCell-PT-2-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-2-LTLFireability-11 finished in 2126 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)&&p0)))'
Support contains 4 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 201 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 201 transition count 196
Applied a total of 2 rules in 4 ms. Remains 201 /202 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 201 cols
[2022-05-20 12:31:19] [INFO ] Computed 35 place invariants in 1 ms
[2022-05-20 12:31:19] [INFO ] Implicit Places using invariants in 207 ms returned [15, 16, 38, 39, 55, 67, 86, 88, 100, 102, 143, 144, 171, 174, 192]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 208 ms to find 15 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/202 places, 196/197 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 184 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 184 transition count 194
Applied a total of 4 rules in 3 ms. Remains 184 /186 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 184 cols
[2022-05-20 12:31:19] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-20 12:31:19] [INFO ] Implicit Places using invariants in 113 ms returned []
// Phase 1: matrix 194 rows 184 cols
[2022-05-20 12:31:19] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-20 12:31:19] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:31:19] [INFO ] Implicit Places using invariants and state equation in 431 ms returned []
Implicit Place search using SMT with State Equation took 548 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 184/202 places, 194/197 transitions.
Finished structural reductions, in 2 iterations. Remains : 184/202 places, 194/197 transitions.
Stuttering acceptance computed with spot in 170 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(OR (EQ s14 0) (EQ s74 0)), p0:(AND (EQ s79 1) (EQ s128 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-2-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-2-LTLFireability-13 finished in 947 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U p1)))'
Support contains 4 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 197/197 transitions.
Applied a total of 0 rules in 3 ms. Remains 202 /202 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 202 cols
[2022-05-20 12:31:20] [INFO ] Computed 35 place invariants in 1 ms
[2022-05-20 12:31:20] [INFO ] Implicit Places using invariants in 396 ms returned [15, 16, 38, 39, 55, 67, 86, 100, 102, 144, 145, 172, 175, 193]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 399 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/202 places, 197/197 transitions.
Applied a total of 0 rules in 3 ms. Remains 188 /188 variables (removed 0) and now considering 197/197 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 188/202 places, 197/197 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(AND (EQ s61 1) (EQ s68 1)), p0:(AND (EQ s81 1) (EQ s131 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-2-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-2-LTLFireability-14 finished in 539 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((X(p0) U !p0))&&G(p1))))'
Support contains 4 out of 202 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 202/202 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 201 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 201 transition count 196
Applied a total of 2 rules in 6 ms. Remains 201 /202 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 201 cols
[2022-05-20 12:31:20] [INFO ] Computed 35 place invariants in 2 ms
[2022-05-20 12:31:20] [INFO ] Implicit Places using invariants in 313 ms returned [15, 16, 38, 55, 67, 86, 88, 100, 102, 143, 144, 171, 174, 192]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 315 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/202 places, 196/197 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 6 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2022-05-20 12:31:20] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 12:31:21] [INFO ] Implicit Places using invariants in 185 ms returned []
// Phase 1: matrix 194 rows 185 cols
[2022-05-20 12:31:21] [INFO ] Computed 21 place invariants in 2 ms
[2022-05-20 12:31:21] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:31:21] [INFO ] Implicit Places using invariants and state equation in 548 ms returned []
Implicit Place search using SMT with State Equation took 735 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/202 places, 194/197 transitions.
Finished structural reductions, in 2 iterations. Remains : 185/202 places, 194/197 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), (OR (NOT p1) p0), true, (OR (NOT p1) p0)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(AND (EQ s79 1) (EQ s122 1)), p0:(AND (EQ s36 1) (EQ s43 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-2-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-2-LTLFireability-15 finished in 1236 ms.
All properties solved by simple procedures.
Total runtime 43307 ms.

BK_STOP 1653049881993

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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