About the Execution of LTSMin+red for SharedMemory-PT-000010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 484.023 | 36754.00 | 61922.00 | 871.60 | ?FFFFTFFTFFFFFFF | 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.r361-smll-167891811900668.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 ltsminxred
Input is SharedMemory-PT-000010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r361-smll-167891811900668
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.6M
-rw-r--r-- 1 mcc users 37K Feb 25 14:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 200K Feb 25 14:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 67K Feb 25 14:03 CTLFireability.txt
-rw-r--r-- 1 mcc users 302K Feb 25 14:03 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 17K Feb 25 16:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Feb 25 16:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 34K Feb 25 16:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 115K Feb 25 16:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 94K Feb 25 14:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 523K Feb 25 14:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 189K Feb 25 14:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 836K Feb 25 14:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.7K Feb 25 16:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 104K 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 SharedMemory-PT-000010-LTLFireability-00
FORMULA_NAME SharedMemory-PT-000010-LTLFireability-01
FORMULA_NAME SharedMemory-PT-000010-LTLFireability-02
FORMULA_NAME SharedMemory-PT-000010-LTLFireability-03
FORMULA_NAME SharedMemory-PT-000010-LTLFireability-04
FORMULA_NAME SharedMemory-PT-000010-LTLFireability-05
FORMULA_NAME SharedMemory-PT-000010-LTLFireability-06
FORMULA_NAME SharedMemory-PT-000010-LTLFireability-07
FORMULA_NAME SharedMemory-PT-000010-LTLFireability-08
FORMULA_NAME SharedMemory-PT-000010-LTLFireability-09
FORMULA_NAME SharedMemory-PT-000010-LTLFireability-10
FORMULA_NAME SharedMemory-PT-000010-LTLFireability-11
FORMULA_NAME SharedMemory-PT-000010-LTLFireability-12
FORMULA_NAME SharedMemory-PT-000010-LTLFireability-13
FORMULA_NAME SharedMemory-PT-000010-LTLFireability-14
FORMULA_NAME SharedMemory-PT-000010-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679444421745
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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SharedMemory-PT-000010
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 00:20:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 00:20:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 00:20:24] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2023-03-22 00:20:24] [INFO ] Transformed 131 places.
[2023-03-22 00:20:24] [INFO ] Transformed 210 transitions.
[2023-03-22 00:20:24] [INFO ] Found NUPN structural information;
[2023-03-22 00:20:24] [INFO ] Completing missing partition info from NUPN : creating a component with [Ext_Mem_Acc_10_6, Ext_Mem_Acc_8_7]
[2023-03-22 00:20:24] [INFO ] Parsed PT model containing 131 places and 210 transitions and 800 arcs in 187 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA SharedMemory-PT-000010-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-PT-000010-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 131 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 33 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2023-03-22 00:20:25] [INFO ] Computed 21 place invariants in 37 ms
[2023-03-22 00:20:25] [INFO ] Implicit Places using invariants in 364 ms returned []
[2023-03-22 00:20:25] [INFO ] Invariant cache hit.
[2023-03-22 00:20:25] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 715 ms to find 0 implicit places.
[2023-03-22 00:20:25] [INFO ] Invariant cache hit.
[2023-03-22 00:20:26] [INFO ] Dead Transitions using invariants and state equation in 398 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1150 ms. Remains : 131/131 places, 210/210 transitions.
Support contains 131 out of 131 places after structural reductions.
[2023-03-22 00:20:26] [INFO ] Flatten gal took : 113 ms
[2023-03-22 00:20:27] [INFO ] Flatten gal took : 85 ms
[2023-03-22 00:20:27] [INFO ] Input system was already deterministic with 210 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 382 ms. (steps per millisecond=26 ) properties (out of 31) seen :30
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 266 ms. (steps per millisecond=37 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:20:27] [INFO ] Invariant cache hit.
[2023-03-22 00:20:28] [INFO ] [Real]Absence check using 21 positive place invariants in 13 ms returned sat
[2023-03-22 00:20:28] [INFO ] After 183ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
FORMULA SharedMemory-PT-000010-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA SharedMemory-PT-000010-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(X((X(p0)||F(p1)))))'
Support contains 100 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 6 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2023-03-22 00:20:28] [INFO ] Invariant cache hit.
[2023-03-22 00:20:29] [INFO ] Implicit Places using invariants in 168 ms returned []
[2023-03-22 00:20:29] [INFO ] Invariant cache hit.
[2023-03-22 00:20:29] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
[2023-03-22 00:20:29] [INFO ] Invariant cache hit.
[2023-03-22 00:20:29] [INFO ] Dead Transitions using invariants and state equation in 275 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 701 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 607 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : SharedMemory-PT-000010-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=1, aps=[p1:(AND (EQ s1 0) (EQ s64 0) (EQ s3 0) (EQ s66 0) (EQ s5 0) (EQ s68 0) (EQ s7 0) (EQ s70 0) (EQ s9 0) (EQ s72 0) (EQ s11 0) (EQ s74 0) (EQ s13 0) (EQ s76 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 31591 reset in 860 ms.
Product exploration explored 100000 steps with 31593 reset in 514 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 p1 p0)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 142 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 312 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 15 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND p1 p0)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 172 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 231 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 277 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 100 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 5 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2023-03-22 00:20:32] [INFO ] Invariant cache hit.
[2023-03-22 00:20:33] [INFO ] Implicit Places using invariants in 173 ms returned []
[2023-03-22 00:20:33] [INFO ] Invariant cache hit.
[2023-03-22 00:20:33] [INFO ] Implicit Places using invariants and state equation in 283 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
[2023-03-22 00:20:33] [INFO ] Invariant cache hit.
[2023-03-22 00:20:33] [INFO ] Dead Transitions using invariants and state equation in 239 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 710 ms. Remains : 131/131 places, 210/210 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 108 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 18 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=9 )
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 192 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 270 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 262 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 31600 reset in 567 ms.
Product exploration explored 100000 steps with 31577 reset in 374 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 100 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 20 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2023-03-22 00:20:36] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-22 00:20:36] [INFO ] Invariant cache hit.
[2023-03-22 00:20:36] [INFO ] Dead Transitions using invariants and state equation in 243 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 282 ms. Remains : 131/131 places, 210/210 transitions.
Support contains 100 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 4 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2023-03-22 00:20:36] [INFO ] Invariant cache hit.
[2023-03-22 00:20:36] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-22 00:20:36] [INFO ] Invariant cache hit.
[2023-03-22 00:20:36] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 418 ms to find 0 implicit places.
[2023-03-22 00:20:36] [INFO ] Invariant cache hit.
[2023-03-22 00:20:37] [INFO ] Dead Transitions using invariants and state equation in 328 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 757 ms. Remains : 131/131 places, 210/210 transitions.
Treatment of property SharedMemory-PT-000010-LTLFireability-00 finished in 8611 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((p0||X(p1)))&&F(p2)))'
Support contains 31 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 6 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2023-03-22 00:20:37] [INFO ] Invariant cache hit.
[2023-03-22 00:20:37] [INFO ] Implicit Places using invariants in 249 ms returned []
[2023-03-22 00:20:37] [INFO ] Invariant cache hit.
[2023-03-22 00:20:37] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2023-03-22 00:20:37] [INFO ] Invariant cache hit.
[2023-03-22 00:20:38] [INFO ] Dead Transitions using invariants and state equation in 335 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 839 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 289 ms :[true, (OR (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p2) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : SharedMemory-PT-000010-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p2 p1), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p0) p2 p1), acceptance={0} source=1 dest: 3}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 1}, { cond=(AND p0 p2), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=4, aps=[p1:(OR (AND (EQ s85 1) (EQ s97 1) (EQ s109 1)) (AND (EQ s85 1) (EQ s88 1) (EQ s121 1)) (AND (EQ s85 1) (EQ s97 1) (EQ s111 1)) (AND (EQ s85 1) (EQ s98 1) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 2 ms.
FORMULA SharedMemory-PT-000010-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-PT-000010-LTLFireability-01 finished in 1157 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((p0 U p1))&&F(((X(p1)&&(!p2||G(!p0)))||G(p1)))))'
Support contains 121 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 2 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2023-03-22 00:20:38] [INFO ] Invariant cache hit.
[2023-03-22 00:20:38] [INFO ] Implicit Places using invariants in 102 ms returned []
[2023-03-22 00:20:38] [INFO ] Invariant cache hit.
[2023-03-22 00:20:38] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2023-03-22 00:20:38] [INFO ] Invariant cache hit.
[2023-03-22 00:20:39] [INFO ] Dead Transitions using invariants and state equation in 362 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 687 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 452 ms :[(NOT p1), true, (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND p0 (NOT p1)), (AND p0 (NOT p1))]
Running random walk in product with property : SharedMemory-PT-000010-LTLFireability-02 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=(AND p0 p2), acceptance={} source=0 dest: 4}, { cond=(OR (AND p1 (NOT p0)) (AND p0 (NOT p2))), acceptance={} source=0 dest: 5}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=0 dest: 6}], [{ cond=true, acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 2}, { cond=(OR p1 p0), acceptance={} source=3 dest: 3}], [{ cond=(AND p1 p0 p2), acceptance={1} source=4 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 1} source=4 dest: 4}, { cond=(OR (AND p1 (NOT p0)) (AND p1 (NOT p2))), acceptance={1} source=4 dest: 5}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=4 dest: 5}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=4 dest: 6}], [{ cond=(AND (NOT p1) p0 p2), acceptance={0, 1} source=5 dest: 4}, { cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=5 dest: 5}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=5 dest: 6}], [{ cond=(AND p1 p0 p2), acceptance={1} source=6 dest: 4}, { cond=(AND (NOT p1) p0 p2), acceptance={0, 1} source=6 dest: 4}, { cond=(AND p1 p0 (NOT p2)), acceptance={1} source=6 dest: 5}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=6 dest: 5}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=6 dest: 6}, { cond=(AND p1 (NOT p0) (NOT p2)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 7}], [{ cond=(AND (NOT p1) p0 p2), acceptance={0, 1} source=7 dest: 4}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={0, 1} source=7 dest: 5}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=7 dest: 6}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={0} source=7 dest: 7}]], initial=0, aps=[p1:(OR (AND (EQ s85 1) (EQ s97 1) (EQ s109 1)) (AND (EQ s85 1) (EQ s88 1) (EQ s121 1)) (AND (EQ s85 1) (EQ s97 1) (EQ s111 1)) (AND (EQ s85 1) (EQ s98 1) ...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 89 steps with 12 reset in 23 ms.
FORMULA SharedMemory-PT-000010-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-PT-000010-LTLFireability-02 finished in 1205 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((p0||G(p1))))'
Support contains 100 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 3 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2023-03-22 00:20:39] [INFO ] Invariant cache hit.
[2023-03-22 00:20:40] [INFO ] Implicit Places using invariants in 150 ms returned []
[2023-03-22 00:20:40] [INFO ] Invariant cache hit.
[2023-03-22 00:20:40] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
[2023-03-22 00:20:40] [INFO ] Invariant cache hit.
[2023-03-22 00:20:40] [INFO ] Dead Transitions using invariants and state equation in 276 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 695 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 136 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : SharedMemory-PT-000010-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (EQ s1 0) (EQ s64 0) (EQ s3 0) (EQ s66 0) (EQ s5 0) (EQ s68 0) (EQ s7 0) (EQ s70 0) (EQ s9 0) (EQ s72 0) (EQ s11 0) (EQ s74 0) (EQ s13 0) (EQ s76 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 1 ms.
FORMULA SharedMemory-PT-000010-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-PT-000010-LTLFireability-04 finished in 854 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(G((F(p1)&&p0))))'
Support contains 30 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 11 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2023-03-22 00:20:40] [INFO ] Invariant cache hit.
[2023-03-22 00:20:40] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-22 00:20:40] [INFO ] Invariant cache hit.
[2023-03-22 00:20:41] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 314 ms to find 0 implicit places.
[2023-03-22 00:20:41] [INFO ] Invariant cache hit.
[2023-03-22 00:20:41] [INFO ] Dead Transitions using invariants and state equation in 331 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 657 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : SharedMemory-PT-000010-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (OR (EQ s96 0) (EQ s127 0)) (OR (EQ s100 0) (EQ s117 0)) (OR (EQ s97 0) (EQ s126 0)) (OR (EQ s99 0) (EQ s118 0)) (OR (EQ s98 0) (EQ s125 0)) (OR (...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SharedMemory-PT-000010-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-PT-000010-LTLFireability-06 finished in 864 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(X(((F(p1)||p0) U (F(p2)&&X(p1))))))'
Support contains 110 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 2 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2023-03-22 00:20:41] [INFO ] Invariant cache hit.
[2023-03-22 00:20:41] [INFO ] Implicit Places using invariants in 89 ms returned []
[2023-03-22 00:20:41] [INFO ] Invariant cache hit.
[2023-03-22 00:20:41] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 290 ms to find 0 implicit places.
[2023-03-22 00:20:41] [INFO ] Invariant cache hit.
[2023-03-22 00:20:42] [INFO ] Dead Transitions using invariants and state equation in 285 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 581 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 271 ms :[(OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (OR (NOT p2) (NOT p1)), (NOT p2), (NOT p1)]
Running random walk in product with property : SharedMemory-PT-000010-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(OR (EQ s1 1) (EQ s64 1) (EQ s3 1) (EQ s66 1) (EQ s5 1) (EQ s68 1) (EQ s7 1) (EQ s70 1) (EQ s9 1) (EQ s72 1) (EQ s11 1) (EQ s74 1) (EQ s13 1) (EQ s76 1...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 19159 reset in 823 ms.
Stack based approach found an accepted trace after 383 steps with 74 reset with depth 8 and stack size 8 in 4 ms.
FORMULA SharedMemory-PT-000010-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-PT-000010-LTLFireability-07 finished in 1714 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((X(F((p1||G(p2))))||p0)))'
Support contains 6 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 11 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2023-03-22 00:20:43] [INFO ] Invariant cache hit.
[2023-03-22 00:20:43] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-22 00:20:43] [INFO ] Invariant cache hit.
[2023-03-22 00:20:43] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
[2023-03-22 00:20:43] [INFO ] Invariant cache hit.
[2023-03-22 00:20:44] [INFO ] Dead Transitions using invariants and state equation in 315 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 719 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : SharedMemory-PT-000010-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s116 1) (AND (EQ s85 1) (EQ s96 1) (EQ s114 1))), p1:(EQ s4 0), p2:(EQ s86 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 47616 reset in 422 ms.
Product exploration explored 100000 steps with 47677 reset in 411 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
Knowledge based reduction with 2 factoid took 183 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 00:20:45] [INFO ] Invariant cache hit.
[2023-03-22 00:20:45] [INFO ] [Real]Absence check using 21 positive place invariants in 12 ms returned sat
[2023-03-22 00:20:45] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 p2), (X (X (NOT (AND (NOT p1) (NOT p2))))), (G (NOT (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (F (NOT p0)), (F (AND (NOT p1) p2))]
Property proved to be true thanks to knowledge :(G (NOT (AND (NOT p1) (NOT p2))))
Knowledge based reduction with 3 factoid took 575 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SharedMemory-PT-000010-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SharedMemory-PT-000010-LTLFireability-08 finished in 2848 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)&&F(G(p2))))))'
Support contains 3 out of 131 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 28 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2023-03-22 00:20:46] [INFO ] Invariant cache hit.
[2023-03-22 00:20:46] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-22 00:20:46] [INFO ] Invariant cache hit.
[2023-03-22 00:20:46] [INFO ] Implicit Places using invariants and state equation in 252 ms returned []
Implicit Place search using SMT with State Equation took 403 ms to find 0 implicit places.
[2023-03-22 00:20:46] [INFO ] Invariant cache hit.
[2023-03-22 00:20:46] [INFO ] Dead Transitions using invariants and state equation in 287 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 721 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 242 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p2), (NOT p1)]
Running random walk in product with property : SharedMemory-PT-000010-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s94 1) (EQ s129 1)), p2:(NEQ s104 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 866 ms.
Stack based approach found an accepted trace after 10 steps with 0 reset with depth 11 and stack size 11 in 0 ms.
FORMULA SharedMemory-PT-000010-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-PT-000010-LTLFireability-09 finished in 1858 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)||X(((!p0 U (p2||G(!p0)))&&p1))))'
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 11 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2023-03-22 00:20:48] [INFO ] Invariant cache hit.
[2023-03-22 00:20:48] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-22 00:20:48] [INFO ] Invariant cache hit.
[2023-03-22 00:20:48] [INFO ] Implicit Places using invariants and state equation in 239 ms returned []
Implicit Place search using SMT with State Equation took 385 ms to find 0 implicit places.
[2023-03-22 00:20:48] [INFO ] Invariant cache hit.
[2023-03-22 00:20:48] [INFO ] Dead Transitions using invariants and state equation in 350 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 753 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : SharedMemory-PT-000010-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s87 1) (EQ s119 1)), p1:(AND (EQ s66 0) (EQ s106 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 2337 reset in 648 ms.
Stack based approach found an accepted trace after 19 steps with 0 reset with depth 20 and stack size 20 in 0 ms.
FORMULA SharedMemory-PT-000010-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-PT-000010-LTLFireability-10 finished in 1592 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(((p0 U X(!p1))&&(!p1 U p2))))'
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 12 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2023-03-22 00:20:49] [INFO ] Invariant cache hit.
[2023-03-22 00:20:49] [INFO ] Implicit Places using invariants in 113 ms returned []
[2023-03-22 00:20:49] [INFO ] Invariant cache hit.
[2023-03-22 00:20:49] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2023-03-22 00:20:49] [INFO ] Invariant cache hit.
[2023-03-22 00:20:50] [INFO ] Dead Transitions using invariants and state equation in 284 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 561 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 265 ms :[(OR (NOT p2) p1), true, p1, (NOT p2), p1]
Running random walk in product with property : SharedMemory-PT-000010-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(OR p2 (NOT p1)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) p2) (AND (NOT p0) (NOT p1))), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(OR (AND p0 p2) (AND p0 (NOT p1))), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 2}, { cond=(AND p0 p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s15 1), p1:(NEQ s104 1), p0:(AND (EQ s97 1) (EQ s126 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 9 steps with 0 reset in 0 ms.
FORMULA SharedMemory-PT-000010-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-PT-000010-LTLFireability-11 finished in 849 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((G(p0)&&(F(G(p2))||p1)))))'
Support contains 4 out of 131 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Applied a total of 0 rules in 8 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2023-03-22 00:20:50] [INFO ] Invariant cache hit.
[2023-03-22 00:20:50] [INFO ] Implicit Places using invariants in 143 ms returned []
[2023-03-22 00:20:50] [INFO ] Invariant cache hit.
[2023-03-22 00:20:50] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
[2023-03-22 00:20:50] [INFO ] Invariant cache hit.
[2023-03-22 00:20:51] [INFO ] Dead Transitions using invariants and state equation in 335 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 746 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 318 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : SharedMemory-PT-000010-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=p0, acceptance={1} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 1}, { cond=p0, acceptance={1} source=2 dest: 2}], [{ cond=(OR (AND (NOT p0) p2) (AND (NOT p1) p2)), acceptance={0} source=3 dest: 3}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={0, 1} source=3 dest: 3}, { cond=(AND p0 p1 p2), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={1} source=3 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=4 dest: 3}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s38 1), p1:(OR (EQ s87 0) (EQ s119 0)), p2:(EQ s106 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 912 ms.
Stack based approach found an accepted trace after 28 steps with 0 reset with depth 29 and stack size 29 in 0 ms.
FORMULA SharedMemory-PT-000010-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-PT-000010-LTLFireability-12 finished in 2015 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(p0)||G(p1)||(p1&&F(p2))))'
Support contains 2 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 210/210 transitions.
Drop transitions removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 72 place count 131 transition count 138
Reduce places removed 72 places and 0 transitions.
Iterating post reduction 1 with 72 rules applied. Total rules applied 144 place count 59 transition count 138
Applied a total of 144 rules in 23 ms. Remains 59 /131 variables (removed 72) and now considering 138/210 (removed 72) transitions.
[2023-03-22 00:20:52] [INFO ] Flow matrix only has 74 transitions (discarded 64 similar events)
// Phase 1: matrix 74 rows 59 cols
[2023-03-22 00:20:52] [INFO ] Computed 21 place invariants in 2 ms
[2023-03-22 00:20:52] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-22 00:20:52] [INFO ] Flow matrix only has 74 transitions (discarded 64 similar events)
[2023-03-22 00:20:52] [INFO ] Invariant cache hit.
[2023-03-22 00:20:52] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2023-03-22 00:20:52] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-22 00:20:52] [INFO ] Flow matrix only has 74 transitions (discarded 64 similar events)
[2023-03-22 00:20:52] [INFO ] Invariant cache hit.
[2023-03-22 00:20:52] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 59/131 places, 138/210 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 345 ms. Remains : 59/131 places, 138/210 transitions.
Stuttering acceptance computed with spot in 249 ms :[true, (NOT p2), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : SharedMemory-PT-000010-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=5 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 6}]], initial=2, aps=[p2:(NEQ s43 1), p0:(EQ s43 0), p1:(EQ s31 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][true, true, true, true, true, true, true]]
Product exploration explored 100000 steps with 10980 reset in 369 ms.
Stack based approach found an accepted trace after 43 steps with 4 reset with depth 8 and stack size 8 in 0 ms.
FORMULA SharedMemory-PT-000010-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-PT-000010-LTLFireability-13 finished in 985 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(X((X(p0)||F(p1)))))'
[2023-03-22 00:20:53] [INFO ] Flatten gal took : 26 ms
[2023-03-22 00:20:53] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 6 ms.
[2023-03-22 00:20:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 131 places, 210 transitions and 800 arcs took 3 ms.
Total runtime 29235 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1168/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : SharedMemory-PT-000010-LTLFireability-00
BK_STOP 1679444458499
--------------------
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 LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name SharedMemory-PT-000010-LTLFireability-00
ltl formula formula --ltl=/tmp/1168/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 131 places, 210 transitions and 800 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1168/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1168/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1168/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1168/ltl_0_
terminate called after throwing an instance of 'terminate called after throwing an instance of 'std::runtime_error'
what(): too many children for formula
std::runtime_error'
terminate called after throwing an instance of 'std::runtime_error'
what(): too many children for formula
what(): too many children for formula
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="SharedMemory-PT-000010"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is SharedMemory-PT-000010, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r361-smll-167891811900668"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SharedMemory-PT-000010.tgz
mv SharedMemory-PT-000010 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;