fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r334-tall-171679080900708
Last Updated
July 7, 2024

About the Execution of ITS-Tools for SharedMemory-COL-000010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1135.647 131224.00 165105.00 468.80 TFFFTFFTFFFTFFFF 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.r334-tall-171679080900708.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 itstools
Input is SharedMemory-COL-000010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r334-tall-171679080900708
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 492K
-rw-r--r-- 1 mcc users 6.5K Apr 12 15:14 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Apr 12 15:14 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Apr 12 15:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Apr 12 15:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Apr 23 07:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Apr 23 07:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Apr 23 07:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 12 15:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 12 15:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 12 15:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 111K Apr 12 15:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 12K 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 SharedMemory-COL-000010-LTLFireability-00
FORMULA_NAME SharedMemory-COL-000010-LTLFireability-01
FORMULA_NAME SharedMemory-COL-000010-LTLFireability-02
FORMULA_NAME SharedMemory-COL-000010-LTLFireability-03
FORMULA_NAME SharedMemory-COL-000010-LTLFireability-04
FORMULA_NAME SharedMemory-COL-000010-LTLFireability-05
FORMULA_NAME SharedMemory-COL-000010-LTLFireability-06
FORMULA_NAME SharedMemory-COL-000010-LTLFireability-07
FORMULA_NAME SharedMemory-COL-000010-LTLFireability-08
FORMULA_NAME SharedMemory-COL-000010-LTLFireability-09
FORMULA_NAME SharedMemory-COL-000010-LTLFireability-10
FORMULA_NAME SharedMemory-COL-000010-LTLFireability-11
FORMULA_NAME SharedMemory-COL-000010-LTLFireability-12
FORMULA_NAME SharedMemory-COL-000010-LTLFireability-13
FORMULA_NAME SharedMemory-COL-000010-LTLFireability-14
FORMULA_NAME SharedMemory-COL-000010-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716866233183

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SharedMemory-COL-000010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLFireability COL
Running Version 202405141337
[2024-05-28 03:17:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-28 03:17:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 03:17:14] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-05-28 03:17:14] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-05-28 03:17:15] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 530 ms
[2024-05-28 03:17:15] [INFO ] Imported 6 HL places and 5 HL transitions for a total of 141 PT places and 320.0 transition bindings in 16 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
[2024-05-28 03:17:15] [INFO ] Built PT skeleton of HLPN with 6 places and 5 transitions 16 arcs in 4 ms.
[2024-05-28 03:17:15] [INFO ] Skeletonized 14 HLPN properties in 2 ms. Removed 2 properties that had guard overlaps.
Initial state reduction rules removed 2 formulas.
FORMULA SharedMemory-COL-000010-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000010-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000010-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000010-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 3 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 258 steps (0 resets) in 11 ms. (21 steps per ms) remains 0/3 properties
[2024-05-28 03:17:15] [INFO ] Flatten gal took : 12 ms
[2024-05-28 03:17:15] [INFO ] Flatten gal took : 1 ms
Domain [P(10), P(10)] of place Ext_Mem_Acc breaks symmetries in sort P
[2024-05-28 03:17:15] [INFO ] Unfolded HLPN to a Petri net with 141 places and 220 transitions 840 arcs in 23 ms.
[2024-05-28 03:17:15] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 10 transitions.
FORMULA SharedMemory-COL-000010-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SharedMemory-COL-000010-LTLFireability-07 TRUE 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 10 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
// Phase 1: matrix 210 rows 131 cols
[2024-05-28 03:17:15] [INFO ] Computed 21 invariants in 22 ms
[2024-05-28 03:17:15] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-05-28 03:17:15] [INFO ] Invariant cache hit.
[2024-05-28 03:17:15] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 489 ms to find 0 implicit places.
Running 190 sub problems to find dead transitions.
[2024-05-28 03:17:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 10/131 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 210/341 variables, 131/152 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (OVERLAPS) 0/341 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 152 constraints, problems are : Problem set: 0 solved, 190 unsolved in 4569 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 10/131 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 210/341 variables, 131/152 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 190/342 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 0/341 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 342 constraints, problems are : Problem set: 0 solved, 190 unsolved in 6654 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
After SMT, in 11705ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 11725ms
Finished structural reductions in LTL mode , in 1 iterations and 12249 ms. Remains : 131/131 places, 210/210 transitions.
Support contains 131 out of 131 places after structural reductions.
[2024-05-28 03:17:27] [INFO ] Flatten gal took : 31 ms
[2024-05-28 03:17:27] [INFO ] Flatten gal took : 33 ms
[2024-05-28 03:17:27] [INFO ] Input system was already deterministic with 210 transitions.
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 64 steps (0 resets) in 8 ms. (7 steps per ms) remains 0/7 properties
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' '!(F(G(p0)))'
Support contains 10 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 22 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-05-28 03:17:28] [INFO ] Invariant cache hit.
[2024-05-28 03:17:28] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-28 03:17:28] [INFO ] Invariant cache hit.
[2024-05-28 03:17:28] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2024-05-28 03:17:28] [INFO ] Redundant transitions in 8 ms returned []
Running 190 sub problems to find dead transitions.
[2024-05-28 03:17:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 10/131 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 210/341 variables, 131/152 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (OVERLAPS) 0/341 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 152 constraints, problems are : Problem set: 0 solved, 190 unsolved in 4025 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 10/131 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 210/341 variables, 131/152 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 190/342 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 0/341 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 342 constraints, problems are : Problem set: 0 solved, 190 unsolved in 6302 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
After SMT, in 10605ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 10609ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10814 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 307 ms :[(NOT p0)]
Running random walk in product with property : SharedMemory-COL-000010-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 756 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 1 ms.
FORMULA SharedMemory-COL-000010-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000010-LTLFireability-01 finished in 11940 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 X(G(!p0)))))'
Support contains 10 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.
[2024-05-28 03:17:40] [INFO ] Invariant cache hit.
[2024-05-28 03:17:40] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-28 03:17:40] [INFO ] Invariant cache hit.
[2024-05-28 03:17:40] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Running 190 sub problems to find dead transitions.
[2024-05-28 03:17:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 10/131 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 210/341 variables, 131/152 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (OVERLAPS) 0/341 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 152 constraints, problems are : Problem set: 0 solved, 190 unsolved in 4231 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 10/131 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 210/341 variables, 131/152 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 190/342 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 0/341 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 342 constraints, problems are : Problem set: 0 solved, 190 unsolved in 6278 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
After SMT, in 10795ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 10797ms
Finished structural reductions in LTL mode , in 1 iterations and 10967 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 137 ms :[p0, p0, true, p0]
Running random walk in product with property : SharedMemory-COL-000010-LTLFireability-02
Entered a terminal (fully accepting) state of product in 20 steps with 0 reset in 0 ms.
FORMULA SharedMemory-COL-000010-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-COL-000010-LTLFireability-02 finished in 11124 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(p0)||F(G(p1))))'
Support contains 31 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 14 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-05-28 03:17:51] [INFO ] Invariant cache hit.
[2024-05-28 03:17:51] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-05-28 03:17:51] [INFO ] Invariant cache hit.
[2024-05-28 03:17:51] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2024-05-28 03:17:51] [INFO ] Redundant transitions in 7 ms returned []
Running 190 sub problems to find dead transitions.
[2024-05-28 03:17:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 10/131 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 210/341 variables, 131/152 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (OVERLAPS) 0/341 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 152 constraints, problems are : Problem set: 0 solved, 190 unsolved in 3965 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 10/131 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 210/341 variables, 131/152 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 190/342 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 0/341 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 342 constraints, problems are : Problem set: 0 solved, 190 unsolved in 6100 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
After SMT, in 10361ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 10363ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10568 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : SharedMemory-COL-000010-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 1710 ms.
Stack based approach found an accepted trace after 539 steps with 0 reset with depth 540 and stack size 486 in 9 ms.
FORMULA SharedMemory-COL-000010-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000010-LTLFireability-03 finished in 12398 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(((p1 U !p2)||(X(!p3) U (X(G(!p3))||(X(!p3)&&G(!p4))))||p0)))'
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 3 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-05-28 03:18:03] [INFO ] Invariant cache hit.
[2024-05-28 03:18:03] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-28 03:18:03] [INFO ] Invariant cache hit.
[2024-05-28 03:18:03] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 125 ms to find 0 implicit places.
Running 190 sub problems to find dead transitions.
[2024-05-28 03:18:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 10/131 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 210/341 variables, 131/152 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (OVERLAPS) 0/341 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 152 constraints, problems are : Problem set: 0 solved, 190 unsolved in 3987 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 10/131 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 210/341 variables, 131/152 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 190/342 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 0/341 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 342 constraints, problems are : Problem set: 0 solved, 190 unsolved in 6919 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
After SMT, in 11166ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 11169ms
Finished structural reductions in LTL mode , in 1 iterations and 11298 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 543 ms :[true, (AND (NOT p0) p2 p3), (AND (NOT p0) p2 p3), (AND p4 p3), (AND p2 p3 p4), p4, (AND p2 p4), p3, p3, (AND p2 p3), (AND p2 p3), p2]
Running random walk in product with property : SharedMemory-COL-000010-LTLFireability-04
Product exploration explored 100000 steps with 50000 reset in 470 ms.
Product exploration explored 100000 steps with 50000 reset in 434 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1) (NOT p4) (NOT p3)), (X (NOT p2)), (X (NOT p4)), (X (NOT (AND (NOT p0) p2 (NOT p1) (NOT p4)))), (X (NOT (AND (NOT p0) p2 (NOT p1) p4))), (X (NOT (AND (NOT p0) p2 p1 p4))), (X (NOT p1)), (X (NOT (AND (NOT p0) p2 p1 (NOT p4)))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1) (NOT p4) (NOT p3))))), (X (X (NOT (AND p4 (NOT p3))))), (X (X (NOT p4))), (X (X (NOT (AND p2 (NOT p1) p3)))), (X (X (NOT (AND p2 p1 p4 (NOT p3))))), (X (X (NOT (AND p2 p1 (NOT p4) (NOT p3))))), (X (X (NOT (AND p2 (NOT p1) p4 (NOT p3))))), (X (X (NOT (AND p2 p1 p3))))]
False Knowledge obtained : [(X p0), (X (NOT p0)), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p4) (NOT p3)))), (X (X (NOT (AND (NOT p4) (NOT p3))))), (X (X p1)), (X (X (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 17 factoid took 18 ms. Reduced automaton from 12 states, 44 edges and 5 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SharedMemory-COL-000010-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SharedMemory-COL-000010-LTLFireability-04 finished in 12821 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 10 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 17 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-05-28 03:18:16] [INFO ] Invariant cache hit.
[2024-05-28 03:18:16] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-28 03:18:16] [INFO ] Invariant cache hit.
[2024-05-28 03:18:16] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2024-05-28 03:18:16] [INFO ] Redundant transitions in 3 ms returned []
Running 190 sub problems to find dead transitions.
[2024-05-28 03:18:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 10/131 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 210/341 variables, 131/152 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (OVERLAPS) 0/341 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 152 constraints, problems are : Problem set: 0 solved, 190 unsolved in 3888 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 10/131 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 210/341 variables, 131/152 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 190/342 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 0/341 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 342 constraints, problems are : Problem set: 0 solved, 190 unsolved in 6166 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
After SMT, in 10336ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 10339ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10533 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Running random walk in product with property : SharedMemory-COL-000010-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 625 ms.
Stack based approach found an accepted trace after 23 steps with 0 reset with depth 24 and stack size 24 in 0 ms.
FORMULA SharedMemory-COL-000010-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000010-LTLFireability-05 finished in 11218 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((F(p1)&&(p1 U !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 4 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-05-28 03:18:27] [INFO ] Invariant cache hit.
[2024-05-28 03:18:27] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-28 03:18:27] [INFO ] Invariant cache hit.
[2024-05-28 03:18:27] [INFO ] Implicit Places using invariants and state equation in 93 ms returned []
Implicit Place search using SMT with State Equation took 148 ms to find 0 implicit places.
Running 190 sub problems to find dead transitions.
[2024-05-28 03:18:27] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 10/131 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 210/341 variables, 131/152 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (OVERLAPS) 0/341 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 152 constraints, problems are : Problem set: 0 solved, 190 unsolved in 3915 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 10/131 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 210/341 variables, 131/152 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 190/342 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 0/341 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 342 constraints, problems are : Problem set: 0 solved, 190 unsolved in 6076 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
After SMT, in 10244ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 10247ms
Finished structural reductions in LTL mode , in 1 iterations and 10400 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 321 ms :[(OR (NOT p1) p0), (OR (NOT p1) p0), (NOT p1), (OR (NOT p1) p0), p0, true, p0]
Running random walk in product with property : SharedMemory-COL-000010-LTLFireability-06
Entered a terminal (fully accepting) state of product in 5983 steps with 279 reset in 39 ms.
FORMULA SharedMemory-COL-000010-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SharedMemory-COL-000010-LTLFireability-06 finished in 10789 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(F(p0)))'
Support contains 90 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.
[2024-05-28 03:18:38] [INFO ] Invariant cache hit.
[2024-05-28 03:18:38] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-28 03:18:38] [INFO ] Invariant cache hit.
[2024-05-28 03:18:38] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
Running 190 sub problems to find dead transitions.
[2024-05-28 03:18:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 10/131 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 210/341 variables, 131/152 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (OVERLAPS) 0/341 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 152 constraints, problems are : Problem set: 0 solved, 190 unsolved in 3990 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 10/131 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 210/341 variables, 131/152 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 190/342 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 0/341 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 342 constraints, problems are : Problem set: 0 solved, 190 unsolved in 6292 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
After SMT, in 10572ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 10574ms
Finished structural reductions in LTL mode , in 1 iterations and 10741 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SharedMemory-COL-000010-LTLFireability-12
Product exploration explored 100000 steps with 18431 reset in 417 ms.
Stack based approach found an accepted trace after 35 steps with 7 reset with depth 4 and stack size 4 in 0 ms.
FORMULA SharedMemory-COL-000010-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000010-LTLFireability-12 finished in 11263 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(X(X(X(F(!p0)))))))'
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.
[2024-05-28 03:18:49] [INFO ] Invariant cache hit.
[2024-05-28 03:18:49] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-28 03:18:49] [INFO ] Invariant cache hit.
[2024-05-28 03:18:49] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 147 ms to find 0 implicit places.
Running 190 sub problems to find dead transitions.
[2024-05-28 03:18:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 10/131 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 210/341 variables, 131/152 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (OVERLAPS) 0/341 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 152 constraints, problems are : Problem set: 0 solved, 190 unsolved in 3951 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 10/131 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 210/341 variables, 131/152 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 190/342 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 0/341 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 342 constraints, problems are : Problem set: 0 solved, 190 unsolved in 6288 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
After SMT, in 10506ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 10509ms
Finished structural reductions in LTL mode , in 1 iterations and 10659 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 328 ms :[p0, p0, p0, p0, p0, p0]
Running random walk in product with property : SharedMemory-COL-000010-LTLFireability-13
Product exploration explored 100000 steps with 9697 reset in 378 ms.
Stack based approach found an accepted trace after 74 steps with 9 reset with depth 7 and stack size 7 in 1 ms.
FORMULA SharedMemory-COL-000010-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000010-LTLFireability-13 finished in 11386 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(F((p0 U (G(p0)||(p0&&G((X(G(!p1))&&F(!p2)))))))))'
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 1 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-05-28 03:19:01] [INFO ] Invariant cache hit.
[2024-05-28 03:19:01] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-28 03:19:01] [INFO ] Invariant cache hit.
[2024-05-28 03:19:01] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 145 ms to find 0 implicit places.
Running 190 sub problems to find dead transitions.
[2024-05-28 03:19:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 10/131 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 210/341 variables, 131/152 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (OVERLAPS) 0/341 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 152 constraints, problems are : Problem set: 0 solved, 190 unsolved in 4029 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 10/131 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 210/341 variables, 131/152 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 190/342 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 0/341 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 342 constraints, problems are : Problem set: 0 solved, 190 unsolved in 6223 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
After SMT, in 10573ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 10576ms
Finished structural reductions in LTL mode , in 1 iterations and 10724 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 203 ms :[(NOT p0), (NOT p0), (AND (NOT p0) p1), (OR (AND (NOT p0) p1) (AND (NOT p0) p2)), (AND (NOT p0) p2)]
Running random walk in product with property : SharedMemory-COL-000010-LTLFireability-14
Product exploration explored 100000 steps with 2105 reset in 1240 ms.
Stack based approach found an accepted trace after 564 steps with 11 reset with depth 33 and stack size 30 in 9 ms.
FORMULA SharedMemory-COL-000010-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000010-LTLFireability-14 finished in 12248 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)))'
Support contains 20 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 16 ms. Remains 131 /131 variables (removed 0) and now considering 210/210 (removed 0) transitions.
[2024-05-28 03:19:13] [INFO ] Invariant cache hit.
[2024-05-28 03:19:13] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-28 03:19:13] [INFO ] Invariant cache hit.
[2024-05-28 03:19:13] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2024-05-28 03:19:13] [INFO ] Redundant transitions in 5 ms returned []
Running 190 sub problems to find dead transitions.
[2024-05-28 03:19:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 10/131 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 210/341 variables, 131/152 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (OVERLAPS) 0/341 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Real declared 341/341 variables, and 152 constraints, problems are : Problem set: 0 solved, 190 unsolved in 3981 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 190 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/121 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/121 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 2 (OVERLAPS) 10/131 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 4 (OVERLAPS) 210/341 variables, 131/152 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/341 variables, 190/342 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/341 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 190 unsolved
At refinement iteration 7 (OVERLAPS) 0/341 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 190 unsolved
No progress, stopping.
After SMT solving in domain Int declared 341/341 variables, and 342 constraints, problems are : Problem set: 0 solved, 190 unsolved in 6021 ms.
Refiners :[Positive P Invariants (semi-flows): 21/21 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 190/190 constraints, Known Traps: 0/0 constraints]
After SMT, in 10284ms problems are : Problem set: 0 solved, 190 unsolved
Search for dead transitions found 0 dead transitions in 10287ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 10453 ms. Remains : 131/131 places, 210/210 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SharedMemory-COL-000010-LTLFireability-15
Product exploration explored 100000 steps with 5701 reset in 383 ms.
Stack based approach found an accepted trace after 15366 steps with 909 reset with depth 47 and stack size 46 in 59 ms.
FORMULA SharedMemory-COL-000010-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property SharedMemory-COL-000010-LTLFireability-15 finished in 10982 ms.
All properties solved by simple procedures.
Total runtime 129964 ms.

BK_STOP 1716866364407

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is SharedMemory-COL-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 r334-tall-171679080900708"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SharedMemory-COL-000010.tgz
mv SharedMemory-COL-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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;