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-171654421800013.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-1, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r285-smll-171654421800013
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 752K
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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.2K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Apr 12 20:35 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Apr 12 20:35 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Apr 12 20:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Apr 12 20:33 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-1-LTLFireability-00
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-01
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-02
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-03
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-04
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-05
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-06
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-07
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-08
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-09
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-10
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-11
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-12
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-13
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-14
FORMULA_NAME ParamProductionCell-PT-1-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716840436450

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-1
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-27 20:07:18] [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:07:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 20:07:19] [INFO ] Load time of PNML (sax parser for PT used): 159 ms
[2024-05-27 20:07:19] [INFO ] Transformed 231 places.
[2024-05-27 20:07:19] [INFO ] Transformed 202 transitions.
[2024-05-27 20:07:19] [INFO ] Found NUPN structural information;
[2024-05-27 20:07:19] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 310 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 4 formulas.
FORMULA ParamProductionCell-PT-1-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 56 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 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 52 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:07:19] [INFO ] Computed 59 invariants in 22 ms
[2024-05-27 20:07:20] [INFO ] Implicit Places using invariants in 691 ms returned [1, 16, 19, 46, 78, 98, 119, 159, 162, 165, 191, 194, 201]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 736 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 212/231 places, 196/202 transitions.
Applied a total of 0 rules in 13 ms. Remains 212 /212 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 802 ms. Remains : 212/231 places, 196/202 transitions.
Support contains 56 out of 212 places after structural reductions.
[2024-05-27 20:07:20] [INFO ] Flatten gal took : 61 ms
[2024-05-27 20:07:20] [INFO ] Flatten gal took : 27 ms
[2024-05-27 20:07:20] [INFO ] Input system was already deterministic with 196 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 700 ms. (steps per millisecond=14 ) properties (out of 31) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 142 ms. (steps per millisecond=70 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 196 rows 212 cols
[2024-05-27 20:07:22] [INFO ] Computed 46 invariants in 17 ms
[2024-05-27 20:07:22] [INFO ] [Real]Absence check using 32 positive place invariants in 17 ms returned sat
[2024-05-27 20:07:22] [INFO ] [Real]Absence check using 32 positive and 14 generalized place invariants in 11 ms returned sat
[2024-05-27 20:07:22] [INFO ] After 375ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2024-05-27 20:07:22] [INFO ] [Nat]Absence check using 32 positive place invariants in 12 ms returned sat
[2024-05-27 20:07:22] [INFO ] [Nat]Absence check using 32 positive and 14 generalized place invariants in 8 ms returned sat
[2024-05-27 20:07:22] [INFO ] After 146ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-27 20:07:22] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 20:07:22] [INFO ] After 94ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2024-05-27 20:07:23] [INFO ] Deduced a trap composed of 8 places in 106 ms of which 5 ms to minimize.
[2024-05-27 20:07:23] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 2 ms to minimize.
[2024-05-27 20:07:23] [INFO ] Deduced a trap composed of 5 places in 97 ms of which 2 ms to minimize.
[2024-05-27 20:07:23] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 2 ms to minimize.
[2024-05-27 20:07:23] [INFO ] Deduced a trap composed of 60 places in 94 ms of which 0 ms to minimize.
[2024-05-27 20:07:23] [INFO ] Deduced a trap composed of 18 places in 83 ms of which 1 ms to minimize.
[2024-05-27 20:07:23] [INFO ] Deduced a trap composed of 56 places in 78 ms of which 1 ms to minimize.
[2024-05-27 20:07:23] [INFO ] Deduced a trap composed of 87 places in 90 ms of which 1 ms to minimize.
[2024-05-27 20:07:23] [INFO ] Deduced a trap composed of 7 places in 79 ms of which 1 ms to minimize.
[2024-05-27 20:07:23] [INFO ] Deduced a trap composed of 84 places in 75 ms of which 0 ms to minimize.
[2024-05-27 20:07:23] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 10 trap constraints in 1056 ms
[2024-05-27 20:07:24] [INFO ] Deduced a trap composed of 38 places in 79 ms of which 1 ms to minimize.
[2024-05-27 20:07:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 92 ms
[2024-05-27 20:07:24] [INFO ] After 1312ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :0
[2024-05-27 20:07:24] [INFO ] After 1592ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 4 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA ParamProductionCell-PT-1-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-LTLFireability-11 TRUE 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' '!(G(F(p0)))'
Support contains 2 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 196/196 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 212 transition count 193
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 209 transition count 193
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 6 place count 209 transition count 177
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 38 place count 193 transition count 177
Performed 31 Post agglomeration using F-continuation condition.Transition count delta: 31
Deduced a syphon composed of 31 places in 1 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 2 with 62 rules applied. Total rules applied 100 place count 162 transition count 146
Applied a total of 100 rules in 41 ms. Remains 162 /212 variables (removed 50) and now considering 146/196 (removed 50) transitions.
// Phase 1: matrix 146 rows 162 cols
[2024-05-27 20:07:24] [INFO ] Computed 46 invariants in 3 ms
[2024-05-27 20:07:24] [INFO ] Implicit Places using invariants in 216 ms returned [1, 8, 12, 13, 15, 19, 24, 27, 32, 33, 37, 46, 49, 50, 56, 59, 63, 69, 71, 82, 83, 84, 86, 106, 120, 122, 138, 140, 143, 147, 148, 156]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 217 ms to find 32 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/212 places, 146/196 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 130 transition count 134
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 25 place count 118 transition count 133
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 117 transition count 133
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 26 place count 117 transition count 128
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 36 place count 112 transition count 128
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 110 place count 75 transition count 91
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 112 place count 74 transition count 90
Applied a total of 112 rules in 23 ms. Remains 74 /130 variables (removed 56) and now considering 90/146 (removed 56) transitions.
// Phase 1: matrix 90 rows 74 cols
[2024-05-27 20:07:24] [INFO ] Computed 14 invariants in 0 ms
[2024-05-27 20:07:24] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-27 20:07:24] [INFO ] Invariant cache hit.
[2024-05-27 20:07:24] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-27 20:07:25] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 232 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 74/212 places, 90/196 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 514 ms. Remains : 74/212 places, 90/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 309 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s2 0) (EQ s11 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 1550 reset in 326 ms.
Product exploration explored 100000 steps with 1529 reset in 222 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 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 30 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=15 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 99 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)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 90/90 transitions.
Applied a total of 0 rules in 4 ms. Remains 74 /74 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2024-05-27 20:07:26] [INFO ] Invariant cache hit.
[2024-05-27 20:07:26] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-27 20:07:26] [INFO ] Invariant cache hit.
[2024-05-27 20:07:26] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-27 20:07:26] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2024-05-27 20:07:26] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-27 20:07:26] [INFO ] Invariant cache hit.
[2024-05-27 20:07:26] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 370 ms. Remains : 74/74 places, 90/90 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 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 30 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=15 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 105 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)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1477 reset in 134 ms.
Product exploration explored 100000 steps with 1516 reset in 152 ms.
Built C files in :
/tmp/ltsmin11603934500732618076
[2024-05-27 20:07:27] [INFO ] Computing symmetric may disable matrix : 90 transitions.
[2024-05-27 20:07:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:07:27] [INFO ] Computing symmetric may enable matrix : 90 transitions.
[2024-05-27 20:07:27] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:07:27] [INFO ] Computing Do-Not-Accords matrix : 90 transitions.
[2024-05-27 20:07:27] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:07:27] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11603934500732618076
Running compilation step : cd /tmp/ltsmin11603934500732618076;'/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 460 ms.
Running link step : cd /tmp/ltsmin11603934500732618076;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin11603934500732618076;'/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/stateBased18051987321975275386.hoa' '--buchi-type=spotba'
LTSmin run took 176 ms.
FORMULA ParamProductionCell-PT-1-LTLFireability-00 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-1-LTLFireability-00 finished in 3767 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((X(F(p0)) U p1)))'
Support contains 4 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 196/196 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 212 transition count 193
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 209 transition count 193
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 6 place count 209 transition count 176
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 40 place count 192 transition count 176
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 98 place count 163 transition count 147
Applied a total of 98 rules in 29 ms. Remains 163 /212 variables (removed 49) and now considering 147/196 (removed 49) transitions.
// Phase 1: matrix 147 rows 163 cols
[2024-05-27 20:07:28] [INFO ] Computed 46 invariants in 6 ms
[2024-05-27 20:07:28] [INFO ] Implicit Places using invariants in 201 ms returned [8, 13, 15, 19, 24, 27, 28, 31, 32, 36, 44, 47, 48, 54, 58, 63, 69, 71, 82, 83, 84, 86, 106, 120, 122, 139, 141, 144, 148, 149, 157]
Discarding 31 places :
Implicit Place search using SMT only with invariants took 204 ms to find 31 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/212 places, 147/196 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 132 transition count 137
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 122 transition count 137
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 20 place count 122 transition count 135
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 120 transition count 135
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 98 place count 83 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 100 place count 82 transition count 97
Applied a total of 100 rules in 21 ms. Remains 82 /132 variables (removed 50) and now considering 97/147 (removed 50) transitions.
// Phase 1: matrix 97 rows 82 cols
[2024-05-27 20:07:28] [INFO ] Computed 15 invariants in 1 ms
[2024-05-27 20:07:28] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-27 20:07:28] [INFO ] Invariant cache hit.
[2024-05-27 20:07:28] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-27 20:07:28] [INFO ] Implicit Places using invariants and state equation in 222 ms returned []
Implicit Place search using SMT with State Equation took 301 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 82/212 places, 97/196 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 556 ms. Remains : 82/212 places, 97/196 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s51 1) (EQ s24 1)), p0:(OR (EQ s51 1) (AND (EQ s34 1) (EQ s65 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]]
Product exploration explored 100000 steps with 0 reset in 159 ms.
Stack based approach found an accepted trace after 72 steps with 0 reset with depth 73 and stack size 73 in 0 ms.
FORMULA ParamProductionCell-PT-1-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-1-LTLFireability-03 finished in 865 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((p0 U G((p1||(G(p3)&&p2))))) U G(p4)))'
Support contains 10 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 196/196 transitions.
Applied a total of 0 rules in 3 ms. Remains 212 /212 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 212 cols
[2024-05-27 20:07:29] [INFO ] Computed 46 invariants in 2 ms
[2024-05-27 20:07:29] [INFO ] Implicit Places using invariants in 237 ms returned [14, 16, 28, 32, 33, 38, 39, 43, 55, 60, 61, 69, 74, 93, 95, 108, 110, 112, 152, 155, 178, 180, 192, 203]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 249 ms to find 24 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/212 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 6 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:07:29] [INFO ] Computed 22 invariants in 2 ms
[2024-05-27 20:07:29] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-27 20:07:29] [INFO ] Invariant cache hit.
[2024-05-27 20:07:29] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 20:07:30] [INFO ] Implicit Places using invariants and state equation in 475 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/212 places, 194/196 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 895 ms. Remains : 186/212 places, 194/196 transitions.
Stuttering acceptance computed with spot in 602 ms :[(NOT p4), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p1) (NOT p3) (NOT p4))), true, (NOT p3), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (AND p2 p3 (NOT p4)) (AND p0 (NOT p4)) (AND p1 (NOT p4))), (OR (AND p1 (NOT p3) (NOT p4)) (AND p0 (NOT p3) (NOT p4))), (OR (AND p0 (NOT p1) (NOT p3) (NOT p4)) (AND p0 (NOT p1) (NOT p2) (NOT p4))), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p4, acceptance={1} source=0 dest: 0}, { cond=(NOT p4), acceptance={0, 1} source=0 dest: 0}, { cond=(NOT p4), acceptance={} source=0 dest: 1}, { cond=p4, acceptance={} source=0 dest: 2}], [{ cond=(OR (AND p1 p0) (AND p2 p3 p0)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p2) p0) (AND (NOT p1) (NOT p3) p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p1) (NOT p3) (NOT p0))), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2 p3 (NOT p0)), acceptance={} source=1 dest: 4}, { cond=(OR (AND p1 (NOT p0)) (AND p2 p3 (NOT p0))), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p1) p2 p3 p0), acceptance={1} source=1 dest: 6}], [{ cond=(OR (AND (NOT p4) (NOT p1) (NOT p2) (NOT p0)) (AND (NOT p4) (NOT p1) (NOT p3) (NOT p0))), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p4) (NOT p1) p2 p3 (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(OR (AND (NOT p4) p1 (NOT p0)) (AND (NOT p4) p2 p3 (NOT p0))), acceptance={} source=2 dest: 5}, { cond=(AND (NOT p4) (NOT p1) p2 p3 p0), acceptance={} source=2 dest: 6}, { cond=(OR (AND p4 (NOT p1) (NOT p2) (NOT p0)) (AND p4 (NOT p1) (NOT p3) (NOT p0))), acceptance={} source=2 dest: 7}, { cond=(AND p4 (NOT p1) p2 p3 (NOT p0)), acceptance={} source=2 dest: 8}, { cond=(OR (AND p4 p1 (NOT p0)) (AND p4 p2 p3 (NOT p0))), acceptance={} source=2 dest: 9}], [{ cond=true, acceptance={0, 1} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 3}, { cond=p3, acceptance={} source=4 dest: 4}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p2 p3), acceptance={} source=5 dest: 4}, { cond=(OR p1 (AND p2 p3)), acceptance={} source=5 dest: 5}], [{ cond=(AND p1 (NOT p3) p0), acceptance={0} source=6 dest: 1}, { cond=(AND (NOT p1) (NOT p3) p0), acceptance={0, 1} source=6 dest: 1}, { cond=(AND (NOT p1) (NOT p3) (NOT p0)), acceptance={} source=6 dest: 3}, { cond=(AND (NOT p1) p3 (NOT p0)), acceptance={} source=6 dest: 4}, { cond=(AND p1 (NOT p3) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p1 p3 p0), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) p3 p0), acceptance={1} source=6 dest: 6}, { cond=(AND p1 p3 (NOT p0)), acceptance={} source=6 dest: 10}], [{ cond=(OR (AND (NOT p4) p1) (AND (NOT p4) p2 p3) (AND (NOT p4) p0)), acceptance={} source=7 dest: 3}, { cond=(OR (AND p4 p1) (AND p4 p2 p3) (AND p4 p0)), acceptance={} source=7 dest: 7}], [{ cond=(OR (AND (NOT p4) p1 (NOT p3)) (AND (NOT p4) (NOT p3) p0)), acceptance={} source=8 dest: 3}, { cond=(OR (AND (NOT p4) p1 p3) (AND (NOT p4) (NOT p2) p3) (AND (NOT p4) p3 p0)), acceptance={} source=8 dest: 4}, { cond=(OR (AND p4 p1 (NOT p3)) (AND p4 (NOT p3) p0)), acceptance={} source=8 dest: 7}, { cond=(OR (AND p4 p1 p3) (AND p4 (NOT p2) p3) (AND p4 p3 p0)), acceptance={} source=8 dest: 8}], [{ cond=(OR (AND (NOT p4) (NOT p1) (NOT p2) p0) (AND (NOT p4) (NOT p1) (NOT p3) p0)), acceptance={} source=9 dest: 3}, { cond=(AND (NOT p4) (NOT p1) p2 p3 p0), acceptance={} source=9 dest: 4}, { cond=(OR (AND (NOT p4) p1 p0) (AND (NOT p4) p2 p3 p0)), acceptance={} source=9 dest: 5}, { cond=(OR (AND p4 (NOT p1) (NOT p2) p0) (AND p4 (NOT p1) (NOT p3) p0)), acceptance={} source=9 dest: 7}, { cond=(AND p4 (NOT p1) p2 p3 p0), acceptance={} source=9 dest: 8}, { cond=(OR (AND p4 p1 p0) (AND p4 p2 p3 p0)), acceptance={} source=9 dest: 9}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=10 dest: 3}, { cond=(AND (NOT p1) p3), acceptance={} source=10 dest: 4}, { cond=(AND p1 (NOT p3)), acceptance={} source=10 dest: 5}, { cond=(AND p1 p3), acceptance={} source=10 dest: 10}]], initial=0, aps=[p4:(AND (EQ s19 1) (EQ s23 1)), p1:(AND (EQ s163 1) (EQ s164 1) (EQ s171 1)), p0:(AND (EQ s90 1) (EQ s91 1) (EQ s112 1)), p2:(AND (EQ s19 1) (EQ s23 1)), ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-1-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-1-LTLFireability-05 finished in 1536 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(p1) U X((p2 U p3)))))'
Support contains 6 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 196/196 transitions.
Applied a total of 0 rules in 4 ms. Remains 212 /212 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 212 cols
[2024-05-27 20:07:30] [INFO ] Computed 46 invariants in 13 ms
[2024-05-27 20:07:31] [INFO ] Implicit Places using invariants in 323 ms returned [14, 16, 21, 28, 33, 38, 39, 43, 55, 60, 61, 69, 74, 93, 95, 107, 108, 110, 112, 152, 155, 178, 180, 183, 188, 192, 203]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 326 ms to find 27 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/212 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 183 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 183 transition count 194
Applied a total of 4 rules in 8 ms. Remains 183 /185 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 183 cols
[2024-05-27 20:07:31] [INFO ] Computed 19 invariants in 1 ms
[2024-05-27 20:07:31] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-27 20:07:31] [INFO ] Invariant cache hit.
[2024-05-27 20:07:31] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 20:07:31] [INFO ] Implicit Places using invariants and state equation in 378 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 183/212 places, 194/196 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 830 ms. Remains : 183/212 places, 194/196 transitions.
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p0) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3) p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s10 1) (EQ s28 1)), p1:(EQ s118 1), p3:(AND (EQ s13 1) (EQ s115 1)), p2:(EQ s162 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 2380 reset in 177 ms.
Product exploration explored 100000 steps with 2380 reset in 229 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 p3) (NOT p2)), (X (AND (NOT p0) (NOT p3) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2)))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 16 factoid took 131 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Finished random walk after 41 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=41 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (X (AND (NOT p0) (NOT p3) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2))), (X (NOT (AND (NOT p0) p1 (NOT p3)))), (X (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2)))), (X (X (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p3) (NOT p2)))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 16 factoid took 148 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
[2024-05-27 20:07:32] [INFO ] Invariant cache hit.
[2024-05-27 20:07:32] [INFO ] [Real]Absence check using 19 positive place invariants in 13 ms returned sat
[2024-05-27 20:07:32] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:07:33] [INFO ] [Real]Absence check using state equation in 391 ms returned sat
[2024-05-27 20:07:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:07:33] [INFO ] [Nat]Absence check using 19 positive place invariants in 12 ms returned sat
[2024-05-27 20:07:33] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:07:33] [INFO ] [Nat]Absence check using state equation in 219 ms returned sat
[2024-05-27 20:07:33] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 20:07:33] [INFO ] [Nat]Added 68 Read/Feed constraints in 25 ms returned sat
[2024-05-27 20:07:33] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 0 ms to minimize.
[2024-05-27 20:07:33] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 0 ms to minimize.
[2024-05-27 20:07:33] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 1 ms to minimize.
[2024-05-27 20:07:33] [INFO ] Deduced a trap composed of 7 places in 75 ms of which 1 ms to minimize.
[2024-05-27 20:07:33] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 0 ms to minimize.
[2024-05-27 20:07:34] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 1 ms to minimize.
[2024-05-27 20:07:34] [INFO ] Deduced a trap composed of 19 places in 56 ms of which 0 ms to minimize.
[2024-05-27 20:07:34] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 1 ms to minimize.
[2024-05-27 20:07:34] [INFO ] Deduced a trap composed of 26 places in 57 ms of which 0 ms to minimize.
[2024-05-27 20:07:34] [INFO ] Deduced a trap composed of 26 places in 71 ms of which 0 ms to minimize.
[2024-05-27 20:07:34] [INFO ] Deduced a trap composed of 28 places in 63 ms of which 1 ms to minimize.
[2024-05-27 20:07:34] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 0 ms to minimize.
[2024-05-27 20:07:34] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 1 ms to minimize.
[2024-05-27 20:07:34] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1083 ms
[2024-05-27 20:07:34] [INFO ] Computed and/alt/rep : 193/308/193 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-27 20:07:35] [INFO ] Added : 184 causal constraints over 37 iterations in 992 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 183 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 : 183/183 places, 194/194 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 183 transition count 155
Reduce places removed 39 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 41 rules applied. Total rules applied 80 place count 144 transition count 153
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 82 place count 142 transition count 153
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 82 place count 142 transition count 144
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 100 place count 133 transition count 144
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 180 place count 93 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 182 place count 92 transition count 103
Applied a total of 182 rules in 21 ms. Remains 92 /183 variables (removed 91) and now considering 103/194 (removed 91) transitions.
// Phase 1: matrix 103 rows 92 cols
[2024-05-27 20:07:35] [INFO ] Computed 19 invariants in 1 ms
[2024-05-27 20:07:35] [INFO ] Implicit Places using invariants in 140 ms returned [0, 2, 34]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 148 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/183 places, 103/194 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 88 transition count 102
Applied a total of 2 rules in 9 ms. Remains 88 /89 variables (removed 1) and now considering 102/103 (removed 1) transitions.
// Phase 1: matrix 102 rows 88 cols
[2024-05-27 20:07:35] [INFO ] Computed 16 invariants in 1 ms
[2024-05-27 20:07:36] [INFO ] Implicit Places using invariants in 257 ms returned []
[2024-05-27 20:07:36] [INFO ] Invariant cache hit.
[2024-05-27 20:07:36] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-27 20:07:36] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 460 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 88/183 places, 102/194 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 642 ms. Remains : 88/183 places, 102/194 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Finished random walk after 20 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2024-05-27 20:07:36] [INFO ] Invariant cache hit.
[2024-05-27 20:07:36] [INFO ] [Real]Absence check using 16 positive place invariants in 7 ms returned sat
[2024-05-27 20:07:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:07:36] [INFO ] [Real]Absence check using state equation in 63 ms returned sat
[2024-05-27 20:07:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:07:36] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2024-05-27 20:07:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:07:36] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2024-05-27 20:07:36] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-27 20:07:36] [INFO ] [Nat]Added 67 Read/Feed constraints in 11 ms returned sat
[2024-05-27 20:07:36] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-05-27 20:07:37] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 1 ms to minimize.
[2024-05-27 20:07:37] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2024-05-27 20:07:37] [INFO ] Deduced a trap composed of 21 places in 41 ms of which 0 ms to minimize.
[2024-05-27 20:07:37] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-05-27 20:07:37] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 0 ms to minimize.
[2024-05-27 20:07:37] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
[2024-05-27 20:07:37] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2024-05-27 20:07:37] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-05-27 20:07:37] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 439 ms
[2024-05-27 20:07:37] [INFO ] Computed and/alt/rep : 101/223/101 causal constraints (skipped 0 transitions) in 8 ms.
[2024-05-27 20:07:37] [INFO ] Added : 88 causal constraints over 18 iterations in 201 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4761 reset in 114 ms.
Product exploration explored 100000 steps with 4761 reset in 150 ms.
Built C files in :
/tmp/ltsmin15309820635318686653
[2024-05-27 20:07:37] [INFO ] Computing symmetric may disable matrix : 102 transitions.
[2024-05-27 20:07:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:07:37] [INFO ] Computing symmetric may enable matrix : 102 transitions.
[2024-05-27 20:07:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:07:37] [INFO ] Computing Do-Not-Accords matrix : 102 transitions.
[2024-05-27 20:07:37] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:07:37] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15309820635318686653
Running compilation step : cd /tmp/ltsmin15309820635318686653;'/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 323 ms.
Running link step : cd /tmp/ltsmin15309820635318686653;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin15309820635318686653;'/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/stateBased11983841853681841443.hoa' '--buchi-type=spotba'
LTSmin run took 179 ms.
FORMULA ParamProductionCell-PT-1-LTLFireability-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-1-LTLFireability-06 finished in 7762 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 U p2)))&&p0)))'
Support contains 5 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 196/196 transitions.
Applied a total of 0 rules in 3 ms. Remains 212 /212 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 212 cols
[2024-05-27 20:07:38] [INFO ] Computed 46 invariants in 2 ms
[2024-05-27 20:07:38] [INFO ] Implicit Places using invariants in 297 ms returned [14, 16, 21, 28, 32, 33, 38, 39, 43, 55, 60, 61, 69, 74, 93, 95, 107, 108, 112, 152, 155, 178, 180, 183, 188, 192, 203]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 298 ms to find 27 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/212 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 183 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 183 transition count 194
Applied a total of 4 rules in 4 ms. Remains 183 /185 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 183 cols
[2024-05-27 20:07:38] [INFO ] Computed 19 invariants in 1 ms
[2024-05-27 20:07:38] [INFO ] Implicit Places using invariants in 129 ms returned []
[2024-05-27 20:07:38] [INFO ] Invariant cache hit.
[2024-05-27 20:07:39] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 20:07:39] [INFO ] Implicit Places using invariants and state equation in 350 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 : 183/212 places, 194/196 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 787 ms. Remains : 183/212 places, 194/196 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-07 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=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR p2 p1), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s91 1) (EQ s95 1)), p2:(OR (AND (EQ s75 1) (EQ s78 1)) (AND (EQ s91 1) (EQ s95 1))), p1:(EQ s25 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-1-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-1-LTLFireability-07 finished in 985 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)||X((G((X(!p1) U ((!p2&&X(!p1))||X(G(!p1)))))||(F(!p3)&&(X(!p1) U ((!p2&&X(!p1))||X(G(!p1))))))))))'
Support contains 9 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 196/196 transitions.
Applied a total of 0 rules in 3 ms. Remains 212 /212 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 212 cols
[2024-05-27 20:07:39] [INFO ] Computed 46 invariants in 1 ms
[2024-05-27 20:07:39] [INFO ] Implicit Places using invariants in 268 ms returned [14, 16, 21, 28, 32, 33, 38, 39, 43, 55, 61, 69, 74, 95, 107, 108, 110, 152, 155, 178, 180, 183, 188, 203]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 269 ms to find 24 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 188/212 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:07:39] [INFO ] Computed 22 invariants in 1 ms
[2024-05-27 20:07:39] [INFO ] Implicit Places using invariants in 149 ms returned []
[2024-05-27 20:07:39] [INFO ] Invariant cache hit.
[2024-05-27 20:07:40] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 20:07:40] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 517 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 186/212 places, 194/196 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 795 ms. Remains : 186/212 places, 194/196 transitions.
Stuttering acceptance computed with spot in 689 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), p1, (AND (NOT p0) p1), p1, (AND p1 p3), p1, (AND (NOT p0) p1), (AND (NOT p0) p1 p3), (AND (NOT p0) p1), true, (AND p3 p1), (AND p1 p3), (NOT p0), (AND p3 (NOT p0) p1), p3, (AND p3 (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-09 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={} source=2 dest: 4}, { cond=p3, acceptance={} source=2 dest: 5}, { cond=p2, acceptance={} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) p3), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=3 dest: 6}, { cond=p0, acceptance={} source=3 dest: 7}, { cond=(AND p0 p3), acceptance={} source=3 dest: 8}, { cond=(AND p0 p2), acceptance={} source=3 dest: 9}], [{ cond=p1, acceptance={} source=4 dest: 10}], [{ cond=p3, acceptance={} source=5 dest: 5}, { cond=p3, acceptance={} source=5 dest: 11}, { cond=(AND p2 p3), acceptance={} source=5 dest: 12}], [{ cond=true, acceptance={} source=6 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=6 dest: 6}, { cond=(AND p2 p1), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={} source=7 dest: 10}, { cond=(AND p0 p1), acceptance={} source=7 dest: 13}], [{ cond=(AND (NOT p0) p3), acceptance={} source=8 dest: 5}, { cond=(AND p0 p3), acceptance={} source=8 dest: 8}, { cond=(AND (NOT p0) p3), acceptance={} source=8 dest: 11}, { cond=(AND (NOT p0) p2 p3), acceptance={} source=8 dest: 12}, { cond=(AND p0 p3), acceptance={} source=8 dest: 14}], [{ cond=(NOT p0), acceptance={} source=9 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=9 dest: 6}, { cond=p0, acceptance={} source=9 dest: 7}, { cond=(AND p0 p2), acceptance={} source=9 dest: 9}], [{ cond=true, acceptance={0} source=10 dest: 10}], [{ cond=(AND p3 p1), acceptance={} source=11 dest: 15}], [{ cond=p3, acceptance={} source=12 dest: 11}, { cond=(AND p2 p3 (NOT p1)), acceptance={} source=12 dest: 12}, { cond=(AND p2 p3 p1), acceptance={0} source=12 dest: 12}], [{ cond=(NOT p0), acceptance={} source=13 dest: 10}, { cond=p0, acceptance={} source=13 dest: 13}], [{ cond=(AND (NOT p0) p3 p1), acceptance={} source=14 dest: 15}, { cond=(AND p0 p3 p1), acceptance={} source=14 dest: 16}], [{ cond=p3, acceptance={0} source=15 dest: 15}], [{ cond=(AND (NOT p0) p3 (NOT p1)), acceptance={} source=16 dest: 15}, { cond=(AND p0 p3 (NOT p1)), acceptance={} source=16 dest: 16}]], initial=0, aps=[p0:(OR (EQ s80 0) (EQ s83 0)), p3:(AND (EQ s94 1) (EQ s110 1)), p2:(AND (EQ s50 1) (EQ s54 1)), p1:(AND (EQ s158 1) (EQ s167 1) (EQ s173 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 220 ms.
Product exploration explored 100000 steps with 25000 reset in 224 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2) (NOT p1)), (X p0), (X (X (NOT p2))), true, (X (X (NOT p3))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 150 ms. Reduced automaton from 17 states, 42 edges and 4 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[true, (AND (NOT p0) p1), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-27 20:07:41] [INFO ] Invariant cache hit.
[2024-05-27 20:07:41] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-27 20:07:41] [INFO ] [Nat]Absence check using 20 positive place invariants in 12 ms returned sat
[2024-05-27 20:07:41] [INFO ] [Nat]Absence check using 20 positive and 2 generalized place invariants in 4 ms returned sat
[2024-05-27 20:07:41] [INFO ] After 60ms 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 p0 (NOT p3) (NOT p2) (NOT p1)), (X p0), (X (X (NOT p2))), true, (X (X (NOT p3))), (X (X (NOT (AND p0 p3)))), (X (X (NOT (AND (NOT p0) p3)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p0)), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(F (NOT p0)), (F (AND p0 p1))]
Knowledge based reduction with 11 factoid took 156 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[true, (AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 192 ms :[true, (AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Support contains 5 out of 186 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 186/186 places, 194/194 transitions.
Applied a total of 0 rules in 2 ms. Remains 186 /186 variables (removed 0) and now considering 194/194 (removed 0) transitions.
[2024-05-27 20:07:42] [INFO ] Invariant cache hit.
[2024-05-27 20:07:42] [INFO ] Implicit Places using invariants in 139 ms returned []
[2024-05-27 20:07:42] [INFO ] Invariant cache hit.
[2024-05-27 20:07:42] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 20:07:42] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 501 ms to find 0 implicit places.
[2024-05-27 20:07:42] [INFO ] Invariant cache hit.
[2024-05-27 20:07:43] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 684 ms. Remains : 186/186 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 : [(AND (NOT p1) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[true, (AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Finished random walk after 135 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=135 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 124 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[true, (AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 192 ms :[true, (AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Stuttering acceptance computed with spot in 211 ms :[true, (AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Product exploration explored 100000 steps with 25000 reset in 169 ms.
Product exploration explored 100000 steps with 25000 reset in 186 ms.
Applying partial POR strategy [true, false, true, false, false, false]
Stuttering acceptance computed with spot in 191 ms :[true, (AND p1 (NOT p0)), (NOT p0), (AND p1 (NOT p0)), (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Support contains 5 out of 186 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 186/186 places, 194/194 transitions.
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 186 transition count 194
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 33 place count 186 transition count 194
Deduced a syphon composed of 44 places in 1 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 44 place count 186 transition count 194
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 52 place count 178 transition count 186
Deduced a syphon composed of 36 places in 1 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 60 place count 178 transition count 186
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 69 places in 0 ms
Iterating global reduction 1 with 33 rules applied. Total rules applied 93 place count 178 transition count 186
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 115 place count 156 transition count 164
Deduced a syphon composed of 47 places in 1 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 137 place count 156 transition count 164
Deduced a syphon composed of 47 places in 1 ms
Applied a total of 137 rules in 36 ms. Remains 156 /186 variables (removed 30) and now considering 164/194 (removed 30) transitions.
[2024-05-27 20:07:44] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 164 rows 156 cols
[2024-05-27 20:07:44] [INFO ] Computed 22 invariants in 1 ms
[2024-05-27 20:07:45] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 156/186 places, 164/194 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 206 ms. Remains : 156/186 places, 164/194 transitions.
Built C files in :
/tmp/ltsmin12844569059547341632
[2024-05-27 20:07:45] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12844569059547341632
Running compilation step : cd /tmp/ltsmin12844569059547341632;'/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 437 ms.
Running link step : cd /tmp/ltsmin12844569059547341632;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin12844569059547341632;'/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/stateBased12943554740161054063.hoa' '--buchi-type=spotba'
LTSmin run took 195 ms.
FORMULA ParamProductionCell-PT-1-LTLFireability-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-1-LTLFireability-09 finished in 6385 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(p0)||X(X(X(F(p1)))))))'
Support contains 4 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 196/196 transitions.
Applied a total of 0 rules in 3 ms. Remains 212 /212 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 212 cols
[2024-05-27 20:07:45] [INFO ] Computed 46 invariants in 2 ms
[2024-05-27 20:07:46] [INFO ] Implicit Places using invariants in 287 ms returned [14, 16, 21, 28, 32, 33, 39, 43, 55, 60, 61, 69, 74, 93, 95, 107, 108, 110, 112, 152, 155, 178, 180, 183, 188, 192, 203]
Discarding 27 places :
Implicit Place search using SMT only with invariants took 296 ms to find 27 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/212 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 183 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 183 transition count 194
Applied a total of 4 rules in 7 ms. Remains 183 /185 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 183 cols
[2024-05-27 20:07:46] [INFO ] Computed 19 invariants in 1 ms
[2024-05-27 20:07:46] [INFO ] Implicit Places using invariants in 136 ms returned []
[2024-05-27 20:07:46] [INFO ] Invariant cache hit.
[2024-05-27 20:07:46] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 20:07:46] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 183/212 places, 194/196 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 797 ms. Remains : 183/212 places, 194/196 transitions.
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 2}]], initial=0, aps=[p0:(OR (EQ s13 0) (EQ s119 0)), p1:(OR (EQ s32 0) (EQ s36 0))], 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 224 ms.
Product exploration explored 100000 steps with 50000 reset in 243 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 14 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ParamProductionCell-PT-1-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-1-LTLFireability-12 finished in 1478 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)) U p0)||F(p1)))'
Support contains 4 out of 212 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 212/212 places, 196/196 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 212 transition count 193
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 209 transition count 193
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 17 Pre rules applied. Total rules applied 6 place count 209 transition count 176
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 34 rules applied. Total rules applied 40 place count 192 transition count 176
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 104 place count 160 transition count 144
Applied a total of 104 rules in 18 ms. Remains 160 /212 variables (removed 52) and now considering 144/196 (removed 52) transitions.
// Phase 1: matrix 144 rows 160 cols
[2024-05-27 20:07:47] [INFO ] Computed 46 invariants in 1 ms
[2024-05-27 20:07:47] [INFO ] Implicit Places using invariants in 221 ms returned [1, 8, 12, 13, 15, 19, 27, 28, 31, 32, 36, 44, 47, 48, 55, 58, 62, 68, 70, 81, 82, 83, 85, 105, 118, 120, 136, 138, 141, 145, 146, 154]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 236 ms to find 32 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/212 places, 144/196 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 128 transition count 132
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 116 transition count 132
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 24 place count 116 transition count 127
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 34 place count 111 transition count 127
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: 35
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 104 place count 76 transition count 92
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 106 place count 75 transition count 91
Applied a total of 106 rules in 13 ms. Remains 75 /128 variables (removed 53) and now considering 91/144 (removed 53) transitions.
// Phase 1: matrix 91 rows 75 cols
[2024-05-27 20:07:47] [INFO ] Computed 14 invariants in 0 ms
[2024-05-27 20:07:47] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-27 20:07:47] [INFO ] Invariant cache hit.
[2024-05-27 20:07:47] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-27 20:07:47] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 75/212 places, 91/196 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 525 ms. Remains : 75/212 places, 91/196 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s6 1) (EQ s10 1) (EQ s12 1)), p1:(EQ s23 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 1493 reset in 115 ms.
Product exploration explored 100000 steps with 1493 reset in 133 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)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :3
Finished Best-First random walk after 111 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=55 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1))), (F (AND p0 p1))]
Knowledge based reduction with 5 factoid took 194 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
[2024-05-27 20:07:48] [INFO ] Invariant cache hit.
[2024-05-27 20:07:48] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-27 20:07:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:07:49] [INFO ] [Real]Absence check using state equation in 54 ms returned sat
[2024-05-27 20:07:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:07:49] [INFO ] [Nat]Absence check using 14 positive place invariants in 6 ms returned sat
[2024-05-27 20:07:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:07:49] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2024-05-27 20:07:49] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-27 20:07:49] [INFO ] [Nat]Added 67 Read/Feed constraints in 11 ms returned sat
[2024-05-27 20:07:49] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-27 20:07:49] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 3 ms to minimize.
[2024-05-27 20:07:49] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 0 ms to minimize.
[2024-05-27 20:07:49] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 1 ms to minimize.
[2024-05-27 20:07:49] [INFO ] Deduced a trap composed of 10 places in 36 ms of which 0 ms to minimize.
[2024-05-27 20:07:49] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2024-05-27 20:07:49] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-27 20:07:49] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 283 ms
[2024-05-27 20:07:49] [INFO ] Computed and/alt/rep : 90/214/90 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-27 20:07:49] [INFO ] Added : 70 causal constraints over 14 iterations in 143 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 out of 75 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 75/75 places, 91/91 transitions.
Applied a total of 0 rules in 3 ms. Remains 75 /75 variables (removed 0) and now considering 91/91 (removed 0) transitions.
[2024-05-27 20:07:49] [INFO ] Invariant cache hit.
[2024-05-27 20:07:49] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-27 20:07:49] [INFO ] Invariant cache hit.
[2024-05-27 20:07:49] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-27 20:07:49] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 259 ms to find 0 implicit places.
[2024-05-27 20:07:49] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-27 20:07:49] [INFO ] Invariant cache hit.
[2024-05-27 20:07:49] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 366 ms. Remains : 75/75 places, 91/91 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 107 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 4) seen :3
Finished Best-First random walk after 103 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=103 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1)), (F (AND p0 (NOT p1))), (F (AND p0 p1))]
Knowledge based reduction with 9 factoid took 223 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
[2024-05-27 20:07:50] [INFO ] Invariant cache hit.
[2024-05-27 20:07:50] [INFO ] [Real]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-27 20:07:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:07:50] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2024-05-27 20:07:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:07:51] [INFO ] [Nat]Absence check using 14 positive place invariants in 7 ms returned sat
[2024-05-27 20:07:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:07:51] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2024-05-27 20:07:51] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-27 20:07:51] [INFO ] [Nat]Added 67 Read/Feed constraints in 11 ms returned sat
[2024-05-27 20:07:51] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
[2024-05-27 20:07:51] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-27 20:07:51] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 1 ms to minimize.
[2024-05-27 20:07:51] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2024-05-27 20:07:51] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 0 ms to minimize.
[2024-05-27 20:07:51] [INFO ] Deduced a trap composed of 24 places in 34 ms of which 1 ms to minimize.
[2024-05-27 20:07:51] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-27 20:07:51] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 284 ms
[2024-05-27 20:07:51] [INFO ] Computed and/alt/rep : 90/214/90 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-27 20:07:51] [INFO ] Added : 70 causal constraints over 14 iterations in 152 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, false]
Product exploration explored 100000 steps with 1492 reset in 112 ms.
Product exploration explored 100000 steps with 1493 reset in 132 ms.
Built C files in :
/tmp/ltsmin12964205391428597118
[2024-05-27 20:07:51] [INFO ] Computing symmetric may disable matrix : 91 transitions.
[2024-05-27 20:07:51] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:07:51] [INFO ] Computing symmetric may enable matrix : 91 transitions.
[2024-05-27 20:07:51] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:07:51] [INFO ] Computing Do-Not-Accords matrix : 91 transitions.
[2024-05-27 20:07:51] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:07:51] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12964205391428597118
Running compilation step : cd /tmp/ltsmin12964205391428597118;'/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 270 ms.
Running link step : cd /tmp/ltsmin12964205391428597118;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin12964205391428597118;'/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/stateBased11472070453502277460.hoa' '--buchi-type=spotba'
LTSmin run took 179 ms.
FORMULA ParamProductionCell-PT-1-LTLFireability-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-1-LTLFireability-13 finished in 5181 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(p0)||F(p1)))'
Support contains 3 out of 212 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 212/212 places, 196/196 transitions.
Applied a total of 0 rules in 2 ms. Remains 212 /212 variables (removed 0) and now considering 196/196 (removed 0) transitions.
// Phase 1: matrix 196 rows 212 cols
[2024-05-27 20:07:52] [INFO ] Computed 46 invariants in 2 ms
[2024-05-27 20:07:52] [INFO ] Implicit Places using invariants in 243 ms returned [14, 16, 21, 28, 32, 33, 38, 39, 43, 55, 60, 61, 69, 74, 93, 95, 107, 108, 110, 112, 152, 155, 178, 180, 183, 188, 192, 203]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 244 ms to find 28 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/212 places, 196/196 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 182 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 182 transition count 194
Applied a total of 4 rules in 4 ms. Remains 182 /184 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 182 cols
[2024-05-27 20:07:52] [INFO ] Computed 18 invariants in 0 ms
[2024-05-27 20:07:52] [INFO ] Implicit Places using invariants in 120 ms returned []
[2024-05-27 20:07:52] [INFO ] Invariant cache hit.
[2024-05-27 20:07:52] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 20:07:53] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 182/212 places, 194/196 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 706 ms. Remains : 182/212 places, 194/196 transitions.
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p1:(EQ s71 1), p0:(AND (EQ s12 1) (EQ s68 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 666 reset in 104 ms.
Product exploration explored 100000 steps with 666 reset in 126 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Finished random walk after 149 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=149 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
[2024-05-27 20:07:53] [INFO ] Invariant cache hit.
[2024-05-27 20:07:53] [INFO ] [Real]Absence check using 18 positive place invariants in 13 ms returned sat
[2024-05-27 20:07:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:07:54] [INFO ] [Real]Absence check using state equation in 229 ms returned sat
[2024-05-27 20:07:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:07:54] [INFO ] [Nat]Absence check using 18 positive place invariants in 10 ms returned sat
[2024-05-27 20:07:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:07:54] [INFO ] [Nat]Absence check using state equation in 175 ms returned sat
[2024-05-27 20:07:54] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-27 20:07:54] [INFO ] [Nat]Added 68 Read/Feed constraints in 27 ms returned sat
[2024-05-27 20:07:54] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 0 ms to minimize.
[2024-05-27 20:07:54] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 0 ms to minimize.
[2024-05-27 20:07:54] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 0 ms to minimize.
[2024-05-27 20:07:54] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2024-05-27 20:07:55] [INFO ] Deduced a trap composed of 7 places in 69 ms of which 0 ms to minimize.
[2024-05-27 20:07:55] [INFO ] Deduced a trap composed of 7 places in 73 ms of which 0 ms to minimize.
[2024-05-27 20:07:55] [INFO ] Deduced a trap composed of 26 places in 69 ms of which 1 ms to minimize.
[2024-05-27 20:07:55] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 0 ms to minimize.
[2024-05-27 20:07:55] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 0 ms to minimize.
[2024-05-27 20:07:55] [INFO ] Deduced a trap composed of 26 places in 63 ms of which 2 ms to minimize.
[2024-05-27 20:07:55] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 0 ms to minimize.
[2024-05-27 20:07:55] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 885 ms
[2024-05-27 20:07:55] [INFO ] Computed and/alt/rep : 193/308/193 causal constraints (skipped 0 transitions) in 14 ms.
[2024-05-27 20:07:56] [INFO ] Added : 178 causal constraints over 36 iterations in 876 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 182 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 : 182/182 places, 194/194 transitions.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 182 transition count 151
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 86 place count 139 transition count 151
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 86 place count 139 transition count 143
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 102 place count 131 transition count 143
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 194 place count 85 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 196 place count 84 transition count 96
Applied a total of 196 rules in 12 ms. Remains 84 /182 variables (removed 98) and now considering 96/194 (removed 98) transitions.
// Phase 1: matrix 96 rows 84 cols
[2024-05-27 20:07:56] [INFO ] Computed 18 invariants in 0 ms
[2024-05-27 20:07:56] [INFO ] Implicit Places using invariants in 94 ms returned [0, 2, 54]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 95 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/182 places, 96/194 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 80 transition count 95
Applied a total of 2 rules in 5 ms. Remains 80 /81 variables (removed 1) and now considering 95/96 (removed 1) transitions.
// Phase 1: matrix 95 rows 80 cols
[2024-05-27 20:07:56] [INFO ] Computed 15 invariants in 1 ms
[2024-05-27 20:07:56] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-27 20:07:56] [INFO ] Invariant cache hit.
[2024-05-27 20:07:56] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-27 20:07:56] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 80/182 places, 95/194 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 362 ms. Remains : 80/182 places, 95/194 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Finished random walk after 66 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=66 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p1), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
[2024-05-27 20:07:57] [INFO ] Invariant cache hit.
[2024-05-27 20:07:57] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2024-05-27 20:07:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 20:07:57] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2024-05-27 20:07:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 20:07:57] [INFO ] [Nat]Absence check using 15 positive place invariants in 6 ms returned sat
[2024-05-27 20:07:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 20:07:57] [INFO ] [Nat]Absence check using state equation in 42 ms returned sat
[2024-05-27 20:07:57] [INFO ] State equation strengthened by 67 read => feed constraints.
[2024-05-27 20:07:57] [INFO ] [Nat]Added 67 Read/Feed constraints in 12 ms returned sat
[2024-05-27 20:07:57] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-27 20:07:57] [INFO ] Deduced a trap composed of 4 places in 39 ms of which 1 ms to minimize.
[2024-05-27 20:07:57] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2024-05-27 20:07:57] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 0 ms to minimize.
[2024-05-27 20:07:57] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-05-27 20:07:57] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 1 ms to minimize.
[2024-05-27 20:07:57] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 1 ms to minimize.
[2024-05-27 20:07:57] [INFO ] Deduced a trap composed of 37 places in 34 ms of which 2 ms to minimize.
[2024-05-27 20:07:57] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-27 20:07:57] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 400 ms
[2024-05-27 20:07:57] [INFO ] Computed and/alt/rep : 94/216/94 causal constraints (skipped 0 transitions) in 7 ms.
[2024-05-27 20:07:57] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 0 ms to minimize.
[2024-05-27 20:07:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 63 ms
[2024-05-27 20:07:57] [INFO ] Added : 83 causal constraints over 17 iterations in 257 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 36 ms :[(NOT p1)]
Product exploration explored 100000 steps with 1492 reset in 100 ms.
Product exploration explored 100000 steps with 1492 reset in 118 ms.
Built C files in :
/tmp/ltsmin9268228887804444341
[2024-05-27 20:07:58] [INFO ] Computing symmetric may disable matrix : 95 transitions.
[2024-05-27 20:07:58] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:07:58] [INFO ] Computing symmetric may enable matrix : 95 transitions.
[2024-05-27 20:07:58] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:07:58] [INFO ] Computing Do-Not-Accords matrix : 95 transitions.
[2024-05-27 20:07:58] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-27 20:07:58] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9268228887804444341
Running compilation step : cd /tmp/ltsmin9268228887804444341;'/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 272 ms.
Running link step : cd /tmp/ltsmin9268228887804444341;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin9268228887804444341;'/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/stateBased6987850154113585963.hoa' '--buchi-type=spotba'
LTSmin run took 187 ms.
FORMULA ParamProductionCell-PT-1-LTLFireability-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-1-LTLFireability-15 finished in 6281 ms.
All properties solved by simple procedures.
Total runtime 39814 ms.

BK_STOP 1716840479804

--------------------
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-1"
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-1, 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-171654421800013"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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