About the Execution of LoLa+red for ParamProductionCell-PT-0
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 483.472 | 17080.00 | 31617.00 | 428.50 | FTTFTFFTFFFTTFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r263-smll-167863538100363.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is ParamProductionCell-PT-0, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-smll-167863538100363
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 640K
-rw-r--r-- 1 mcc users 8.3K Feb 26 17:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 17:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 17:13 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 17:13 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 17:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 135K Feb 26 17:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 17:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 26 17:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 149K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ParamProductionCell-PT-0-LTLCardinality-00
FORMULA_NAME ParamProductionCell-PT-0-LTLCardinality-01
FORMULA_NAME ParamProductionCell-PT-0-LTLCardinality-02
FORMULA_NAME ParamProductionCell-PT-0-LTLCardinality-03
FORMULA_NAME ParamProductionCell-PT-0-LTLCardinality-04
FORMULA_NAME ParamProductionCell-PT-0-LTLCardinality-05
FORMULA_NAME ParamProductionCell-PT-0-LTLCardinality-06
FORMULA_NAME ParamProductionCell-PT-0-LTLCardinality-07
FORMULA_NAME ParamProductionCell-PT-0-LTLCardinality-08
FORMULA_NAME ParamProductionCell-PT-0-LTLCardinality-09
FORMULA_NAME ParamProductionCell-PT-0-LTLCardinality-10
FORMULA_NAME ParamProductionCell-PT-0-LTLCardinality-11
FORMULA_NAME ParamProductionCell-PT-0-LTLCardinality-12
FORMULA_NAME ParamProductionCell-PT-0-LTLCardinality-13
FORMULA_NAME ParamProductionCell-PT-0-LTLCardinality-14
FORMULA_NAME ParamProductionCell-PT-0-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678780052309
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ParamProductionCell-PT-0
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-14 07:47:34] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-14 07:47:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-14 07:47:34] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2023-03-14 07:47:34] [INFO ] Transformed 198 places.
[2023-03-14 07:47:34] [INFO ] Transformed 176 transitions.
[2023-03-14 07:47:34] [INFO ] Found NUPN structural information;
[2023-03-14 07:47:34] [INFO ] Parsed PT model containing 198 places and 176 transitions and 730 arcs in 203 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ParamProductionCell-PT-0-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-0-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-0-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-0-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-0-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-0-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-0-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-0-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 198 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 198/198 places, 176/176 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 192 transition count 170
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 192 transition count 170
Applied a total of 12 rules in 54 ms. Remains 192 /198 variables (removed 6) and now considering 170/176 (removed 6) transitions.
// Phase 1: matrix 170 rows 192 cols
[2023-03-14 07:47:35] [INFO ] Computed 49 place invariants in 17 ms
[2023-03-14 07:47:35] [INFO ] Implicit Places using invariants in 492 ms returned [15, 16, 18, 19, 24, 31, 36, 41, 42, 46, 47, 59, 64, 65, 73, 78, 79, 98, 99, 101, 113, 114, 116, 118, 119, 160, 162, 164, 165]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 532 ms to find 29 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 163/198 places, 170/176 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 162 transition count 169
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 162 transition count 169
Applied a total of 2 rules in 22 ms. Remains 162 /163 variables (removed 1) and now considering 169/170 (removed 1) transitions.
// Phase 1: matrix 169 rows 162 cols
[2023-03-14 07:47:35] [INFO ] Computed 20 place invariants in 7 ms
[2023-03-14 07:47:35] [INFO ] Implicit Places using invariants in 141 ms returned []
[2023-03-14 07:47:35] [INFO ] Invariant cache hit.
[2023-03-14 07:47:35] [INFO ] State equation strengthened by 59 read => feed constraints.
[2023-03-14 07:47:36] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 162/198 places, 169/176 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1049 ms. Remains : 162/198 places, 169/176 transitions.
Support contains 21 out of 162 places after structural reductions.
[2023-03-14 07:47:36] [INFO ] Flatten gal took : 54 ms
[2023-03-14 07:47:36] [INFO ] Flatten gal took : 22 ms
[2023-03-14 07:47:36] [INFO ] Input system was already deterministic with 169 transitions.
Finished random walk after 713 steps, including 0 resets, run visited all 14 properties in 60 ms. (steps per millisecond=11 )
FORMULA ParamProductionCell-PT-0-LTLCardinality-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 169/169 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 161 transition count 168
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 161 transition count 168
Applied a total of 2 rules in 14 ms. Remains 161 /162 variables (removed 1) and now considering 168/169 (removed 1) transitions.
// Phase 1: matrix 168 rows 161 cols
[2023-03-14 07:47:36] [INFO ] Computed 20 place invariants in 2 ms
[2023-03-14 07:47:37] [INFO ] Implicit Places using invariants in 183 ms returned [29, 133]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 187 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 159/162 places, 168/169 transitions.
Applied a total of 0 rules in 12 ms. Remains 159 /159 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 213 ms. Remains : 159/162 places, 168/169 transitions.
Stuttering acceptance computed with spot in 256 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-0-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s18 0) (EQ s123 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 86 steps with 0 reset in 4 ms.
FORMULA ParamProductionCell-PT-0-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-0-LTLCardinality-00 finished in 541 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(F(p1)))))'
Support contains 3 out of 162 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 162/162 places, 169/169 transitions.
Drop transitions removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 162 transition count 137
Reduce places removed 32 places and 0 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 64 place count 130 transition count 137
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 64 place count 130 transition count 129
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 80 place count 122 transition count 129
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 81 place count 121 transition count 128
Iterating global reduction 2 with 1 rules applied. Total rules applied 82 place count 121 transition count 128
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 166 place count 78 transition count 87
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 166 place count 78 transition count 86
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 168 place count 77 transition count 86
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 170 place count 76 transition count 85
Applied a total of 170 rules in 41 ms. Remains 76 /162 variables (removed 86) and now considering 85/169 (removed 84) transitions.
// Phase 1: matrix 85 rows 76 cols
[2023-03-14 07:47:37] [INFO ] Computed 18 place invariants in 2 ms
[2023-03-14 07:47:37] [INFO ] Implicit Places using invariants in 119 ms returned [0, 1, 15, 64]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 120 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 72/162 places, 85/169 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 68 transition count 81
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 0 with 2 rules applied. Total rules applied 10 place count 67 transition count 80
Applied a total of 10 rules in 11 ms. Remains 67 /72 variables (removed 5) and now considering 80/85 (removed 5) transitions.
// Phase 1: matrix 80 rows 67 cols
[2023-03-14 07:47:37] [INFO ] Computed 14 place invariants in 1 ms
[2023-03-14 07:47:37] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-14 07:47:37] [INFO ] Invariant cache hit.
[2023-03-14 07:47:37] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-14 07:47:37] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 67/162 places, 80/169 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 400 ms. Remains : 67/162 places, 80/169 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ParamProductionCell-PT-0-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s55 1), p1:(OR (EQ s49 0) (EQ s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 8326 reset in 322 ms.
Product exploration explored 100000 steps with 8333 reset in 225 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) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 197 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 12 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=12 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 227 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 80/80 transitions.
Applied a total of 0 rules in 5 ms. Remains 67 /67 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-14 07:47:39] [INFO ] Invariant cache hit.
[2023-03-14 07:47:39] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-14 07:47:39] [INFO ] Invariant cache hit.
[2023-03-14 07:47:39] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-14 07:47:39] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2023-03-14 07:47:39] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-14 07:47:39] [INFO ] Invariant cache hit.
[2023-03-14 07:47:39] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 497 ms. Remains : 67/67 places, 80/80 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 200 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 12 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=6 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F p0), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 252 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 8323 reset in 150 ms.
Product exploration explored 100000 steps with 8332 reset in 341 ms.
Support contains 3 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 80/80 transitions.
Applied a total of 0 rules in 4 ms. Remains 67 /67 variables (removed 0) and now considering 80/80 (removed 0) transitions.
[2023-03-14 07:47:40] [INFO ] Invariant cache hit.
[2023-03-14 07:47:40] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-14 07:47:40] [INFO ] Invariant cache hit.
[2023-03-14 07:47:40] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-14 07:47:40] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2023-03-14 07:47:40] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 07:47:40] [INFO ] Invariant cache hit.
[2023-03-14 07:47:41] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 300 ms. Remains : 67/67 places, 80/80 transitions.
Treatment of property ParamProductionCell-PT-0-LTLCardinality-02 finished in 3827 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)&&X((!p1 U G(!p0)))))'
Support contains 3 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 169/169 transitions.
Applied a total of 0 rules in 3 ms. Remains 162 /162 variables (removed 0) and now considering 169/169 (removed 0) transitions.
// Phase 1: matrix 169 rows 162 cols
[2023-03-14 07:47:41] [INFO ] Computed 20 place invariants in 3 ms
[2023-03-14 07:47:41] [INFO ] Implicit Places using invariants in 110 ms returned [29]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 113 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 161/162 places, 169/169 transitions.
Applied a total of 0 rules in 2 ms. Remains 161 /161 variables (removed 0) and now considering 169/169 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 118 ms. Remains : 161/162 places, 169/169 transitions.
Stuttering acceptance computed with spot in 195 ms :[(OR (NOT p1) p0), true, (NOT p1), p0, p0]
Running random walk in product with property : ParamProductionCell-PT-0-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}, { cond=(OR p1 p0), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s83 1), p0:(OR (EQ s133 0) (EQ s87 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 35 steps with 0 reset in 1 ms.
FORMULA ParamProductionCell-PT-0-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-0-LTLCardinality-03 finished in 335 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F((p0 U (p1||G(p0))))&&F((G(F(!p2))||(F(!p2)&&G(p3)))))))'
Support contains 6 out of 162 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 162/162 places, 169/169 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 161 transition count 168
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 161 transition count 168
Applied a total of 2 rules in 4 ms. Remains 161 /162 variables (removed 1) and now considering 168/169 (removed 1) transitions.
// Phase 1: matrix 168 rows 161 cols
[2023-03-14 07:47:41] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-14 07:47:41] [INFO ] Implicit Places using invariants in 99 ms returned [29, 133]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 101 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 159/162 places, 168/169 transitions.
Applied a total of 0 rules in 2 ms. Remains 159 /159 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 109 ms. Remains : 159/162 places, 168/169 transitions.
Stuttering acceptance computed with spot in 264 ms :[(OR p2 (AND (NOT p0) (NOT p1))), (OR p2 (AND (NOT p0) (NOT p1))), p2, (AND (NOT p1) (NOT p0)), (AND (NOT p3) p2), p2]
Running random walk in product with property : ParamProductionCell-PT-0-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p3), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}, { cond=p3, acceptance={} source=1 dest: 4}, { cond=p2, acceptance={} source=1 dest: 5}], [{ cond=(NOT p3), acceptance={} source=2 dest: 2}, { cond=p3, acceptance={} source=2 dest: 4}, { cond=p2, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p3), acceptance={} source=4 dest: 2}, { cond=p3, acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p3)), acceptance={} source=4 dest: 5}], [{ cond=p2, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p3:(NEQ s3 1), p1:(AND (NOT (OR (EQ s71 0) (EQ s2 1))) (NEQ s76 1)), p2:(OR (EQ s88 0) (EQ s32 1)), p0:(NEQ s76 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 288 reset in 148 ms.
Stack based approach found an accepted trace after 1393 steps with 5 reset with depth 383 and stack size 383 in 4 ms.
FORMULA ParamProductionCell-PT-0-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-0-LTLCardinality-06 finished in 563 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((F(!p0)&&F(p0))) U G(p1)))'
Support contains 4 out of 162 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 162/162 places, 169/169 transitions.
Drop transitions removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 162 transition count 140
Reduce places removed 29 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 31 rules applied. Total rules applied 60 place count 133 transition count 138
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 62 place count 131 transition count 138
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 62 place count 131 transition count 128
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 82 place count 121 transition count 128
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 83 place count 120 transition count 127
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 120 transition count 127
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 166 place count 78 transition count 87
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 166 place count 78 transition count 86
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 168 place count 77 transition count 86
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 170 place count 76 transition count 85
Applied a total of 170 rules in 25 ms. Remains 76 /162 variables (removed 86) and now considering 85/169 (removed 84) transitions.
// Phase 1: matrix 85 rows 76 cols
[2023-03-14 07:47:42] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-14 07:47:42] [INFO ] Implicit Places using invariants in 91 ms returned [0, 1, 64]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 92 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/162 places, 85/169 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 70 transition count 82
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 8 place count 69 transition count 81
Applied a total of 8 rules in 9 ms. Remains 69 /73 variables (removed 4) and now considering 81/85 (removed 4) transitions.
// Phase 1: matrix 81 rows 69 cols
[2023-03-14 07:47:42] [INFO ] Computed 15 place invariants in 0 ms
[2023-03-14 07:47:42] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-14 07:47:42] [INFO ] Invariant cache hit.
[2023-03-14 07:47:42] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-14 07:47:42] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 69/162 places, 81/169 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 351 ms. Remains : 69/162 places, 81/169 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), p0, (NOT p0), p1]
Running random walk in product with property : ParamProductionCell-PT-0-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=3 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (EQ s54 0) (EQ s9 1)), p0:(OR (EQ s12 0) (EQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 2060 reset in 126 ms.
Stack based approach found an accepted trace after 1086 steps with 24 reset with depth 107 and stack size 107 in 3 ms.
FORMULA ParamProductionCell-PT-0-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-0-LTLCardinality-08 finished in 656 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 162 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 162/162 places, 169/169 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 162 transition count 138
Reduce places removed 31 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 32 rules applied. Total rules applied 63 place count 131 transition count 137
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 130 transition count 137
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 64 place count 130 transition count 128
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 82 place count 121 transition count 128
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 83 place count 120 transition count 127
Iterating global reduction 3 with 1 rules applied. Total rules applied 84 place count 120 transition count 127
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 168 place count 77 transition count 86
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 168 place count 77 transition count 85
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 170 place count 76 transition count 85
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 172 place count 75 transition count 84
Applied a total of 172 rules in 24 ms. Remains 75 /162 variables (removed 87) and now considering 84/169 (removed 85) transitions.
// Phase 1: matrix 84 rows 75 cols
[2023-03-14 07:47:42] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-14 07:47:42] [INFO ] Implicit Places using invariants in 91 ms returned [0, 1, 16, 63]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 93 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 71/162 places, 84/169 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 67 transition count 80
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 10 place count 66 transition count 79
Applied a total of 10 rules in 8 ms. Remains 66 /71 variables (removed 5) and now considering 79/84 (removed 5) transitions.
// Phase 1: matrix 79 rows 66 cols
[2023-03-14 07:47:42] [INFO ] Computed 14 place invariants in 0 ms
[2023-03-14 07:47:42] [INFO ] Implicit Places using invariants in 79 ms returned []
[2023-03-14 07:47:42] [INFO ] Invariant cache hit.
[2023-03-14 07:47:42] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-14 07:47:43] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 66/162 places, 79/169 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 335 ms. Remains : 66/162 places, 79/169 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-0-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s8 0) (NEQ s12 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 115 ms.
Stack based approach found an accepted trace after 82 steps with 0 reset with depth 83 and stack size 83 in 0 ms.
FORMULA ParamProductionCell-PT-0-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-0-LTLCardinality-10 finished in 501 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 162 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 162/162 places, 169/169 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 162 transition count 138
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 131 transition count 138
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 62 place count 131 transition count 130
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 78 place count 123 transition count 130
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 122 transition count 129
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 122 transition count 129
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 164 place count 79 transition count 88
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 164 place count 79 transition count 87
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 166 place count 78 transition count 87
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 168 place count 77 transition count 86
Applied a total of 168 rules in 20 ms. Remains 77 /162 variables (removed 85) and now considering 86/169 (removed 83) transitions.
// Phase 1: matrix 86 rows 77 cols
[2023-03-14 07:47:43] [INFO ] Computed 18 place invariants in 1 ms
[2023-03-14 07:47:43] [INFO ] Implicit Places using invariants in 91 ms returned [0, 1, 15, 65]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 92 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 73/162 places, 86/169 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 70 transition count 83
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 0 with 2 rules applied. Total rules applied 8 place count 69 transition count 82
Applied a total of 8 rules in 6 ms. Remains 69 /73 variables (removed 4) and now considering 82/86 (removed 4) transitions.
// Phase 1: matrix 82 rows 69 cols
[2023-03-14 07:47:43] [INFO ] Computed 14 place invariants in 2 ms
[2023-03-14 07:47:43] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-14 07:47:43] [INFO ] Invariant cache hit.
[2023-03-14 07:47:43] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-14 07:47:43] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 69/162 places, 82/169 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 348 ms. Remains : 69/162 places, 82/169 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-0-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s50 0) (EQ s17 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 16666 reset in 109 ms.
Product exploration explored 100000 steps with 16666 reset in 264 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 115 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2023-03-14 07:47:44] [INFO ] Invariant cache hit.
[2023-03-14 07:47:44] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2023-03-14 07:47:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 07:47:44] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2023-03-14 07:47:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 07:47:44] [INFO ] [Nat]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-03-14 07:47:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 07:47:44] [INFO ] [Nat]Absence check using state equation in 37 ms returned sat
[2023-03-14 07:47:44] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-14 07:47:44] [INFO ] [Nat]Added 58 Read/Feed constraints in 14 ms returned sat
[2023-03-14 07:47:44] [INFO ] Deduced a trap composed of 4 places in 47 ms of which 3 ms to minimize.
[2023-03-14 07:47:44] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 2 ms to minimize.
[2023-03-14 07:47:44] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2023-03-14 07:47:44] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 2 ms to minimize.
[2023-03-14 07:47:44] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2023-03-14 07:47:44] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 1 ms to minimize.
[2023-03-14 07:47:44] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2023-03-14 07:47:45] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 1 ms to minimize.
[2023-03-14 07:47:45] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2023-03-14 07:47:45] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2023-03-14 07:47:45] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 0 ms to minimize.
[2023-03-14 07:47:45] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2023-03-14 07:47:45] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2023-03-14 07:47:45] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 0 ms to minimize.
[2023-03-14 07:47:45] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2023-03-14 07:47:45] [INFO ] Deduced a trap composed of 24 places in 32 ms of which 1 ms to minimize.
[2023-03-14 07:47:45] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 709 ms
[2023-03-14 07:47:45] [INFO ] Computed and/alt/rep : 81/197/81 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-14 07:47:45] [INFO ] Added : 73 causal constraints over 16 iterations in 177 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 82/82 transitions.
Applied a total of 0 rules in 3 ms. Remains 69 /69 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2023-03-14 07:47:45] [INFO ] Invariant cache hit.
[2023-03-14 07:47:45] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-14 07:47:45] [INFO ] Invariant cache hit.
[2023-03-14 07:47:45] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-14 07:47:45] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
[2023-03-14 07:47:45] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 07:47:45] [INFO ] Invariant cache hit.
[2023-03-14 07:47:45] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 323 ms. Remains : 69/69 places, 82/82 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 114 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
[2023-03-14 07:47:46] [INFO ] Invariant cache hit.
[2023-03-14 07:47:46] [INFO ] [Real]Absence check using 14 positive place invariants in 5 ms returned sat
[2023-03-14 07:47:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-14 07:47:46] [INFO ] [Real]Absence check using state equation in 44 ms returned sat
[2023-03-14 07:47:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-14 07:47:46] [INFO ] [Nat]Absence check using 14 positive place invariants in 4 ms returned sat
[2023-03-14 07:47:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-14 07:47:46] [INFO ] [Nat]Absence check using state equation in 39 ms returned sat
[2023-03-14 07:47:46] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-14 07:47:46] [INFO ] [Nat]Added 58 Read/Feed constraints in 9 ms returned sat
[2023-03-14 07:47:46] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2023-03-14 07:47:46] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2023-03-14 07:47:46] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 0 ms to minimize.
[2023-03-14 07:47:46] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2023-03-14 07:47:46] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2023-03-14 07:47:46] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 1 ms to minimize.
[2023-03-14 07:47:46] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 0 ms to minimize.
[2023-03-14 07:47:46] [INFO ] Deduced a trap composed of 13 places in 35 ms of which 0 ms to minimize.
[2023-03-14 07:47:46] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2023-03-14 07:47:46] [INFO ] Deduced a trap composed of 13 places in 30 ms of which 1 ms to minimize.
[2023-03-14 07:47:46] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
[2023-03-14 07:47:46] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2023-03-14 07:47:47] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2023-03-14 07:47:47] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
[2023-03-14 07:47:47] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2023-03-14 07:47:47] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2023-03-14 07:47:47] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 655 ms
[2023-03-14 07:47:47] [INFO ] Computed and/alt/rep : 81/197/81 causal constraints (skipped 0 transitions) in 6 ms.
[2023-03-14 07:47:47] [INFO ] Added : 73 causal constraints over 16 iterations in 164 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 16666 reset in 190 ms.
Product exploration explored 100000 steps with 16666 reset in 129 ms.
Support contains 2 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 82/82 transitions.
Applied a total of 0 rules in 5 ms. Remains 69 /69 variables (removed 0) and now considering 82/82 (removed 0) transitions.
[2023-03-14 07:47:47] [INFO ] Invariant cache hit.
[2023-03-14 07:47:47] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-14 07:47:47] [INFO ] Invariant cache hit.
[2023-03-14 07:47:47] [INFO ] State equation strengthened by 58 read => feed constraints.
[2023-03-14 07:47:47] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2023-03-14 07:47:47] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-14 07:47:47] [INFO ] Invariant cache hit.
[2023-03-14 07:47:47] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 297 ms. Remains : 69/69 places, 82/82 transitions.
Treatment of property ParamProductionCell-PT-0-LTLCardinality-15 finished in 4827 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
[2023-03-14 07:47:48] [INFO ] Flatten gal took : 14 ms
[2023-03-14 07:47:48] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-14 07:47:48] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 162 places, 169 transitions and 520 arcs took 3 ms.
Total runtime 13705 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ParamProductionCell-PT-0
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLCardinality
FORMULA ParamProductionCell-PT-0-LTLCardinality-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ParamProductionCell-PT-0-LTLCardinality-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1678780069389
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:749
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 6 (type EXCL) for 3 ParamProductionCell-PT-0-LTLCardinality-15
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: FINISHED task # 6 (type EXCL) for ParamProductionCell-PT-0-LTLCardinality-15
lola: result : false
lola: markings : 6
lola: fired transitions : 5
lola: time used : 0.000000
lola: memory pages used : 1
lola: LAUNCH task # 1 (type EXCL) for 0 ParamProductionCell-PT-0-LTLCardinality-02
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: FINISHED task # 1 (type EXCL) for ParamProductionCell-PT-0-LTLCardinality-02
lola: result : true
lola: markings : 16
lola: fired transitions : 15
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ParamProductionCell-PT-0-LTLCardinality-02: LTL true LTL model checker
ParamProductionCell-PT-0-LTLCardinality-15: F true state space / EG
Time elapsed: 0 secs. Pages in use: 1
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ParamProductionCell-PT-0"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is ParamProductionCell-PT-0, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r263-smll-167863538100363"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ParamProductionCell-PT-0.tgz
mv ParamProductionCell-PT-0 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;