Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r261-smll-167863536300364.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ParamProductionCell-PT-0, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r261-smll-167863536300364
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 8.3K Feb 26 17:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 17:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 17:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 17:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 17:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Feb 26 17:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 17:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 26 17:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 149K Mar 5 18:23 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-0-LTLFireability-00
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-01
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-02
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-03
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-04
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-05
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-06
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-07
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-08
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-09
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-10
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-11
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-12
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-13
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-14
FORMULA_NAME ParamProductionCell-PT-0-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678917102514

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ParamProductionCell-PT-0
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-15 21:51:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-15 21:51:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 21:51:46] [INFO ] Load time of PNML (sax parser for PT used): 158 ms
[2023-03-15 21:51:46] [INFO ] Transformed 198 places.
[2023-03-15 21:51:46] [INFO ] Transformed 176 transitions.
[2023-03-15 21:51:46] [INFO ] Found NUPN structural information;
[2023-03-15 21:51:46] [INFO ] Parsed PT model containing 198 places and 176 transitions and 730 arcs in 327 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ParamProductionCell-PT-0-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-0-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-0-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 58 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 176/176 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 193 transition count 171
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 193 transition count 171
Applied a total of 10 rules in 65 ms. Remains 193 /198 variables (removed 5) and now considering 171/176 (removed 5) transitions.
// Phase 1: matrix 171 rows 193 cols
[2023-03-15 21:51:47] [INFO ] Computed 49 place invariants in 21 ms
[2023-03-15 21:51:47] [INFO ] Implicit Places using invariants in 693 ms returned [16, 19, 35, 36, 41, 42, 46, 47, 59, 64, 73, 79, 98, 118, 119, 160, 165]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 758 ms to find 17 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 176/198 places, 171/176 transitions.
Applied a total of 0 rules in 15 ms. Remains 176 /176 variables (removed 0) and now considering 171/171 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 839 ms. Remains : 176/198 places, 171/176 transitions.
Support contains 58 out of 176 places after structural reductions.
[2023-03-15 21:51:48] [INFO ] Flatten gal took : 128 ms
[2023-03-15 21:51:48] [INFO ] Flatten gal took : 42 ms
[2023-03-15 21:51:48] [INFO ] Input system was already deterministic with 171 transitions.
Support contains 56 out of 176 places (down from 58) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 824 ms. (steps per millisecond=12 ) properties (out of 33) seen :31
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 171 rows 176 cols
[2023-03-15 21:51:49] [INFO ] Computed 32 place invariants in 7 ms
[2023-03-15 21:51:49] [INFO ] [Real]Absence check using 25 positive place invariants in 11 ms returned sat
[2023-03-15 21:51:49] [INFO ] [Real]Absence check using 25 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 21:51:49] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA ParamProductionCell-PT-0-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 171/171 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 176 transition count 162
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 167 transition count 162
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 18 place count 167 transition count 148
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 46 place count 153 transition count 148
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 152 transition count 147
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 152 transition count 147
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 96 place count 127 transition count 124
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 96 place count 127 transition count 123
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 98 place count 126 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 100 place count 125 transition count 122
Applied a total of 100 rules in 63 ms. Remains 125 /176 variables (removed 51) and now considering 122/171 (removed 49) transitions.
// Phase 1: matrix 122 rows 125 cols
[2023-03-15 21:51:50] [INFO ] Computed 30 place invariants in 2 ms
[2023-03-15 21:51:50] [INFO ] Implicit Places using invariants in 221 ms returned [0, 1, 9, 11, 15, 20, 42, 55, 67, 68, 70, 103, 105, 106]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 227 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 111/176 places, 122/171 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 111 transition count 119
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 108 transition count 119
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 8 place count 106 transition count 117
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 106 transition count 117
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 46 place count 88 transition count 99
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 48 place count 87 transition count 98
Applied a total of 48 rules in 30 ms. Remains 87 /111 variables (removed 24) and now considering 98/122 (removed 24) transitions.
// Phase 1: matrix 98 rows 87 cols
[2023-03-15 21:51:50] [INFO ] Computed 16 place invariants in 2 ms
[2023-03-15 21:51:50] [INFO ] Implicit Places using invariants in 161 ms returned []
[2023-03-15 21:51:50] [INFO ] Invariant cache hit.
[2023-03-15 21:51:50] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-15 21:51:50] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 469 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 87/176 places, 98/171 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 789 ms. Remains : 87/176 places, 98/171 transitions.
Stuttering acceptance computed with spot in 310 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-00 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 (OR (EQ s37 0) (EQ s77 0)) (OR (EQ s22 0) (EQ s23 0)))], 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 664 ms.
Stack based approach found an accepted trace after 103 steps with 0 reset with depth 104 and stack size 104 in 1 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-0-LTLFireability-00 finished in 1836 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||F((p1||X((G(p3)&&p2))))))))'
Support contains 9 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 171/171 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 175 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 175 transition count 170
Applied a total of 2 rules in 12 ms. Remains 175 /176 variables (removed 1) and now considering 170/171 (removed 1) transitions.
// Phase 1: matrix 170 rows 175 cols
[2023-03-15 21:51:51] [INFO ] Computed 32 place invariants in 4 ms
[2023-03-15 21:51:52] [INFO ] Implicit Places using invariants in 227 ms returned [15, 22, 55, 67, 86, 100, 101, 103, 144, 146, 148]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 230 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 164/176 places, 170/171 transitions.
Applied a total of 0 rules in 5 ms. Remains 164 /164 variables (removed 0) and now considering 170/170 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 247 ms. Remains : 164/176 places, 170/171 transitions.
Stuttering acceptance computed with spot in 268 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p3), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s18 1) (EQ s27 1) (EQ s30 1)), p1:(AND (EQ s80 1) (EQ s83 1) (EQ s110 1)), p2:(AND (EQ s80 1) (EQ s83 1) (EQ s152 1)), p3:(AND (EQ s16 1) (EQ ...], 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 16 reset in 408 ms.
Stack based approach found an accepted trace after 611 steps with 1 reset with depth 379 and stack size 379 in 5 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-0-LTLFireability-02 finished in 970 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((X(p1)||p0))))'
Support contains 6 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 171/171 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 175 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 175 transition count 170
Applied a total of 2 rules in 17 ms. Remains 175 /176 variables (removed 1) and now considering 170/171 (removed 1) transitions.
[2023-03-15 21:51:52] [INFO ] Invariant cache hit.
[2023-03-15 21:51:53] [INFO ] Implicit Places using invariants in 239 ms returned [15, 17, 22, 29, 55, 67, 88, 100, 101, 103, 146, 148]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 243 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 163/176 places, 170/171 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 161 transition count 168
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 161 transition count 168
Applied a total of 4 rules in 17 ms. Remains 161 /163 variables (removed 2) and now considering 168/170 (removed 2) transitions.
// Phase 1: matrix 168 rows 161 cols
[2023-03-15 21:51:53] [INFO ] Computed 20 place invariants in 3 ms
[2023-03-15 21:51:53] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-03-15 21:51:53] [INFO ] Invariant cache hit.
[2023-03-15 21:51:53] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-15 21:51:53] [INFO ] Implicit Places using invariants and state equation in 448 ms returned []
Implicit Place search using SMT with State Equation took 618 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 161/176 places, 168/171 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 897 ms. Remains : 161/176 places, 168/171 transitions.
Stuttering acceptance computed with spot in 165 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(AND (EQ s84 1) (EQ s147 1)), p0:(OR (AND (EQ s80 1) (EQ s103 1)) (AND (EQ s133 1) (EQ s140 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-0-LTLFireability-05 finished in 1089 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((!p0 U (p1||G(!p0)))) U (X(G(p3))&&p2)))'
Support contains 6 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 171/171 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 175 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 175 transition count 170
Applied a total of 2 rules in 13 ms. Remains 175 /176 variables (removed 1) and now considering 170/171 (removed 1) transitions.
// Phase 1: matrix 170 rows 175 cols
[2023-03-15 21:51:53] [INFO ] Computed 32 place invariants in 4 ms
[2023-03-15 21:51:54] [INFO ] Implicit Places using invariants in 306 ms returned [15, 17, 29, 55, 67, 86, 88, 100, 103, 144, 146, 148]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 311 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 163/176 places, 170/171 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 161 transition count 168
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 161 transition count 168
Applied a total of 4 rules in 13 ms. Remains 161 /163 variables (removed 2) and now considering 168/170 (removed 2) transitions.
// Phase 1: matrix 168 rows 161 cols
[2023-03-15 21:51:54] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-15 21:51:54] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-15 21:51:54] [INFO ] Invariant cache hit.
[2023-03-15 21:51:54] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-15 21:51:54] [INFO ] Implicit Places using invariants and state equation in 417 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 161/176 places, 168/171 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 905 ms. Remains : 161/176 places, 168/171 transitions.
Stuttering acceptance computed with spot in 320 ms :[(OR (NOT p2) (NOT p3)), (AND (NOT p1) p0), (NOT p3), true, (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={0} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p2) p1 (NOT p3)) (AND (NOT p2) (NOT p0) (NOT p3))), acceptance={0} source=2 dest: 0}, { cond=(OR (AND (NOT p2) p1 (NOT p3)) (AND (NOT p1) (NOT p0) (NOT p3))), acceptance={} source=2 dest: 1}, { cond=p3, acceptance={} source=2 dest: 2}, { cond=(OR (AND p2 p1 (NOT p3)) (AND p2 (NOT p0) (NOT p3))), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0 p3), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(OR (AND p1 (NOT p3)) (AND (NOT p0) (NOT p3))), acceptance={} source=4 dest: 3}, { cond=(OR (AND p1 p3) (AND (NOT p0) p3)), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s20 1) (EQ s24 1)), p1:(AND (NOT (AND (EQ s32 1) (EQ s38 1))) (NOT (AND (EQ s20 1) (EQ s24 1)))), p0:(AND (EQ s20 1) (EQ s24 1)), p3:(AND (EQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33027 reset in 384 ms.
Product exploration explored 100000 steps with 33350 reset in 329 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0) (NOT p3)), (X (OR (AND (NOT p2) p1 (NOT p3)) (AND (NOT p2) (NOT p0) (NOT p3)))), (X (NOT p3)), (X (NOT (OR (AND p2 p1 (NOT p3)) (AND p2 (NOT p0) (NOT p3))))), (X (OR (AND (NOT p2) p1 (NOT p3)) (AND (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) p0 p3))), (X (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (OR (AND (NOT p2) p1 (NOT p3)) (AND (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT p3))), true, (X (X (NOT (OR (AND p2 p1 (NOT p3)) (AND p2 (NOT p0) (NOT p3)))))), (X (X (OR (AND (NOT p2) p1 (NOT p3)) (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT p2))), (X (X (OR (AND p1 (NOT p3)) (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND p1 p3) (AND (NOT p0) p3)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 22 factoid took 1400 ms. Reduced automaton from 5 states, 14 edges and 4 AP (stutter sensitive) to 5 states, 16 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p2) (NOT p3)), (AND (NOT p1) p0), (NOT p3), true, (OR (AND (NOT p0) (NOT p3)) (AND p1 (NOT p3)))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 15) seen :11
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 21:51:57] [INFO ] Invariant cache hit.
[2023-03-15 21:51:57] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 (NOT p0) (NOT p3)), (X (OR (AND (NOT p2) p1 (NOT p3)) (AND (NOT p2) (NOT p0) (NOT p3)))), (X (NOT p3)), (X (NOT (OR (AND p2 p1 (NOT p3)) (AND p2 (NOT p0) (NOT p3))))), (X (OR (AND (NOT p2) p1 (NOT p3)) (AND (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p1) p0 p3))), (X (NOT p2)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) p0 (NOT p3)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (OR (AND (NOT p2) p1 (NOT p3)) (AND (NOT p2) (NOT p0) (NOT p3))))), (X (X (NOT p3))), true, (X (X (NOT (OR (AND p2 p1 (NOT p3)) (AND p2 (NOT p0) (NOT p3)))))), (X (X (OR (AND (NOT p2) p1 (NOT p3)) (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0 p3)))), (X (X (NOT p2))), (X (X (OR (AND p1 (NOT p3)) (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) p0 (NOT p3))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (OR (AND p1 p3) (AND (NOT p0) p3))))), (G (NOT (OR (AND p1 (NOT p3) p2) (AND (NOT p3) (NOT p0) p2))))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p1) (NOT p3) (NOT p0)) (AND p1 (NOT p3) (NOT p2))))), (F (NOT (OR (AND p1 (NOT p3) (NOT p2)) (AND (NOT p3) (NOT p0) (NOT p2))))), (F p3), (F (AND (NOT p1) p3 p0 p2)), (F (OR (AND p1 p3) (AND p3 (NOT p0)))), (F (OR (AND (NOT p1) (NOT p3) p0) (AND (NOT p1) p0 (NOT p2)))), (F (NOT (OR (AND p1 (NOT p3)) (AND (NOT p3) (NOT p0))))), (F (AND (NOT p1) p0)), (F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p3 p0)), (F (NOT (OR (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2))))), (F (OR (AND p1 p2) (AND p3 p2) (AND (NOT p0) p2))), (F (NOT (OR (AND (NOT p1) (NOT p3) (NOT p0)) (AND p1 (NOT p2)) (AND (NOT p0) (NOT p2))))), (F (AND (NOT p1) (NOT p3) p0))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p1) (NOT p3) p0))
Knowledge based reduction with 23 factoid took 1031 ms. Reduced automaton from 5 states, 16 edges and 4 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA ParamProductionCell-PT-0-LTLFireability-06 FALSE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-0-LTLFireability-06 finished in 4977 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(!p0)))'
Support contains 2 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 171/171 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 175 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 175 transition count 170
Applied a total of 2 rules in 7 ms. Remains 175 /176 variables (removed 1) and now considering 170/171 (removed 1) transitions.
// Phase 1: matrix 170 rows 175 cols
[2023-03-15 21:51:58] [INFO ] Computed 32 place invariants in 4 ms
[2023-03-15 21:51:59] [INFO ] Implicit Places using invariants in 284 ms returned [15, 17, 22, 29, 55, 67, 86, 88, 100, 101, 103, 144, 146, 148]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 297 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 161/176 places, 170/171 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 159 transition count 168
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 159 transition count 168
Applied a total of 4 rules in 6 ms. Remains 159 /161 variables (removed 2) and now considering 168/170 (removed 2) transitions.
// Phase 1: matrix 168 rows 159 cols
[2023-03-15 21:51:59] [INFO ] Computed 18 place invariants in 2 ms
[2023-03-15 21:51:59] [INFO ] Implicit Places using invariants in 177 ms returned []
[2023-03-15 21:51:59] [INFO ] Invariant cache hit.
[2023-03-15 21:51:59] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-15 21:51:59] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 599 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 159/176 places, 168/171 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 911 ms. Remains : 159/176 places, 168/171 transitions.
Stuttering acceptance computed with spot in 106 ms :[p0, p0]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s16 1) (EQ s24 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 340 ms.
Product exploration explored 100000 steps with 50000 reset in 345 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 : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 3 factoid took 94 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ParamProductionCell-PT-0-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-0-LTLFireability-07 finished in 1822 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)||X(F((X(p3)&&p2)))||p0)))'
Support contains 6 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 171/171 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 175 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 175 transition count 170
Applied a total of 2 rules in 6 ms. Remains 175 /176 variables (removed 1) and now considering 170/171 (removed 1) transitions.
// Phase 1: matrix 170 rows 175 cols
[2023-03-15 21:52:00] [INFO ] Computed 32 place invariants in 2 ms
[2023-03-15 21:52:00] [INFO ] Implicit Places using invariants in 199 ms returned [15, 17, 22, 29, 55, 67, 86, 88, 100, 101, 103, 144, 148]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 200 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/176 places, 170/171 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 160 transition count 168
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 160 transition count 168
Applied a total of 4 rules in 3 ms. Remains 160 /162 variables (removed 2) and now considering 168/170 (removed 2) transitions.
// Phase 1: matrix 168 rows 160 cols
[2023-03-15 21:52:00] [INFO ] Computed 19 place invariants in 0 ms
[2023-03-15 21:52:00] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-15 21:52:00] [INFO ] Invariant cache hit.
[2023-03-15 21:52:01] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-15 21:52:01] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 160/176 places, 168/171 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 604 ms. Remains : 160/176 places, 168/171 transitions.
Stuttering acceptance computed with spot in 504 ms :[(OR (NOT p2) (NOT p3)), (NOT p3), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=p2, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=1 dest: 0}, { cond=(AND p2 (NOT p3)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p1 p2), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) p2 (NOT p3)), acceptance={} source=5 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p3)), acceptance={} source=5 dest: 4}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=5 dest: 5}]], initial=2, aps=[p2:(AND (EQ s133 1) (EQ s154 1)), p3:(AND (EQ s133 1) (EQ s154 1)), p0:(OR (EQ s90 0) (EQ s96 0)), p1:(AND (EQ s131 1) (EQ s138 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 328 ms.
Product exploration explored 100000 steps with 50000 reset in 356 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p3) p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p2))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 8 factoid took 215 ms. Reduced automaton from 6 states, 15 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ParamProductionCell-PT-0-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-0-LTLFireability-09 finished in 2043 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G((p1 U X(p2)))||p0))))'
Support contains 4 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 171/171 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 175 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 175 transition count 170
Applied a total of 2 rules in 6 ms. Remains 175 /176 variables (removed 1) and now considering 170/171 (removed 1) transitions.
// Phase 1: matrix 170 rows 175 cols
[2023-03-15 21:52:02] [INFO ] Computed 32 place invariants in 2 ms
[2023-03-15 21:52:03] [INFO ] Implicit Places using invariants in 292 ms returned [15, 17, 22, 29, 55, 67, 88, 100, 101, 103, 144, 146, 148]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 294 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/176 places, 170/171 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 160 transition count 168
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 160 transition count 168
Applied a total of 4 rules in 5 ms. Remains 160 /162 variables (removed 2) and now considering 168/170 (removed 2) transitions.
// Phase 1: matrix 168 rows 160 cols
[2023-03-15 21:52:03] [INFO ] Computed 19 place invariants in 2 ms
[2023-03-15 21:52:03] [INFO ] Implicit Places using invariants in 186 ms returned []
[2023-03-15 21:52:03] [INFO ] Invariant cache hit.
[2023-03-15 21:52:03] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-15 21:52:03] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 656 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 160/176 places, 168/171 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 963 ms. Remains : 160/176 places, 168/171 transitions.
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s79 0) (EQ s128 0)), p1:(AND (EQ s79 1) (EQ s128 1)), p2:(AND (EQ s80 1) (EQ s144 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 301 reset in 217 ms.
Product exploration explored 100000 steps with 324 reset in 256 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 667 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-15 21:52:05] [INFO ] Invariant cache hit.
[2023-03-15 21:52:05] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 21:52:05] [INFO ] [Nat]Absence check using 19 positive place invariants in 15 ms returned sat
[2023-03-15 21:52:05] [INFO ] After 104ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (G (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (AND p1 (NOT p0) (NOT p2))), (F (NOT p0)), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 12 factoid took 959 ms. Reduced automaton from 4 states, 11 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 168/168 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 160 transition count 139
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 1 with 29 rules applied. Total rules applied 58 place count 131 transition count 139
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 58 place count 131 transition count 131
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 74 place count 123 transition count 131
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 142 place count 88 transition count 98
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 142 place count 88 transition count 97
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 144 place count 87 transition count 97
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 86 transition count 96
Applied a total of 146 rules in 31 ms. Remains 86 /160 variables (removed 74) and now considering 96/168 (removed 72) transitions.
// Phase 1: matrix 96 rows 86 cols
[2023-03-15 21:52:07] [INFO ] Computed 17 place invariants in 1 ms
[2023-03-15 21:52:07] [INFO ] Implicit Places using invariants in 157 ms returned [0, 1]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 158 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/160 places, 96/168 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 83 transition count 95
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 82 transition count 94
Applied a total of 4 rules in 12 ms. Remains 82 /84 variables (removed 2) and now considering 94/96 (removed 2) transitions.
// Phase 1: matrix 94 rows 82 cols
[2023-03-15 21:52:07] [INFO ] Computed 15 place invariants in 1 ms
[2023-03-15 21:52:07] [INFO ] Implicit Places using invariants in 123 ms returned []
[2023-03-15 21:52:07] [INFO ] Invariant cache hit.
[2023-03-15 21:52:07] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-15 21:52:07] [INFO ] Implicit Places using invariants and state equation in 276 ms returned []
Implicit Place search using SMT with State Equation took 401 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 82/160 places, 94/168 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 602 ms. Remains : 82/160 places, 94/168 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 178 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 48 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=24 )
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 3 factoid took 230 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 756 reset in 210 ms.
Product exploration explored 100000 steps with 778 reset in 247 ms.
Built C files in :
/tmp/ltsmin12483887447888895110
[2023-03-15 21:52:08] [INFO ] Computing symmetric may disable matrix : 94 transitions.
[2023-03-15 21:52:08] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 21:52:08] [INFO ] Computing symmetric may enable matrix : 94 transitions.
[2023-03-15 21:52:08] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 21:52:08] [INFO ] Computing Do-Not-Accords matrix : 94 transitions.
[2023-03-15 21:52:08] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 21:52:08] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12483887447888895110
Running compilation step : cd /tmp/ltsmin12483887447888895110;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 688 ms.
Running link step : cd /tmp/ltsmin12483887447888895110;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin12483887447888895110;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14389352620817656905.hoa' '--buchi-type=spotba'
LTSmin run took 715 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-0-LTLFireability-10 finished in 7771 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 171/171 transitions.
Drop transitions removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 176 transition count 162
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 167 transition count 162
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 18 place count 167 transition count 148
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 46 place count 153 transition count 148
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 47 place count 152 transition count 147
Iterating global reduction 2 with 1 rules applied. Total rules applied 48 place count 152 transition count 147
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 104 place count 123 transition count 120
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 104 place count 123 transition count 119
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 106 place count 122 transition count 119
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 108 place count 121 transition count 118
Applied a total of 108 rules in 37 ms. Remains 121 /176 variables (removed 55) and now considering 118/171 (removed 53) transitions.
// Phase 1: matrix 118 rows 121 cols
[2023-03-15 21:52:10] [INFO ] Computed 30 place invariants in 1 ms
[2023-03-15 21:52:10] [INFO ] Implicit Places using invariants in 222 ms returned [0, 1, 9, 11, 15, 20, 34, 40, 51, 53, 64, 65, 100, 102, 103]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 240 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/176 places, 118/171 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 106 transition count 115
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 103 transition count 115
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 103 transition count 113
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 10 place count 101 transition count 113
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 2 with 60 rules applied. Total rules applied 70 place count 71 transition count 83
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 72 place count 70 transition count 82
Applied a total of 72 rules in 35 ms. Remains 70 /106 variables (removed 36) and now considering 82/118 (removed 36) transitions.
// Phase 1: matrix 82 rows 70 cols
[2023-03-15 21:52:10] [INFO ] Computed 15 place invariants in 0 ms
[2023-03-15 21:52:10] [INFO ] Implicit Places using invariants in 105 ms returned []
[2023-03-15 21:52:10] [INFO ] Invariant cache hit.
[2023-03-15 21:52:10] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-15 21:52:11] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 334 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 70/176 places, 82/171 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 649 ms. Remains : 70/176 places, 82/171 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-11 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 (EQ s37 1) (EQ s39 1) (EQ s43 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 187 ms.
Stack based approach found an accepted trace after 104 steps with 0 reset with depth 105 and stack size 105 in 0 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-0-LTLFireability-11 finished in 912 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((((X(p0)||F(p1)) U p0)||G(p2)))'
Support contains 5 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 171/171 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 175 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 175 transition count 170
Applied a total of 2 rules in 4 ms. Remains 175 /176 variables (removed 1) and now considering 170/171 (removed 1) transitions.
// Phase 1: matrix 170 rows 175 cols
[2023-03-15 21:52:11] [INFO ] Computed 32 place invariants in 2 ms
[2023-03-15 21:52:11] [INFO ] Implicit Places using invariants in 215 ms returned [17, 22, 29, 55, 67, 86, 88, 101, 103, 144, 146, 148]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 216 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 163/176 places, 170/171 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 161 transition count 168
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 161 transition count 168
Applied a total of 4 rules in 4 ms. Remains 161 /163 variables (removed 2) and now considering 168/170 (removed 2) transitions.
// Phase 1: matrix 168 rows 161 cols
[2023-03-15 21:52:11] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-15 21:52:11] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-15 21:52:11] [INFO ] Invariant cache hit.
[2023-03-15 21:52:11] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-15 21:52:12] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 161/176 places, 168/171 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 830 ms. Remains : 161/176 places, 168/171 transitions.
Stuttering acceptance computed with spot in 326 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s92 1) (EQ s95 1)), p2:(AND (EQ s4 1) (EQ s15 1)), p1:(AND (EQ s92 1) (EQ s112 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 775 reset in 197 ms.
Product exploration explored 100000 steps with 777 reset in 582 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 823 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 176 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=58 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p1) (NOT p0))))]
Knowledge based reduction with 16 factoid took 1072 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 211 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
[2023-03-15 21:52:15] [INFO ] Invariant cache hit.
[2023-03-15 21:52:16] [INFO ] [Real]Absence check using 19 positive place invariants in 15 ms returned sat
[2023-03-15 21:52:16] [INFO ] [Real]Absence check using 19 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-15 21:52:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:52:16] [INFO ] [Real]Absence check using state equation in 230 ms returned sat
[2023-03-15 21:52:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:52:16] [INFO ] [Nat]Absence check using 19 positive place invariants in 15 ms returned sat
[2023-03-15 21:52:16] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-15 21:52:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:52:16] [INFO ] [Nat]Absence check using state equation in 227 ms returned sat
[2023-03-15 21:52:16] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-15 21:52:16] [INFO ] [Nat]Added 59 Read/Feed constraints in 20 ms returned sat
[2023-03-15 21:52:16] [INFO ] Deduced a trap composed of 7 places in 100 ms of which 11 ms to minimize.
[2023-03-15 21:52:17] [INFO ] Deduced a trap composed of 5 places in 113 ms of which 2 ms to minimize.
[2023-03-15 21:52:17] [INFO ] Deduced a trap composed of 7 places in 90 ms of which 2 ms to minimize.
[2023-03-15 21:52:17] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 3 ms to minimize.
[2023-03-15 21:52:17] [INFO ] Deduced a trap composed of 44 places in 75 ms of which 2 ms to minimize.
[2023-03-15 21:52:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 599 ms
[2023-03-15 21:52:17] [INFO ] Computed and/alt/rep : 167/284/167 causal constraints (skipped 0 transitions) in 24 ms.
[2023-03-15 21:52:18] [INFO ] Deduced a trap composed of 42 places in 57 ms of which 0 ms to minimize.
[2023-03-15 21:52:18] [INFO ] Deduced a trap composed of 39 places in 77 ms of which 1 ms to minimize.
[2023-03-15 21:52:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 196 ms
[2023-03-15 21:52:18] [INFO ] Added : 165 causal constraints over 34 iterations in 996 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 161 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 168/168 transitions.
Applied a total of 0 rules in 2 ms. Remains 161 /161 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2023-03-15 21:52:18] [INFO ] Invariant cache hit.
[2023-03-15 21:52:18] [INFO ] Implicit Places using invariants in 162 ms returned []
[2023-03-15 21:52:18] [INFO ] Invariant cache hit.
[2023-03-15 21:52:18] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-15 21:52:19] [INFO ] Implicit Places using invariants and state equation in 446 ms returned []
Implicit Place search using SMT with State Equation took 610 ms to find 0 implicit places.
[2023-03-15 21:52:19] [INFO ] Invariant cache hit.
[2023-03-15 21:52:19] [INFO ] Dead Transitions using invariants and state equation in 245 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 859 ms. Remains : 161/161 places, 168/168 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 366 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
Finished random walk after 183 steps, including 0 resets, run visited all 3 properties in 7 ms. (steps per millisecond=26 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 6 factoid took 456 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
Stuttering acceptance computed with spot in 216 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
[2023-03-15 21:52:20] [INFO ] Invariant cache hit.
[2023-03-15 21:52:20] [INFO ] [Real]Absence check using 19 positive place invariants in 15 ms returned sat
[2023-03-15 21:52:20] [INFO ] [Real]Absence check using 19 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-15 21:52:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 21:52:21] [INFO ] [Real]Absence check using state equation in 228 ms returned sat
[2023-03-15 21:52:21] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 21:52:21] [INFO ] [Nat]Absence check using 19 positive place invariants in 16 ms returned sat
[2023-03-15 21:52:21] [INFO ] [Nat]Absence check using 19 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-15 21:52:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 21:52:21] [INFO ] [Nat]Absence check using state equation in 211 ms returned sat
[2023-03-15 21:52:21] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-15 21:52:21] [INFO ] [Nat]Added 59 Read/Feed constraints in 25 ms returned sat
[2023-03-15 21:52:21] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 3 ms to minimize.
[2023-03-15 21:52:21] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 0 ms to minimize.
[2023-03-15 21:52:21] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2023-03-15 21:52:22] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 0 ms to minimize.
[2023-03-15 21:52:22] [INFO ] Deduced a trap composed of 44 places in 71 ms of which 1 ms to minimize.
[2023-03-15 21:52:22] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 497 ms
[2023-03-15 21:52:22] [INFO ] Computed and/alt/rep : 167/284/167 causal constraints (skipped 0 transitions) in 18 ms.
[2023-03-15 21:52:23] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 0 ms to minimize.
[2023-03-15 21:52:23] [INFO ] Deduced a trap composed of 39 places in 74 ms of which 1 ms to minimize.
[2023-03-15 21:52:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 250 ms
[2023-03-15 21:52:23] [INFO ] Added : 165 causal constraints over 34 iterations in 1253 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 212 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
Product exploration explored 100000 steps with 776 reset in 182 ms.
Product exploration explored 100000 steps with 775 reset in 211 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 217 ms :[(NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (NOT p1)]
Support contains 3 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 168/168 transitions.
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 27 rules applied. Total rules applied 27 place count 161 transition count 168
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 10 Pre rules applied. Total rules applied 27 place count 161 transition count 168
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 37 place count 161 transition count 168
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 41 place count 157 transition count 164
Deduced a syphon composed of 33 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 45 place count 157 transition count 164
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 75 places in 0 ms
Iterating global reduction 1 with 42 rules applied. Total rules applied 87 place count 157 transition count 164
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 109 place count 135 transition count 142
Deduced a syphon composed of 53 places in 1 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 131 place count 135 transition count 142
Deduced a syphon composed of 53 places in 0 ms
Applied a total of 131 rules in 46 ms. Remains 135 /161 variables (removed 26) and now considering 142/168 (removed 26) transitions.
[2023-03-15 21:52:24] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 142 rows 135 cols
[2023-03-15 21:52:24] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-15 21:52:24] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 135/161 places, 142/168 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 273 ms. Remains : 135/161 places, 142/168 transitions.
Built C files in :
/tmp/ltsmin7689079243229506430
[2023-03-15 21:52:24] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7689079243229506430
Running compilation step : cd /tmp/ltsmin7689079243229506430;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 631 ms.
Running link step : cd /tmp/ltsmin7689079243229506430;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin7689079243229506430;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7570080924881385178.hoa' '--buchi-type=spotba'
LTSmin run took 11084 ms.
FORMULA ParamProductionCell-PT-0-LTLFireability-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-0-LTLFireability-13 finished in 25220 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U (!p1&&G(F((!p2||G(!p3)))))))'
Support contains 8 out of 176 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 176/176 places, 171/171 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 176 transition count 165
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 170 transition count 164
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 169 transition count 164
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 14 place count 169 transition count 149
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 44 place count 154 transition count 149
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 94 place count 128 transition count 125
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 94 place count 128 transition count 124
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 96 place count 127 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 3 with 2 rules applied. Total rules applied 98 place count 126 transition count 123
Applied a total of 98 rules in 20 ms. Remains 126 /176 variables (removed 50) and now considering 123/171 (removed 48) transitions.
// Phase 1: matrix 123 rows 126 cols
[2023-03-15 21:52:36] [INFO ] Computed 30 place invariants in 1 ms
[2023-03-15 21:52:36] [INFO ] Implicit Places using invariants in 173 ms returned [0, 1, 9, 11, 15, 20, 34, 66, 67, 69, 104, 106, 107]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 176 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 113/176 places, 123/171 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 113 transition count 120
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 110 transition count 120
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 40 place count 93 transition count 103
Applied a total of 40 rules in 13 ms. Remains 93 /113 variables (removed 20) and now considering 103/123 (removed 20) transitions.
// Phase 1: matrix 103 rows 93 cols
[2023-03-15 21:52:36] [INFO ] Computed 17 place invariants in 0 ms
[2023-03-15 21:52:36] [INFO ] Implicit Places using invariants in 119 ms returned []
[2023-03-15 21:52:36] [INFO ] Invariant cache hit.
[2023-03-15 21:52:37] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-15 21:52:37] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 93/176 places, 103/171 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 573 ms. Remains : 93/176 places, 103/171 transitions.
Stuttering acceptance computed with spot in 229 ms :[(OR p1 (AND p2 p3)), true, (NOT p0), (AND p3 p2), (AND p3 p2)]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p0), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p3 p2), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND p3 p2), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p3) p2), acceptance={} source=4 dest: 4}, { cond=(AND p3 p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s37 1) (EQ s38 1)), p0:(EQ s54 1), p3:(AND (EQ s24 1) (EQ s26 1) (EQ s31 1)), p2:(AND (EQ s39 1) (EQ s75 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 136 ms.
Product exploration explored 100000 steps with 0 reset in 140 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), (X (NOT p1)), (X (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p3 p2))), (X (NOT (AND p3 p2))), true, (X (X (NOT p1))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p3 p2)))), (X (X (NOT (AND p3 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 884 ms. Reduced automaton from 5 states, 12 edges and 4 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND p2 p3), (AND p2 p3), (AND p2 p3)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 21:52:38] [INFO ] Invariant cache hit.
[2023-03-15 21:52:38] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned sat
[2023-03-15 21:52:38] [INFO ] [Real]Absence check using 16 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-15 21:52:38] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), (X (NOT p1)), (X (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND (NOT p3) p2))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) p3 p2))), (X (NOT (AND p3 p2))), true, (X (X (NOT p1))), (X (X (NOT p0))), (X (X (NOT (AND p1 p0)))), (X (X (NOT (AND (NOT p3) p2)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p3 p2)))), (X (X (NOT (AND p3 p2)))), (G (NOT (AND p2 p3)))]
False Knowledge obtained : [(F (AND p2 (NOT p3)))]
Property proved to be true thanks to knowledge :(G (NOT (AND p2 p3)))
Knowledge based reduction with 17 factoid took 427 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ParamProductionCell-PT-0-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-0-LTLFireability-14 finished in 2669 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 176 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 176/176 places, 171/171 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 175 transition count 170
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 175 transition count 170
Applied a total of 2 rules in 8 ms. Remains 175 /176 variables (removed 1) and now considering 170/171 (removed 1) transitions.
// Phase 1: matrix 170 rows 175 cols
[2023-03-15 21:52:39] [INFO ] Computed 32 place invariants in 2 ms
[2023-03-15 21:52:39] [INFO ] Implicit Places using invariants in 265 ms returned [15, 17, 22, 29, 55, 67, 86, 88, 100, 101, 103, 144, 146]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 266 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/176 places, 170/171 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 160 transition count 168
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 160 transition count 168
Applied a total of 4 rules in 6 ms. Remains 160 /162 variables (removed 2) and now considering 168/170 (removed 2) transitions.
// Phase 1: matrix 168 rows 160 cols
[2023-03-15 21:52:39] [INFO ] Computed 19 place invariants in 1 ms
[2023-03-15 21:52:39] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-15 21:52:39] [INFO ] Invariant cache hit.
[2023-03-15 21:52:39] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-15 21:52:40] [INFO ] Implicit Places using invariants and state equation in 355 ms returned []
Implicit Place search using SMT with State Equation took 507 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 160/176 places, 168/171 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 789 ms. Remains : 160/176 places, 168/171 transitions.
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-0-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (NEQ s132 1) (NEQ s134 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 174 ms.
Product exploration explored 100000 steps with 33333 reset in 190 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 (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 67 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ParamProductionCell-PT-0-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-0-LTLFireability-15 finished in 1378 ms.
All properties solved by simple procedures.
Total runtime 54364 ms.

BK_STOP 1678917161574

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-0"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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