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-165276998600275.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-3, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r150-smll-165276998600275
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 436K
-rw-r--r-- 1 mcc users 9.3K Apr 29 17:40 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 29 17:40 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Apr 29 17:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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.8K May 9 08:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 18K 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-3-LTLCardinality-00
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-01
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-02
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-03
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-04
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-05
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-06
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-07
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-08
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-09
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-10
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-11
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-12
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-13
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-14
FORMULA_NAME ParamProductionCell-PT-3-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653050140435

Running Version 202205111006
[2022-05-20 12:35:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 12:35:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 12:35:42] [INFO ] Load time of PNML (sax parser for PT used): 194 ms
[2022-05-20 12:35:42] [INFO ] Transformed 231 places.
[2022-05-20 12:35:42] [INFO ] Transformed 202 transitions.
[2022-05-20 12:35:42] [INFO ] Found NUPN structural information;
[2022-05-20 12:35:42] [INFO ] Parsed PT model containing 231 places and 202 transitions in 376 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ParamProductionCell-PT-3-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-3-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-3-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-3-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-3-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-3-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-3-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 227 transition count 198
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 227 transition count 198
Applied a total of 8 rules in 58 ms. Remains 227 /231 variables (removed 4) and now considering 198/202 (removed 4) transitions.
// Phase 1: matrix 198 rows 227 cols
[2022-05-20 12:35:43] [INFO ] Computed 59 place invariants in 24 ms
[2022-05-20 12:35:43] [INFO ] Implicit Places using invariants in 567 ms returned [15, 16, 18, 19, 24, 31, 35, 36, 41, 42, 47, 59, 65, 73, 78, 79, 98, 101, 113, 116, 118, 119, 164, 166, 167, 192, 193, 196, 202, 203, 207, 218]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 618 ms to find 32 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 195/231 places, 198/202 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 193 transition count 196
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 193 transition count 196
Applied a total of 4 rules in 21 ms. Remains 193 /195 variables (removed 2) and now considering 196/198 (removed 2) transitions.
// Phase 1: matrix 196 rows 193 cols
[2022-05-20 12:35:43] [INFO ] Computed 27 place invariants in 3 ms
[2022-05-20 12:35:43] [INFO ] Implicit Places using invariants in 189 ms returned []
// Phase 1: matrix 196 rows 193 cols
[2022-05-20 12:35:43] [INFO ] Computed 27 place invariants in 7 ms
[2022-05-20 12:35:44] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:35:44] [INFO ] Implicit Places using invariants and state equation in 977 ms returned []
Implicit Place search using SMT with State Equation took 1170 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 193/231 places, 196/202 transitions.
Finished structural reductions, in 2 iterations. Remains : 193/231 places, 196/202 transitions.
Support contains 29 out of 193 places after structural reductions.
[2022-05-20 12:35:45] [INFO ] Flatten gal took : 90 ms
[2022-05-20 12:35:45] [INFO ] Flatten gal took : 38 ms
[2022-05-20 12:35:45] [INFO ] Input system was already deterministic with 196 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 306 ms. (steps per millisecond=32 ) properties (out of 15) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 196 rows 193 cols
[2022-05-20 12:35:45] [INFO ] Computed 27 place invariants in 3 ms
[2022-05-20 12:35:45] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 12:35:45] [INFO ] [Nat]Absence check using 24 positive place invariants in 19 ms returned sat
[2022-05-20 12:35:45] [INFO ] [Nat]Absence check using 24 positive and 3 generalized place invariants in 3 ms returned sat
[2022-05-20 12:35:45] [INFO ] After 107ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
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' '!(F(G(X(F((X(p0)||G(p1)))))))'
Support contains 6 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 196/196 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 193 transition count 179
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 18 rules applied. Total rules applied 35 place count 176 transition count 178
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 175 transition count 178
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 36 place count 175 transition count 161
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 70 place count 158 transition count 161
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 72 place count 156 transition count 159
Iterating global reduction 3 with 2 rules applied. Total rules applied 74 place count 156 transition count 159
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 136 place count 125 transition count 128
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 138 place count 124 transition count 127
Applied a total of 138 rules in 69 ms. Remains 124 /193 variables (removed 69) and now considering 127/196 (removed 69) transitions.
// Phase 1: matrix 127 rows 124 cols
[2022-05-20 12:35:46] [INFO ] Computed 27 place invariants in 2 ms
[2022-05-20 12:35:46] [INFO ] Implicit Places using invariants in 240 ms returned [20, 29, 47, 58, 86, 87, 109]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 252 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 117/193 places, 127/196 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 117 transition count 125
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 115 transition count 125
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 115 transition count 123
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 113 transition count 123
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 54 place count 90 transition count 100
Applied a total of 54 rules in 22 ms. Remains 90 /117 variables (removed 27) and now considering 100/127 (removed 27) transitions.
// Phase 1: matrix 100 rows 90 cols
[2022-05-20 12:35:46] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-20 12:35:46] [INFO ] Implicit Places using invariants in 103 ms returned []
// Phase 1: matrix 100 rows 90 cols
[2022-05-20 12:35:46] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-20 12:35:46] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-05-20 12:35:46] [INFO ] Implicit Places using invariants and state equation in 280 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 90/193 places, 100/196 transitions.
Finished structural reductions, in 2 iterations. Remains : 90/193 places, 100/196 transitions.
Stuttering acceptance computed with spot in 354 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-3-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s35 0) (EQ s78 1)), p0:(AND (EQ s9 0) (EQ s84 1) (OR (EQ s1 0) (EQ s50 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 61 reset in 593 ms.
Product exploration explored 100000 steps with 75 reset in 289 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 232 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 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 456 steps, including 0 resets, run visited all 2 properties in 11 ms. (steps per millisecond=41 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 247 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 :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 100/100 transitions.
Applied a total of 0 rules in 5 ms. Remains 90 /90 variables (removed 0) and now considering 100/100 (removed 0) transitions.
// Phase 1: matrix 100 rows 90 cols
[2022-05-20 12:35:48] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-20 12:35:49] [INFO ] Implicit Places using invariants in 97 ms returned []
// Phase 1: matrix 100 rows 90 cols
[2022-05-20 12:35:49] [INFO ] Computed 20 place invariants in 5 ms
[2022-05-20 12:35:49] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-05-20 12:35:49] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 311 ms to find 0 implicit places.
[2022-05-20 12:35:49] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 100 rows 90 cols
[2022-05-20 12:35:49] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-20 12:35:49] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 90/90 places, 100/100 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 266 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 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 295 steps, including 0 resets, run visited all 2 properties in 7 ms. (steps per millisecond=42 )
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 5 factoid took 235 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 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 71 reset in 343 ms.
Product exploration explored 100000 steps with 76 reset in 444 ms.
Built C files in :
/tmp/ltsmin2185772158243487178
[2022-05-20 12:35:51] [INFO ] Computing symmetric may disable matrix : 100 transitions.
[2022-05-20 12:35:51] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:35:51] [INFO ] Computing symmetric may enable matrix : 100 transitions.
[2022-05-20 12:35:51] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:35:51] [INFO ] Computing Do-Not-Accords matrix : 100 transitions.
[2022-05-20 12:35:51] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:35:51] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2185772158243487178
Running compilation step : cd /tmp/ltsmin2185772158243487178;'/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 657 ms.
Running link step : cd /tmp/ltsmin2185772158243487178;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin2185772158243487178;'/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/stateBased17984224265166807678.hoa' '--buchi-type=spotba'
LTSmin run took 134 ms.
FORMULA ParamProductionCell-PT-3-LTLCardinality-00 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-3-LTLCardinality-00 finished in 5808 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((((G(p0)&&G(p1)) U G(p2))&&G(X(p3))))'
Support contains 6 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 196/196 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 192 transition count 195
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 192 transition count 195
Applied a total of 2 rules in 13 ms. Remains 192 /193 variables (removed 1) and now considering 195/196 (removed 1) transitions.
// Phase 1: matrix 195 rows 192 cols
[2022-05-20 12:35:51] [INFO ] Computed 27 place invariants in 2 ms
[2022-05-20 12:35:52] [INFO ] Implicit Places using invariants in 139 ms returned [52, 94, 137, 138]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 141 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/193 places, 195/196 transitions.
Applied a total of 0 rules in 4 ms. Remains 188 /188 variables (removed 0) and now considering 195/195 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 188/193 places, 195/196 transitions.
Stuttering acceptance computed with spot in 277 ms :[(OR (NOT p2) (NOT p3)), true, (OR (AND (NOT p1) p2) (AND (NOT p0) p2)), (NOT p2), (NOT p3), (NOT p2)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(OR (AND (NOT p1) p2) (AND (NOT p0) p2)), acceptance={} source=0 dest: 3}, { cond=(OR (AND p1 p0) p2), acceptance={} source=0 dest: 4}, { cond=(AND p1 p0), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR (AND (NOT p1) p2) (AND (NOT p0) p2)), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0 p2), acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 1}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 1}, { cond=p3, acceptance={} source=4 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={} source=5 dest: 1}, { cond=(AND p1 p0 (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(OR (AND (NOT p1) p2) (AND (NOT p0) p2)), acceptance={} source=5 dest: 3}, { cond=(AND p1 p0 p2), acceptance={} source=5 dest: 5}, { cond=(AND p1 p0 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s92 1), p2:(OR (EQ s36 0) (EQ s92 1)), p0:(OR (EQ s176 0) (EQ s162 1)), p3:(OR (EQ s81 0) (EQ s128 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 179 steps with 0 reset in 1 ms.
FORMULA ParamProductionCell-PT-3-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-3-LTLCardinality-03 finished in 460 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(F(p0))))'
Support contains 3 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 191 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 191 transition count 194
Applied a total of 4 rules in 8 ms. Remains 191 /193 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 191 cols
[2022-05-20 12:35:52] [INFO ] Computed 27 place invariants in 1 ms
[2022-05-20 12:35:52] [INFO ] Implicit Places using invariants in 151 ms returned [36, 52, 82, 94, 136, 165]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 154 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/193 places, 194/196 transitions.
Applied a total of 0 rules in 3 ms. Remains 185 /185 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 185/193 places, 194/196 transitions.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (AND (NEQ s155 0) (NEQ s113 1)) (AND (EQ s132 1) (OR (EQ s155 0) (EQ s113 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 321 ms.
Product exploration explored 100000 steps with 50000 reset in 311 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 58 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA ParamProductionCell-PT-3-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-3-LTLCardinality-05 finished in 942 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 196/196 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 193 transition count 179
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 18 rules applied. Total rules applied 35 place count 176 transition count 178
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 175 transition count 178
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 36 place count 175 transition count 164
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 64 place count 161 transition count 164
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 66 place count 159 transition count 162
Iterating global reduction 3 with 2 rules applied. Total rules applied 68 place count 159 transition count 162
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 140 place count 123 transition count 126
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 142 place count 122 transition count 125
Applied a total of 142 rules in 26 ms. Remains 122 /193 variables (removed 71) and now considering 125/196 (removed 71) transitions.
// Phase 1: matrix 125 rows 122 cols
[2022-05-20 12:35:53] [INFO ] Computed 27 place invariants in 0 ms
[2022-05-20 12:35:53] [INFO ] Implicit Places using invariants in 139 ms returned [20, 29, 47, 58, 86, 87, 109]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 140 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 115/193 places, 125/196 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 115 transition count 123
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 113 transition count 122
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 112 transition count 122
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 6 place count 112 transition count 119
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 12 place count 109 transition count 119
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 58 place count 86 transition count 96
Applied a total of 58 rules in 17 ms. Remains 86 /115 variables (removed 29) and now considering 96/125 (removed 29) transitions.
// Phase 1: matrix 96 rows 86 cols
[2022-05-20 12:35:53] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-20 12:35:53] [INFO ] Implicit Places using invariants in 100 ms returned []
// Phase 1: matrix 96 rows 86 cols
[2022-05-20 12:35:53] [INFO ] Computed 20 place invariants in 5 ms
[2022-05-20 12:35:53] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-05-20 12:35:53] [INFO ] Implicit Places using invariants and state equation in 182 ms returned []
Implicit Place search using SMT with State Equation took 285 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 86/193 places, 96/196 transitions.
Finished structural reductions, in 2 iterations. Remains : 86/193 places, 96/196 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s29 0) (NEQ s0 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 133 ms.
Stack based approach found an accepted trace after 189 steps with 0 reset with depth 190 and stack size 190 in 0 ms.
FORMULA ParamProductionCell-PT-3-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-3-LTLCardinality-07 finished in 654 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(F(p0))))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 196/196 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 193 transition count 177
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 174 transition count 177
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 38 place count 174 transition count 161
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 70 place count 158 transition count 161
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 72 place count 156 transition count 159
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 156 transition count 159
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 144 place count 121 transition count 124
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 146 place count 120 transition count 123
Applied a total of 146 rules in 28 ms. Remains 120 /193 variables (removed 73) and now considering 123/196 (removed 73) transitions.
// Phase 1: matrix 123 rows 120 cols
[2022-05-20 12:35:54] [INFO ] Computed 27 place invariants in 1 ms
[2022-05-20 12:35:54] [INFO ] Implicit Places using invariants in 158 ms returned [20, 29, 45, 56, 85, 86, 108]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 160 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 113/193 places, 123/196 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 121
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 111 transition count 121
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 111 transition count 119
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 8 place count 109 transition count 119
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 54 place count 86 transition count 96
Applied a total of 54 rules in 15 ms. Remains 86 /113 variables (removed 27) and now considering 96/123 (removed 27) transitions.
// Phase 1: matrix 96 rows 86 cols
[2022-05-20 12:35:54] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-20 12:35:54] [INFO ] Implicit Places using invariants in 98 ms returned []
// Phase 1: matrix 96 rows 86 cols
[2022-05-20 12:35:54] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-20 12:35:54] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-05-20 12:35:54] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 86/193 places, 96/196 transitions.
Finished structural reductions, in 2 iterations. Remains : 86/193 places, 96/196 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s66 0) (EQ s46 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 479 reset in 127 ms.
Product exploration explored 100000 steps with 472 reset in 159 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 : []
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Finished random walk after 299 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=149 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 86 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 86/86 places, 96/96 transitions.
Applied a total of 0 rules in 5 ms. Remains 86 /86 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 86 cols
[2022-05-20 12:35:55] [INFO ] Computed 20 place invariants in 5 ms
[2022-05-20 12:35:55] [INFO ] Implicit Places using invariants in 96 ms returned []
// Phase 1: matrix 96 rows 86 cols
[2022-05-20 12:35:55] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-20 12:35:55] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-05-20 12:35:55] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 310 ms to find 0 implicit places.
[2022-05-20 12:35:55] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 96 rows 86 cols
[2022-05-20 12:35:55] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-20 12:35:55] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 86/86 places, 96/96 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 119 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Finished random walk after 94 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=94 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 192 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 475 reset in 242 ms.
Product exploration explored 100000 steps with 511 reset in 585 ms.
Built C files in :
/tmp/ltsmin1154399408057443509
[2022-05-20 12:35:57] [INFO ] Computing symmetric may disable matrix : 96 transitions.
[2022-05-20 12:35:57] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:35:57] [INFO ] Computing symmetric may enable matrix : 96 transitions.
[2022-05-20 12:35:57] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:35:57] [INFO ] Computing Do-Not-Accords matrix : 96 transitions.
[2022-05-20 12:35:57] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:35:57] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1154399408057443509
Running compilation step : cd /tmp/ltsmin1154399408057443509;'/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 273 ms.
Running link step : cd /tmp/ltsmin1154399408057443509;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin1154399408057443509;'/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/stateBased15643243487485651036.hoa' '--buchi-type=spotba'
LTSmin run took 1003 ms.
FORMULA ParamProductionCell-PT-3-LTLCardinality-08 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-3-LTLCardinality-08 finished in 4722 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((!(F(X(p0)) U (G(p0) U p0))&&F(p1)))))'
Support contains 4 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 196/196 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 192 transition count 195
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 192 transition count 195
Applied a total of 2 rules in 5 ms. Remains 192 /193 variables (removed 1) and now considering 195/196 (removed 1) transitions.
// Phase 1: matrix 195 rows 192 cols
[2022-05-20 12:35:58] [INFO ] Computed 27 place invariants in 1 ms
[2022-05-20 12:35:58] [INFO ] Implicit Places using invariants in 178 ms returned [36, 82, 94, 137, 138, 166]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 179 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/193 places, 195/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 186 /186 variables (removed 0) and now considering 195/195 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 186/193 places, 195/196 transitions.
Stuttering acceptance computed with spot in 183 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), p0]
Running random walk in product with property : ParamProductionCell-PT-3-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={0} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s61 0) (EQ s106 1)), p1:(OR (EQ s49 0) (EQ s51 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 135 ms.
Stack based approach found an accepted trace after 247 steps with 0 reset with depth 248 and stack size 248 in 1 ms.
FORMULA ParamProductionCell-PT-3-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-3-LTLCardinality-09 finished in 526 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(p0)))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 191 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 191 transition count 194
Applied a total of 4 rules in 4 ms. Remains 191 /193 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 191 cols
[2022-05-20 12:35:59] [INFO ] Computed 27 place invariants in 1 ms
[2022-05-20 12:35:59] [INFO ] Implicit Places using invariants in 237 ms returned [36, 52, 82, 94, 136, 137, 165]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 238 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/193 places, 194/196 transitions.
Applied a total of 0 rules in 3 ms. Remains 184 /184 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 184/193 places, 194/196 transitions.
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s98 0) (EQ s118 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][false, false, false]]
Entered a terminal (fully accepting) state of product in 113 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-3-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-3-LTLCardinality-10 finished in 367 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 193 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 193/193 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 191 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 191 transition count 194
Applied a total of 4 rules in 8 ms. Remains 191 /193 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 191 cols
[2022-05-20 12:35:59] [INFO ] Computed 27 place invariants in 1 ms
[2022-05-20 12:35:59] [INFO ] Implicit Places using invariants in 189 ms returned [36, 52, 82, 94, 136, 137, 165]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 190 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/193 places, 194/196 transitions.
Applied a total of 0 rules in 1 ms. Remains 184 /184 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 184/193 places, 194/196 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s68 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 1308 reset in 114 ms.
Product exploration explored 100000 steps with 1309 reset in 134 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 2 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 70 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=35 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
// Phase 1: matrix 194 rows 184 cols
[2022-05-20 12:36:00] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-20 12:36:00] [INFO ] [Real]Absence check using 18 positive place invariants in 12 ms returned sat
[2022-05-20 12:36:00] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 4 ms returned sat
[2022-05-20 12:36:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:36:00] [INFO ] [Real]Absence check using state equation in 260 ms returned sat
[2022-05-20 12:36:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:36:01] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2022-05-20 12:36:01] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 3 ms returned sat
[2022-05-20 12:36:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:36:01] [INFO ] [Nat]Absence check using state equation in 166 ms returned sat
[2022-05-20 12:36:01] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:36:01] [INFO ] [Nat]Added 68 Read/Feed constraints in 15 ms returned sat
[2022-05-20 12:36:01] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 5 ms to minimize.
[2022-05-20 12:36:01] [INFO ] Deduced a trap composed of 11 places in 110 ms of which 2 ms to minimize.
[2022-05-20 12:36:01] [INFO ] Deduced a trap composed of 8 places in 85 ms of which 1 ms to minimize.
[2022-05-20 12:36:01] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 2 ms to minimize.
[2022-05-20 12:36:01] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 1 ms to minimize.
[2022-05-20 12:36:02] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 0 ms to minimize.
[2022-05-20 12:36:02] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 1 ms to minimize.
[2022-05-20 12:36:02] [INFO ] Deduced a trap composed of 19 places in 79 ms of which 1 ms to minimize.
[2022-05-20 12:36:02] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 1 ms to minimize.
[2022-05-20 12:36:02] [INFO ] Deduced a trap composed of 12 places in 78 ms of which 1 ms to minimize.
[2022-05-20 12:36:02] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 1 ms to minimize.
[2022-05-20 12:36:02] [INFO ] Deduced a trap composed of 18 places in 77 ms of which 1 ms to minimize.
[2022-05-20 12:36:02] [INFO ] Deduced a trap composed of 27 places in 59 ms of which 1 ms to minimize.
[2022-05-20 12:36:02] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 0 ms to minimize.
[2022-05-20 12:36:02] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2022-05-20 12:36:02] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 0 ms to minimize.
[2022-05-20 12:36:02] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 1 ms to minimize.
[2022-05-20 12:36:03] [INFO ] Deduced a trap composed of 37 places in 55 ms of which 1 ms to minimize.
[2022-05-20 12:36:03] [INFO ] Deduced a trap composed of 50 places in 52 ms of which 1 ms to minimize.
[2022-05-20 12:36:03] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2022-05-20 12:36:03] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 1 ms to minimize.
[2022-05-20 12:36:03] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 1 ms to minimize.
[2022-05-20 12:36:03] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 1 ms to minimize.
[2022-05-20 12:36:03] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
[2022-05-20 12:36:03] [INFO ] Deduced a trap composed of 58 places in 50 ms of which 1 ms to minimize.
[2022-05-20 12:36:03] [INFO ] Trap strengthening (SAT) tested/added 26/25 trap constraints in 2211 ms
[2022-05-20 12:36:03] [INFO ] Computed and/alt/rep : 191/309/191 causal constraints (skipped 0 transitions) in 15 ms.
[2022-05-20 12:36:04] [INFO ] Added : 190 causal constraints over 38 iterations in 915 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 184 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 184/184 places, 194/194 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 184 transition count 152
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 1 with 42 rules applied. Total rules applied 84 place count 142 transition count 152
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 84 place count 142 transition count 141
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 106 place count 131 transition count 141
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: 45
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 196 place count 86 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 198 place count 85 transition count 95
Applied a total of 198 rules in 17 ms. Remains 85 /184 variables (removed 99) and now considering 95/194 (removed 99) transitions.
// Phase 1: matrix 95 rows 85 cols
[2022-05-20 12:36:04] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-20 12:36:04] [INFO ] Implicit Places using invariants in 84 ms returned []
// Phase 1: matrix 95 rows 85 cols
[2022-05-20 12:36:04] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-20 12:36:04] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-05-20 12:36:04] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2022-05-20 12:36:04] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 95 rows 85 cols
[2022-05-20 12:36:04] [INFO ] Computed 20 place invariants in 0 ms
[2022-05-20 12:36:04] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 85/184 places, 95/194 transitions.
Finished structural reductions, in 1 iterations. Remains : 85/184 places, 95/194 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 36 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=18 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
// Phase 1: matrix 95 rows 85 cols
[2022-05-20 12:36:05] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-20 12:36:05] [INFO ] [Real]Absence check using 18 positive place invariants in 9 ms returned sat
[2022-05-20 12:36:05] [INFO ] [Real]Absence check using 18 positive and 2 generalized place invariants in 3 ms returned sat
[2022-05-20 12:36:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:36:05] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2022-05-20 12:36:05] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:36:05] [INFO ] [Nat]Absence check using 18 positive place invariants in 11 ms returned sat
[2022-05-20 12:36:05] [INFO ] [Nat]Absence check using 18 positive and 2 generalized place invariants in 3 ms returned sat
[2022-05-20 12:36:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:36:05] [INFO ] [Nat]Absence check using state equation in 56 ms returned sat
[2022-05-20 12:36:05] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-05-20 12:36:05] [INFO ] [Nat]Added 67 Read/Feed constraints in 12 ms returned sat
[2022-05-20 12:36:05] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 1 ms to minimize.
[2022-05-20 12:36:05] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 1 ms to minimize.
[2022-05-20 12:36:05] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2022-05-20 12:36:05] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2022-05-20 12:36:05] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2022-05-20 12:36:05] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 0 ms to minimize.
[2022-05-20 12:36:05] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 0 ms to minimize.
[2022-05-20 12:36:06] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 1 ms to minimize.
[2022-05-20 12:36:06] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 2 ms to minimize.
[2022-05-20 12:36:06] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 3 ms to minimize.
[2022-05-20 12:36:06] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2022-05-20 12:36:06] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2022-05-20 12:36:06] [INFO ] Deduced a trap composed of 22 places in 33 ms of which 1 ms to minimize.
[2022-05-20 12:36:06] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 0 ms to minimize.
[2022-05-20 12:36:06] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2022-05-20 12:36:06] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 1 ms to minimize.
[2022-05-20 12:36:06] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2022-05-20 12:36:06] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2022-05-20 12:36:06] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2022-05-20 12:36:06] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2022-05-20 12:36:06] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2022-05-20 12:36:06] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 0 ms to minimize.
[2022-05-20 12:36:06] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2022-05-20 12:36:06] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 0 ms to minimize.
[2022-05-20 12:36:06] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2022-05-20 12:36:06] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 1 ms to minimize.
[2022-05-20 12:36:06] [INFO ] Trap strengthening (SAT) tested/added 27/26 trap constraints in 1243 ms
[2022-05-20 12:36:06] [INFO ] Computed and/alt/rep : 93/217/93 causal constraints (skipped 0 transitions) in 11 ms.
[2022-05-20 12:36:07] [INFO ] Added : 83 causal constraints over 17 iterations in 201 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2771 reset in 124 ms.
Product exploration explored 100000 steps with 2779 reset in 141 ms.
Built C files in :
/tmp/ltsmin15418095343423899652
[2022-05-20 12:36:07] [INFO ] Computing symmetric may disable matrix : 95 transitions.
[2022-05-20 12:36:07] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:36:07] [INFO ] Computing symmetric may enable matrix : 95 transitions.
[2022-05-20 12:36:07] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:36:07] [INFO ] Computing Do-Not-Accords matrix : 95 transitions.
[2022-05-20 12:36:07] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:36:07] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15418095343423899652
Running compilation step : cd /tmp/ltsmin15418095343423899652;'/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 382 ms.
Running link step : cd /tmp/ltsmin15418095343423899652;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin15418095343423899652;'/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/stateBased7881647786224012794.hoa' '--buchi-type=spotba'
LTSmin run took 215 ms.
FORMULA ParamProductionCell-PT-3-LTLCardinality-11 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-3-LTLCardinality-11 finished in 8354 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(G(p0))))'
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 196/196 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 193 transition count 177
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 38 place count 174 transition count 177
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 38 place count 174 transition count 161
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 70 place count 158 transition count 161
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 72 place count 156 transition count 159
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 156 transition count 159
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 146 place count 120 transition count 123
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 148 place count 119 transition count 122
Applied a total of 148 rules in 18 ms. Remains 119 /193 variables (removed 74) and now considering 122/196 (removed 74) transitions.
// Phase 1: matrix 122 rows 119 cols
[2022-05-20 12:36:08] [INFO ] Computed 27 place invariants in 0 ms
[2022-05-20 12:36:08] [INFO ] Implicit Places using invariants in 238 ms returned [20, 29, 45, 56, 85, 107]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 240 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 113/193 places, 122/196 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 113 transition count 120
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 111 transition count 120
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 111 transition count 118
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 109 transition count 118
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 48 place count 89 transition count 98
Applied a total of 48 rules in 8 ms. Remains 89 /113 variables (removed 24) and now considering 98/122 (removed 24) transitions.
// Phase 1: matrix 98 rows 89 cols
[2022-05-20 12:36:08] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 12:36:08] [INFO ] Implicit Places using invariants in 145 ms returned []
// Phase 1: matrix 98 rows 89 cols
[2022-05-20 12:36:08] [INFO ] Computed 21 place invariants in 1 ms
[2022-05-20 12:36:08] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-05-20 12:36:08] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 340 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 89/193 places, 98/196 transitions.
Finished structural reductions, in 2 iterations. Remains : 89/193 places, 98/196 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-3-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s63 0) (EQ s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 135 ms.
Stack based approach found an accepted trace after 240 steps with 0 reset with depth 241 and stack size 241 in 1 ms.
FORMULA ParamProductionCell-PT-3-LTLCardinality-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-3-LTLCardinality-14 finished in 795 ms.
All properties solved by simple procedures.
Total runtime 26442 ms.

BK_STOP 1653050168894

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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