About the Execution of LTSMin+red for JoinFreeModules-PT-0050
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
610.100 | 1053778.00 | 1213976.00 | 2662.00 | FFFFFFTTFFFFFFFF | 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.r504-tall-171649611900044.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 ltsminxred
Input is JoinFreeModules-PT-0050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r504-tall-171649611900044
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 9.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 108K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 5.4K Apr 11 14:20 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 43K Apr 11 14:20 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 11 14:20 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 11 14:20 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 152K May 18 16:42 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 JoinFreeModules-PT-0050-LTLFireability-00
FORMULA_NAME JoinFreeModules-PT-0050-LTLFireability-01
FORMULA_NAME JoinFreeModules-PT-0050-LTLFireability-02
FORMULA_NAME JoinFreeModules-PT-0050-LTLFireability-03
FORMULA_NAME JoinFreeModules-PT-0050-LTLFireability-04
FORMULA_NAME JoinFreeModules-PT-0050-LTLFireability-05
FORMULA_NAME JoinFreeModules-PT-0050-LTLFireability-06
FORMULA_NAME JoinFreeModules-PT-0050-LTLFireability-07
FORMULA_NAME JoinFreeModules-PT-0050-LTLFireability-08
FORMULA_NAME JoinFreeModules-PT-0050-LTLFireability-09
FORMULA_NAME JoinFreeModules-PT-0050-LTLFireability-10
FORMULA_NAME JoinFreeModules-PT-0050-LTLFireability-11
FORMULA_NAME JoinFreeModules-PT-0050-LTLFireability-12
FORMULA_NAME JoinFreeModules-PT-0050-LTLFireability-13
FORMULA_NAME JoinFreeModules-PT-0050-LTLFireability-14
FORMULA_NAME JoinFreeModules-PT-0050-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1717218144181
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-0050
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:02:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 05:02:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:02:25] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2024-06-01 05:02:25] [INFO ] Transformed 251 places.
[2024-06-01 05:02:25] [INFO ] Transformed 401 transitions.
[2024-06-01 05:02:25] [INFO ] Parsed PT model containing 251 places and 401 transitions and 1152 arcs in 175 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-0050-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0050-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0050-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0050-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0050-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 21 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Running 300 sub problems to find dead transitions.
// Phase 1: matrix 401 rows 250 cols
[2024-06-01 05:02:25] [INFO ] Computed 50 invariants in 10 ms
[2024-06-01 05:02:25] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/651 variables, and 350 constraints, problems are : Problem set: 0 solved, 300 unsolved in 14435 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 300/650 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:02:44] [INFO ] Deduced a trap composed of 3 places in 44 ms of which 10 ms to minimize.
[2024-06-01 05:02:44] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 05:02:44] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 3/653 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:02:55] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-06-01 05:02:55] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 05:02:55] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 05:02:56] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 05:02:56] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 5/658 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/651 variables, and 658 constraints, problems are : Problem set: 0 solved, 300 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 8/8 constraints]
After SMT, in 34575ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 34593ms
[2024-06-01 05:03:00] [INFO ] Invariant cache hit.
[2024-06-01 05:03:00] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-01 05:03:00] [INFO ] Invariant cache hit.
[2024-06-01 05:03:00] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-06-01 05:03:00] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-06-01 05:03:00] [INFO ] Invariant cache hit.
[2024-06-01 05:03:00] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/651 variables, and 350 constraints, problems are : Problem set: 0 solved, 300 unsolved in 14154 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 300/650 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:03:19] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 05:03:19] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 05:03:22] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-06-01 05:03:22] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 05:03:22] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 05:03:22] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 6/656 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:03:31] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 05:03:31] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 05:03:31] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 3/659 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:03:36] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/650 variables, 1/660 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/651 variables, and 660 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 10/10 constraints]
After SMT, in 44217ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 44222ms
Finished structural reductions in LTL mode , in 1 iterations and 79096 ms. Remains : 250/250 places, 401/401 transitions.
Support contains 24 out of 250 places after structural reductions.
[2024-06-01 05:03:44] [INFO ] Flatten gal took : 47 ms
[2024-06-01 05:03:44] [INFO ] Flatten gal took : 21 ms
[2024-06-01 05:03:44] [INFO ] Input system was already deterministic with 401 transitions.
Support contains 22 out of 250 places (down from 24) after GAL structural reductions.
RANDOM walk for 38388 steps (8 resets) in 545 ms. (70 steps per ms) remains 0/20 properties
FORMULA JoinFreeModules-PT-0050-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(p1)))))'
Support contains 3 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 9 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Running 300 sub problems to find dead transitions.
[2024-06-01 05:03:45] [INFO ] Invariant cache hit.
[2024-06-01 05:03:45] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/651 variables, and 350 constraints, problems are : Problem set: 0 solved, 300 unsolved in 14443 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 300/650 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:04:04] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 05:04:04] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 05:04:07] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 05:04:07] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 05:04:07] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 05:04:07] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 6/656 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:04:16] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 05:04:16] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 05:04:16] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 3/659 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/651 variables, and 659 constraints, problems are : Problem set: 0 solved, 300 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 9/9 constraints]
After SMT, in 34505ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 34509ms
[2024-06-01 05:04:19] [INFO ] Invariant cache hit.
[2024-06-01 05:04:19] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-01 05:04:19] [INFO ] Invariant cache hit.
[2024-06-01 05:04:20] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-06-01 05:04:20] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-06-01 05:04:20] [INFO ] Invariant cache hit.
[2024-06-01 05:04:20] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/651 variables, and 350 constraints, problems are : Problem set: 0 solved, 300 unsolved in 14233 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 300/650 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:04:38] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-06-01 05:04:38] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 05:04:41] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-06-01 05:04:41] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 05:04:41] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 05:04:41] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 6/656 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:04:51] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 2 ms to minimize.
[2024-06-01 05:04:51] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 05:04:51] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 3/659 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:04:56] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/650 variables, 1/660 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/651 variables, and 660 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 10/10 constraints]
After SMT, in 44281ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 44284ms
Finished structural reductions in LTL mode , in 1 iterations and 78986 ms. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-0050-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 1669 ms.
Stack based approach found an accepted trace after 7234 steps with 0 reset with depth 7235 and stack size 7230 in 140 ms.
FORMULA JoinFreeModules-PT-0050-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property JoinFreeModules-PT-0050-LTLFireability-01 finished in 81048 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(G(p0))&&G(p1))))'
Support contains 3 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 6 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Running 300 sub problems to find dead transitions.
[2024-06-01 05:05:06] [INFO ] Invariant cache hit.
[2024-06-01 05:05:06] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/651 variables, and 350 constraints, problems are : Problem set: 0 solved, 300 unsolved in 14038 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 300/650 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:05:24] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 05:05:24] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 05:05:27] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 05:05:28] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 05:05:28] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 05:05:28] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 6/656 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:05:37] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 05:05:37] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-06-01 05:05:37] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 3/659 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/651 variables, and 659 constraints, problems are : Problem set: 0 solved, 300 unsolved in 20022 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 9/9 constraints]
After SMT, in 34097ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 34104ms
[2024-06-01 05:05:40] [INFO ] Invariant cache hit.
[2024-06-01 05:05:40] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-06-01 05:05:40] [INFO ] Invariant cache hit.
[2024-06-01 05:05:40] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-06-01 05:05:40] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-06-01 05:05:40] [INFO ] Invariant cache hit.
[2024-06-01 05:05:40] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/651 variables, and 350 constraints, problems are : Problem set: 0 solved, 300 unsolved in 14479 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 300/650 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:05:59] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 05:05:59] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 05:06:02] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-01 05:06:02] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 05:06:02] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 05:06:02] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 6/656 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:06:12] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-06-01 05:06:12] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 05:06:12] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 3/659 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:06:17] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/650 variables, 1/660 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/651 variables, and 660 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 10/10 constraints]
After SMT, in 44523ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 44525ms
Finished structural reductions in LTL mode , in 1 iterations and 78825 ms. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 165 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-0050-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0050-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0050-LTLFireability-03 finished in 79012 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 27 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Running 300 sub problems to find dead transitions.
[2024-06-01 05:06:25] [INFO ] Invariant cache hit.
[2024-06-01 05:06:25] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/651 variables, and 350 constraints, problems are : Problem set: 0 solved, 300 unsolved in 14435 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 300/650 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:06:44] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 05:06:44] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 05:06:47] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-06-01 05:06:47] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 05:06:47] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 05:06:47] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 6/656 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:06:56] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-06-01 05:06:57] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 3 ms to minimize.
[2024-06-01 05:06:57] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 3/659 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/651 variables, and 659 constraints, problems are : Problem set: 0 solved, 300 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 9/9 constraints]
After SMT, in 34493ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 34498ms
[2024-06-01 05:06:59] [INFO ] Invariant cache hit.
[2024-06-01 05:06:59] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-06-01 05:06:59] [INFO ] Invariant cache hit.
[2024-06-01 05:07:00] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-06-01 05:07:00] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2024-06-01 05:07:00] [INFO ] Redundant transitions in 22 ms returned []
Running 300 sub problems to find dead transitions.
[2024-06-01 05:07:00] [INFO ] Invariant cache hit.
[2024-06-01 05:07:00] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/651 variables, and 350 constraints, problems are : Problem set: 0 solved, 300 unsolved in 14397 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 300/650 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:07:18] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-06-01 05:07:19] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 05:07:22] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-01 05:07:22] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 05:07:22] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 05:07:22] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 6/656 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:07:31] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 05:07:31] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 05:07:31] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 3/659 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:07:36] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/650 variables, 1/660 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/651 variables, and 660 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 10/10 constraints]
After SMT, in 44451ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 44454ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 79204 ms. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-0050-LTLFireability-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0050-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0050-LTLFireability-05 finished in 79328 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 20 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Running 300 sub problems to find dead transitions.
[2024-06-01 05:07:44] [INFO ] Invariant cache hit.
[2024-06-01 05:07:44] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/651 variables, and 350 constraints, problems are : Problem set: 0 solved, 300 unsolved in 14528 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 300/650 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:08:03] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-06-01 05:08:03] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 05:08:06] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 05:08:06] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 05:08:06] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 05:08:06] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 6/656 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:08:16] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-06-01 05:08:16] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 05:08:16] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 3/659 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/651 variables, and 659 constraints, problems are : Problem set: 0 solved, 300 unsolved in 20019 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 9/9 constraints]
After SMT, in 34580ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 34582ms
[2024-06-01 05:08:19] [INFO ] Invariant cache hit.
[2024-06-01 05:08:19] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-01 05:08:19] [INFO ] Invariant cache hit.
[2024-06-01 05:08:19] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-06-01 05:08:19] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
[2024-06-01 05:08:19] [INFO ] Redundant transitions in 2 ms returned []
Running 300 sub problems to find dead transitions.
[2024-06-01 05:08:19] [INFO ] Invariant cache hit.
[2024-06-01 05:08:19] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/651 variables, and 350 constraints, problems are : Problem set: 0 solved, 300 unsolved in 14221 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 300/650 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:08:38] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-06-01 05:08:38] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 05:08:41] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 05:08:41] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 05:08:41] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 05:08:41] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 6/656 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:08:50] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 05:08:50] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 05:08:50] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 3/659 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:08:55] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/650 variables, 1/660 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/651 variables, and 660 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 10/10 constraints]
After SMT, in 44274ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 44277ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 79066 ms. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-0050-LTLFireability-06
Product exploration explored 100000 steps with 0 reset in 1663 ms.
Product exploration explored 100000 steps with 0 reset in 1854 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 133 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 6 to 4
RANDOM walk for 40065 steps (8 resets) in 320 ms. (124 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 266 ms. (149 steps per ms) remains 1/1 properties
[2024-06-01 05:09:07] [INFO ] Invariant cache hit.
[2024-06-01 05:09:07] [INFO ] State equation strengthened by 50 read => feed constraints.
Problem apf0 is UNSAT
After SMT solving in domain Real declared 2/651 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 15 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/250 constraints, ReadFeed: 0/50 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 21ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 14 factoid took 307 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 36 ms :[(AND (NOT p0) (NOT p1))]
Support contains 3 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 17 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Running 300 sub problems to find dead transitions.
[2024-06-01 05:09:08] [INFO ] Invariant cache hit.
[2024-06-01 05:09:08] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/651 variables, and 350 constraints, problems are : Problem set: 0 solved, 300 unsolved in 14266 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 300/650 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:09:26] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 05:09:26] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 05:09:30] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 05:09:30] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 05:09:30] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 05:09:30] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 6/656 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:09:39] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 05:09:39] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 05:09:39] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 3/659 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/651 variables, and 659 constraints, problems are : Problem set: 0 solved, 300 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 9/9 constraints]
After SMT, in 34310ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 34313ms
[2024-06-01 05:09:42] [INFO ] Invariant cache hit.
[2024-06-01 05:09:42] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-01 05:09:42] [INFO ] Invariant cache hit.
[2024-06-01 05:09:42] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-06-01 05:09:42] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2024-06-01 05:09:42] [INFO ] Redundant transitions in 2 ms returned []
Running 300 sub problems to find dead transitions.
[2024-06-01 05:09:42] [INFO ] Invariant cache hit.
[2024-06-01 05:09:42] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/651 variables, and 350 constraints, problems are : Problem set: 0 solved, 300 unsolved in 14295 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 300/650 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:10:01] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 05:10:01] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 05:10:04] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 05:10:04] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 05:10:04] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 05:10:04] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 6/656 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:10:14] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 05:10:14] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-06-01 05:10:14] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 3/659 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:10:19] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/650 variables, 1/660 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/651 variables, and 660 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 10/10 constraints]
After SMT, in 44342ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 44346ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 78870 ms. Remains : 250/250 places, 401/401 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 213 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 6 to 4
RANDOM walk for 40027 steps (8 resets) in 168 ms. (236 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 161 ms. (246 steps per ms) remains 1/1 properties
[2024-06-01 05:10:27] [INFO ] Invariant cache hit.
[2024-06-01 05:10:27] [INFO ] State equation strengthened by 50 read => feed constraints.
Problem apf0 is UNSAT
After SMT solving in domain Real declared 2/651 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 15 ms.
Refiners :[Positive P Invariants (semi-flows): 0/50 constraints, State Equation: 0/250 constraints, ReadFeed: 0/50 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 24ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 p1))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT p1)), (F (NOT (AND (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 14 factoid took 336 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 27 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 1600 ms.
Product exploration explored 100000 steps with 0 reset in 1755 ms.
Support contains 3 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 9 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Running 300 sub problems to find dead transitions.
[2024-06-01 05:10:31] [INFO ] Invariant cache hit.
[2024-06-01 05:10:31] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/651 variables, and 350 constraints, problems are : Problem set: 0 solved, 300 unsolved in 14494 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 300/650 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:10:50] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 05:10:50] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-06-01 05:10:53] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 05:10:53] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-06-01 05:10:53] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 05:10:53] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 6/656 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:11:02] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 05:11:02] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 05:11:02] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 3/659 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/651 variables, and 659 constraints, problems are : Problem set: 0 solved, 300 unsolved in 20018 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 9/9 constraints]
After SMT, in 34553ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 34555ms
[2024-06-01 05:11:05] [INFO ] Invariant cache hit.
[2024-06-01 05:11:05] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-01 05:11:05] [INFO ] Invariant cache hit.
[2024-06-01 05:11:06] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-06-01 05:11:06] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
[2024-06-01 05:11:06] [INFO ] Redundant transitions in 2 ms returned []
Running 300 sub problems to find dead transitions.
[2024-06-01 05:11:06] [INFO ] Invariant cache hit.
[2024-06-01 05:11:06] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/651 variables, and 350 constraints, problems are : Problem set: 0 solved, 300 unsolved in 14261 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 300/650 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:11:24] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 05:11:24] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 05:11:27] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 05:11:27] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 05:11:27] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 05:11:27] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 6/656 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:11:37] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-06-01 05:11:37] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-06-01 05:11:37] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 3/659 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:11:42] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/650 variables, 1/660 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/651 variables, and 660 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 10/10 constraints]
After SMT, in 44308ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 44310ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 79056 ms. Remains : 250/250 places, 401/401 transitions.
Treatment of property JoinFreeModules-PT-0050-LTLFireability-06 finished in 245713 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(G(p0)))'
Support contains 1 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 2 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Running 300 sub problems to find dead transitions.
[2024-06-01 05:11:50] [INFO ] Invariant cache hit.
[2024-06-01 05:11:50] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/651 variables, and 350 constraints, problems are : Problem set: 0 solved, 300 unsolved in 14180 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 300/650 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:12:09] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 05:12:09] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 05:12:12] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 05:12:12] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 05:12:12] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 05:12:12] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 6/656 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:12:22] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 05:12:22] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 05:12:22] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 3/659 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/651 variables, and 659 constraints, problems are : Problem set: 0 solved, 300 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 9/9 constraints]
After SMT, in 34232ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 34234ms
[2024-06-01 05:12:24] [INFO ] Invariant cache hit.
[2024-06-01 05:12:24] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-01 05:12:24] [INFO ] Invariant cache hit.
[2024-06-01 05:12:24] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-06-01 05:12:24] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-06-01 05:12:24] [INFO ] Invariant cache hit.
[2024-06-01 05:12:24] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/651 variables, and 350 constraints, problems are : Problem set: 0 solved, 300 unsolved in 14611 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 300/650 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:12:43] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 05:12:43] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 05:12:47] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-06-01 05:12:47] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 05:12:47] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 05:12:47] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 6/656 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:12:56] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-01 05:12:56] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-06-01 05:12:56] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 3/659 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:13:01] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/650 variables, 1/660 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/651 variables, and 660 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 10/10 constraints]
After SMT, in 44657ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 44659ms
Finished structural reductions in LTL mode , in 1 iterations and 79080 ms. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0050-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0050-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0050-LTLFireability-10 finished in 79190 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(p0) U X(p1)))'
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 4 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Running 300 sub problems to find dead transitions.
[2024-06-01 05:13:09] [INFO ] Invariant cache hit.
[2024-06-01 05:13:09] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/651 variables, and 350 constraints, problems are : Problem set: 0 solved, 300 unsolved in 14311 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 300/650 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:13:28] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-06-01 05:13:28] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 05:13:31] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-01 05:13:31] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 05:13:31] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 05:13:31] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 6/656 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:13:40] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-01 05:13:40] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 05:13:40] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 3/659 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/651 variables, and 659 constraints, problems are : Problem set: 0 solved, 300 unsolved in 20020 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 9/9 constraints]
After SMT, in 34374ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 34377ms
[2024-06-01 05:13:44] [INFO ] Invariant cache hit.
[2024-06-01 05:13:44] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-01 05:13:44] [INFO ] Invariant cache hit.
[2024-06-01 05:13:44] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-06-01 05:13:44] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-06-01 05:13:44] [INFO ] Invariant cache hit.
[2024-06-01 05:13:44] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/651 variables, and 350 constraints, problems are : Problem set: 0 solved, 300 unsolved in 14202 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 300/650 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:14:02] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 05:14:02] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 05:14:05] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-06-01 05:14:05] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 05:14:05] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
[2024-06-01 05:14:05] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 6/656 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:14:15] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-06-01 05:14:15] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 05:14:15] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 3/659 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:14:20] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/650 variables, 1/660 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/651 variables, and 660 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 10/10 constraints]
After SMT, in 44250ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 44253ms
Finished structural reductions in LTL mode , in 1 iterations and 78817 ms. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0050-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0050-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0050-LTLFireability-11 finished in 78981 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((p0&&G(F((p1||G(p0)))))))'
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 10 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Running 300 sub problems to find dead transitions.
[2024-06-01 05:14:28] [INFO ] Invariant cache hit.
[2024-06-01 05:14:28] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/651 variables, and 350 constraints, problems are : Problem set: 0 solved, 300 unsolved in 14143 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 300/650 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:14:47] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-06-01 05:14:47] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 05:14:50] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-06-01 05:14:50] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 05:14:50] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
[2024-06-01 05:14:50] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 6/656 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:14:59] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 05:14:59] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-06-01 05:14:59] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 3/659 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/651 variables, and 659 constraints, problems are : Problem set: 0 solved, 300 unsolved in 20015 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 9/9 constraints]
After SMT, in 34194ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 34197ms
[2024-06-01 05:15:02] [INFO ] Invariant cache hit.
[2024-06-01 05:15:02] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-06-01 05:15:02] [INFO ] Invariant cache hit.
[2024-06-01 05:15:02] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-06-01 05:15:02] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
[2024-06-01 05:15:03] [INFO ] Redundant transitions in 2 ms returned []
Running 300 sub problems to find dead transitions.
[2024-06-01 05:15:03] [INFO ] Invariant cache hit.
[2024-06-01 05:15:03] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/651 variables, and 350 constraints, problems are : Problem set: 0 solved, 300 unsolved in 14166 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 300/650 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:15:21] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 05:15:21] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 05:15:24] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 05:15:24] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 05:15:24] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 05:15:24] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 6/656 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:15:34] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-01 05:15:34] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 05:15:34] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 3/659 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:15:38] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/650 variables, 1/660 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/651 variables, and 660 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 10/10 constraints]
After SMT, in 44214ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 44218ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 78614 ms. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-0050-LTLFireability-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0050-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0050-LTLFireability-12 finished in 78769 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(p0))'
Support contains 1 out of 250 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 9 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Running 300 sub problems to find dead transitions.
[2024-06-01 05:15:47] [INFO ] Invariant cache hit.
[2024-06-01 05:15:47] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/651 variables, and 350 constraints, problems are : Problem set: 0 solved, 300 unsolved in 13921 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 300/650 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:16:05] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 05:16:05] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 05:16:08] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 05:16:08] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 05:16:08] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 05:16:08] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 6/656 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:16:18] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-06-01 05:16:18] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 05:16:18] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 3/659 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/651 variables, and 659 constraints, problems are : Problem set: 0 solved, 300 unsolved in 20016 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 9/9 constraints]
After SMT, in 33973ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 33976ms
[2024-06-01 05:16:21] [INFO ] Invariant cache hit.
[2024-06-01 05:16:21] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-01 05:16:21] [INFO ] Invariant cache hit.
[2024-06-01 05:16:21] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-06-01 05:16:21] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 183 ms to find 0 implicit places.
[2024-06-01 05:16:21] [INFO ] Redundant transitions in 2 ms returned []
Running 300 sub problems to find dead transitions.
[2024-06-01 05:16:21] [INFO ] Invariant cache hit.
[2024-06-01 05:16:21] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/651 variables, and 350 constraints, problems are : Problem set: 0 solved, 300 unsolved in 14105 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 300/650 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:16:40] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 05:16:40] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 05:16:43] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-01 05:16:43] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 05:16:43] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 05:16:43] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 6/656 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:16:52] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-06-01 05:16:52] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 05:16:52] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 3/659 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:16:57] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/650 variables, 1/660 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/651 variables, and 660 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 10/10 constraints]
After SMT, in 44163ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 44169ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 78345 ms. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0050-LTLFireability-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0050-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0050-LTLFireability-13 finished in 78407 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 1 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 2 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Running 300 sub problems to find dead transitions.
[2024-06-01 05:17:05] [INFO ] Invariant cache hit.
[2024-06-01 05:17:05] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/651 variables, and 350 constraints, problems are : Problem set: 0 solved, 300 unsolved in 14213 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 300/650 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:17:24] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 05:17:24] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 05:17:27] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 05:17:27] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 05:17:27] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 05:17:27] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 6/656 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:17:36] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 05:17:36] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-06-01 05:17:36] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 3/659 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/651 variables, and 659 constraints, problems are : Problem set: 0 solved, 300 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 9/9 constraints]
After SMT, in 34268ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 34271ms
[2024-06-01 05:17:40] [INFO ] Invariant cache hit.
[2024-06-01 05:17:40] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-01 05:17:40] [INFO ] Invariant cache hit.
[2024-06-01 05:17:40] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-06-01 05:17:40] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-06-01 05:17:40] [INFO ] Invariant cache hit.
[2024-06-01 05:17:40] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/651 variables, and 350 constraints, problems are : Problem set: 0 solved, 300 unsolved in 14403 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 300/650 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:17:59] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 05:17:59] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 05:18:02] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 05:18:02] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 05:18:02] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 05:18:02] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 6/656 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:18:11] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-06-01 05:18:11] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 05:18:11] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 3/659 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:18:16] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/650 variables, 1/660 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/651 variables, and 660 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30007 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 10/10 constraints]
After SMT, in 44448ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 44451ms
Finished structural reductions in LTL mode , in 1 iterations and 78917 ms. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0050-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0050-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0050-LTLFireability-14 finished in 79010 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(G(X((!X((X(p0)||p0)) U p1))))))'
Support contains 2 out of 250 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 250/250 places, 401/401 transitions.
Applied a total of 0 rules in 3 ms. Remains 250 /250 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Running 300 sub problems to find dead transitions.
[2024-06-01 05:18:24] [INFO ] Invariant cache hit.
[2024-06-01 05:18:24] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/651 variables, and 350 constraints, problems are : Problem set: 0 solved, 300 unsolved in 14085 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 300/650 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:18:43] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 05:18:43] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 05:18:46] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 05:18:46] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 05:18:46] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 05:18:46] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 6/656 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:18:55] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-06-01 05:18:55] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 05:18:55] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 3/659 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/651 variables, and 659 constraints, problems are : Problem set: 0 solved, 300 unsolved in 20021 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 9/9 constraints]
After SMT, in 34144ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 34147ms
[2024-06-01 05:18:58] [INFO ] Invariant cache hit.
[2024-06-01 05:18:58] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-06-01 05:18:58] [INFO ] Invariant cache hit.
[2024-06-01 05:18:59] [INFO ] State equation strengthened by 50 read => feed constraints.
[2024-06-01 05:18:59] [INFO ] Implicit Places using invariants and state equation in 131 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
Running 300 sub problems to find dead transitions.
[2024-06-01 05:18:59] [INFO ] Invariant cache hit.
[2024-06-01 05:18:59] [INFO ] State equation strengthened by 50 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 6 (OVERLAPS) 0/650 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
No progress, stopping.
After SMT solving in domain Real declared 650/651 variables, and 350 constraints, problems are : Problem set: 0 solved, 300 unsolved in 14071 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 300 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/200 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 1 (OVERLAPS) 50/250 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/250 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 3 (OVERLAPS) 400/650 variables, 250/300 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/650 variables, 50/350 constraints. Problems are: Problem set: 0 solved, 300 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/650 variables, 300/650 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:19:17] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 05:19:17] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 05:19:20] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-01 05:19:20] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 05:19:20] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 05:19:20] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/650 variables, 6/656 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:19:30] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-06-01 05:19:30] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 05:19:30] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/650 variables, 3/659 constraints. Problems are: Problem set: 0 solved, 300 unsolved
[2024-06-01 05:19:35] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/650 variables, 1/660 constraints. Problems are: Problem set: 0 solved, 300 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 650/651 variables, and 660 constraints, problems are : Problem set: 0 solved, 300 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 50/50 constraints, State Equation: 250/250 constraints, ReadFeed: 50/50 constraints, PredecessorRefiner: 300/300 constraints, Known Traps: 10/10 constraints]
After SMT, in 44123ms problems are : Problem set: 0 solved, 300 unsolved
Search for dead transitions found 0 dead transitions in 44128ms
Finished structural reductions in LTL mode , in 1 iterations and 78464 ms. Remains : 250/250 places, 401/401 transitions.
Stuttering acceptance computed with spot in 117 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : JoinFreeModules-PT-0050-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0050-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0050-LTLFireability-15 finished in 78598 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
[2024-06-01 05:19:43] [INFO ] Flatten gal took : 16 ms
[2024-06-01 05:19:43] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 05:19:43] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 250 places, 401 transitions and 1150 arcs took 4 ms.
Total runtime 1038351 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA JoinFreeModules-PT-0050-LTLFireability-06 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
BK_STOP 1717219197959
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name JoinFreeModules-PT-0050-LTLFireability-06
ltl formula formula --ltl=/tmp/1781/ltl_0_
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 250 places, 401 transitions and 1150 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.020 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1781/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1781/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1781/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1781/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 451 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 251, there are 414 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~2500 levels ~10000 states ~976284 transitions
pnml2lts-mc( 2/ 4): ~5000 levels ~20000 states ~1947044 transitions
pnml2lts-mc( 2/ 4): ~10000 levels ~40000 states ~3873844 transitions
pnml2lts-mc( 2/ 4): ~20000 levels ~80000 states ~7739096 transitions
pnml2lts-mc( 2/ 4): ~40000 levels ~160000 states ~15525912 transitions
pnml2lts-mc( 2/ 4): ~80000 levels ~320000 states ~30949852 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 343259
pnml2lts-mc( 0/ 4): unique transitions count: 41234779
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 709354
pnml2lts-mc( 0/ 4): - claim success count: 343262
pnml2lts-mc( 0/ 4): - cum. max stack depth: 343262
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 343262 states 41235029 transitions, fanout: 120.127
pnml2lts-mc( 0/ 4): Total exploration time 13.810 sec (12.870 sec minimum, 13.322 sec on average)
pnml2lts-mc( 0/ 4): States per second: 24856, Transitions per second: 2985882
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 306.3MB, 9.6 B/state, compr.: 1.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/78.0%
pnml2lts-mc( 0/ 4): Stored 404 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 306.3MB (~256.0MB paged-in)
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="JoinFreeModules-PT-0050"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is JoinFreeModules-PT-0050, 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 r504-tall-171649611900044"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0050.tgz
mv JoinFreeModules-PT-0050 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 ;