Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 20:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K Apr 12 20:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Apr 12 20:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Apr 12 20:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 174K May 18 16:43 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-5-LTLFireability-00
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-01
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-02
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-03
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-04
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-05
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-06
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-07
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-08
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-09
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-10
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-11
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-12
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-13
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-14
FORMULA_NAME ParamProductionCell-PT-5-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716841105370

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ParamProductionCell-PT-5
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-27 20:18:27] [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]
[2024-05-27 20:18:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 20:18:28] [INFO ] Load time of PNML (sax parser for PT used): 122 ms
[2024-05-27 20:18:28] [INFO ] Transformed 231 places.
[2024-05-27 20:18:28] [INFO ] Transformed 202 transitions.
[2024-05-27 20:18:28] [INFO ] Found NUPN structural information;
[2024-05-27 20:18:28] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 252 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ParamProductionCell-PT-5-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-5-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-5-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 51 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 225 transition count 196
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 225 transition count 196
Applied a total of 12 rules in 47 ms. Remains 225 /231 variables (removed 6) and now considering 196/202 (removed 6) transitions.
// Phase 1: matrix 196 rows 225 cols
[2024-05-27 20:18:28] [INFO ] Computed 59 invariants in 19 ms
[2024-05-27 20:18:29] [INFO ] Implicit Places using invariants in 579 ms returned [15, 16, 18, 31, 35, 36, 41, 46, 47, 59, 64, 73, 79, 101, 114, 116, 118, 119, 159, 162, 190, 191, 194, 195, 200, 201, 216]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 626 ms to find 27 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 198/231 places, 196/202 transitions.
Applied a total of 0 rules in 12 ms. Remains 198 /198 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 686 ms. Remains : 198/231 places, 196/202 transitions.
Support contains 51 out of 198 places after structural reductions.
[2024-05-27 20:18:29] [INFO ] Flatten gal took : 58 ms
[2024-05-27 20:18:29] [INFO ] Flatten gal took : 25 ms
[2024-05-27 20:18:29] [INFO ] Input system was already deterministic with 196 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 29) seen :28
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 196 rows 198 cols
[2024-05-27 20:18:29] [INFO ] Computed 32 invariants in 7 ms
[2024-05-27 20:18:29] [INFO ] [Real]Absence check using 23 positive place invariants in 13 ms returned sat
[2024-05-27 20:18:29] [INFO ] [Real]Absence check using 23 positive and 9 generalized place invariants in 6 ms returned sat
[2024-05-27 20:18:29] [INFO ] After 123ms 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 1 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
FORMULA ParamProductionCell-PT-5-LTLFireability-06 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.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(p0)))&&(!p1 U (p2||G(!p1)))))'
Support contains 8 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 196/196 transitions.
Applied a total of 0 rules in 9 ms. Remains 198 /198 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2024-05-27 20:18:30] [INFO ] Invariant cache hit.
[2024-05-27 20:18:30] [INFO ] Implicit Places using invariants in 226 ms returned [16, 21, 35, 54, 66, 85, 99, 144, 145, 179]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 231 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/198 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 186 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 186 transition count 194
Applied a total of 4 rules in 11 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2024-05-27 20:18:30] [INFO ] Computed 22 invariants in 3 ms
[2024-05-27 20:18:30] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-05-27 20:18:30] [INFO ] Invariant cache hit.
[2024-05-27 20:18:30] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 20:18:31] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/198 places, 194/196 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 727 ms. Remains : 186/198 places, 194/196 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 329 ms :[(OR (NOT p0) (AND p1 (NOT p2))), true, (NOT p0), (AND (NOT p2) p1), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(OR p2 (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 1}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (NOT (AND (EQ s32 1) (EQ s46 1) (EQ s80 1) (EQ s125 1) (EQ s91 1) (EQ s114 1))) (NOT (AND (EQ s91 1) (EQ s114 1)))), p1:(AND (EQ s91 1) (EQ s114 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-00 finished in 1153 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0) U p1))'
Support contains 3 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 196/196 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 198 transition count 171
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 173 transition count 171
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 50 place count 173 transition count 158
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 76 place count 160 transition count 158
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 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 130 place count 133 transition count 131
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 132 place count 132 transition count 130
Applied a total of 132 rules in 41 ms. Remains 132 /198 variables (removed 66) and now considering 130/196 (removed 66) transitions.
// Phase 1: matrix 130 rows 132 cols
[2024-05-27 20:18:31] [INFO ] Computed 32 invariants in 2 ms
[2024-05-27 20:18:31] [INFO ] Implicit Places using invariants in 151 ms returned [9, 12, 22, 34, 41, 51, 52, 64, 95, 98, 99, 122]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 152 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/198 places, 130/196 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 120 transition count 128
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 118 transition count 128
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 118 transition count 127
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 117 transition count 127
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 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 60 place count 90 transition count 100
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 62 place count 89 transition count 99
Applied a total of 62 rules in 18 ms. Remains 89 /120 variables (removed 31) and now considering 99/130 (removed 31) transitions.
// Phase 1: matrix 99 rows 89 cols
[2024-05-27 20:18:31] [INFO ] Computed 20 invariants in 1 ms
[2024-05-27 20:18:31] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-27 20:18:31] [INFO ] Invariant cache hit.
[2024-05-27 20:18:31] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-27 20:18:31] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 89/198 places, 99/196 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 502 ms. Remains : 89/198 places, 99/196 transitions.
Stuttering acceptance computed with spot in 93 ms :[(NOT p1), true, p0]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(EQ s59 1), p0:(AND (EQ s3 1) (EQ s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Entered a terminal (fully accepting) state of product in 10 steps with 0 reset in 1 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-01 finished in 617 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0)||G(!p1)) U p1))'
Support contains 3 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 196/196 transitions.
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 198 transition count 171
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 50 place count 173 transition count 171
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 50 place count 173 transition count 157
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 78 place count 159 transition count 157
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 128 place count 134 transition count 132
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 130 place count 133 transition count 131
Applied a total of 130 rules in 30 ms. Remains 133 /198 variables (removed 65) and now considering 131/196 (removed 65) transitions.
// Phase 1: matrix 131 rows 133 cols
[2024-05-27 20:18:32] [INFO ] Computed 32 invariants in 5 ms
[2024-05-27 20:18:32] [INFO ] Implicit Places using invariants in 146 ms returned [8, 11, 21, 33, 40, 50, 64, 95, 98, 99, 123]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 147 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 122/198 places, 131/196 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 122 transition count 129
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 120 transition count 129
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 120 transition count 128
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 6 place count 119 transition count 128
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 8 place count 117 transition count 126
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 117 transition count 126
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 36 place count 104 transition count 113
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 38 place count 103 transition count 112
Applied a total of 38 rules in 19 ms. Remains 103 /122 variables (removed 19) and now considering 112/131 (removed 19) transitions.
// Phase 1: matrix 112 rows 103 cols
[2024-05-27 20:18:32] [INFO ] Computed 21 invariants in 1 ms
[2024-05-27 20:18:32] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-05-27 20:18:32] [INFO ] Invariant cache hit.
[2024-05-27 20:18:32] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-27 20:18:32] [INFO ] Implicit Places using invariants and state equation in 248 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 103/198 places, 112/196 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 546 ms. Remains : 103/198 places, 112/196 transitions.
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p1), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p0), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(EQ s53 1), p1:(AND (EQ s38 1) (EQ s40 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-04 finished in 702 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 196/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 198 /198 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 198 cols
[2024-05-27 20:18:32] [INFO ] Computed 32 invariants in 2 ms
[2024-05-27 20:18:32] [INFO ] Implicit Places using invariants in 180 ms returned [16, 21, 35, 54, 66, 85, 86, 99, 141, 144, 179]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 182 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/198 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 185 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 185 transition count 194
Applied a total of 4 rules in 4 ms. Remains 185 /187 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 185 cols
[2024-05-27 20:18:32] [INFO ] Computed 21 invariants in 1 ms
[2024-05-27 20:18:33] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-05-27 20:18:33] [INFO ] Invariant cache hit.
[2024-05-27 20:18:33] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 20:18:33] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 185/198 places, 194/196 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 669 ms. Remains : 185/198 places, 194/196 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-07 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: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (EQ s132 1) (EQ 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 1409 reset in 410 ms.
Product exploration explored 100000 steps with 1419 reset in 277 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), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 245 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 52 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=26 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-05-27 20:18:35] [INFO ] Invariant cache hit.
[2024-05-27 20:18:35] [INFO ] [Real]Absence check using 18 positive place invariants in 12 ms returned sat
[2024-05-27 20:18:35] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 5 ms returned sat
[2024-05-27 20:18:35] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:18:35] [INFO ] [Real]Absence check using state equation in 257 ms returned sat
[2024-05-27 20:18:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:18:35] [INFO ] [Nat]Absence check using 18 positive place invariants in 9 ms returned sat
[2024-05-27 20:18:35] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-27 20:18:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:18:35] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2024-05-27 20:18:35] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 20:18:35] [INFO ] [Nat]Added 68 Read/Feed constraints in 27 ms returned sat
[2024-05-27 20:18:36] [INFO ] Deduced a trap composed of 6 places in 90 ms of which 4 ms to minimize.
[2024-05-27 20:18:36] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 2 ms to minimize.
[2024-05-27 20:18:36] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 1 ms to minimize.
[2024-05-27 20:18:36] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 1 ms to minimize.
[2024-05-27 20:18:36] [INFO ] Deduced a trap composed of 7 places in 86 ms of which 1 ms to minimize.
[2024-05-27 20:18:36] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 1 ms to minimize.
[2024-05-27 20:18:36] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 1 ms to minimize.
[2024-05-27 20:18:36] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 0 ms to minimize.
[2024-05-27 20:18:36] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 833 ms
[2024-05-27 20:18:36] [INFO ] Computed and/alt/rep : 189/309/189 causal constraints (skipped 0 transitions) in 19 ms.
[2024-05-27 20:18:37] [INFO ] Added : 173 causal constraints over 35 iterations in 761 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Applied a total of 0 rules in 2 ms. Remains 185 /185 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2024-05-27 20:18:37] [INFO ] Invariant cache hit.
[2024-05-27 20:18:37] [INFO ] Implicit Places using invariants in 127 ms returned []
[2024-05-27 20:18:37] [INFO ] Invariant cache hit.
[2024-05-27 20:18:37] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 20:18:38] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 459 ms to find 0 implicit places.
[2024-05-27 20:18:38] [INFO ] Invariant cache hit.
[2024-05-27 20:18:38] [INFO ] Dead Transitions using invariants and state equation in 265 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 728 ms. Remains : 185/185 places, 194/194 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 74 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Finished random walk after 76 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=76 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), true]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 95 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2024-05-27 20:18:38] [INFO ] Invariant cache hit.
[2024-05-27 20:18:39] [INFO ] [Real]Absence check using 18 positive place invariants in 10 ms returned sat
[2024-05-27 20:18:39] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-27 20:18:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:18:39] [INFO ] [Real]Absence check using state equation in 250 ms returned sat
[2024-05-27 20:18:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:18:39] [INFO ] [Nat]Absence check using 18 positive place invariants in 8 ms returned sat
[2024-05-27 20:18:39] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-27 20:18:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:18:39] [INFO ] [Nat]Absence check using state equation in 168 ms returned sat
[2024-05-27 20:18:39] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 20:18:39] [INFO ] [Nat]Added 68 Read/Feed constraints in 25 ms returned sat
[2024-05-27 20:18:39] [INFO ] Deduced a trap composed of 6 places in 74 ms of which 1 ms to minimize.
[2024-05-27 20:18:39] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 0 ms to minimize.
[2024-05-27 20:18:39] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2024-05-27 20:18:40] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-05-27 20:18:40] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 0 ms to minimize.
[2024-05-27 20:18:40] [INFO ] Deduced a trap composed of 45 places in 71 ms of which 0 ms to minimize.
[2024-05-27 20:18:40] [INFO ] Deduced a trap composed of 25 places in 75 ms of which 1 ms to minimize.
[2024-05-27 20:18:40] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2024-05-27 20:18:40] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 721 ms
[2024-05-27 20:18:40] [INFO ] Computed and/alt/rep : 189/309/189 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-27 20:18:41] [INFO ] Added : 173 causal constraints over 35 iterations in 915 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1418 reset in 154 ms.
Product exploration explored 100000 steps with 1417 reset in 313 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 194/194 transitions.
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 185 transition count 194
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 12 Pre rules applied. Total rules applied 37 place count 185 transition count 196
Deduced a syphon composed of 49 places in 1 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 49 place count 185 transition count 196
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 57 place count 177 transition count 187
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 65 place count 177 transition count 187
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 1 with 42 rules applied. Total rules applied 107 place count 177 transition count 187
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 132 place count 152 transition count 162
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 157 place count 152 transition count 162
Deduced a syphon composed of 58 places in 0 ms
Applied a total of 157 rules in 33 ms. Remains 152 /185 variables (removed 33) and now considering 162/194 (removed 32) transitions.
[2024-05-27 20:18:42] [INFO ] Redundant transitions in 6 ms returned []
// Phase 1: matrix 162 rows 152 cols
[2024-05-27 20:18:42] [INFO ] Computed 21 invariants in 2 ms
[2024-05-27 20:18:42] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 152/185 places, 162/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 199 ms. Remains : 152/185 places, 162/194 transitions.
Built C files in :
/tmp/ltsmin9888309890812846620
[2024-05-27 20:18:42] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9888309890812846620
Running compilation step : cd /tmp/ltsmin9888309890812846620;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 608 ms.
Running link step : cd /tmp/ltsmin9888309890812846620;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin9888309890812846620;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased6828874790882763666.hoa' '--buchi-type=spotba'
LTSmin run took 7291 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-07 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-5-LTLFireability-07 finished in 17784 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(G(p1))))))'
Support contains 3 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 196/196 transitions.
Applied a total of 0 rules in 4 ms. Remains 198 /198 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 198 cols
[2024-05-27 20:18:50] [INFO ] Computed 32 invariants in 1 ms
[2024-05-27 20:18:50] [INFO ] Implicit Places using invariants in 170 ms returned [16, 21, 35, 54, 66, 85, 86, 99, 141, 144, 145, 179]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 173 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/198 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 184 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 184 transition count 194
Applied a total of 4 rules in 5 ms. Remains 184 /186 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 184 cols
[2024-05-27 20:18:50] [INFO ] Computed 20 invariants in 2 ms
[2024-05-27 20:18:50] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-27 20:18:50] [INFO ] Invariant cache hit.
[2024-05-27 20:18:50] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 20:18:51] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 184/198 places, 194/196 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 707 ms. Remains : 184/198 places, 194/196 transitions.
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s73 0), p1:(OR (EQ s14 0) (EQ s119 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 91 steps with 0 reset in 5 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-08 finished in 970 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p1)||p0)))'
Support contains 7 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 196/196 transitions.
Drop transitions removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 198 transition count 172
Reduce places removed 24 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 25 rules applied. Total rules applied 49 place count 174 transition count 171
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 50 place count 173 transition count 171
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 50 place count 173 transition count 157
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 78 place count 159 transition count 157
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 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 132 place count 132 transition count 130
Applied a total of 132 rules in 23 ms. Remains 132 /198 variables (removed 66) and now considering 130/196 (removed 66) transitions.
// Phase 1: matrix 130 rows 132 cols
[2024-05-27 20:18:51] [INFO ] Computed 32 invariants in 5 ms
[2024-05-27 20:18:51] [INFO ] Implicit Places using invariants in 185 ms returned [9, 37, 44, 55, 56, 68, 95, 98, 99, 122]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 187 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 122/198 places, 130/196 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 122 transition count 128
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 120 transition count 128
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 120 transition count 127
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 119 transition count 127
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 2 with 50 rules applied. Total rules applied 56 place count 94 transition count 102
Applied a total of 56 rules in 14 ms. Remains 94 /122 variables (removed 28) and now considering 102/130 (removed 28) transitions.
// Phase 1: matrix 102 rows 94 cols
[2024-05-27 20:18:51] [INFO ] Computed 22 invariants in 1 ms
[2024-05-27 20:18:51] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-27 20:18:51] [INFO ] Invariant cache hit.
[2024-05-27 20:18:51] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 20:18:52] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 94/198 places, 102/196 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 522 ms. Remains : 94/198 places, 102/196 transitions.
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s53 0) (EQ s55 0) (AND (EQ s10 1) (EQ s11 1) (EQ s15 1))), p1:(OR (EQ s20 0) (EQ s27 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 84 reset in 209 ms.
Product exploration explored 100000 steps with 90 reset in 251 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 174 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 74 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 61 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=61 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 212 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 81 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 7 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 102/102 transitions.
Applied a total of 0 rules in 4 ms. Remains 94 /94 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-05-27 20:18:53] [INFO ] Invariant cache hit.
[2024-05-27 20:18:53] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-05-27 20:18:53] [INFO ] Invariant cache hit.
[2024-05-27 20:18:53] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 20:18:53] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2024-05-27 20:18:53] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-27 20:18:53] [INFO ] Invariant cache hit.
[2024-05-27 20:18:53] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 420 ms. Remains : 94/94 places, 102/102 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 179 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 72 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 218 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=109 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 246 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 74 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 95 reset in 145 ms.
Product exploration explored 100000 steps with 97 reset in 398 ms.
Built C files in :
/tmp/ltsmin4537622324575317841
[2024-05-27 20:18:54] [INFO ] Computing symmetric may disable matrix : 102 transitions.
[2024-05-27 20:18:54] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:18:54] [INFO ] Computing symmetric may enable matrix : 102 transitions.
[2024-05-27 20:18:54] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:18:54] [INFO ] Computing Do-Not-Accords matrix : 102 transitions.
[2024-05-27 20:18:54] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:18:54] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4537622324575317841
Running compilation step : cd /tmp/ltsmin4537622324575317841;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 320 ms.
Running link step : cd /tmp/ltsmin4537622324575317841;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin4537622324575317841;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17761537718769764979.hoa' '--buchi-type=spotba'
LTSmin run took 1993 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-09 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-5-LTLFireability-09 finished in 5813 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p0)||X(X(p1))))))'
Support contains 4 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 196/196 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 198 transition count 170
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 172 transition count 170
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 52 place count 172 transition count 157
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 78 place count 159 transition count 157
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 124 place count 136 transition count 134
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 126 place count 135 transition count 133
Applied a total of 126 rules in 15 ms. Remains 135 /198 variables (removed 63) and now considering 133/196 (removed 63) transitions.
// Phase 1: matrix 133 rows 135 cols
[2024-05-27 20:18:57] [INFO ] Computed 32 invariants in 2 ms
[2024-05-27 20:18:57] [INFO ] Implicit Places using invariants in 191 ms returned [8, 11, 36, 43, 53, 54, 66, 97, 98, 125]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 192 ms to find 10 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 125/198 places, 133/196 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 125 transition count 130
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 122 transition count 130
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 50 place count 100 transition count 108
Applied a total of 50 rules in 6 ms. Remains 100 /125 variables (removed 25) and now considering 108/133 (removed 25) transitions.
// Phase 1: matrix 108 rows 100 cols
[2024-05-27 20:18:57] [INFO ] Computed 22 invariants in 1 ms
[2024-05-27 20:18:57] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-05-27 20:18:57] [INFO ] Invariant cache hit.
[2024-05-27 20:18:57] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-27 20:18:57] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 352 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 100/198 places, 108/196 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 566 ms. Remains : 100/198 places, 108/196 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s62 1) (EQ s70 1)), p0:(OR (EQ s17 0) (EQ s24 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3075 reset in 152 ms.
Product exploration explored 100000 steps with 3311 reset in 170 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) p0), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
Knowledge based reduction with 3 factoid took 181 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-27 20:18:58] [INFO ] Invariant cache hit.
[2024-05-27 20:18:58] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 20:18:58] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2024-05-27 20:18:58] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-27 20:18:58] [INFO ] After 45ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 4 factoid took 209 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 100 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 100/100 places, 108/108 transitions.
Applied a total of 0 rules in 5 ms. Remains 100 /100 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2024-05-27 20:18:59] [INFO ] Invariant cache hit.
[2024-05-27 20:18:59] [INFO ] Implicit Places using invariants in 138 ms returned []
[2024-05-27 20:18:59] [INFO ] Invariant cache hit.
[2024-05-27 20:18:59] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-27 20:18:59] [INFO ] Implicit Places using invariants and state equation in 208 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
[2024-05-27 20:18:59] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-27 20:18:59] [INFO ] Invariant cache hit.
[2024-05-27 20:18:59] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 456 ms. Remains : 100/100 places, 108/108 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 161 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 180 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3343 reset in 142 ms.
Product exploration explored 100000 steps with 3297 reset in 235 ms.
Built C files in :
/tmp/ltsmin560258205891108818
[2024-05-27 20:19:00] [INFO ] Computing symmetric may disable matrix : 108 transitions.
[2024-05-27 20:19:00] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:19:00] [INFO ] Computing symmetric may enable matrix : 108 transitions.
[2024-05-27 20:19:00] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:19:00] [INFO ] Computing Do-Not-Accords matrix : 108 transitions.
[2024-05-27 20:19:00] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:19:00] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin560258205891108818
Running compilation step : cd /tmp/ltsmin560258205891108818;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 360 ms.
Running link step : cd /tmp/ltsmin560258205891108818;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 62 ms.
Running LTSmin : cd /tmp/ltsmin560258205891108818;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10062896256098076789.hoa' '--buchi-type=spotba'
LTSmin run took 2219 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-5-LTLFireability-10 finished in 5907 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G((F(p1)||X(G(p2))))))'
Support contains 6 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 196/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 198 /198 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 198 cols
[2024-05-27 20:19:03] [INFO ] Computed 32 invariants in 2 ms
[2024-05-27 20:19:03] [INFO ] Implicit Places using invariants in 184 ms returned [16, 21, 35, 54, 66, 86, 99, 141, 144, 145, 179]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 186 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/198 places, 196/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 187 /187 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 194 ms. Remains : 187/198 places, 196/196 transitions.
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s80 1) (EQ s85 1) (EQ s148 1)), p1:(AND (EQ s91 1) (EQ s96 1)), p2:(EQ s166 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 803 reset in 144 ms.
Product exploration explored 100000 steps with 805 reset in 165 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 p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 133 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Finished random walk after 1571 steps, including 0 resets, run visited all 3 properties in 14 ms. (steps per millisecond=112 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 330 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 196 rows 187 cols
[2024-05-27 20:19:04] [INFO ] Computed 21 invariants in 1 ms
[2024-05-27 20:19:04] [INFO ] [Real]Absence check using 18 positive place invariants in 9 ms returned sat
[2024-05-27 20:19:04] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-27 20:19:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:19:05] [INFO ] [Real]Absence check using state equation in 226 ms returned sat
[2024-05-27 20:19:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:19:05] [INFO ] [Nat]Absence check using 18 positive place invariants in 11 ms returned sat
[2024-05-27 20:19:05] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-27 20:19:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:19:05] [INFO ] [Nat]Absence check using state equation in 206 ms returned sat
[2024-05-27 20:19:05] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 20:19:05] [INFO ] [Nat]Added 68 Read/Feed constraints in 25 ms returned sat
[2024-05-27 20:19:05] [INFO ] Deduced a trap composed of 7 places in 93 ms of which 1 ms to minimize.
[2024-05-27 20:19:05] [INFO ] Deduced a trap composed of 5 places in 74 ms of which 1 ms to minimize.
[2024-05-27 20:19:05] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 1 ms to minimize.
[2024-05-27 20:19:06] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 0 ms to minimize.
[2024-05-27 20:19:06] [INFO ] Deduced a trap composed of 14 places in 108 ms of which 0 ms to minimize.
[2024-05-27 20:19:06] [INFO ] Deduced a trap composed of 5 places in 82 ms of which 1 ms to minimize.
[2024-05-27 20:19:06] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 1 ms to minimize.
[2024-05-27 20:19:06] [INFO ] Deduced a trap composed of 11 places in 80 ms of which 0 ms to minimize.
[2024-05-27 20:19:06] [INFO ] Deduced a trap composed of 29 places in 77 ms of which 0 ms to minimize.
[2024-05-27 20:19:06] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-05-27 20:19:06] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 1 ms to minimize.
[2024-05-27 20:19:06] [INFO ] Deduced a trap composed of 69 places in 60 ms of which 0 ms to minimize.
[2024-05-27 20:19:06] [INFO ] Deduced a trap composed of 26 places in 135 ms of which 1 ms to minimize.
[2024-05-27 20:19:07] [INFO ] Deduced a trap composed of 7 places in 117 ms of which 1 ms to minimize.
[2024-05-27 20:19:07] [INFO ] Deduced a trap composed of 21 places in 110 ms of which 1 ms to minimize.
[2024-05-27 20:19:07] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 4 ms to minimize.
[2024-05-27 20:19:07] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 2 ms to minimize.
[2024-05-27 20:19:07] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1780 ms
[2024-05-27 20:19:07] [INFO ] Computed and/alt/rep : 191/335/191 causal constraints (skipped 0 transitions) in 32 ms.
[2024-05-27 20:19:08] [INFO ] Added : 182 causal constraints over 37 iterations in 821 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p2))
Support contains 6 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 196/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 187 /187 variables (removed 0) and now considering 196/196 (removed 0) transitions.
[2024-05-27 20:19:08] [INFO ] Invariant cache hit.
[2024-05-27 20:19:08] [INFO ] Implicit Places using invariants in 216 ms returned []
[2024-05-27 20:19:08] [INFO ] Invariant cache hit.
[2024-05-27 20:19:08] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 20:19:08] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 581 ms to find 0 implicit places.
[2024-05-27 20:19:08] [INFO ] Invariant cache hit.
[2024-05-27 20:19:09] [INFO ] Dead Transitions using invariants and state equation in 312 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 896 ms. Remains : 187/187 places, 196/196 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) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 125 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Finished random walk after 3208 steps, including 0 resets, run visited all 3 properties in 10 ms. (steps per millisecond=320 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 192 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
[2024-05-27 20:19:09] [INFO ] Invariant cache hit.
[2024-05-27 20:19:10] [INFO ] [Real]Absence check using 18 positive place invariants in 11 ms returned sat
[2024-05-27 20:19:10] [INFO ] [Real]Absence check using 18 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-27 20:19:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:19:10] [INFO ] [Real]Absence check using state equation in 179 ms returned sat
[2024-05-27 20:19:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:19:10] [INFO ] [Nat]Absence check using 18 positive place invariants in 11 ms returned sat
[2024-05-27 20:19:10] [INFO ] [Nat]Absence check using 18 positive and 3 generalized place invariants in 4 ms returned sat
[2024-05-27 20:19:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:19:10] [INFO ] [Nat]Absence check using state equation in 207 ms returned sat
[2024-05-27 20:19:10] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 20:19:10] [INFO ] [Nat]Added 68 Read/Feed constraints in 19 ms returned sat
[2024-05-27 20:19:10] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 2 ms to minimize.
[2024-05-27 20:19:10] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 4 ms to minimize.
[2024-05-27 20:19:10] [INFO ] Deduced a trap composed of 7 places in 65 ms of which 0 ms to minimize.
[2024-05-27 20:19:10] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 1 ms to minimize.
[2024-05-27 20:19:11] [INFO ] Deduced a trap composed of 5 places in 69 ms of which 4 ms to minimize.
[2024-05-27 20:19:11] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 0 ms to minimize.
[2024-05-27 20:19:11] [INFO ] Deduced a trap composed of 20 places in 62 ms of which 0 ms to minimize.
[2024-05-27 20:19:11] [INFO ] Deduced a trap composed of 6 places in 69 ms of which 1 ms to minimize.
[2024-05-27 20:19:11] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 1 ms to minimize.
[2024-05-27 20:19:11] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 0 ms to minimize.
[2024-05-27 20:19:11] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-05-27 20:19:11] [INFO ] Deduced a trap composed of 22 places in 52 ms of which 1 ms to minimize.
[2024-05-27 20:19:11] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1056 ms
[2024-05-27 20:19:11] [INFO ] Computed and/alt/rep : 191/335/191 causal constraints (skipped 0 transitions) in 15 ms.
[2024-05-27 20:19:12] [INFO ] Added : 185 causal constraints over 37 iterations in 838 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 793 reset in 137 ms.
Product exploration explored 100000 steps with 803 reset in 155 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 187 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 187/187 places, 196/196 transitions.
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 187 transition count 196
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 13 Pre rules applied. Total rules applied 35 place count 187 transition count 198
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 1 with 13 rules applied. Total rules applied 48 place count 187 transition count 198
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 58 place count 177 transition count 187
Deduced a syphon composed of 38 places in 1 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 68 place count 177 transition count 187
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 77 places in 0 ms
Iterating global reduction 1 with 39 rules applied. Total rules applied 107 place count 177 transition count 187
Discarding 25 places :
Symmetric choice reduction at 1 with 25 rule applications. Total rules 132 place count 152 transition count 162
Deduced a syphon composed of 52 places in 1 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 157 place count 152 transition count 162
Deduced a syphon composed of 52 places in 1 ms
Applied a total of 157 rules in 19 ms. Remains 152 /187 variables (removed 35) and now considering 162/196 (removed 34) transitions.
[2024-05-27 20:19:13] [INFO ] Redundant transitions in 19 ms returned []
// Phase 1: matrix 162 rows 152 cols
[2024-05-27 20:19:13] [INFO ] Computed 21 invariants in 1 ms
[2024-05-27 20:19:13] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 152/187 places, 162/196 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 230 ms. Remains : 152/187 places, 162/196 transitions.
Built C files in :
/tmp/ltsmin2677988534224311644
[2024-05-27 20:19:13] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2677988534224311644
Running compilation step : cd /tmp/ltsmin2677988534224311644;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 452 ms.
Running link step : cd /tmp/ltsmin2677988534224311644;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin2677988534224311644;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5646097684510265085.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 187 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 187/187 places, 196/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 187 /187 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 187 cols
[2024-05-27 20:19:28] [INFO ] Computed 21 invariants in 1 ms
[2024-05-27 20:19:28] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-27 20:19:28] [INFO ] Invariant cache hit.
[2024-05-27 20:19:28] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 20:19:29] [INFO ] Implicit Places using invariants and state equation in 328 ms returned []
Implicit Place search using SMT with State Equation took 474 ms to find 0 implicit places.
[2024-05-27 20:19:29] [INFO ] Invariant cache hit.
[2024-05-27 20:19:29] [INFO ] Dead Transitions using invariants and state equation in 170 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 648 ms. Remains : 187/187 places, 196/196 transitions.
Built C files in :
/tmp/ltsmin15323198921635041747
[2024-05-27 20:19:29] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15323198921635041747
Running compilation step : cd /tmp/ltsmin15323198921635041747;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 450 ms.
Running link step : cd /tmp/ltsmin15323198921635041747;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin15323198921635041747;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11971977859212439162.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-27 20:19:44] [INFO ] Flatten gal took : 17 ms
[2024-05-27 20:19:44] [INFO ] Flatten gal took : 22 ms
[2024-05-27 20:19:44] [INFO ] Time to serialize gal into /tmp/LTL6713263768761253274.gal : 23 ms
[2024-05-27 20:19:44] [INFO ] Time to serialize properties into /tmp/LTL11532978413412373240.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6713263768761253274.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3120163878469426615.hoa' '-atoms' '/tmp/LTL11532978413412373240.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL11532978413412373240.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3120163878469426615.hoa
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t14, t22, t26, t30, t34, t42, t46, t54, t58, t62, t65, t71, t72, t73, t75, t77, t79,...447
Detected timeout of ITS tools.
[2024-05-27 20:19:59] [INFO ] Flatten gal took : 13 ms
[2024-05-27 20:19:59] [INFO ] Flatten gal took : 12 ms
[2024-05-27 20:19:59] [INFO ] Time to serialize gal into /tmp/LTL5962087968872357294.gal : 5 ms
[2024-05-27 20:19:59] [INFO ] Time to serialize properties into /tmp/LTL3147668080274237035.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5962087968872357294.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3147668080274237035.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((F("(((robot_right==1)&&(arm2_pick_up_angle==1))&&(A1U_rot2_run==1))"))||(G((F("((arm2_release_ext==1)&&(A2U_ext_run==1))"))||(X(G(...175
Formula 0 simplified : G!"(((robot_right==1)&&(arm2_pick_up_angle==1))&&(A1U_rot2_run==1))" & F(G!"((arm2_release_ext==1)&&(A2U_ext_run==1))" & XF!"(CU_out...161
Reverse transition relation is NOT exact ! Due to transitions t6, t10, t14, t22, t26, t30, t34, t42, t46, t54, t58, t62, t65, t71, t72, t73, t75, t77, t79,...447
Detected timeout of ITS tools.
[2024-05-27 20:20:14] [INFO ] Flatten gal took : 13 ms
[2024-05-27 20:20:14] [INFO ] Applying decomposition
[2024-05-27 20:20:14] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph5622482015378988664.txt' '-o' '/tmp/graph5622482015378988664.bin' '-w' '/tmp/graph5622482015378988664.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5622482015378988664.bin' '-l' '-1' '-v' '-w' '/tmp/graph5622482015378988664.weights' '-q' '0' '-e' '0.001'
[2024-05-27 20:20:14] [INFO ] Decomposing Gal with order
[2024-05-27 20:20:14] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-27 20:20:14] [INFO ] Removed a total of 40 redundant transitions.
[2024-05-27 20:20:14] [INFO ] Flatten gal took : 91 ms
[2024-05-27 20:20:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 9 ms.
[2024-05-27 20:20:14] [INFO ] Time to serialize gal into /tmp/LTL452124082618243670.gal : 8 ms
[2024-05-27 20:20:14] [INFO ] Time to serialize properties into /tmp/LTL5041692387889225396.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL452124082618243670.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5041692387889225396.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !(((F("(((i8.u32.robot_right==1)&&(i5.u31.arm2_pick_up_angle==1))&&(i8.u58.A1U_rot2_run==1))"))||(G((F("((i6.i0.u34.arm2_release_ext==...223
Formula 0 simplified : G!"(((i8.u32.robot_right==1)&&(i5.u31.arm2_pick_up_angle==1))&&(i8.u58.A1U_rot2_run==1))" & F(G!"((i6.i0.u34.arm2_release_ext==1)&&(...209
Reverse transition relation is NOT exact ! Due to transitions t62, t115, i0.i0.u7.t6, i0.i0.u8.t10, i0.i1.u4.t14, i1.i0.u2.t22, i1.i0.u13.t26, i1.i1.u14.t3...809
3 unique states visited
0 strongly connected components in search stack
3 transitions explored
3 items max in DFS search stack
253 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.6023,97960,1,0,229515,619,3143,126336,306,1633,468264
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ParamProductionCell-PT-5-LTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property ParamProductionCell-PT-5-LTLFireability-11 finished in 74755 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((G(p1)||G(p2)))&&p0)))'
Support contains 6 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 196/196 transitions.
Applied a total of 0 rules in 3 ms. Remains 198 /198 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 198 cols
[2024-05-27 20:20:17] [INFO ] Computed 32 invariants in 1 ms
[2024-05-27 20:20:18] [INFO ] Implicit Places using invariants in 203 ms returned [16, 21, 35, 54, 66, 85, 99, 141, 144, 179]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 204 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/198 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 186 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 186 transition count 194
Applied a total of 4 rules in 4 ms. Remains 186 /188 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 186 cols
[2024-05-27 20:20:18] [INFO ] Computed 22 invariants in 1 ms
[2024-05-27 20:20:18] [INFO ] Implicit Places using invariants in 151 ms returned []
[2024-05-27 20:20:18] [INFO ] Invariant cache hit.
[2024-05-27 20:20:18] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 20:20:18] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 496 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/198 places, 194/196 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 708 ms. Remains : 186/198 places, 194/196 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={1} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s133 1) (EQ s135 1)), p1:(AND (EQ s34 1) (EQ s39 1)), p2:(AND (EQ s80 1) (EQ s126 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-13 finished in 877 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(G(p1))))'
Support contains 5 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 196/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 198 /198 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 198 cols
[2024-05-27 20:20:18] [INFO ] Computed 32 invariants in 1 ms
[2024-05-27 20:20:19] [INFO ] Implicit Places using invariants in 191 ms returned [21, 35, 54, 66, 86, 99, 141, 144, 145, 179]
Discarding 10 places :
Implicit Place search using SMT only with invariants took 192 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/198 places, 196/196 transitions.
Applied a total of 0 rules in 1 ms. Remains 188 /188 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 198 ms. Remains : 188/198 places, 196/196 transitions.
Stuttering acceptance computed with spot in 247 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(OR (NEQ s80 1) (NEQ s81 1) (NEQ s88 1)), p1:(OR (NEQ s16 1) (NEQ s22 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 260 steps with 0 reset in 1 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-14 finished in 460 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 198 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 198/198 places, 196/196 transitions.
Drop transitions removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 198 transition count 170
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 1 with 26 rules applied. Total rules applied 52 place count 172 transition count 170
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 52 place count 172 transition count 156
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 80 place count 158 transition count 156
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 132 place count 132 transition count 130
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 134 place count 131 transition count 129
Applied a total of 134 rules in 31 ms. Remains 131 /198 variables (removed 67) and now considering 129/196 (removed 67) transitions.
// Phase 1: matrix 129 rows 131 cols
[2024-05-27 20:20:19] [INFO ] Computed 32 invariants in 1 ms
[2024-05-27 20:20:19] [INFO ] Implicit Places using invariants in 225 ms returned [8, 11, 21, 33, 40, 50, 64, 93, 96, 97, 121]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 243 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 120/198 places, 129/196 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 120 transition count 127
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 118 transition count 127
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 118 transition count 126
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 117 transition count 126
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 8 place count 115 transition count 124
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 115 transition count 124
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 36 place count 102 transition count 111
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 38 place count 101 transition count 110
Applied a total of 38 rules in 15 ms. Remains 101 /120 variables (removed 19) and now considering 110/129 (removed 19) transitions.
// Phase 1: matrix 110 rows 101 cols
[2024-05-27 20:20:19] [INFO ] Computed 21 invariants in 5 ms
[2024-05-27 20:20:19] [INFO ] Implicit Places using invariants in 134 ms returned []
[2024-05-27 20:20:19] [INFO ] Invariant cache hit.
[2024-05-27 20:20:19] [INFO ] State equation strengthened by 66 read => feed constraints.
[2024-05-27 20:20:19] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 337 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 101/198 places, 110/196 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 627 ms. Remains : 101/198 places, 110/196 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-5-LTLFireability-15 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 s38 1) (EQ s66 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 148 ms.
Stack based approach found an accepted trace after 180 steps with 0 reset with depth 181 and stack size 181 in 1 ms.
FORMULA ParamProductionCell-PT-5-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-5-LTLFireability-15 finished in 824 ms.
All properties solved by simple procedures.
Total runtime 112241 ms.

BK_STOP 1716841221250

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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-5"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is ParamProductionCell-PT-5, 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 r285-smll-171654421800033"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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