Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 420K
-rw-r--r-- 1 mcc users 8.6K Apr 29 17:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Apr 29 17:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 29 17:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Apr 29 17:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.2K May 9 08:22 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 08:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K May 9 08:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 08:22 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 08:22 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 08:22 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 2 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 174K May 10 09:34 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ParamProductionCell-PT-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 1653049567385

Running Version 202205111006
[2022-05-20 12:26:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 12:26:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 12:26:09] [INFO ] Load time of PNML (sax parser for PT used): 212 ms
[2022-05-20 12:26:09] [INFO ] Transformed 231 places.
[2022-05-20 12:26:09] [INFO ] Transformed 202 transitions.
[2022-05-20 12:26:09] [INFO ] Found NUPN structural information;
[2022-05-20 12:26:09] [INFO ] Parsed PT model containing 231 places and 202 transitions in 438 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ParamProductionCell-PT-1-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 53 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 229 transition count 200
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 229 transition count 200
Applied a total of 4 rules in 55 ms. Remains 229 /231 variables (removed 2) and now considering 200/202 (removed 2) transitions.
// Phase 1: matrix 200 rows 229 cols
[2022-05-20 12:26:10] [INFO ] Computed 59 place invariants in 33 ms
[2022-05-20 12:26:10] [INFO ] Implicit Places using invariants in 497 ms returned [1, 15, 16, 18, 19, 31, 35, 36, 41, 59, 64, 65, 73, 79, 117, 119, 120, 162, 163, 167, 168, 192, 194, 198, 205, 220]
Discarding 26 places :
Implicit Place search using SMT only with invariants took 552 ms to find 26 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 203/231 places, 200/202 transitions.
Applied a total of 0 rules in 14 ms. Remains 203 /203 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions, in 2 iterations. Remains : 203/231 places, 200/202 transitions.
Support contains 53 out of 203 places after structural reductions.
[2022-05-20 12:26:11] [INFO ] Flatten gal took : 76 ms
[2022-05-20 12:26:11] [INFO ] Flatten gal took : 34 ms
[2022-05-20 12:26:11] [INFO ] Input system was already deterministic with 200 transitions.
Support contains 51 out of 203 places (down from 53) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 858 ms. (steps per millisecond=11 ) properties (out of 28) seen :24
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 217 ms. (steps per millisecond=46 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 193 ms. (steps per millisecond=51 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 227 ms. (steps per millisecond=44 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 200 rows 203 cols
[2022-05-20 12:26:12] [INFO ] Computed 33 place invariants in 8 ms
[2022-05-20 12:26:13] [INFO ] [Real]Absence check using 21 positive place invariants in 15 ms returned sat
[2022-05-20 12:26:13] [INFO ] [Real]Absence check using 21 positive and 12 generalized place invariants in 17 ms returned sat
[2022-05-20 12:26:13] [INFO ] After 230ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:2
[2022-05-20 12:26:13] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:26:13] [INFO ] After 57ms SMT Verify possible using 68 Read/Feed constraints in real domain returned unsat :1 sat :0 real:3
[2022-05-20 12:26:13] [INFO ] After 525ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2022-05-20 12:26:13] [INFO ] [Nat]Absence check using 21 positive place invariants in 19 ms returned sat
[2022-05-20 12:26:13] [INFO ] [Nat]Absence check using 21 positive and 12 generalized place invariants in 24 ms returned sat
[2022-05-20 12:26:13] [INFO ] After 200ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2022-05-20 12:26:14] [INFO ] After 99ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2022-05-20 12:26:14] [INFO ] Deduced a trap composed of 7 places in 166 ms of which 10 ms to minimize.
[2022-05-20 12:26:14] [INFO ] Deduced a trap composed of 8 places in 155 ms of which 2 ms to minimize.
[2022-05-20 12:26:14] [INFO ] Deduced a trap composed of 5 places in 130 ms of which 2 ms to minimize.
[2022-05-20 12:26:14] [INFO ] Deduced a trap composed of 7 places in 120 ms of which 3 ms to minimize.
[2022-05-20 12:26:14] [INFO ] Deduced a trap composed of 14 places in 185 ms of which 2 ms to minimize.
[2022-05-20 12:26:15] [INFO ] Deduced a trap composed of 35 places in 134 ms of which 1 ms to minimize.
[2022-05-20 12:26:15] [INFO ] Deduced a trap composed of 38 places in 127 ms of which 1 ms to minimize.
[2022-05-20 12:26:15] [INFO ] Deduced a trap composed of 11 places in 163 ms of which 3 ms to minimize.
[2022-05-20 12:26:15] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 8 trap constraints in 1410 ms
[2022-05-20 12:26:15] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 1 ms to minimize.
[2022-05-20 12:26:15] [INFO ] Deduced a trap composed of 74 places in 176 ms of which 1 ms to minimize.
[2022-05-20 12:26:16] [INFO ] Deduced a trap composed of 63 places in 165 ms of which 1 ms to minimize.
[2022-05-20 12:26:16] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 2 ms to minimize.
[2022-05-20 12:26:16] [INFO ] Deduced a trap composed of 38 places in 98 ms of which 1 ms to minimize.
[2022-05-20 12:26:16] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 5 trap constraints in 775 ms
[2022-05-20 12:26:16] [INFO ] After 2327ms SMT Verify possible using trap constraints in natural domain returned unsat :4 sat :0
[2022-05-20 12:26:16] [INFO ] After 2772ms 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 0 ms.
FORMULA ParamProductionCell-PT-1-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 11 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA ParamProductionCell-PT-1-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-1-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 203/203 places, 200/200 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 203 transition count 179
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 182 transition count 179
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 42 place count 182 transition count 165
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 70 place count 168 transition count 165
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 74 place count 164 transition count 161
Iterating global reduction 2 with 4 rules applied. Total rules applied 78 place count 164 transition count 161
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 132 place count 137 transition count 134
Applied a total of 132 rules in 77 ms. Remains 137 /203 variables (removed 66) and now considering 134/200 (removed 66) transitions.
// Phase 1: matrix 134 rows 137 cols
[2022-05-20 12:26:16] [INFO ] Computed 33 place invariants in 4 ms
[2022-05-20 12:26:17] [INFO ] Implicit Places using invariants in 263 ms returned [1, 4, 7, 10, 19, 23, 41, 46, 52, 53, 55, 67, 68, 87, 99, 116, 119, 122, 124]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 267 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/203 places, 134/200 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 118 transition count 128
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 112 transition count 128
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 12 place count 112 transition count 122
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 24 place count 106 transition count 122
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 104 transition count 120
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 104 transition count 120
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 82 place count 77 transition count 93
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 84 place count 76 transition count 92
Applied a total of 84 rules in 20 ms. Remains 76 /118 variables (removed 42) and now considering 92/134 (removed 42) transitions.
// Phase 1: matrix 92 rows 76 cols
[2022-05-20 12:26:17] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-20 12:26:17] [INFO ] Implicit Places using invariants in 90 ms returned []
// Phase 1: matrix 92 rows 76 cols
[2022-05-20 12:26:17] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-20 12:26:17] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-05-20 12:26:17] [INFO ] Implicit Places using invariants and state equation in 185 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 76/203 places, 92/200 transitions.
Finished structural reductions, in 2 iterations. Remains : 76/203 places, 92/200 transitions.
Stuttering acceptance computed with spot in 253 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s14 1) (EQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 4761 reset in 590 ms.
Product exploration explored 100000 steps with 4761 reset in 311 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Finished random walk after 20 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 128 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
// Phase 1: matrix 92 rows 76 cols
[2022-05-20 12:26:18] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-20 12:26:19] [INFO ] [Real]Absence check using 14 positive place invariants in 9 ms returned sat
[2022-05-20 12:26:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:26:19] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2022-05-20 12:26:19] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:26:19] [INFO ] [Nat]Absence check using 14 positive place invariants in 9 ms returned sat
[2022-05-20 12:26:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:26:19] [INFO ] [Nat]Absence check using state equation in 81 ms returned sat
[2022-05-20 12:26:19] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-05-20 12:26:19] [INFO ] [Nat]Added 67 Read/Feed constraints in 14 ms returned sat
[2022-05-20 12:26:19] [INFO ] Deduced a trap composed of 4 places in 57 ms of which 0 ms to minimize.
[2022-05-20 12:26:19] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 0 ms to minimize.
[2022-05-20 12:26:19] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2022-05-20 12:26:19] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2022-05-20 12:26:19] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 273 ms
[2022-05-20 12:26:19] [INFO ] Computed and/alt/rep : 91/213/91 causal constraints (skipped 0 transitions) in 14 ms.
[2022-05-20 12:26:19] [INFO ] Added : 18 causal constraints over 4 iterations in 87 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 76 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 76/76 places, 92/92 transitions.
Applied a total of 0 rules in 6 ms. Remains 76 /76 variables (removed 0) and now considering 92/92 (removed 0) transitions.
// Phase 1: matrix 92 rows 76 cols
[2022-05-20 12:26:19] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-20 12:26:19] [INFO ] Implicit Places using invariants in 135 ms returned []
// Phase 1: matrix 92 rows 76 cols
[2022-05-20 12:26:19] [INFO ] Computed 14 place invariants in 2 ms
[2022-05-20 12:26:20] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-05-20 12:26:20] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
[2022-05-20 12:26:20] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 92 rows 76 cols
[2022-05-20 12:26:20] [INFO ] Computed 14 place invariants in 6 ms
[2022-05-20 12:26:20] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 76/76 places, 92/92 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 159 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Finished random walk after 20 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=20 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 184 ms. Reduced automaton from 1 states, 1 edges and 1 AP to 1 states, 1 edges and 1 AP.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
// Phase 1: matrix 92 rows 76 cols
[2022-05-20 12:26:20] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-20 12:26:21] [INFO ] [Real]Absence check using 14 positive place invariants in 12 ms returned sat
[2022-05-20 12:26:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:26:21] [INFO ] [Real]Absence check using state equation in 94 ms returned sat
[2022-05-20 12:26:21] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:26:21] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2022-05-20 12:26:21] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:26:21] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2022-05-20 12:26:21] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-05-20 12:26:21] [INFO ] [Nat]Added 67 Read/Feed constraints in 12 ms returned sat
[2022-05-20 12:26:21] [INFO ] Deduced a trap composed of 4 places in 78 ms of which 1 ms to minimize.
[2022-05-20 12:26:21] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
[2022-05-20 12:26:21] [INFO ] Deduced a trap composed of 3 places in 85 ms of which 0 ms to minimize.
[2022-05-20 12:26:21] [INFO ] Deduced a trap composed of 7 places in 81 ms of which 3 ms to minimize.
[2022-05-20 12:26:21] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 381 ms
[2022-05-20 12:26:21] [INFO ] Computed and/alt/rep : 91/213/91 causal constraints (skipped 0 transitions) in 13 ms.
[2022-05-20 12:26:21] [INFO ] Added : 18 causal constraints over 4 iterations in 101 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Product exploration explored 100000 steps with 4761 reset in 252 ms.
Product exploration explored 100000 steps with 4761 reset in 325 ms.
Built C files in :
/tmp/ltsmin7073508790268488594
[2022-05-20 12:26:22] [INFO ] Computing symmetric may disable matrix : 92 transitions.
[2022-05-20 12:26:22] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:26:22] [INFO ] Computing symmetric may enable matrix : 92 transitions.
[2022-05-20 12:26:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:26:22] [INFO ] Computing Do-Not-Accords matrix : 92 transitions.
[2022-05-20 12:26:22] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:26:22] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7073508790268488594
Running compilation step : cd /tmp/ltsmin7073508790268488594;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 647 ms.
Running link step : cd /tmp/ltsmin7073508790268488594;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin7073508790268488594;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased8745790247351009694.hoa' '--buchi-type=spotba'
LTSmin run took 174 ms.
FORMULA ParamProductionCell-PT-1-LTLFireability-02 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-1-LTLFireability-02 finished in 6793 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U (F(X(p1)) U p0)))'
Support contains 4 out of 203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 203/203 places, 200/200 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 203 transition count 179
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 42 place count 182 transition count 179
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 42 place count 182 transition count 166
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 68 place count 169 transition count 166
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 72 place count 165 transition count 162
Iterating global reduction 2 with 4 rules applied. Total rules applied 76 place count 165 transition count 162
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 2 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 128 place count 139 transition count 136
Applied a total of 128 rules in 43 ms. Remains 139 /203 variables (removed 64) and now considering 136/200 (removed 64) transitions.
// Phase 1: matrix 136 rows 139 cols
[2022-05-20 12:26:23] [INFO ] Computed 33 place invariants in 3 ms
[2022-05-20 12:26:23] [INFO ] Implicit Places using invariants in 275 ms returned [1, 4, 7, 10, 24, 25, 43, 48, 54, 55, 57, 69, 70, 89, 101, 118, 121, 124]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 292 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 121/203 places, 136/200 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 121 transition count 132
Reduce places removed 4 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 6 rules applied. Total rules applied 10 place count 117 transition count 130
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 115 transition count 130
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 12 place count 115 transition count 123
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 26 place count 108 transition count 123
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 28 place count 106 transition count 121
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 106 transition count 121
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 80 place count 81 transition count 96
Applied a total of 80 rules in 33 ms. Remains 81 /121 variables (removed 40) and now considering 96/136 (removed 40) transitions.
// Phase 1: matrix 96 rows 81 cols
[2022-05-20 12:26:23] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-20 12:26:23] [INFO ] Implicit Places using invariants in 124 ms returned []
// Phase 1: matrix 96 rows 81 cols
[2022-05-20 12:26:23] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-20 12:26:24] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:26:24] [INFO ] Implicit Places using invariants and state equation in 275 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 81/203 places, 96/200 transitions.
Finished structural reductions, in 2 iterations. Remains : 81/203 places, 96/200 transitions.
Stuttering acceptance computed with spot in 245 ms :[(NOT p0), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s69 1) (EQ s73 1)), p1:(AND (EQ s11 1) (EQ s14 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 2702 reset in 291 ms.
Product exploration explored 100000 steps with 2700 reset in 287 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 (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 546 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Finished random walk after 44 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=22 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 10 factoid took 713 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
// Phase 1: matrix 96 rows 81 cols
[2022-05-20 12:26:26] [INFO ] Computed 15 place invariants in 2 ms
[2022-05-20 12:26:26] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2022-05-20 12:26:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:26:27] [INFO ] [Real]Absence check using state equation in 79 ms returned sat
[2022-05-20 12:26:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:26:27] [INFO ] [Nat]Absence check using 15 positive place invariants in 12 ms returned sat
[2022-05-20 12:26:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:26:27] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2022-05-20 12:26:27] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:26:27] [INFO ] [Nat]Added 68 Read/Feed constraints in 14 ms returned sat
[2022-05-20 12:26:27] [INFO ] Computed and/alt/rep : 95/226/95 causal constraints (skipped 0 transitions) in 13 ms.
[2022-05-20 12:26:27] [INFO ] Added : 9 causal constraints over 2 iterations in 60 ms. Result :sat
Could not prove EG (NOT p0)
// Phase 1: matrix 96 rows 81 cols
[2022-05-20 12:26:27] [INFO ] Computed 15 place invariants in 2 ms
[2022-05-20 12:26:27] [INFO ] [Real]Absence check using 15 positive place invariants in 11 ms returned sat
[2022-05-20 12:26:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:26:27] [INFO ] [Real]Absence check using state equation in 95 ms returned sat
[2022-05-20 12:26:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:26:27] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2022-05-20 12:26:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:26:27] [INFO ] [Nat]Absence check using state equation in 77 ms returned sat
[2022-05-20 12:26:27] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:26:27] [INFO ] [Nat]Added 68 Read/Feed constraints in 19 ms returned sat
[2022-05-20 12:26:27] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 2 ms to minimize.
[2022-05-20 12:26:27] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2022-05-20 12:26:28] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 0 ms to minimize.
[2022-05-20 12:26:28] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 1 ms to minimize.
[2022-05-20 12:26:28] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 0 ms to minimize.
[2022-05-20 12:26:28] [INFO ] Deduced a trap composed of 4 places in 55 ms of which 1 ms to minimize.
[2022-05-20 12:26:28] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2022-05-20 12:26:28] [INFO ] Deduced a trap composed of 29 places in 58 ms of which 1 ms to minimize.
[2022-05-20 12:26:28] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 0 ms to minimize.
[2022-05-20 12:26:28] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2022-05-20 12:26:28] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2022-05-20 12:26:28] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2022-05-20 12:26:28] [INFO ] Deduced a trap composed of 10 places in 24 ms of which 0 ms to minimize.
[2022-05-20 12:26:28] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 2 ms to minimize.
[2022-05-20 12:26:28] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 0 ms to minimize.
[2022-05-20 12:26:28] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 1 ms to minimize.
[2022-05-20 12:26:28] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 2 ms to minimize.
[2022-05-20 12:26:28] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1045 ms
[2022-05-20 12:26:28] [INFO ] Computed and/alt/rep : 95/226/95 causal constraints (skipped 0 transitions) in 12 ms.
[2022-05-20 12:26:29] [INFO ] Added : 87 causal constraints over 19 iterations in 380 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 81 cols
[2022-05-20 12:26:29] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-20 12:26:29] [INFO ] Implicit Places using invariants in 103 ms returned []
// Phase 1: matrix 96 rows 81 cols
[2022-05-20 12:26:29] [INFO ] Computed 15 place invariants in 0 ms
[2022-05-20 12:26:29] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:26:29] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 367 ms to find 0 implicit places.
// Phase 1: matrix 96 rows 81 cols
[2022-05-20 12:26:29] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-20 12:26:29] [INFO ] Dead Transitions using invariants and state equation in 94 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 96/96 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 305 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Finished random walk after 35 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=17 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 336 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 3 states, 4 edges and 2 AP.
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
// Phase 1: matrix 96 rows 81 cols
[2022-05-20 12:26:30] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-20 12:26:30] [INFO ] [Real]Absence check using 15 positive place invariants in 8 ms returned sat
[2022-05-20 12:26:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:26:30] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2022-05-20 12:26:30] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:26:31] [INFO ] [Nat]Absence check using 15 positive place invariants in 11 ms returned sat
[2022-05-20 12:26:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:26:31] [INFO ] [Nat]Absence check using state equation in 82 ms returned sat
[2022-05-20 12:26:31] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:26:31] [INFO ] [Nat]Added 68 Read/Feed constraints in 18 ms returned sat
[2022-05-20 12:26:31] [INFO ] Computed and/alt/rep : 95/226/95 causal constraints (skipped 0 transitions) in 14 ms.
[2022-05-20 12:26:31] [INFO ] Added : 9 causal constraints over 2 iterations in 62 ms. Result :sat
Could not prove EG (NOT p0)
// Phase 1: matrix 96 rows 81 cols
[2022-05-20 12:26:31] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-20 12:26:31] [INFO ] [Real]Absence check using 15 positive place invariants in 9 ms returned sat
[2022-05-20 12:26:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:26:31] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2022-05-20 12:26:31] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:26:31] [INFO ] [Nat]Absence check using 15 positive place invariants in 10 ms returned sat
[2022-05-20 12:26:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:26:31] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2022-05-20 12:26:31] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:26:31] [INFO ] [Nat]Added 68 Read/Feed constraints in 19 ms returned sat
[2022-05-20 12:26:31] [INFO ] Deduced a trap composed of 4 places in 59 ms of which 1 ms to minimize.
[2022-05-20 12:26:31] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 1 ms to minimize.
[2022-05-20 12:26:31] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 0 ms to minimize.
[2022-05-20 12:26:31] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2022-05-20 12:26:31] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2022-05-20 12:26:31] [INFO ] Deduced a trap composed of 4 places in 54 ms of which 0 ms to minimize.
[2022-05-20 12:26:32] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2022-05-20 12:26:32] [INFO ] Deduced a trap composed of 29 places in 51 ms of which 1 ms to minimize.
[2022-05-20 12:26:32] [INFO ] Deduced a trap composed of 12 places in 53 ms of which 1 ms to minimize.
[2022-05-20 12:26:32] [INFO ] Deduced a trap composed of 12 places in 52 ms of which 1 ms to minimize.
[2022-05-20 12:26:32] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 0 ms to minimize.
[2022-05-20 12:26:32] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 1 ms to minimize.
[2022-05-20 12:26:32] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 1 ms to minimize.
[2022-05-20 12:26:32] [INFO ] Deduced a trap composed of 10 places in 53 ms of which 1 ms to minimize.
[2022-05-20 12:26:32] [INFO ] Deduced a trap composed of 3 places in 48 ms of which 1 ms to minimize.
[2022-05-20 12:26:32] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 0 ms to minimize.
[2022-05-20 12:26:32] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2022-05-20 12:26:32] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1051 ms
[2022-05-20 12:26:32] [INFO ] Computed and/alt/rep : 95/226/95 causal constraints (skipped 0 transitions) in 11 ms.
[2022-05-20 12:26:33] [INFO ] Added : 87 causal constraints over 19 iterations in 349 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2703 reset in 215 ms.
Product exploration explored 100000 steps with 2705 reset in 277 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Support contains 4 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 96/96 transitions.
Applied a total of 0 rules in 9 ms. Remains 81 /81 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2022-05-20 12:26:34] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 96 rows 81 cols
[2022-05-20 12:26:34] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-20 12:26:34] [INFO ] Dead Transitions using invariants and state equation in 235 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 81/81 places, 96/96 transitions.
Product exploration explored 100000 steps with 2701 reset in 447 ms.
Product exploration explored 100000 steps with 2705 reset in 298 ms.
Built C files in :
/tmp/ltsmin17195744251082700119
[2022-05-20 12:26:35] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17195744251082700119
Running compilation step : cd /tmp/ltsmin17195744251082700119;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 279 ms.
Running link step : cd /tmp/ltsmin17195744251082700119;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin17195744251082700119;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5798160629645323054.hoa' '--buchi-type=spotba'
LTSmin run took 190 ms.
FORMULA ParamProductionCell-PT-1-LTLFireability-05 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-1-LTLFireability-05 finished in 12302 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(X(G(G(p0)))))))'
Support contains 2 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 200/200 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 199 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 199 transition count 196
Applied a total of 8 rules in 10 ms. Remains 199 /203 variables (removed 4) and now considering 196/200 (removed 4) transitions.
// Phase 1: matrix 196 rows 199 cols
[2022-05-20 12:26:35] [INFO ] Computed 33 place invariants in 3 ms
[2022-05-20 12:26:36] [INFO ] Implicit Places using invariants in 435 ms returned [33, 37, 38, 65, 84, 85, 87, 99, 100, 143, 168, 171, 176, 180]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 437 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/203 places, 196/200 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 9 ms. Remains 183 /185 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 183 cols
[2022-05-20 12:26:36] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-20 12:26:36] [INFO ] Implicit Places using invariants in 195 ms returned []
// Phase 1: matrix 194 rows 183 cols
[2022-05-20 12:26:36] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-20 12:26:36] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:26:36] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 697 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 183/203 places, 194/200 transitions.
Finished structural reductions, in 2 iterations. Remains : 183/203 places, 194/200 transitions.
Stuttering acceptance computed with spot in 205 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (EQ s19 1) (EQ s23 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA ParamProductionCell-PT-1-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-1-LTLFireability-08 finished in 1380 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(!(X(!(F(!p0)||p1)) U X(p2)))'
Support contains 6 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 200/200 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 199 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 199 transition count 196
Applied a total of 8 rules in 8 ms. Remains 199 /203 variables (removed 4) and now considering 196/200 (removed 4) transitions.
// Phase 1: matrix 196 rows 199 cols
[2022-05-20 12:26:37] [INFO ] Computed 33 place invariants in 2 ms
[2022-05-20 12:26:37] [INFO ] Implicit Places using invariants in 303 ms returned [19, 37, 38, 65, 84, 87, 99, 100, 143, 168, 171, 176, 180]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 316 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/203 places, 196/200 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 184 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 184 transition count 194
Applied a total of 4 rules in 6 ms. Remains 184 /186 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 184 cols
[2022-05-20 12:26:37] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-20 12:26:37] [INFO ] Implicit Places using invariants in 181 ms returned []
// Phase 1: matrix 194 rows 184 cols
[2022-05-20 12:26:37] [INFO ] Computed 20 place invariants in 1 ms
[2022-05-20 12:26:37] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:26:38] [INFO ] Implicit Places using invariants and state equation in 613 ms returned []
Implicit Place search using SMT with State Equation took 805 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 184/203 places, 194/200 transitions.
Finished structural reductions, in 2 iterations. Remains : 184/203 places, 194/200 transitions.
Stuttering acceptance computed with spot in 243 ms :[true, p0, p2, p2, (AND p0 p2)]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p2, acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p2), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(AND (EQ s32 1) (EQ s40 1)), p2:(AND (EQ s80 1) (EQ s126 1)), p1:(AND (EQ s172 1) (EQ s179 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 470 ms.
Product exploration explored 100000 steps with 50000 reset in 507 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT p2)), (X (NOT (AND (NOT p1) p0 (NOT p2)))), true, (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND p0 p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) p0 (NOT p2))))
Knowledge based reduction with 6 factoid took 123 ms. Reduced automaton from 5 states, 7 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA ParamProductionCell-PT-1-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-1-LTLFireability-09 finished in 2508 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((!X(p0) U F(((!G(p0) U p1)&&G(p2)))))'
Support contains 6 out of 203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 203/203 places, 200/200 transitions.
Drop transitions removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 203 transition count 180
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 40 place count 183 transition count 180
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 40 place count 183 transition count 166
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 68 place count 169 transition count 166
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 72 place count 165 transition count 162
Iterating global reduction 2 with 4 rules applied. Total rules applied 76 place count 165 transition count 162
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 132 place count 137 transition count 134
Applied a total of 132 rules in 19 ms. Remains 137 /203 variables (removed 66) and now considering 134/200 (removed 66) transitions.
// Phase 1: matrix 134 rows 137 cols
[2022-05-20 12:26:39] [INFO ] Computed 33 place invariants in 1 ms
[2022-05-20 12:26:39] [INFO ] Implicit Places using invariants in 250 ms returned [1, 4, 7, 10, 19, 24, 40, 46, 52, 53, 67, 68, 87, 99, 116, 119, 122, 124]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 252 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 119/203 places, 134/200 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 119 transition count 130
Reduce places removed 4 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 7 rules applied. Total rules applied 11 place count 115 transition count 127
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 14 place count 112 transition count 127
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 14 place count 112 transition count 123
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 22 place count 108 transition count 123
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 56 place count 91 transition count 106
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 58 place count 90 transition count 105
Applied a total of 58 rules in 17 ms. Remains 90 /119 variables (removed 29) and now considering 105/134 (removed 29) transitions.
// Phase 1: matrix 105 rows 90 cols
[2022-05-20 12:26:39] [INFO ] Computed 15 place invariants in 1 ms
[2022-05-20 12:26:40] [INFO ] Implicit Places using invariants in 96 ms returned []
// Phase 1: matrix 105 rows 90 cols
[2022-05-20 12:26:40] [INFO ] Computed 15 place invariants in 0 ms
[2022-05-20 12:26:40] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-05-20 12:26:40] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 90/203 places, 105/200 transitions.
Finished structural reductions, in 2 iterations. Remains : 90/203 places, 105/200 transitions.
Stuttering acceptance computed with spot in 274 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2), (OR (AND p0 (NOT p2)) (AND p0 (NOT p1))), (AND p0 (NOT p2))]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 0}, { cond=p2, acceptance={} source=2 dest: 2}], [{ cond=(OR (AND (NOT p1) p0) (AND p0 (NOT p2))), acceptance={0} source=3 dest: 3}, { cond=(AND p1 p0 p2), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s35 1) (EQ s37 1) (EQ s52 1)), p1:(EQ s28 1), p0:(AND (EQ s14 1) (EQ s19 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null][true, true, true, true, true]]
Product exploration explored 100000 steps with 603 reset in 242 ms.
Stack based approach found an accepted trace after 256 steps with 2 reset with depth 73 and stack size 73 in 1 ms.
FORMULA ParamProductionCell-PT-1-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-1-LTLFireability-10 finished in 1102 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(G((X((X(p1)||p2))&&p0))))))'
Support contains 5 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 200/200 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 199 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 199 transition count 196
Applied a total of 8 rules in 8 ms. Remains 199 /203 variables (removed 4) and now considering 196/200 (removed 4) transitions.
// Phase 1: matrix 196 rows 199 cols
[2022-05-20 12:26:40] [INFO ] Computed 33 place invariants in 2 ms
[2022-05-20 12:26:41] [INFO ] Implicit Places using invariants in 295 ms returned [19, 33, 37, 38, 65, 84, 85, 87, 143, 168, 171, 176, 180]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 296 ms to find 13 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 186/203 places, 196/200 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 184 transition count 194
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 184 transition count 194
Applied a total of 4 rules in 7 ms. Remains 184 /186 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 184 cols
[2022-05-20 12:26:41] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-20 12:26:41] [INFO ] Implicit Places using invariants in 198 ms returned []
// Phase 1: matrix 194 rows 184 cols
[2022-05-20 12:26:41] [INFO ] Computed 20 place invariants in 2 ms
[2022-05-20 12:26:41] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:26:41] [INFO ] Implicit Places using invariants and state equation in 660 ms returned []
Implicit Place search using SMT with State Equation took 868 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 184/203 places, 194/200 transitions.
Finished structural reductions, in 2 iterations. Remains : 184/203 places, 194/200 transitions.
Stuttering acceptance computed with spot in 302 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p2 p1), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND p0 p2), acceptance={} source=5 dest: 5}]], initial=2, aps=[p0:(AND (EQ s91 1) (EQ s98 1)), p1:(OR (EQ s89 0) (EQ s90 0) (EQ s112 0)), p2:(AND (EQ s91 1) (EQ s98 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-1-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-1-LTLFireability-11 finished in 1511 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(p0))))'
Support contains 3 out of 203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 203/203 places, 200/200 transitions.
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 203 transition count 182
Reduce places removed 18 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 19 rules applied. Total rules applied 37 place count 185 transition count 181
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 184 transition count 181
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 38 place count 184 transition count 166
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 68 place count 169 transition count 166
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 72 place count 165 transition count 162
Iterating global reduction 3 with 4 rules applied. Total rules applied 76 place count 165 transition count 162
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 132 place count 137 transition count 134
Applied a total of 132 rules in 38 ms. Remains 137 /203 variables (removed 66) and now considering 134/200 (removed 66) transitions.
// Phase 1: matrix 134 rows 137 cols
[2022-05-20 12:26:42] [INFO ] Computed 33 place invariants in 2 ms
[2022-05-20 12:26:42] [INFO ] Implicit Places using invariants in 317 ms returned [1, 4, 7, 10, 19, 23, 24, 46, 52, 53, 55, 67, 68, 87, 99, 116, 119, 122, 124]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 319 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/203 places, 134/200 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 118 transition count 128
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 13 place count 112 transition count 127
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 111 transition count 127
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 14 place count 111 transition count 121
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 26 place count 105 transition count 121
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 28 place count 103 transition count 119
Iterating global reduction 3 with 2 rules applied. Total rules applied 30 place count 103 transition count 119
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 86 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 88 place count 74 transition count 90
Applied a total of 88 rules in 21 ms. Remains 74 /118 variables (removed 44) and now considering 90/134 (removed 44) transitions.
// Phase 1: matrix 90 rows 74 cols
[2022-05-20 12:26:42] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-20 12:26:42] [INFO ] Implicit Places using invariants in 141 ms returned []
// Phase 1: matrix 90 rows 74 cols
[2022-05-20 12:26:42] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-20 12:26:42] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-05-20 12:26:42] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 74/203 places, 90/200 transitions.
Finished structural reductions, in 2 iterations. Remains : 74/203 places, 90/200 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-12 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:(AND (EQ s22 1) (EQ s24 1) (EQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5555 reset in 167 ms.
Product exploration explored 100000 steps with 5555 reset in 124 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Finished random walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 90 rows 74 cols
[2022-05-20 12:26:43] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-20 12:26:43] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-20 12:26:43] [INFO ] [Real]Absence check using 13 positive and 1 generalized place invariants in 4 ms returned sat
[2022-05-20 12:26:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:26:43] [INFO ] [Real]Absence check using state equation in 50 ms returned sat
[2022-05-20 12:26:43] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:26:44] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2022-05-20 12:26:44] [INFO ] [Nat]Absence check using 13 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-20 12:26:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:26:44] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2022-05-20 12:26:44] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-05-20 12:26:44] [INFO ] [Nat]Added 67 Read/Feed constraints in 9 ms returned sat
[2022-05-20 12:26:44] [INFO ] Deduced a trap composed of 4 places in 33 ms of which 1 ms to minimize.
[2022-05-20 12:26:44] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 2 ms to minimize.
[2022-05-20 12:26:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 82 ms
[2022-05-20 12:26:44] [INFO ] Computed and/alt/rep : 89/219/89 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-20 12:26:44] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2022-05-20 12:26:44] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2022-05-20 12:26:44] [INFO ] Deduced a trap composed of 10 places in 28 ms of which 1 ms to minimize.
[2022-05-20 12:26:44] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 0 ms to minimize.
[2022-05-20 12:26:44] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 171 ms
[2022-05-20 12:26:44] [INFO ] Added : 86 causal constraints over 18 iterations in 377 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 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 3 ms. Remains 74 /74 variables (removed 0) and now considering 90/90 (removed 0) transitions.
// Phase 1: matrix 90 rows 74 cols
[2022-05-20 12:26:44] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-20 12:26:44] [INFO ] Implicit Places using invariants in 66 ms returned []
// Phase 1: matrix 90 rows 74 cols
[2022-05-20 12:26:44] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-20 12:26:44] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-05-20 12:26:44] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
[2022-05-20 12:26:44] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 90 rows 74 cols
[2022-05-20 12:26:44] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-20 12:26:44] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Finished random walk after 17 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=17 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
// Phase 1: matrix 90 rows 74 cols
[2022-05-20 12:26:45] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-20 12:26:45] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2022-05-20 12:26:45] [INFO ] [Real]Absence check using 13 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-20 12:26:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:26:45] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2022-05-20 12:26:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:26:45] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2022-05-20 12:26:45] [INFO ] [Nat]Absence check using 13 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-20 12:26:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:26:45] [INFO ] [Nat]Absence check using state equation in 40 ms returned sat
[2022-05-20 12:26:45] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-05-20 12:26:45] [INFO ] [Nat]Added 67 Read/Feed constraints in 9 ms returned sat
[2022-05-20 12:26:45] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 0 ms to minimize.
[2022-05-20 12:26:45] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2022-05-20 12:26:45] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 89 ms
[2022-05-20 12:26:45] [INFO ] Computed and/alt/rep : 89/219/89 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-20 12:26:46] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2022-05-20 12:26:46] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
[2022-05-20 12:26:46] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
[2022-05-20 12:26:46] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2022-05-20 12:26:46] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 218 ms
[2022-05-20 12:26:46] [INFO ] Added : 86 causal constraints over 18 iterations in 432 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5551 reset in 176 ms.
Product exploration explored 100000 steps with 5555 reset in 201 ms.
Built C files in :
/tmp/ltsmin2818506367757996743
[2022-05-20 12:26:46] [INFO ] Computing symmetric may disable matrix : 90 transitions.
[2022-05-20 12:26:46] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:26:46] [INFO ] Computing symmetric may enable matrix : 90 transitions.
[2022-05-20 12:26:46] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:26:46] [INFO ] Computing Do-Not-Accords matrix : 90 transitions.
[2022-05-20 12:26:46] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:26:47] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2818506367757996743
Running compilation step : cd /tmp/ltsmin2818506367757996743;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 429 ms.
Running link step : cd /tmp/ltsmin2818506367757996743;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin2818506367757996743;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10167792419948423464.hoa' '--buchi-type=spotba'
LTSmin run took 137 ms.
FORMULA ParamProductionCell-PT-1-LTLFireability-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-1-LTLFireability-12 finished in 5382 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(F(p0))||p1))||F(G(X(p2)))))'
Support contains 5 out of 203 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 203/203 places, 200/200 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 199 transition count 196
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 199 transition count 196
Applied a total of 8 rules in 5 ms. Remains 199 /203 variables (removed 4) and now considering 196/200 (removed 4) transitions.
// Phase 1: matrix 196 rows 199 cols
[2022-05-20 12:26:47] [INFO ] Computed 33 place invariants in 2 ms
[2022-05-20 12:26:47] [INFO ] Implicit Places using invariants in 317 ms returned [19, 33, 37, 38, 65, 84, 85, 87, 99, 100, 143, 168, 171, 180]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 318 ms to find 14 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/203 places, 196/200 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 9 ms. Remains 183 /185 variables (removed 2) and now considering 194/196 (removed 2) transitions.
// Phase 1: matrix 194 rows 183 cols
[2022-05-20 12:26:47] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-20 12:26:48] [INFO ] Implicit Places using invariants in 205 ms returned []
// Phase 1: matrix 194 rows 183 cols
[2022-05-20 12:26:48] [INFO ] Computed 19 place invariants in 2 ms
[2022-05-20 12:26:48] [INFO ] State equation strengthened by 68 read => feed constraints.
[2022-05-20 12:26:48] [INFO ] Implicit Places using invariants and state equation in 536 ms returned []
Implicit Place search using SMT with State Equation took 743 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 183/203 places, 194/200 transitions.
Finished structural reductions, in 2 iterations. Remains : 183/203 places, 194/200 transitions.
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 2}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p1:(AND (EQ s161 1) (EQ s167 1)), p2:(AND (EQ s13 1) (EQ s69 1)), p0:(EQ s28 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 571 reset in 200 ms.
Product exploration explored 100000 steps with 581 reset in 379 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 p2) p0), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 358 ms. Reduced automaton from 4 states, 7 edges and 3 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :1
Finished Best-First random walk after 195 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=97 )
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT p1)), true, (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT (AND p2 (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) p2))]
Knowledge based reduction with 6 factoid took 284 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 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 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 183 transition count 152
Reduce places removed 42 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 43 rules applied. Total rules applied 85 place count 141 transition count 151
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 86 place count 140 transition count 151
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 86 place count 140 transition count 144
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 100 place count 133 transition count 144
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 184 place count 91 transition count 102
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 186 place count 90 transition count 101
Applied a total of 186 rules in 34 ms. Remains 90 /183 variables (removed 93) and now considering 101/194 (removed 93) transitions.
// Phase 1: matrix 101 rows 90 cols
[2022-05-20 12:26:50] [INFO ] Computed 19 place invariants in 1 ms
[2022-05-20 12:26:50] [INFO ] Implicit Places using invariants in 128 ms returned [0, 2, 56]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 132 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 87/183 places, 101/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 86 transition count 100
Applied a total of 2 rules in 10 ms. Remains 86 /87 variables (removed 1) and now considering 100/101 (removed 1) transitions.
// Phase 1: matrix 100 rows 86 cols
[2022-05-20 12:26:50] [INFO ] Computed 16 place invariants in 0 ms
[2022-05-20 12:26:50] [INFO ] Implicit Places using invariants in 113 ms returned []
// Phase 1: matrix 100 rows 86 cols
[2022-05-20 12:26:50] [INFO ] Computed 16 place invariants in 10 ms
[2022-05-20 12:26:51] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-05-20 12:26:51] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 86/183 places, 100/194 transitions.
Finished structural reductions, in 2 iterations. Remains : 86/183 places, 100/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 p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 468 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Finished random walk after 4601 steps, including 1 resets, run visited all 2 properties in 19 ms. (steps per millisecond=242 )
Knowledge obtained : [(AND p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), true, (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p2))), (F (AND (NOT p0) p2))]
Knowledge based reduction with 5 factoid took 338 ms. Reduced automaton from 3 states, 5 edges and 2 AP to 3 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 145 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 1184 reset in 198 ms.
Product exploration explored 100000 steps with 1234 reset in 293 ms.
Built C files in :
/tmp/ltsmin15198147229824981316
[2022-05-20 12:26:53] [INFO ] Computing symmetric may disable matrix : 100 transitions.
[2022-05-20 12:26:53] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:26:53] [INFO ] Computing symmetric may enable matrix : 100 transitions.
[2022-05-20 12:26:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:26:53] [INFO ] Computing Do-Not-Accords matrix : 100 transitions.
[2022-05-20 12:26:53] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:26:53] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15198147229824981316
Running compilation step : cd /tmp/ltsmin15198147229824981316;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 464 ms.
Running link step : cd /tmp/ltsmin15198147229824981316;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin15198147229824981316;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2684923892104957364.hoa' '--buchi-type=spotba'
LTSmin run took 217 ms.
FORMULA ParamProductionCell-PT-1-LTLFireability-14 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ParamProductionCell-PT-1-LTLFireability-14 finished in 6311 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(X(F((F(X(F(p0)))||p1))))))'
Support contains 4 out of 203 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 203/203 places, 200/200 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 203 transition count 181
Reduce places removed 19 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 20 rules applied. Total rules applied 39 place count 184 transition count 180
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 183 transition count 180
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 40 place count 183 transition count 165
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 70 place count 168 transition count 165
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 74 place count 164 transition count 161
Iterating global reduction 3 with 4 rules applied. Total rules applied 78 place count 164 transition count 161
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 132 place count 137 transition count 134
Applied a total of 132 rules in 21 ms. Remains 137 /203 variables (removed 66) and now considering 134/200 (removed 66) transitions.
// Phase 1: matrix 134 rows 137 cols
[2022-05-20 12:26:53] [INFO ] Computed 33 place invariants in 1 ms
[2022-05-20 12:26:54] [INFO ] Implicit Places using invariants in 313 ms returned [1, 5, 8, 20, 24, 25, 41, 46, 52, 53, 55, 67, 68, 87, 99, 116, 119, 122, 124]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 314 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/203 places, 134/200 transitions.
Drop transitions removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 118 transition count 127
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 111 transition count 127
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 14 place count 111 transition count 120
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 28 place count 104 transition count 120
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 30 place count 102 transition count 118
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 102 transition count 118
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 2 with 54 rules applied. Total rules applied 86 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 2 with 2 rules applied. Total rules applied 88 place count 74 transition count 90
Applied a total of 88 rules in 13 ms. Remains 74 /118 variables (removed 44) and now considering 90/134 (removed 44) transitions.
// Phase 1: matrix 90 rows 74 cols
[2022-05-20 12:26:54] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-20 12:26:54] [INFO ] Implicit Places using invariants in 108 ms returned []
// Phase 1: matrix 90 rows 74 cols
[2022-05-20 12:26:54] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-20 12:26:54] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-05-20 12:26:54] [INFO ] Implicit Places using invariants and state equation in 281 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 74/203 places, 90/200 transitions.
Finished structural reductions, in 2 iterations. Remains : 74/203 places, 90/200 transitions.
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ParamProductionCell-PT-1-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s31 1) (EQ s55 1)), p0:(AND (EQ s4 1) (EQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 2903 reset in 193 ms.
Product exploration explored 100000 steps with 2904 reset in 220 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 (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 31 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 192 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 90 rows 74 cols
[2022-05-20 12:26:55] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-20 12:26:56] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2022-05-20 12:26:56] [INFO ] [Real]Absence check using 13 positive and 1 generalized place invariants in 1 ms returned sat
[2022-05-20 12:26:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:26:56] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2022-05-20 12:26:56] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:26:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2022-05-20 12:26:56] [INFO ] [Nat]Absence check using 13 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-20 12:26:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:26:56] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2022-05-20 12:26:56] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-05-20 12:26:56] [INFO ] [Nat]Added 67 Read/Feed constraints in 15 ms returned sat
[2022-05-20 12:26:56] [INFO ] Deduced a trap composed of 3 places in 57 ms of which 1 ms to minimize.
[2022-05-20 12:26:56] [INFO ] Deduced a trap composed of 3 places in 54 ms of which 1 ms to minimize.
[2022-05-20 12:26:56] [INFO ] Deduced a trap composed of 7 places in 51 ms of which 1 ms to minimize.
[2022-05-20 12:26:56] [INFO ] Deduced a trap composed of 19 places in 51 ms of which 0 ms to minimize.
[2022-05-20 12:26:56] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 0 ms to minimize.
[2022-05-20 12:26:56] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 1 ms to minimize.
[2022-05-20 12:26:56] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
[2022-05-20 12:26:56] [INFO ] Deduced a trap composed of 20 places in 43 ms of which 1 ms to minimize.
[2022-05-20 12:26:56] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
[2022-05-20 12:26:56] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2022-05-20 12:26:56] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 606 ms
[2022-05-20 12:26:56] [INFO ] Computed and/alt/rep : 89/213/89 causal constraints (skipped 0 transitions) in 10 ms.
[2022-05-20 12:26:57] [INFO ] Added : 74 causal constraints over 15 iterations in 254 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 4 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 5 ms. Remains 74 /74 variables (removed 0) and now considering 90/90 (removed 0) transitions.
// Phase 1: matrix 90 rows 74 cols
[2022-05-20 12:26:57] [INFO ] Computed 14 place invariants in 1 ms
[2022-05-20 12:26:57] [INFO ] Implicit Places using invariants in 134 ms returned []
// Phase 1: matrix 90 rows 74 cols
[2022-05-20 12:26:57] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-20 12:26:57] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-05-20 12:26:57] [INFO ] Implicit Places using invariants and state equation in 233 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
[2022-05-20 12:26:57] [INFO ] Redundant transitions in 3 ms returned []
// Phase 1: matrix 90 rows 74 cols
[2022-05-20 12:26:57] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-20 12:26:57] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 145 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 31 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=15 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 3 factoid took 182 ms. Reduced automaton from 2 states, 3 edges and 2 AP to 2 states, 3 edges and 2 AP.
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
// Phase 1: matrix 90 rows 74 cols
[2022-05-20 12:26:58] [INFO ] Computed 14 place invariants in 0 ms
[2022-05-20 12:26:58] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2022-05-20 12:26:58] [INFO ] [Real]Absence check using 13 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-20 12:26:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 12:26:58] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2022-05-20 12:26:58] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 12:26:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2022-05-20 12:26:58] [INFO ] [Nat]Absence check using 13 positive and 1 generalized place invariants in 2 ms returned sat
[2022-05-20 12:26:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 12:26:58] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2022-05-20 12:26:58] [INFO ] State equation strengthened by 67 read => feed constraints.
[2022-05-20 12:26:58] [INFO ] [Nat]Added 67 Read/Feed constraints in 16 ms returned sat
[2022-05-20 12:26:58] [INFO ] Deduced a trap composed of 3 places in 53 ms of which 0 ms to minimize.
[2022-05-20 12:26:58] [INFO ] Deduced a trap composed of 3 places in 60 ms of which 1 ms to minimize.
[2022-05-20 12:26:58] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 3 ms to minimize.
[2022-05-20 12:26:59] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 4 ms to minimize.
[2022-05-20 12:26:59] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 0 ms to minimize.
[2022-05-20 12:26:59] [INFO ] Deduced a trap composed of 5 places in 48 ms of which 1 ms to minimize.
[2022-05-20 12:26:59] [INFO ] Deduced a trap composed of 31 places in 48 ms of which 1 ms to minimize.
[2022-05-20 12:26:59] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
[2022-05-20 12:26:59] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2022-05-20 12:26:59] [INFO ] Deduced a trap composed of 18 places in 33 ms of which 1 ms to minimize.
[2022-05-20 12:26:59] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 526 ms
[2022-05-20 12:26:59] [INFO ] Computed and/alt/rep : 89/213/89 causal constraints (skipped 0 transitions) in 12 ms.
[2022-05-20 12:26:59] [INFO ] Added : 74 causal constraints over 15 iterations in 256 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2905 reset in 195 ms.
Product exploration explored 100000 steps with 2907 reset in 240 ms.
Built C files in :
/tmp/ltsmin13867961930381314781
[2022-05-20 12:27:00] [INFO ] Computing symmetric may disable matrix : 90 transitions.
[2022-05-20 12:27:00] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:27:00] [INFO ] Computing symmetric may enable matrix : 90 transitions.
[2022-05-20 12:27:00] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:27:00] [INFO ] Computing Do-Not-Accords matrix : 90 transitions.
[2022-05-20 12:27:00] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 12:27:00] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13867961930381314781
Running compilation step : cd /tmp/ltsmin13867961930381314781;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 392 ms.
Running link step : cd /tmp/ltsmin13867961930381314781;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin13867961930381314781;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17176448740287791912.hoa' '--buchi-type=spotba'
LTSmin run took 271 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 6899 ms.
All properties solved by simple procedures.
Total runtime 51378 ms.

BK_STOP 1653049621039

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-4028"
echo " Executing tool itstools"
echo " Input is ParamProductionCell-PT-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 r150-smll-165276998600260"
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 ;