About the Execution of GreatSPN+red for ParamProductionCell-PT-2
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 460.411 | 57767.00 | 89976.00 | 520.90 | FFFFTFFFFFTTFFTT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r267-smll-171654405500027.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is ParamProductionCell-PT-2, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r267-smll-171654405500027
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 776K
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 20:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Apr 12 20:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 19K Apr 12 20:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 133K Apr 12 20:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 2 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 174K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ParamProductionCell-PT-2-LTLCardinality-00
FORMULA_NAME ParamProductionCell-PT-2-LTLCardinality-01
FORMULA_NAME ParamProductionCell-PT-2-LTLCardinality-02
FORMULA_NAME ParamProductionCell-PT-2-LTLCardinality-03
FORMULA_NAME ParamProductionCell-PT-2-LTLCardinality-04
FORMULA_NAME ParamProductionCell-PT-2-LTLCardinality-05
FORMULA_NAME ParamProductionCell-PT-2-LTLCardinality-06
FORMULA_NAME ParamProductionCell-PT-2-LTLCardinality-07
FORMULA_NAME ParamProductionCell-PT-2-LTLCardinality-08
FORMULA_NAME ParamProductionCell-PT-2-LTLCardinality-09
FORMULA_NAME ParamProductionCell-PT-2-LTLCardinality-10
FORMULA_NAME ParamProductionCell-PT-2-LTLCardinality-11
FORMULA_NAME ParamProductionCell-PT-2-LTLCardinality-12
FORMULA_NAME ParamProductionCell-PT-2-LTLCardinality-13
FORMULA_NAME ParamProductionCell-PT-2-LTLCardinality-14
FORMULA_NAME ParamProductionCell-PT-2-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716649281409
Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ParamProductionCell-PT-2
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-25 15:01:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-25 15:01:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-25 15:01:23] [INFO ] Load time of PNML (sax parser for PT used): 289 ms
[2024-05-25 15:01:23] [INFO ] Transformed 231 places.
[2024-05-25 15:01:23] [INFO ] Transformed 202 transitions.
[2024-05-25 15:01:23] [INFO ] Found NUPN structural information;
[2024-05-25 15:01:23] [INFO ] Parsed PT model containing 231 places and 202 transitions and 846 arcs in 477 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ParamProductionCell-PT-2-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-2-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-2-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-2-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ParamProductionCell-PT-2-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 231 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 231/231 places, 202/202 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 227 transition count 198
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 227 transition count 198
Applied a total of 8 rules in 64 ms. Remains 227 /231 variables (removed 4) and now considering 198/202 (removed 4) transitions.
// Phase 1: matrix 198 rows 227 cols
[2024-05-25 15:01:24] [INFO ] Computed 59 invariants in 30 ms
[2024-05-25 15:01:25] [INFO ] Implicit Places using invariants in 761 ms returned [15, 18, 19, 24, 31, 35, 36, 41, 42, 46, 59, 64, 65, 73, 79, 98, 99, 101, 113, 114, 116, 119, 160, 161, 165, 166, 192, 193, 196, 197, 202, 218]
Discarding 32 places :
Implicit Place search using SMT only with invariants took 829 ms to find 32 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 195/231 places, 198/202 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 194 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 194 transition count 197
Applied a total of 2 rules in 25 ms. Remains 194 /195 variables (removed 1) and now considering 197/198 (removed 1) transitions.
// Phase 1: matrix 197 rows 194 cols
[2024-05-25 15:01:25] [INFO ] Computed 27 invariants in 4 ms
[2024-05-25 15:01:25] [INFO ] Implicit Places using invariants in 199 ms returned []
[2024-05-25 15:01:25] [INFO ] Invariant cache hit.
[2024-05-25 15:01:25] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:01:25] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 194/231 places, 197/202 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1571 ms. Remains : 194/231 places, 197/202 transitions.
Support contains 32 out of 194 places after structural reductions.
[2024-05-25 15:01:26] [INFO ] Flatten gal took : 61 ms
[2024-05-25 15:01:26] [INFO ] Flatten gal took : 24 ms
[2024-05-25 15:01:26] [INFO ] Input system was already deterministic with 197 transitions.
RANDOM walk for 7482 steps (1 resets) in 480 ms. (15 steps per ms) remains 0/19 properties
FORMULA ParamProductionCell-PT-2-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA ParamProductionCell-PT-2-LTLCardinality-13 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.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(p1)))))'
Support contains 3 out of 194 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 197/197 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 191 transition count 194
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 191 transition count 194
Applied a total of 6 rules in 13 ms. Remains 191 /194 variables (removed 3) and now considering 194/197 (removed 3) transitions.
// Phase 1: matrix 194 rows 191 cols
[2024-05-25 15:01:26] [INFO ] Computed 27 invariants in 3 ms
[2024-05-25 15:01:27] [INFO ] Implicit Places using invariants in 172 ms returned [15, 37, 96, 137, 168, 172]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 174 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/194 places, 194/197 transitions.
Applied a total of 0 rules in 5 ms. Remains 185 /185 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 192 ms. Remains : 185/194 places, 194/197 transitions.
Stuttering acceptance computed with spot in 334 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 1167 steps with 16 reset in 16 ms.
FORMULA ParamProductionCell-PT-2-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-2-LTLCardinality-00 finished in 632 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 194 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 194/194 places, 197/197 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) 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 194 transition count 166
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 163 transition count 166
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 15 Pre rules applied. Total rules applied 62 place count 163 transition count 151
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 2 with 30 rules applied. Total rules applied 92 place count 148 transition count 151
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 95 place count 145 transition count 148
Iterating global reduction 2 with 3 rules applied. Total rules applied 98 place count 145 transition count 148
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 182 place count 103 transition count 106
Applied a total of 182 rules in 56 ms. Remains 103 /194 variables (removed 91) and now considering 106/197 (removed 91) transitions.
// Phase 1: matrix 106 rows 103 cols
[2024-05-25 15:01:27] [INFO ] Computed 27 invariants in 1 ms
[2024-05-25 15:01:27] [INFO ] Implicit Places using invariants in 124 ms returned [10, 21, 36, 53, 72, 90, 91]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 126 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 96/194 places, 106/197 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 85 transition count 95
Applied a total of 22 rules in 12 ms. Remains 85 /96 variables (removed 11) and now considering 95/106 (removed 11) transitions.
// Phase 1: matrix 95 rows 85 cols
[2024-05-25 15:01:27] [INFO ] Computed 20 invariants in 1 ms
[2024-05-25 15:01:27] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-05-25 15:01:27] [INFO ] Invariant cache hit.
[2024-05-25 15:01:27] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:01:27] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 302 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 85/194 places, 95/197 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 497 ms. Remains : 85/194 places, 95/197 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLCardinality-01
Product exploration explored 100000 steps with 0 reset in 472 ms.
Stack based approach found an accepted trace after 2530 steps with 0 reset with depth 2531 and stack size 1081 in 8 ms.
FORMULA ParamProductionCell-PT-2-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-2-LTLCardinality-01 finished in 1058 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 194 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 194/194 places, 197/197 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 30 transitions
Trivial Post-agglo rules discarded 30 transitions
Performed 30 trivial Post agglomeration. Transition count delta: 30
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 194 transition count 167
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 60 place count 164 transition count 167
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 14 Pre rules applied. Total rules applied 60 place count 164 transition count 153
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 2 with 28 rules applied. Total rules applied 88 place count 150 transition count 153
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 91 place count 147 transition count 150
Iterating global reduction 2 with 3 rules applied. Total rules applied 94 place count 147 transition count 150
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 174 place count 107 transition count 110
Applied a total of 174 rules in 25 ms. Remains 107 /194 variables (removed 87) and now considering 110/197 (removed 87) transitions.
// Phase 1: matrix 110 rows 107 cols
[2024-05-25 15:01:28] [INFO ] Computed 27 invariants in 2 ms
[2024-05-25 15:01:28] [INFO ] Implicit Places using invariants in 129 ms returned [10, 22, 38, 56, 76, 94, 95]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 131 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/194 places, 110/197 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 89 transition count 99
Applied a total of 22 rules in 7 ms. Remains 89 /100 variables (removed 11) and now considering 99/110 (removed 11) transitions.
// Phase 1: matrix 99 rows 89 cols
[2024-05-25 15:01:28] [INFO ] Computed 20 invariants in 1 ms
[2024-05-25 15:01:28] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-05-25 15:01:28] [INFO ] Invariant cache hit.
[2024-05-25 15:01:28] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:01:28] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 295 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 89/194 places, 99/197 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 460 ms. Remains : 89/194 places, 99/197 transitions.
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLCardinality-02
Product exploration explored 100000 steps with 0 reset in 148 ms.
Stack based approach found an accepted trace after 196 steps with 0 reset with depth 197 and stack size 197 in 1 ms.
FORMULA ParamProductionCell-PT-2-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-2-LTLCardinality-02 finished in 823 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0))||G(p1)))'
Support contains 4 out of 194 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 194/194 places, 197/197 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 194 transition count 171
Reduce places removed 26 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 27 rules applied. Total rules applied 53 place count 168 transition count 170
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 167 transition count 170
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 54 place count 167 transition count 153
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 88 place count 150 transition count 153
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 91 place count 147 transition count 150
Iterating global reduction 3 with 3 rules applied. Total rules applied 94 place count 147 transition count 150
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 168 place count 110 transition count 113
Applied a total of 168 rules in 22 ms. Remains 110 /194 variables (removed 84) and now considering 113/197 (removed 84) transitions.
// Phase 1: matrix 113 rows 110 cols
[2024-05-25 15:01:29] [INFO ] Computed 27 invariants in 2 ms
[2024-05-25 15:01:29] [INFO ] Implicit Places using invariants in 130 ms returned [26, 43, 60, 79, 97, 98]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 135 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/194 places, 113/197 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 0 with 22 rules applied. Total rules applied 22 place count 93 transition count 102
Applied a total of 22 rules in 7 ms. Remains 93 /104 variables (removed 11) and now considering 102/113 (removed 11) transitions.
// Phase 1: matrix 102 rows 93 cols
[2024-05-25 15:01:29] [INFO ] Computed 21 invariants in 1 ms
[2024-05-25 15:01:29] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-05-25 15:01:29] [INFO ] Invariant cache hit.
[2024-05-25 15:01:29] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:01:29] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 93/194 places, 102/197 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 469 ms. Remains : 93/194 places, 102/197 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLCardinality-03
Product exploration explored 100000 steps with 0 reset in 146 ms.
Stack based approach found an accepted trace after 221 steps with 0 reset with depth 222 and stack size 222 in 1 ms.
FORMULA ParamProductionCell-PT-2-LTLCardinality-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ParamProductionCell-PT-2-LTLCardinality-03 finished in 710 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&(G(!p0)||G(F(p1)))))'
Support contains 3 out of 194 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 194/194 places, 197/197 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 26 transitions
Trivial Post-agglo rules discarded 26 transitions
Performed 26 trivial Post agglomeration. Transition count delta: 26
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 194 transition count 171
Reduce places removed 26 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 29 rules applied. Total rules applied 55 place count 168 transition count 168
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 58 place count 165 transition count 168
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 58 place count 165 transition count 151
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 92 place count 148 transition count 151
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 95 place count 145 transition count 148
Iterating global reduction 3 with 3 rules applied. Total rules applied 98 place count 145 transition count 148
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: 40
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 178 place count 105 transition count 108
Applied a total of 178 rules in 22 ms. Remains 105 /194 variables (removed 89) and now considering 108/197 (removed 89) transitions.
// Phase 1: matrix 108 rows 105 cols
[2024-05-25 15:01:30] [INFO ] Computed 27 invariants in 1 ms
[2024-05-25 15:01:30] [INFO ] Implicit Places using invariants in 120 ms returned [10, 21, 36, 53, 72]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 122 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 100/194 places, 108/197 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 93 transition count 101
Applied a total of 14 rules in 7 ms. Remains 93 /100 variables (removed 7) and now considering 101/108 (removed 7) transitions.
// Phase 1: matrix 101 rows 93 cols
[2024-05-25 15:01:30] [INFO ] Computed 22 invariants in 1 ms
[2024-05-25 15:01:30] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-05-25 15:01:30] [INFO ] Invariant cache hit.
[2024-05-25 15:01:30] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:01:30] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 93/194 places, 101/197 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 467 ms. Remains : 93/194 places, 101/197 transitions.
Stuttering acceptance computed with spot in 229 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLCardinality-04
Product exploration explored 100000 steps with 2650 reset in 224 ms.
Product exploration explored 100000 steps with 2604 reset in 271 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 3 factoid took 289 ms. Reduced automaton from 6 states, 14 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 202 steps (0 resets) in 4 ms. (40 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT p0)), (F p1)]
Knowledge based reduction with 3 factoid took 340 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (NOT p1)]
[2024-05-25 15:01:32] [INFO ] Invariant cache hit.
[2024-05-25 15:01:32] [INFO ] [Real]Absence check using 19 positive place invariants in 6 ms returned sat
[2024-05-25 15:01:32] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-25 15:01:32] [INFO ] [Real]Absence check using state equation in 87 ms returned sat
[2024-05-25 15:01:32] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:01:32] [INFO ] [Nat]Absence check using 19 positive place invariants in 7 ms returned sat
[2024-05-25 15:01:32] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 2 ms returned sat
[2024-05-25 15:01:32] [INFO ] [Nat]Absence check using state equation in 70 ms returned sat
[2024-05-25 15:01:32] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:01:32] [INFO ] [Nat]Added 68 Read/Feed constraints in 16 ms returned sat
[2024-05-25 15:01:32] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 6 ms to minimize.
[2024-05-25 15:01:32] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 2 ms to minimize.
[2024-05-25 15:01:32] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 2 ms to minimize.
[2024-05-25 15:01:32] [INFO ] Deduced a trap composed of 4 places in 51 ms of which 2 ms to minimize.
[2024-05-25 15:01:33] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-05-25 15:01:33] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 ms to minimize.
[2024-05-25 15:01:33] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-25 15:01:33] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 2 ms to minimize.
[2024-05-25 15:01:33] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 582 ms
[2024-05-25 15:01:33] [INFO ] Computed and/alt/rep : 99/232/99 causal constraints (skipped 0 transitions) in 12 ms.
[2024-05-25 15:01:33] [INFO ] Added : 91 causal constraints over 20 iterations in 309 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 101/101 transitions.
Applied a total of 0 rules in 3 ms. Remains 93 /93 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2024-05-25 15:01:33] [INFO ] Invariant cache hit.
[2024-05-25 15:01:33] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-25 15:01:33] [INFO ] Invariant cache hit.
[2024-05-25 15:01:33] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:01:33] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2024-05-25 15:01:33] [INFO ] Redundant transitions in 2 ms returned []
Running 99 sub problems to find dead transitions.
[2024-05-25 15:01:33] [INFO ] Invariant cache hit.
[2024-05-25 15:01:33] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-25 15:01:34] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:01:34] [INFO ] Deduced a trap composed of 5 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:01:34] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:01:34] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:01:34] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:01:34] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2024-05-25 15:01:34] [INFO ] Deduced a trap composed of 12 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:01:34] [INFO ] Deduced a trap composed of 23 places in 40 ms of which 2 ms to minimize.
[2024-05-25 15:01:34] [INFO ] Deduced a trap composed of 28 places in 39 ms of which 4 ms to minimize.
[2024-05-25 15:01:34] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:01:34] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 2 ms to minimize.
[2024-05-25 15:01:35] [INFO ] Deduced a trap composed of 11 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:01:35] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:01:35] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 2 ms to minimize.
[2024-05-25 15:01:35] [INFO ] Deduced a trap composed of 9 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:01:35] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:01:35] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:01:35] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 2 ms to minimize.
[2024-05-25 15:01:35] [INFO ] Deduced a trap composed of 23 places in 35 ms of which 2 ms to minimize.
[2024-05-25 15:01:35] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-25 15:01:35] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:01:35] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-25 15:01:35] [INFO ] Deduced a trap composed of 19 places in 46 ms of which 1 ms to minimize.
[2024-05-25 15:01:35] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-25 15:01:36] [INFO ] Deduced a trap composed of 23 places in 234 ms of which 27 ms to minimize.
[2024-05-25 15:01:36] [INFO ] Deduced a trap composed of 11 places in 26 ms of which 1 ms to minimize.
[2024-05-25 15:01:36] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:01:36] [INFO ] Deduced a trap composed of 26 places in 85 ms of which 1 ms to minimize.
[2024-05-25 15:01:37] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-25 15:01:37] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 3/92 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-25 15:01:38] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
[2024-05-25 15:01:38] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-25 15:01:38] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-05-25 15:01:38] [INFO ] Deduced a trap composed of 8 places in 26 ms of which 1 ms to minimize.
[2024-05-25 15:01:38] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2024-05-25 15:01:38] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-25 15:01:38] [INFO ] Deduced a trap composed of 9 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:01:38] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-25 15:01:39] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 11 (OVERLAPS) 1/93 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-25 15:01:39] [INFO ] Deduced a trap composed of 39 places in 46 ms of which 1 ms to minimize.
[2024-05-25 15:01:40] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/93 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/93 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 14 (OVERLAPS) 101/194 variables, 93/156 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/194 variables, 68/224 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/194 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-25 15:01:42] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 2 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/194 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/194 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 19 (OVERLAPS) 0/194 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 225 constraints, problems are : Problem set: 0 solved, 99 unsolved in 10589 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 38/56 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 3/92 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 1/93 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (OVERLAPS) 101/194 variables, 93/157 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 68/225 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 99/324 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/194 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 14 (OVERLAPS) 0/194 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 324 constraints, problems are : Problem set: 0 solved, 99 unsolved in 4243 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 42/42 constraints]
After SMT, in 14913ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 14925ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 15257 ms. Remains : 93/93 places, 101/101 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 p1)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 202 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (NOT p1)]
RANDOM walk for 187 steps (0 resets) in 5 ms. (31 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F p1)]
Knowledge based reduction with 3 factoid took 230 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 117 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (NOT p1)]
[2024-05-25 15:01:49] [INFO ] Invariant cache hit.
[2024-05-25 15:01:49] [INFO ] [Real]Absence check using 19 positive place invariants in 9 ms returned sat
[2024-05-25 15:01:49] [INFO ] [Real]Absence check using 19 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-25 15:01:49] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2024-05-25 15:01:49] [INFO ] Solution in real domain found non-integer solution.
[2024-05-25 15:01:49] [INFO ] [Nat]Absence check using 19 positive place invariants in 8 ms returned sat
[2024-05-25 15:01:49] [INFO ] [Nat]Absence check using 19 positive and 3 generalized place invariants in 3 ms returned sat
[2024-05-25 15:01:50] [INFO ] [Nat]Absence check using state equation in 68 ms returned sat
[2024-05-25 15:01:50] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:01:50] [INFO ] [Nat]Added 68 Read/Feed constraints in 15 ms returned sat
[2024-05-25 15:01:50] [INFO ] Deduced a trap composed of 3 places in 46 ms of which 2 ms to minimize.
[2024-05-25 15:01:50] [INFO ] Deduced a trap composed of 5 places in 50 ms of which 2 ms to minimize.
[2024-05-25 15:01:50] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
[2024-05-25 15:01:50] [INFO ] Deduced a trap composed of 4 places in 48 ms of which 1 ms to minimize.
[2024-05-25 15:01:50] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-05-25 15:01:50] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-05-25 15:01:50] [INFO ] Deduced a trap composed of 12 places in 62 ms of which 14 ms to minimize.
[2024-05-25 15:01:50] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 2 ms to minimize.
[2024-05-25 15:01:50] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 503 ms
[2024-05-25 15:01:50] [INFO ] Computed and/alt/rep : 99/232/99 causal constraints (skipped 0 transitions) in 9 ms.
[2024-05-25 15:01:50] [INFO ] Added : 91 causal constraints over 20 iterations in 267 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 2258 reset in 132 ms.
Product exploration explored 100000 steps with 2259 reset in 407 ms.
Support contains 3 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 101/101 transitions.
Applied a total of 0 rules in 3 ms. Remains 93 /93 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2024-05-25 15:01:51] [INFO ] Invariant cache hit.
[2024-05-25 15:01:51] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-05-25 15:01:51] [INFO ] Invariant cache hit.
[2024-05-25 15:01:51] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-05-25 15:01:51] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2024-05-25 15:01:51] [INFO ] Redundant transitions in 2 ms returned []
Running 99 sub problems to find dead transitions.
[2024-05-25 15:01:51] [INFO ] Invariant cache hit.
[2024-05-25 15:01:51] [INFO ] State equation strengthened by 68 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-25 15:01:52] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 2 ms to minimize.
[2024-05-25 15:01:52] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 2 ms to minimize.
[2024-05-25 15:01:52] [INFO ] Deduced a trap composed of 19 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:01:52] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 1 ms to minimize.
[2024-05-25 15:01:52] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-05-25 15:01:52] [INFO ] Deduced a trap composed of 14 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:01:52] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-25 15:01:52] [INFO ] Deduced a trap composed of 23 places in 37 ms of which 1 ms to minimize.
[2024-05-25 15:01:52] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 1 ms to minimize.
[2024-05-25 15:01:52] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:01:52] [INFO ] Deduced a trap composed of 26 places in 36 ms of which 1 ms to minimize.
[2024-05-25 15:01:52] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 0 ms to minimize.
[2024-05-25 15:01:52] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:01:52] [INFO ] Deduced a trap composed of 16 places in 31 ms of which 1 ms to minimize.
[2024-05-25 15:01:52] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:01:52] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-25 15:01:52] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 1 ms to minimize.
[2024-05-25 15:01:53] [INFO ] Deduced a trap composed of 12 places in 29 ms of which 1 ms to minimize.
[2024-05-25 15:01:53] [INFO ] Deduced a trap composed of 23 places in 32 ms of which 1 ms to minimize.
[2024-05-25 15:01:53] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 20/38 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-25 15:01:53] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:01:53] [INFO ] Deduced a trap composed of 12 places in 28 ms of which 1 ms to minimize.
[2024-05-25 15:01:53] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
[2024-05-25 15:01:53] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 4/42 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-25 15:01:54] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 2 ms to minimize.
[2024-05-25 15:01:54] [INFO ] Deduced a trap composed of 11 places in 22 ms of which 0 ms to minimize.
[2024-05-25 15:01:54] [INFO ] Deduced a trap composed of 13 places in 34 ms of which 1 ms to minimize.
[2024-05-25 15:01:54] [INFO ] Deduced a trap composed of 26 places in 33 ms of which 2 ms to minimize.
[2024-05-25 15:01:54] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/89 variables, 5/47 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-25 15:01:54] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/89 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 3/92 variables, 3/51 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-25 15:01:55] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2024-05-25 15:01:55] [INFO ] Deduced a trap composed of 11 places in 24 ms of which 1 ms to minimize.
[2024-05-25 15:01:55] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-25 15:01:55] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-25 15:01:55] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
[2024-05-25 15:01:55] [INFO ] Deduced a trap composed of 9 places in 22 ms of which 1 ms to minimize.
[2024-05-25 15:01:55] [INFO ] Deduced a trap composed of 9 places in 23 ms of which 1 ms to minimize.
[2024-05-25 15:01:55] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/92 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-25 15:01:56] [INFO ] Deduced a trap composed of 25 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/92 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/92 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 11 (OVERLAPS) 1/93 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-25 15:01:56] [INFO ] Deduced a trap composed of 39 places in 39 ms of which 1 ms to minimize.
[2024-05-25 15:01:57] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/93 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/93 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 14 (OVERLAPS) 101/194 variables, 93/156 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/194 variables, 68/224 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/194 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 99 unsolved
[2024-05-25 15:01:59] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 1 ms to minimize.
At refinement iteration 17 (OVERLAPS) 0/194 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/194 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 19 (OVERLAPS) 0/194 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Real declared 194/194 variables, and 225 constraints, problems are : Problem set: 0 solved, 99 unsolved in 9777 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 42/42 constraints]
Escalating to Integer solving :Problem set: 0 solved, 99 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/89 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/89 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/89 variables, 38/56 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/89 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 4 (OVERLAPS) 3/92 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/92 variables, 3/62 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 7 (OVERLAPS) 1/93 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/93 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/93 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 10 (OVERLAPS) 101/194 variables, 93/157 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/194 variables, 68/225 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 99/324 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/194 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 99 unsolved
At refinement iteration 14 (OVERLAPS) 0/194 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 99 unsolved
No progress, stopping.
After SMT solving in domain Int declared 194/194 variables, and 324 constraints, problems are : Problem set: 0 solved, 99 unsolved in 4183 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 93/93 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 99/99 constraints, Known Traps: 42/42 constraints]
After SMT, in 13988ms problems are : Problem set: 0 solved, 99 unsolved
Search for dead transitions found 0 dead transitions in 13991ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 14340 ms. Remains : 93/93 places, 101/101 transitions.
Treatment of property ParamProductionCell-PT-2-LTLCardinality-04 finished in 35897 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!p0 U G(p1))))'
Support contains 3 out of 194 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 197/197 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 191 transition count 194
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 191 transition count 194
Applied a total of 6 rules in 5 ms. Remains 191 /194 variables (removed 3) and now considering 194/197 (removed 3) transitions.
// Phase 1: matrix 194 rows 191 cols
[2024-05-25 15:02:05] [INFO ] Computed 27 invariants in 2 ms
[2024-05-25 15:02:06] [INFO ] Implicit Places using invariants in 143 ms returned [15, 64, 96, 137, 168, 172]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 145 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/194 places, 194/197 transitions.
Applied a total of 0 rules in 3 ms. Remains 185 /185 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 154 ms. Remains : 185/194 places, 194/197 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 38 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-2-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-2-LTLCardinality-05 finished in 306 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X(!p0))&&F(!p1))||X(X(G(!p0)))))'
Support contains 4 out of 194 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 197/197 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 191 transition count 194
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 191 transition count 194
Applied a total of 6 rules in 4 ms. Remains 191 /194 variables (removed 3) and now considering 194/197 (removed 3) transitions.
[2024-05-25 15:02:06] [INFO ] Invariant cache hit.
[2024-05-25 15:02:06] [INFO ] Implicit Places using invariants in 182 ms returned [15, 37, 64, 96, 137, 168, 172]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 183 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/194 places, 194/197 transitions.
Applied a total of 0 rules in 2 ms. Remains 184 /184 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 189 ms. Remains : 184/194 places, 194/197 transitions.
Stuttering acceptance computed with spot in 237 ms :[p0, p0, (AND p1 p0), p0, (AND p1 p0), true, p1]
Running random walk in product with property : ParamProductionCell-PT-2-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-2-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-2-LTLCardinality-06 finished in 448 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p1||G(p2))&&p0))))'
Support contains 6 out of 194 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 197/197 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 193 transition count 196
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 193 transition count 196
Applied a total of 2 rules in 3 ms. Remains 193 /194 variables (removed 1) and now considering 196/197 (removed 1) transitions.
// Phase 1: matrix 196 rows 193 cols
[2024-05-25 15:02:06] [INFO ] Computed 27 invariants in 1 ms
[2024-05-25 15:02:06] [INFO ] Implicit Places using invariants in 170 ms returned [15, 37, 64, 96, 170, 174]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 171 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 187/194 places, 196/197 transitions.
Applied a total of 0 rules in 5 ms. Remains 187 /187 variables (removed 0) and now considering 196/196 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 180 ms. Remains : 187/194 places, 196/197 transitions.
Stuttering acceptance computed with spot in 183 ms :[true, (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-2-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ParamProductionCell-PT-2-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ParamProductionCell-PT-2-LTLCardinality-08 finished in 380 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 194 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 194/194 places, 197/197 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 191 transition count 194
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 191 transition count 194
Applied a total of 6 rules in 4 ms. Remains 191 /194 variables (removed 3) and now considering 194/197 (removed 3) transitions.
// Phase 1: matrix 194 rows 191 cols
[2024-05-25 15:02:07] [INFO ] Computed 27 invariants in 4 ms
[2024-05-25 15:02:07] [INFO ] Implicit Places using invariants in 176 ms returned [15, 37, 64, 96, 137, 168, 172]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 178 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 184/194 places, 194/197 transitions.
Applied a total of 0 rules in 3 ms. Remains 184 /184 variables (removed 0) and now considering 194/194 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 186 ms. Remains : 184/194 places, 194/197 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ParamProductionCell-PT-2-LTLCardinality-10
Product exploration explored 100000 steps with 33333 reset in 177 ms.
Product exploration explored 100000 steps with 33333 reset in 208 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 14 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ParamProductionCell-PT-2-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ParamProductionCell-PT-2-LTLCardinality-10 finished in 710 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))&&(G(!p0)||G(F(p1)))))'
[2024-05-25 15:02:08] [INFO ] Flatten gal took : 17 ms
[2024-05-25 15:02:08] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-05-25 15:02:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 194 places, 197 transitions and 626 arcs took 8 ms.
Total runtime 44645 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------
Running ParamProductionCell-PT-2
IS_COLORED=
IS_NUPN=
LOADING PETRI NET FILE /home/mcc/execution/415/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 194
TRANSITIONS: 197
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.003s]
SAVING FILE /home/mcc/execution/415/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]
----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES
Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net
Process ID: 1298
MODEL NAME: /home/mcc/execution/415/model
194 places, 197 transitions.
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA ParamProductionCell-PT-2-LTLCardinality-04 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------
BK_STOP 1716649339176
--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
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-2"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is ParamProductionCell-PT-2, 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 r267-smll-171654405500027"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ParamProductionCell-PT-2.tgz
mv ParamProductionCell-PT-2 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 ;