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-171649611900051.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-0100, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r504-tall-171649611900051
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 688K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:02 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 8.8K Apr 11 14:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Apr 11 14:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Apr 11 14:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K Apr 11 14:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K 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 304K 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-0100-LTLCardinality-00
FORMULA_NAME JoinFreeModules-PT-0100-LTLCardinality-01
FORMULA_NAME JoinFreeModules-PT-0100-LTLCardinality-02
FORMULA_NAME JoinFreeModules-PT-0100-LTLCardinality-03
FORMULA_NAME JoinFreeModules-PT-0100-LTLCardinality-04
FORMULA_NAME JoinFreeModules-PT-0100-LTLCardinality-05
FORMULA_NAME JoinFreeModules-PT-0100-LTLCardinality-06
FORMULA_NAME JoinFreeModules-PT-0100-LTLCardinality-07
FORMULA_NAME JoinFreeModules-PT-0100-LTLCardinality-08
FORMULA_NAME JoinFreeModules-PT-0100-LTLCardinality-09
FORMULA_NAME JoinFreeModules-PT-0100-LTLCardinality-10
FORMULA_NAME JoinFreeModules-PT-0100-LTLCardinality-11
FORMULA_NAME JoinFreeModules-PT-0100-LTLCardinality-12
FORMULA_NAME JoinFreeModules-PT-0100-LTLCardinality-13
FORMULA_NAME JoinFreeModules-PT-0100-LTLCardinality-14
FORMULA_NAME JoinFreeModules-PT-0100-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717218334101

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-0100
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:05:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 05:05:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:05:35] [INFO ] Load time of PNML (sax parser for PT used): 107 ms
[2024-06-01 05:05:35] [INFO ] Transformed 501 places.
[2024-06-01 05:05:35] [INFO ] Transformed 801 transitions.
[2024-06-01 05:05:35] [INFO ] Parsed PT model containing 501 places and 801 transitions and 2302 arcs in 207 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-0100-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0100-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0100-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0100-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 56 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
// Phase 1: matrix 801 rows 500 cols
[2024-06-01 05:05:35] [INFO ] Computed 100 invariants in 24 ms
[2024-06-01 05:05:35] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20232ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20261ms
[2024-06-01 05:05:55] [INFO ] Invariant cache hit.
[2024-06-01 05:05:56] [INFO ] Implicit Places using invariants in 112 ms returned []
[2024-06-01 05:05:56] [INFO ] Invariant cache hit.
[2024-06-01 05:05:56] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-01 05:05:56] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 465 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2024-06-01 05:05:56] [INFO ] Invariant cache hit.
[2024-06-01 05:05:56] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 05:06:40] [INFO ] Deduced a trap composed of 3 places in 45 ms of which 13 ms to minimize.
[2024-06-01 05:06:40] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 05:06:40] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-06-01 05:06:40] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
[2024-06-01 05:06:46] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 3 ms to minimize.
[2024-06-01 05:06:46] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1306 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 6/6 constraints]
After SMT, in 60181ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60188ms
Finished structural reductions in LTL mode , in 1 iterations and 81017 ms. Remains : 500/500 places, 801/801 transitions.
Support contains 45 out of 500 places after structural reductions.
[2024-06-01 05:06:56] [INFO ] Flatten gal took : 105 ms
[2024-06-01 05:06:56] [INFO ] Flatten gal took : 56 ms
[2024-06-01 05:06:57] [INFO ] Input system was already deterministic with 801 transitions.
Support contains 41 out of 500 places (down from 45) after GAL structural reductions.
RANDOM walk for 40149 steps (8 resets) in 767 ms. (52 steps per ms) remains 4/24 properties
BEST_FIRST walk for 40004 steps (8 resets) in 656 ms. (60 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 370 ms. (107 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 390 ms. (102 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 456 ms. (87 steps per ms) remains 2/2 properties
[2024-06-01 05:06:58] [INFO ] Invariant cache hit.
[2024-06-01 05:06:58] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 24/39 variables, 15/18 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/39 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/1301 variables, and 21 constraints, problems are : Problem set: 0 solved, 2 unsolved in 282 ms.
Refiners :[Positive P Invariants (semi-flows): 3/100 constraints, State Equation: 15/500 constraints, ReadFeed: 3/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 12/15 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 05:06:58] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 24/39 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/39 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/1301 variables, and 24 constraints, problems are : Problem set: 0 solved, 2 unsolved in 133 ms.
Refiners :[Positive P Invariants (semi-flows): 3/100 constraints, State Equation: 15/500 constraints, ReadFeed: 3/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 437ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 150 steps, including 0 resets, run visited all 2 properties in 3 ms. (steps per millisecond=50 )
Parikh walk visited 2 properties in 7 ms.
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' '!(G(F(((X(X(p1))&&F(p2))||p0))))'
Support contains 5 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 53 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2024-06-01 05:06:58] [INFO ] Invariant cache hit.
[2024-06-01 05:06:58] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20157ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20164ms
[2024-06-01 05:07:19] [INFO ] Invariant cache hit.
[2024-06-01 05:07:19] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-01 05:07:19] [INFO ] Invariant cache hit.
[2024-06-01 05:07:19] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-01 05:07:19] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2024-06-01 05:07:19] [INFO ] Redundant transitions in 43 ms returned []
Running 600 sub problems to find dead transitions.
[2024-06-01 05:07:19] [INFO ] Invariant cache hit.
[2024-06-01 05:07:19] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 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 Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 05:08:03] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
[2024-06-01 05:08:03] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 05:08:03] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-06-01 05:08:03] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 05:08:08] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2024-06-01 05:08:08] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 05:08:19] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-06-01 05:08:19] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-06-01 05:08:19] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1309 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 9/9 constraints]
After SMT, in 60126ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60132ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 80789 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 357 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLCardinality-00
Product exploration explored 100000 steps with 1 reset in 5128 ms.
Product exploration explored 100000 steps with 1 reset in 5344 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 9 factoid took 165 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 154 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 6 to 4
RANDOM walk for 40083 steps (8 resets) in 387 ms. (103 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 386 ms. (103 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 467 ms. (85 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 317 ms. (125 steps per ms) remains 3/3 properties
[2024-06-01 05:08:31] [INFO ] Invariant cache hit.
[2024-06-01 05:08:31] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 20/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 40/65 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/1301 variables, and 35 constraints, problems are : Problem set: 0 solved, 3 unsolved in 61 ms.
Refiners :[Positive P Invariants (semi-flows): 5/100 constraints, State Equation: 25/500 constraints, ReadFeed: 5/100 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 20/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 05:08:31] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 05:08:31] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 05:08:31] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 05:08:31] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
[2024-06-01 05:08:31] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 40/65 variables, 25/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 5/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 3/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/65 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/1301 variables, and 43 constraints, problems are : Problem set: 0 solved, 3 unsolved in 204 ms.
Refiners :[Positive P Invariants (semi-flows): 5/100 constraints, State Equation: 25/500 constraints, ReadFeed: 5/100 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints]
After SMT, in 278ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 268 steps, including 0 resets, run visited all 3 properties in 10 ms. (steps per millisecond=26 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 12 ms.
Knowledge obtained : [(AND p0 p2 (NOT p1)), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT (OR p2 p0))), (F p1), (F (NOT p2)), (F (NOT (OR p1 p2 p0))), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 9 factoid took 419 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 141 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 129 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 29 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2024-06-01 05:08:32] [INFO ] Invariant cache hit.
[2024-06-01 05:08:32] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20100ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20108ms
[2024-06-01 05:08:52] [INFO ] Invariant cache hit.
[2024-06-01 05:08:52] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-01 05:08:52] [INFO ] Invariant cache hit.
[2024-06-01 05:08:53] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-01 05:08:53] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 398 ms to find 0 implicit places.
[2024-06-01 05:08:53] [INFO ] Redundant transitions in 7 ms returned []
Running 600 sub problems to find dead transitions.
[2024-06-01 05:08:53] [INFO ] Invariant cache hit.
[2024-06-01 05:08:53] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 05:09:36] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
[2024-06-01 05:09:36] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-06-01 05:09:36] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 05:09:36] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 05:09:41] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 05:09:41] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 05:09:53] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1307 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 7/7 constraints]
After SMT, in 60172ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60177ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 80729 ms. Remains : 500/500 places, 801/801 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 p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 11 factoid took 294 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 146 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 6 to 4
RANDOM walk for 40094 steps (8 resets) in 233 ms. (171 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT (OR p2 p0))), (F p1), (F (NOT p2)), (F (NOT (OR p1 p2 p0))), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 11 factoid took 476 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 154 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 145 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2 reset in 4445 ms.
Product exploration explored 100000 steps with 2 reset in 4735 ms.
Support contains 5 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 22 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2024-06-01 05:10:04] [INFO ] Invariant cache hit.
[2024-06-01 05:10:04] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20092ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20097ms
[2024-06-01 05:10:24] [INFO ] Invariant cache hit.
[2024-06-01 05:10:24] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-01 05:10:24] [INFO ] Invariant cache hit.
[2024-06-01 05:10:24] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-01 05:10:24] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2024-06-01 05:10:24] [INFO ] Redundant transitions in 7 ms returned []
Running 600 sub problems to find dead transitions.
[2024-06-01 05:10:24] [INFO ] Invariant cache hit.
[2024-06-01 05:10:24] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 05:11:08] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-06-01 05:11:08] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-06-01 05:11:08] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 05:11:08] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 05:11:13] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-06-01 05:11:13] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-06-01 05:11:24] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-06-01 05:11:24] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-01 05:11:24] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-01 05:11:24] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1310 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 10/10 constraints]
After SMT, in 60127ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60132ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 80645 ms. Remains : 500/500 places, 801/801 transitions.
Treatment of property JoinFreeModules-PT-0100-LTLCardinality-00 finished in 266143 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 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 20 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2024-06-01 05:11:25] [INFO ] Invariant cache hit.
[2024-06-01 05:11:25] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20103ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20108ms
[2024-06-01 05:11:45] [INFO ] Invariant cache hit.
[2024-06-01 05:11:45] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-01 05:11:45] [INFO ] Invariant cache hit.
[2024-06-01 05:11:45] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-01 05:11:45] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2024-06-01 05:11:45] [INFO ] Redundant transitions in 13 ms returned []
Running 600 sub problems to find dead transitions.
[2024-06-01 05:11:45] [INFO ] Invariant cache hit.
[2024-06-01 05:11:45] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 05:12:29] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 05:12:29] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-06-01 05:12:29] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 05:12:29] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 05:12:34] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-06-01 05:12:34] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1306 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 6/6 constraints]
After SMT, in 60131ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60142ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 80684 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLCardinality-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0100-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0100-LTLCardinality-02 finished in 80769 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 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 5 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2024-06-01 05:12:45] [INFO ] Invariant cache hit.
[2024-06-01 05:12:45] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20078ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20083ms
[2024-06-01 05:13:05] [INFO ] Invariant cache hit.
[2024-06-01 05:13:05] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-01 05:13:05] [INFO ] Invariant cache hit.
[2024-06-01 05:13:06] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-01 05:13:06] [INFO ] Implicit Places using invariants and state equation in 288 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2024-06-01 05:13:06] [INFO ] Invariant cache hit.
[2024-06-01 05:13:06] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 5.0)
(s1 89.0)
(s2 0.0)
(s3 4.0)
(s4 5.0)
(s5 5.0)
(s6 89.0)
(s7 0.0)
(s8 4.0)
(s9 5.0)
(s10 5.0)
(s11 2.0)
(s12 0.0)
(s13 48.0)
(s14 48.0)
(s15 5.0)
(s16 2.0)
(s17 87.0)
(s18 4.0)
(s19 5.0)
(s20 5.0)
(s21 2.0)
(s22 0.0)
(s23 4.0)
(s24 92.0)
(s25 5.0)
(s26 2.0)
(s27 0.0)
(s28 4.0)
(s29 92.0)
(s30 5.0)
(s31 2.0)
(s32 0.0)
(s33 4.0)
(s34 92.0)
(s35 5.0)
(s36 2.0)
(s37 86.0)
(s38 5.0)
(s39 5.0)
(s40 5.0)
(s41 89.0)
(s42 0.0)
(s43 4.0)
(s44 5.0)
(s45 5.0)
(s46 2.0)
(s47 87.0)
(s48 4.0)
(s49 5.0)
(s50 5.0)
(s51 89.0)
(s52 0.0)
(s53 4.0)
(s54 5.0)
(s55 5.0)
(s56 2.0)
(s57 87.0)
(s58 4.0)
(s59 5.0)
(s60 5.0)
(s61 2.0)
(s62 0.0)
(s63 4.0)
(s64 92.0)
(s65 5.0)
(s66 2.0)
(s67 0.0)
(s68 4.0)
(s69 92.0)
(s70 5.0)
(s71 2.0)
(s72 86.0)
(s73 5.0)
(s74 5.0)
(s75 5.0)
(s76 2.0)
(s77 87.0)
(s78 4.0)
(s79 5.0)
(s80 5.0)
(s81 89.0)
(s82 0.0)
(s83 4.0)
(s84 5.0)
(s85 5.0)
(s86 2.0)
(s87 0.0)
(s88 4.0)
(s89 92.0)
(s90 5.0)
(s91 87.0)
(s92 0.0)
(s93 4.0)
(s94 7.0)
(s95 5.0)
(s96 2.0)
(s97 86.0)
(s98 5.0)
(s99 5.0)
(s100 5.0)
(s101 2.0)
(s102 0.0)
(s103 4.0)
(s104 92.0)
(s105 5.0)
(s106 2.0)
(s107 86.0)
(s108 5.0)
(s109 5.0)
(s110 5.0)
(s111 89.0)
(s112 0.0)
(s113 4.0)
(s114 5.0)
(s115 5.0)
(s116 2.0)
(s117 86.0)
(s118 5.0)
(s119 5.0)
(s120 5.0)
(s121 2.0)
(s122 86.0)
(s123 5.0)
(s124 5.0)
(s125 5.0)
(s126 89.0)
(s127 0.0)
(s128 4.0)
(s129 5.0)
(s130 5.0)
(s131 89.0)
(s132 0.0)
(s133 4.0)
(s134 5.0)
(s135 5.0)
(s136 89.0)
(s137 0.0)
(s138 4.0)
(s139 5.0)
(s140 5.0)
(s141 2.0)
(s142 0.0)
(s143 4.0)
(s144 92.0)
(s145 5.0)
(s146 2.0)
(s147 0.0)
(s148 48.0)
(s149 48.0)
(s150 5.0)
(s151 2.0)
(s152 0.0)
(s153 4.0)
(s154 92.0)
(s155 5.0)
(s156 88.0)
(s157 0.0)
(s158 5.0)
(s159 5.0)
(s160 5.0)
(s161 2.0)
(s162 86.0)
(s163 5.0)
(s164 5.0)
(s165 5.0)
(s166 2.0)
(s167 87.0)
(s168 4.0)
(s169 5.0)
(s170 5.0)
(s171 2.0)
(s172 87.0)
(s173 4.0)
(s174 5.0)
(s175 5.0)
(s176 89.0)
(s177 0.0)
(s178 4.0)
(s179 5.0)
(s180 5.0)
(s181 89.0)
(s182 0.0)
(s183 4.0)
(s184 5.0)
(s185 5.0)
(s186 2.0)
(s187 86.0)
(s188 timeout
5.0)
(s189 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 05:13:50] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-06-01 05:13:50] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 05:13:50] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-06-01 05:13:50] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 05:13:55] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-06-01 05:13:55] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1306 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 6/6 constraints]
After SMT, in 60127ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60132ms
Finished structural reductions in LTL mode , in 1 iterations and 80610 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLCardinality-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0100-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0100-LTLCardinality-03 finished in 80736 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 6 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 19 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2024-06-01 05:14:06] [INFO ] Invariant cache hit.
[2024-06-01 05:14:06] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20095ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20100ms
[2024-06-01 05:14:26] [INFO ] Invariant cache hit.
[2024-06-01 05:14:26] [INFO ] Implicit Places using invariants in 104 ms returned []
[2024-06-01 05:14:26] [INFO ] Invariant cache hit.
[2024-06-01 05:14:26] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-01 05:14:26] [INFO ] Implicit Places using invariants and state equation in 254 ms returned []
Implicit Place search using SMT with State Equation took 361 ms to find 0 implicit places.
[2024-06-01 05:14:26] [INFO ] Redundant transitions in 7 ms returned []
Running 600 sub problems to find dead transitions.
[2024-06-01 05:14:27] [INFO ] Invariant cache hit.
[2024-06-01 05:14:27] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 05:15:10] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 9 ms to minimize.
[2024-06-01 05:15:10] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-01 05:15:10] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-01 05:15:11] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-06-01 05:15:16] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-06-01 05:15:16] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1306 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 6/6 constraints]
After SMT, in 60114ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60120ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 80614 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLCardinality-06
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-0100-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0100-LTLCardinality-06 finished in 80789 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 2 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 10 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2024-06-01 05:15:27] [INFO ] Invariant cache hit.
[2024-06-01 05:15:27] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20106ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20110ms
[2024-06-01 05:15:47] [INFO ] Invariant cache hit.
[2024-06-01 05:15:47] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-01 05:15:47] [INFO ] Invariant cache hit.
[2024-06-01 05:15:47] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-01 05:15:47] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
Running 600 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 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 05:16:31] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 6 ms to minimize.
[2024-06-01 05:16:31] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-06-01 05:16:31] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-06-01 05:16:31] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 05:16:36] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 13 ms to minimize.
[2024-06-01 05:16:36] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 05:16:47] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 05:16:47] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 05:16:47] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 05:16:47] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1310 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 10/10 constraints]
After SMT, in 60119ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60124ms
Finished structural reductions in LTL mode , in 1 iterations and 80648 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 289 steps with 0 reset in 6 ms.
FORMULA JoinFreeModules-PT-0100-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0100-LTLCardinality-08 finished in 80747 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(F(p0))||G((p1||G(p2))))))'
Support contains 6 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 9 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2024-06-01 05:16:48] [INFO ] Invariant cache hit.
[2024-06-01 05:16:48] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20081ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20086ms
[2024-06-01 05:17:08] [INFO ] Invariant cache hit.
[2024-06-01 05:17:08] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-01 05:17:08] [INFO ] Invariant cache hit.
[2024-06-01 05:17:08] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-01 05:17:08] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 396 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2024-06-01 05:17:08] [INFO ] Invariant cache hit.
[2024-06-01 05:17:08] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 05:17:52] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-06-01 05:17:52] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-01 05:17:52] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 05:17:52] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
[2024-06-01 05:17:57] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 05:17:57] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 05:18:07] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-06-01 05:18:08] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 05:18:08] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-06-01 05:18:08] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
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 1300/1301 variables, and 1310 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 10/10 constraints]
After SMT, in 60138ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60145ms
Finished structural reductions in LTL mode , in 1 iterations and 80640 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 176 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLCardinality-09
Product exploration explored 100000 steps with 0 reset in 4150 ms.
Product exploration explored 100000 steps with 0 reset in 4472 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X p1), (X (NOT (AND (NOT p1) p2))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 187 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40124 steps (8 resets) in 436 ms. (91 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 299 ms. (133 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 276 ms. (144 steps per ms) remains 1/3 properties
[2024-06-01 05:18:18] [INFO ] Invariant cache hit.
[2024-06-01 05:18:18] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 48/78 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/1301 variables, and 42 constraints, problems are : Problem set: 0 solved, 1 unsolved in 39 ms.
Refiners :[Positive P Invariants (semi-flows): 6/100 constraints, State Equation: 30/500 constraints, ReadFeed: 6/100 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 05:18:18] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
[2024-06-01 05:18:18] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 48/78 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 6/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/78 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/1301 variables, and 45 constraints, problems are : Problem set: 0 solved, 1 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 6/100 constraints, State Equation: 30/500 constraints, ReadFeed: 6/100 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 193ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 441 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=63 )
Parikh walk visited 1 properties in 6 ms.
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X p1), (X (NOT (AND (NOT p1) p2))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT (OR p2 p0))), (F (NOT (OR p2 p0 p1))), (F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p2 p1))), (F (NOT (OR (NOT p2) p1)))]
Knowledge based reduction with 13 factoid took 460 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 18 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2024-06-01 05:18:19] [INFO ] Invariant cache hit.
[2024-06-01 05:18:19] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20090ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20094ms
[2024-06-01 05:18:39] [INFO ] Invariant cache hit.
[2024-06-01 05:18:39] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-01 05:18:39] [INFO ] Invariant cache hit.
[2024-06-01 05:18:39] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-01 05:18:39] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
[2024-06-01 05:18:39] [INFO ] Redundant transitions in 11 ms returned []
Running 600 sub problems to find dead transitions.
[2024-06-01 05:18:39] [INFO ] Invariant cache hit.
[2024-06-01 05:18:39] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 05:19:23] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 2 ms to minimize.
[2024-06-01 05:19:23] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-06-01 05:19:23] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-06-01 05:19:23] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 05:19:28] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-06-01 05:19:28] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-06-01 05:19:39] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-06-01 05:19:39] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-06-01 05:19:39] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 05:19:39] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1310 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 10/10 constraints]
After SMT, in 60116ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60122ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 80600 ms. Remains : 500/500 places, 801/801 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 p1 p2 p0), (X p2), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 14 factoid took 234 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40164 steps (8 resets) in 358 ms. (111 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 294 ms. (135 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 251 ms. (158 steps per ms) remains 1/2 properties
[2024-06-01 05:19:40] [INFO ] Invariant cache hit.
[2024-06-01 05:19:40] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 48/78 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/1301 variables, and 42 constraints, problems are : Problem set: 0 solved, 1 unsolved in 43 ms.
Refiners :[Positive P Invariants (semi-flows): 6/100 constraints, State Equation: 30/500 constraints, ReadFeed: 6/100 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 05:19:40] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 05:19:41] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 48/78 variables, 30/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 6/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/78 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/1301 variables, and 45 constraints, problems are : Problem set: 0 solved, 1 unsolved in 120 ms.
Refiners :[Positive P Invariants (semi-flows): 6/100 constraints, State Equation: 30/500 constraints, ReadFeed: 6/100 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 188ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 512 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=102 )
Parikh walk visited 1 properties in 4 ms.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT (OR p2 p0))), (F (NOT (OR p2 p0 p1))), (F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p2 p1))), (F (NOT (OR (NOT p2) p1)))]
Knowledge based reduction with 14 factoid took 392 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 4074 ms.
Product exploration explored 100000 steps with 0 reset in 4354 ms.
Support contains 6 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 13 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2024-06-01 05:19:50] [INFO ] Invariant cache hit.
[2024-06-01 05:19:50] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
(s385 5.0timeout
^^^^^^^^^^
(error "Invalid token: 5.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 5.0)
(s1 89.0)
(s2 0.0)
(s3 4.0)
(s4 5.0)
(s5 5.0)
(s6 2.0)
(s7 0.0)
(s8 91.0)
(s9 5.0)
(s10 5.0)
(s11 2.0)
(s12 0.0)
(s13 91.0)
(s14 5.0)
(s15 5.0)
(s16 2.0)
(s17 87.0)
(s18 4.0)
(s19 5.0)
(s20 5.0)
(s21 2.0)
(s22 0.0)
(s23 4.0)
(s24 92.0)
(s25 5.0)
(s26 2.0)
(s27 0.0)
(s28 4.0)
(s29 92.0)
(s30 5.0)
(s31 2.0)
(s32 0.0)
(s33 4.0)
(s34 92.0)
(s35 5.0)
(s36 2.0)
(s37 0.0)
(s38 91.0)
(s39 5.0)
(s40 5.0)
(s41 89.0)
(s42 0.0)
(s43 4.0)
(s44 5.0)
(s45 92.0)
(s46 2.0)
(s47 0.0)
(s48 4.0)
(s49 5.0)
(s50 5.0)
(s51 89.0)
(s52 0.0)
(s53 4.0)
(s54 5.0)
(s55 5.0)
(s56 2.0)
(s57 87.0)
(s58 4.0)
(s59 5.0)
(s60 5.0)
(s61 2.0)
(s62 0.0)
(s63 4.0)
(s64 92.0)
(s65 5.0)
(s66 2.0)
(s67 0.0)
(s68 4.0)
(s69 92.0)
(s70 92.0)
(s71 2.0)
(s72 0.0)
(s73 4.0)
(s74 5.0)
(s75 92.0)
(s76 2.0)
(s77 0.0)
(s78 4.0)
(s79 5.0)
(s80 5.0)
(s81 89.0)
(s82 0.0)
(s83 4.0)
(s84 5.0)
(s85 5.0)
(s86 2.0)
(s87 0.0)
(s88 4.0)
(s89 92.0)
(s90 5.0)
(s91 87.0)
(s92 0.0)
(s93 4.0)
(s94 7.0)
(s95 92.0)
(s96 2.0)
(s97 0.0)
(s98 4.0)
(s99 5.0)
(s100 5.0)
(s101 2.0)
(s102 0.0)
(s103 4.0)
(s104 92.0)
(s105 92.0)
(s106 2.0)
(s107 0.0)
(s108 4.0)
(s109 5.0)
(s110 92.0)
(s111 2.0)
(s112 0.0)
(s113 4.0)
(s114 5.0)
(s115 5.0)
(s116 2.0)
(s117 87.0)
(s118 4.0)
(s119 5.0)
(s120 5.0)
(s121 2.0)
(s122 87.0)
(s123 4.0)
(s124 5.0)
(s125 5.0)
(s126 2.0)
(s127 0.0)
(s128 91.0)
(s129 5.0)
(s130 5.0)
(s131 89.0)
(s132 0.0)
(s133 4.0)
(s134 5.0)
(s135 5.0)
(s136 89.0)
(s137 0.0)
(s138 4.0)
(s139 5.0)
(s140 5.0)
(s141 2.0)
(s142 0.0)
(s143 4.0)
(s144 92.0)
(s145 5.0)
(s146 2.0)
(s147 0.0)
(s148 91.0)
(s149 5.0)
(s150 5.0)
(s151 2.0)
(s152 0.0)
(s153 4.0)
(s154 92.0)
(s155 92.0)
(s156 2.0)
(s157 0.0)
(s158 4.0)
(s159 5.0)
(s160 5.0)
(s161 2.0)
(s162 87.0)
(s163 4.0)
(s164 5.0)
(s165 5.0)
(s166 2.0)
(s167 0.0)
(s168 91.0)
(s169 5.0)
(s170 5.0)
(s171 2.0)
(s172 87.0)
(s173 4.0)
(s174 5.0)
(s175 5.0)
(s176 89.0)
(s177 0.0)
(s178 4.0)
(s179 5.0)
(s180 5.0)
(s181 89.0)
(s182 0.0)
(s183 4.0)
(s184 5.0)
(s185 5.0)
(s186 2.0)
(s187 0.0)
(s188 91.0)
(s189 5.0)
(s190 5.0)
(s191 2.0)
(s192 0.0)
(s193 91.0)
(s194 5.0)
(s195 5.0)
(s196 89.0)
(s197 0.0)
(s198 4.0)
(s199 5.0)
(s200 5.0)
(s201 2.0)
(s202 87.0)
(s203 4.0)
(s204 5.0)
(s205 5.0)
(s206 2.0)
(s207 87.0)
(s208 4.0)
(s209 5.0)
(s210 5.0)
(s211 2.0)
(s212 0.0)
(s213 4.0)
(s214 92.0)
(s215 5.0)
(s216 89.0)
(s217 0.0)
(s218 4.0)
(s219 5.0)
(s220 5.0)
(s221 2.0)
(s222 0.0)
(s223 91.0)
(s224 5.0)
(s225 5.0)
(s226 2.0)
(s227 87.0)
(s228 4.0)
(s229 5.0)
(s230 5.0)
(s231 89.0)
(s232 0.0)
(s233 4.0)
(s234 5.0)
(s235 5.0)
(s236 87.0)
(s237 0.0)
(s238 4.0)
(s239 7.0)
(s240 5.0)
(s241 2.0)
(s242 0.0)
(s243 4.0)
(s244 92.0)
(s245 5.0)
(s246 89.0)
(s247 0.0)
(s248 4.0)
(s249 5.0)
(s250 5.0)
(s251 89.0)
(s252 0.0)
(s253 4.0)
(s254 5.0)
(s255 5.0)
(s256 2.0)
(s257 87.0)
(s258 4.0)
(s259 5.0)
(s260 5.0)
(s261 87.0)
(s262 0.0)
(s263 4.0)
(s264 7.0)
(s265 5.0)
(s266 89.0)
(s267 0.0)
(s268 4.0)
(s269 5.0)
(s270 5.0)
(s271 2.0)
(s272 87.0)
(s273 4.0)
(s274 5.0)
(s275 5.0)
(s276 2.0)
(s277 87.0)
(s278 4.0)
(s279 5.0)
(s280 5.0)
(s281 2.0)
(s282 87.0)
(s283 4.0)
(s284 5.0)
(s285 5.0)
(s286 2.0)
(s287 0.0)
(s288 91.0)
(s289 5.0)
(s290 5.0)
(s291 87.0)
(s292 0.0)
(s293 4.0)
(s294 7.0)
(s295 5.0)
(s296 2.0)
(s297 0.0)
(s298 4.0)
(s299 92.0)
(s300 5.0)
(s301 2.0)
(s302 87.0)
(s303 4.0)
(s304 5.0)
(s305 5.0)
(s306 2.0)
(s307 87.0)
(s308 4.0)
(s309 5.0)
(s310 5.0)
(s311 2.0)
(s312 87.0)
(s313 4.0)
(s314 5.0)
(s315 5.0)
(s316 89.0)
(s317 0.0)
(s318 4.0)
(s319 5.0)
(s320 5.0)
(s321 2.0)
(s322 87.0)
(s323 4.0)
(s324 5.0)
(s325 5.0)
(s326 2.0)
(s327 0.0)
(s328 91.0)
(s329 5.0)
(s330 92.0)
(s331 2.0)
(s332 0.0)
(s333 4.0)
(s334 5.0)
(s335 5.0)
(s336 2.0)
(s337 0.0)
(s338 4.0)
(s339 92.0)
(s340 5.0)
(s341 2.0)
(s342 87.0)
(s343 4.0)
(s344 5.0)
(s345 5.0)
(s346 2.0)
(s347 87.0)
(s348 4.0)
(s349 5.0)
(s350 92.0)
(s351 2.0)
(s352 0.0)
(s353 4.0)
(s354 5.0)
(s355 5.0)
(s356 89.0)
(s357 0.0)
(s358 4.0)
(s359 5.0)
(s360 92.0)
(s361 2.0)
(s362 0.0)
(s363 4.0)
(s364 5.0)
(s365 5.0)
(s366 2.0)
(s367 0.0)
(s368 4.0)
(s369 92.0)
(s370 5.0)
(s371 87.0)
(s372 0.0)
(s373 4.0)
(s374 7.0)
(s375 5.0)
(s376 2.0)
(s377 0.0)
(s378 4.0)
(s379 92.0)
(s380 92.0)
(s381 2.0)
(s382 0.0)
(s383 4.0)
(s384 5.0)
(s385 5.0timeout
)
(s386 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20095ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20100ms
[2024-06-01 05:20:10] [INFO ] Invariant cache hit.
[2024-06-01 05:20:10] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-01 05:20:10] [INFO ] Invariant cache hit.
[2024-06-01 05:20:10] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-01 05:20:10] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
[2024-06-01 05:20:10] [INFO ] Redundant transitions in 5 ms returned []
Running 600 sub problems to find dead transitions.
[2024-06-01 05:20:10] [INFO ] Invariant cache hit.
[2024-06-01 05:20:10] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 05:20:54] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-06-01 05:20:54] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-06-01 05:20:54] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-01 05:20:55] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 05:20:59] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-06-01 05:20:59] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1306 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 6/6 constraints]
After SMT, in 60111ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60116ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 80629 ms. Remains : 500/500 places, 801/801 transitions.
Treatment of property JoinFreeModules-PT-0100-LTLCardinality-09 finished in 262924 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(F(!p0))))))'
Support contains 1 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 4 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2024-06-01 05:21:10] [INFO ] Invariant cache hit.
[2024-06-01 05:21:10] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20085ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20092ms
[2024-06-01 05:21:31] [INFO ] Invariant cache hit.
[2024-06-01 05:21:31] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-01 05:21:31] [INFO ] Invariant cache hit.
[2024-06-01 05:21:31] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-01 05:21:31] [INFO ] Implicit Places using invariants and state equation in 274 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2024-06-01 05:21:31] [INFO ] Invariant cache hit.
[2024-06-01 05:21:31] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 05:22:15] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-06-01 05:22:15] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-06-01 05:22:15] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-06-01 05:22:15] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 05:22:20] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-06-01 05:22:20] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-06-01 05:22:31] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-06-01 05:22:31] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
[2024-06-01 05:22:31] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-06-01 05:22:31] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
SMT process timed out in 60150ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60156ms
Finished structural reductions in LTL mode , in 1 iterations and 80630 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 159 ms :[false, false, false, p0, p0]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLCardinality-10
Product exploration explored 100000 steps with 2 reset in 4091 ms.
Stack based approach found an accepted trace after 505 steps with 0 reset with depth 506 and stack size 506 in 13 ms.
FORMULA JoinFreeModules-PT-0100-LTLCardinality-10 FALSE TECHNIQUES STACK_TEST
Treatment of property JoinFreeModules-PT-0100-LTLCardinality-10 finished in 84937 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' '!((!(p0 U p1)&&F(G(!p0))&&F(!p0)))'
Support contains 3 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 19 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2024-06-01 05:22:35] [INFO ] Invariant cache hit.
[2024-06-01 05:22:35] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20085ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20091ms
[2024-06-01 05:22:56] [INFO ] Invariant cache hit.
[2024-06-01 05:22:56] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-01 05:22:56] [INFO ] Invariant cache hit.
[2024-06-01 05:22:56] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-01 05:22:56] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
[2024-06-01 05:22:56] [INFO ] Redundant transitions in 7 ms returned []
Running 600 sub problems to find dead transitions.
[2024-06-01 05:22:56] [INFO ] Invariant cache hit.
[2024-06-01 05:22:56] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 5.0)
(s1 89.0)
(s2 0.0)
(s3 4.0)
(s4 5.0)
(s5 5.0)
(s6 89.0)
(s7 0.0)
(s8 4.0)
(s9 5.0)
(s10 5.0)
(s11 2.0)
(s12 0.0)
(s13 48.0)
(s14 48.0)
(s15 5.0)
(s16 2.0)
(s17 87.0)
(s18 4.0)
(s19 5.0)
(s20 5.0)
(s21 2.0)
(s22 0.0)
(s23 4.0)
(s24 92.0)
(s25 5.0)
(s26 2.0)
(s27 0.0)
(s28 4.0)
(s29 92.0)
(s30 5.0)
(s31 2.0)
(s32 0.0)
(s33 4.0)
(s34 92.0)
(s35 5.0)
(s36 2.0)
(s37 86.0)
(s38 5.0)
(s39 5.0)
(s40 5.0)
(s41 89.0)
(s42 0.0)
(s43 4.0)
(s44 5.0)
(s45 5.0)
(s46 2.0)
(s47 87.0)
(s48 4.0)
(s49 5.0)
(s50 5.0)
(s51 89.0)
(s52 0.0)
(s53 4.0)
(s54 5.0)
(s55 5.0)
(s56 2.0)
(s57 87.0)
(s58 4.0)
(s59 5.0)
(s60 5.0)
(s61 2.0)
(s62 0.0)
(s63 4.0)
(s64 92.0)
(s65 5.0)
(s66 2.0)
(s67 0.0)
(s68 4.0)
(s69 92.0)
(s70 5.0)
(s71 2.0)
(s72 86.0)
(s73 5.0)
(s74 5.0)
(s75 5.0)
(s76 2.0)
(s77 87.0)
(s78 4.0)
(s79 5.0)
(s80 5.0)
(s81 89.0)
(s82 0.0)
(s83 4.0)
(s84 5.0)
(s85 5.0)
(s86 2.0)
(s87 0.0)
(s88 4.0)
(s89 92.0)
(s90 5.0)
(s91 87.0)
(s92 0.0)
(s93 4.0)
(s94 7.0)
(s95 5.0)
(s96 2.0)
(s97 86.0)
(s98 5.0)
(s99 5.0)
(s100 5.0)
(s101 2.0)
(s102 0.0)
(s103 4.0)
(s104 92.0)
(s105 5.0)
(s106 2.0)
(s107 86.0)
(s108 5.0)
(s109 5.0)
(s110 5.0)
(s111 89.0)
(s112 0.0)
(s113 4.0)
(s114 5.0)
(s115 5.0)
(s116 2.0)
(s117 86.0)
(s118 5.0)
(s119 5.0)
(s120 5.0)
(s121 2.0)
(s122 86.0)
(s123 5.0)
(s124 5.0)
(s125 5.0)
(s126 89.0)
(s127 0.0)
(s128 4.0)
(s129 5.0)
(s130 5.0)
(s131 89.0)
(s132 0.0)
(s133 4.0)
(s134 5.0)
(s135 5.0)
(s136 89.0)
(s137 0.0)
(s138 4.0)
(s139 5.0)
(s140 5.0)
(s141 2.0)
(s142 0.0)
(s143 4.0)
(s144 92.0)
(s145 5.0)
(s146 2.0)
(s147 0.0)
(s148 48.0)
(s149 48.0)
(s150 5.0)
(s151 2.0)
(s152 0.0)
(s153 4.0)
(s154 92.0)
(s155 5.0)
(s156 88.0)
(s157 0.0)
(s158 5.0)
(s159 5.0)
(s160 5.0)
(s161 2.0)
(s162 86.0)
(s163 5.0)
(s164 5.0)
(s165 5.0)
(s166 2.0)
(s167 87.0)
(s168 4.0)
(s169 5.0)
(s170 5.0)
(s171 2.0)
(s172 87.0)
(s173 4.0)
(s174 5.0)
(s175 5.0)
(s176 89.0)
(s177 0.0)
(s178 4.0)
(s179 5.0)
(s180 5.0)
(s181 89.0)
(s182 0.0)
(s183 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 05:23:40] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-06-01 05:23:40] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-06-01 05:23:40] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-01 05:23:40] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 0 ms to minimize.
[2024-06-01 05:23:45] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 0 ms to minimize.
[2024-06-01 05:23:45] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1306 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 6/6 constraints]
After SMT, in 60114ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60119ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 80654 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 147 ms :[(OR p0 p1), true, p1, p0]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLCardinality-11
Product exploration explored 100000 steps with 0 reset in 4071 ms.
Stack based approach found an accepted trace after 36593 steps with 0 reset with depth 36594 and stack size 36586 in 1692 ms.
FORMULA JoinFreeModules-PT-0100-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property JoinFreeModules-PT-0100-LTLCardinality-11 finished in 86597 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 U p1) U X(p0))||X((p1 U X(X(p2))))))))'
Support contains 6 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 8 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2024-06-01 05:24:02] [INFO ] Invariant cache hit.
[2024-06-01 05:24:02] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20095ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20100ms
[2024-06-01 05:24:22] [INFO ] Invariant cache hit.
[2024-06-01 05:24:22] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-01 05:24:22] [INFO ] Invariant cache hit.
[2024-06-01 05:24:23] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-01 05:24:23] [INFO ] Implicit Places using invariants and state equation in 296 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2024-06-01 05:24:23] [INFO ] Invariant cache hit.
[2024-06-01 05:24:23] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 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 Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 05:25:06] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-06-01 05:25:06] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-06-01 05:25:06] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-06-01 05:25:07] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 05:25:12] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-06-01 05:25:12] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1306 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 6/6 constraints]
After SMT, in 60120ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60126ms
Finished structural reductions in LTL mode , in 1 iterations and 80642 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 990 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2))]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLCardinality-12
Product exploration explored 100000 steps with 33352 reset in 1390 ms.
Product exploration explored 100000 steps with 33412 reset in 1492 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 227 ms. Reduced automaton from 19 states, 61 edges and 3 AP (stutter sensitive) to 19 states, 61 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 1000 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 15 to 14
RANDOM walk for 40145 steps (8 resets) in 277 ms. (144 steps per ms) remains 8/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 242 ms. (164 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 269 ms. (148 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 215 ms. (185 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 207 ms. (192 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 203 ms. (196 steps per ms) remains 8/8 properties
[2024-06-01 05:25:29] [INFO ] Invariant cache hit.
[2024-06-01 05:25:29] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 40/65 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/1301 variables, and 35 constraints, problems are : Problem set: 0 solved, 8 unsolved in 75 ms.
Refiners :[Positive P Invariants (semi-flows): 5/100 constraints, State Equation: 25/500 constraints, ReadFeed: 5/100 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 8 unsolved
[2024-06-01 05:25:29] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 40/65 variables, 25/31 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 8/44 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/65 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/1301 variables, and 44 constraints, problems are : Problem set: 0 solved, 8 unsolved in 218 ms.
Refiners :[Positive P Invariants (semi-flows): 5/100 constraints, State Equation: 25/500 constraints, ReadFeed: 5/100 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 1/1 constraints]
After SMT, in 301ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 4 different solutions.
Finished Parikh walk after 1640 steps, including 2 resets, run visited all 8 properties in 50 ms. (steps per millisecond=32 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 8 properties in 51 ms.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (OR p1 p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p2 p1))), (F (NOT (OR p0 p1))), (F (NOT (OR p2 (NOT p0)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (OR p2 (NOT p0)) (OR p2 (NOT p1))))), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT p0)), (F (NOT (OR p2 p0))), (F (NOT p2)), (F (NOT (OR p2 p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT (OR p2 (NOT p1))))]
Knowledge based reduction with 11 factoid took 896 ms. Reduced automaton from 19 states, 61 edges and 3 AP (stutter sensitive) to 19 states, 61 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 995 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 948 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 6 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 5 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2024-06-01 05:25:32] [INFO ] Invariant cache hit.
[2024-06-01 05:25:32] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20097ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20104ms
[2024-06-01 05:25:52] [INFO ] Invariant cache hit.
[2024-06-01 05:25:52] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-01 05:25:52] [INFO ] Invariant cache hit.
[2024-06-01 05:25:52] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-01 05:25:52] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2024-06-01 05:25:52] [INFO ] Invariant cache hit.
[2024-06-01 05:25:52] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 05:26:37] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 05:26:37] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 0 ms to minimize.
[2024-06-01 05:26:37] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-01 05:26:37] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-06-01 05:26:42] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-06-01 05:26:42] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1306 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 6/6 constraints]
After SMT, in 60128ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60133ms
Finished structural reductions in LTL mode , in 1 iterations and 80616 ms. Remains : 500/500 places, 801/801 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (OR p0 p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 225 ms. Reduced automaton from 19 states, 61 edges and 3 AP (stutter sensitive) to 19 states, 61 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 894 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Reduction of identical properties reduced properties to check from 15 to 14
RANDOM walk for 40125 steps (8 resets) in 305 ms. (131 steps per ms) remains 6/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 251 ms. (158 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 270 ms. (147 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 234 ms. (170 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 221 ms. (180 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 210 ms. (189 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 6/6 properties
[2024-06-01 05:26:54] [INFO ] Invariant cache hit.
[2024-06-01 05:26:54] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 40/65 variables, 25/30 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/65 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 65/1301 variables, and 35 constraints, problems are : Problem set: 0 solved, 6 unsolved in 68 ms.
Refiners :[Positive P Invariants (semi-flows): 5/100 constraints, State Equation: 25/500 constraints, ReadFeed: 5/100 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 19/25 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 6 unsolved
[2024-06-01 05:26:54] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-06-01 05:26:55] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
[2024-06-01 05:26:55] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 40/65 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 5/38 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 6/44 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/65 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 65/1301 variables, and 44 constraints, problems are : Problem set: 0 solved, 6 unsolved in 260 ms.
Refiners :[Positive P Invariants (semi-flows): 5/100 constraints, State Equation: 25/500 constraints, ReadFeed: 5/100 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 3/3 constraints]
After SMT, in 340ms problems are : Problem set: 0 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Finished Parikh walk after 566 steps, including 1 resets, run visited all 6 properties in 12 ms. (steps per millisecond=47 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 6 properties in 13 ms.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X p1)), (X (X (OR p0 p1)))]
False Knowledge obtained : [(F (NOT (OR p2 p1))), (F (NOT (OR p0 p1))), (F (NOT (OR p2 (NOT p0)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (OR p2 (NOT p0)) (OR p2 (NOT p1))))), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (OR p2 (NOT p0) p1))), (F (NOT p0)), (F (NOT (OR p2 p0))), (F (NOT p2)), (F (NOT (OR p2 p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT (OR p2 (NOT p1))))]
Knowledge based reduction with 11 factoid took 884 ms. Reduced automaton from 19 states, 61 edges and 3 AP (stutter sensitive) to 19 states, 61 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 960 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 994 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 887 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 33282 reset in 1386 ms.
Product exploration explored 100000 steps with 33422 reset in 1501 ms.
Support contains 6 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 9 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2024-06-01 05:27:02] [INFO ] Invariant cache hit.
[2024-06-01 05:27:02] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20093ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20100ms
[2024-06-01 05:27:22] [INFO ] Invariant cache hit.
[2024-06-01 05:27:22] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-06-01 05:27:22] [INFO ] Invariant cache hit.
[2024-06-01 05:27:22] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-01 05:27:22] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2024-06-01 05:27:22] [INFO ] Invariant cache hit.
[2024-06-01 05:27:22] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 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 Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 05:28:06] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-06-01 05:28:06] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 05:28:06] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
[2024-06-01 05:28:06] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 05:28:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-06-01 05:28:11] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1306 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 6/6 constraints]
After SMT, in 60133ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60138ms
Finished structural reductions in LTL mode , in 1 iterations and 80659 ms. Remains : 500/500 places, 801/801 transitions.
Treatment of property JoinFreeModules-PT-0100-LTLCardinality-12 finished in 260319 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)||X(G(p2)))))'
Support contains 5 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 6 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2024-06-01 05:28:22] [INFO ] Invariant cache hit.
[2024-06-01 05:28:22] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20093ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20097ms
[2024-06-01 05:28:42] [INFO ] Invariant cache hit.
[2024-06-01 05:28:43] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-01 05:28:43] [INFO ] Invariant cache hit.
[2024-06-01 05:28:43] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-01 05:28:43] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 391 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2024-06-01 05:28:43] [INFO ] Invariant cache hit.
[2024-06-01 05:28:43] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 05:29:27] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
[2024-06-01 05:29:27] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-06-01 05:29:27] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 05:29:27] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 05:29:32] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 05:29:32] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
[2024-06-01 05:29:43] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1307 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 7/7 constraints]
After SMT, in 60120ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60126ms
Finished structural reductions in LTL mode , in 1 iterations and 80623 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 195 ms :[true, (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 1478 steps with 12 reset in 42 ms.
FORMULA JoinFreeModules-PT-0100-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0100-LTLCardinality-13 finished in 80884 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||X(X(p1))))))'
Support contains 3 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 6 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2024-06-01 05:29:43] [INFO ] Invariant cache hit.
[2024-06-01 05:29:43] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20091ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20097ms
[2024-06-01 05:30:03] [INFO ] Invariant cache hit.
[2024-06-01 05:30:03] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-01 05:30:03] [INFO ] Invariant cache hit.
[2024-06-01 05:30:04] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-01 05:30:04] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2024-06-01 05:30:04] [INFO ] Invariant cache hit.
[2024-06-01 05:30:04] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 05:30:48] [INFO ] Deduced a trap composed of 3 places in 52 ms of which 1 ms to minimize.
[2024-06-01 05:30:48] [INFO ] Deduced a trap composed of 3 places in 30 ms of which 1 ms to minimize.
[2024-06-01 05:30:48] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 05:30:48] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 05:30:53] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 0 ms to minimize.
[2024-06-01 05:30:53] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1306 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 6/6 constraints]
After SMT, in 60124ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60128ms
Finished structural reductions in LTL mode , in 1 iterations and 80629 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLCardinality-14
Product exploration explored 100000 steps with 197 reset in 3440 ms.
Product exploration explored 100000 steps with 390 reset in 2518 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 151 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
RANDOM walk for 29839 steps (6 resets) in 232 ms. (128 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 198 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 158 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Support contains 3 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 8 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2024-06-01 05:31:11] [INFO ] Invariant cache hit.
[2024-06-01 05:31:11] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20082ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20087ms
[2024-06-01 05:31:31] [INFO ] Invariant cache hit.
[2024-06-01 05:31:31] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-01 05:31:31] [INFO ] Invariant cache hit.
[2024-06-01 05:31:32] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-01 05:31:32] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2024-06-01 05:31:32] [INFO ] Invariant cache hit.
[2024-06-01 05:31:32] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 05:32:15] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
[2024-06-01 05:32:15] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-06-01 05:32:15] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-06-01 05:32:16] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 05:32:20] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-01 05:32:20] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-06-01 05:32:32] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1307 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 7/7 constraints]
After SMT, in 60131ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60136ms
Finished structural reductions in LTL mode , in 1 iterations and 80607 ms. Remains : 500/500 places, 801/801 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 201 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
RANDOM walk for 40198 steps (8 resets) in 342 ms. (117 steps per ms) remains 1/2 properties
BEST_FIRST walk for 804 steps (0 resets) in 8 ms. (89 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 195 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 106 reset in 3704 ms.
Product exploration explored 100000 steps with 72 reset in 4178 ms.
Applying partial POR strategy [false, false, false, true, true]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Support contains 3 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 24 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2024-06-01 05:32:41] [INFO ] Invariant cache hit.
[2024-06-01 05:32:41] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20103ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20108ms
[2024-06-01 05:33:01] [INFO ] Redundant transitions in 6 ms returned []
Running 600 sub problems to find dead transitions.
[2024-06-01 05:33:01] [INFO ] Invariant cache hit.
[2024-06-01 05:33:01] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 5.0)
(s1 89.0)
(s2 0.0)
(s3 4.0)
(s4 5.0)
(s5 5.0)
(s6 89.0)
(s7 0.0)
(s8 4.0)
(s9 5.0)
(s10 5.0)
(s11 2.0)
(s12 0.0)
(s13 48.0)
(s14 48.0)
(s15 5.0)
(s16 2.0)
(s17 87.0)
(s18 4.0)
(s19 5.0)
(s20 5.0)
(s21 2.0)
(s22 0.0)
(s23 4.0)
(s24 92.0)
(s25 5.0)
(s26 2.0)
(s27 0.0)
(s28 4.0)
(s29 92.0)
(s30 5.0)
(s31 2.0)
(s32 0.0)
(s33 4.0)
(s34 92.0)
(s35 5.0)
(s36 2.0)
(s37 86.0)
(s38 5.0)
(s39 5.0)
(s40 5.0)
(s41 89.0)
(s42 0.0)
(s43 4.0)
(s44 5.0)
(s45 5.0)
(s46 2.0)
(s47 87.0)
(s48 4.0)
(s49 5.0)
(s50 5.0)
(s51 89.0)
(s52 0.0)
(s53 4.0)
(s54 5.0)
(s55 5.0)
(s56 2.0)
(s57 87.0)
(s58 4.0)
(s59 5.0)
(s60 5.0)
(s61 2.0)
(s62 0.0)
(s63 4.0)
(s64 92.0)
(s65 5.0)
(s66 2.0)
(s67 0.0)
(s68 4.0)
(s69 92.0)
(s70 5.0)
(s71 2.0)
(s72 86.0)
(s73 5.0)
(s74 5.0)
(s75 5.0)
(s76 2.0)
(s77 87.0)
(s78 4.0)
(s79 5.0)
(s80 5.0)
(s81 89.0)
(s82 0.0)
(s83 4.0)
(s84 5.0)
(s85 5.0)
(s86 2.0)
(s87 0.0)
(s88 4.0)
(s89 92.0)
(s90 5.0)
(s91 87.0)
(s92 0.0)
(s93 4.0)
(s94 7.0)
(s95 5.0)
(s96 2.0)
(s97 86.0)
(s98 5.0)
(s99 5.0)
(s100 5.0)
(s101 2.0)
(s102 0.0)
(s103 4.0)
(s104 92.0)
(s105 5.0)
(s106 2.0)
(s107 86.0)
(s108 5.0)
(s109 5.0)
(s110 5.0)
(s111 89.0)
(s112 0.0)
(s113 4.0)
(s114 5.0)
(s115 5.0)
(s116 2.0)
(s117 86.0)
(s118 5.0)
(s119 5.0)
(s120 5.0)
(s121 2.0)
(s122 86.0)
(s123 5.0)
(s124 5.0)
(s125 5.0)
(s126 89.0)
(s127 0.0)
(s128 4.0)
(s129 5.0)
(s130 5.0)
(s131 89.0)
(s132 0.0)
(s133 4.0)
(s134 5.0)
(s135 5.0)
(s136 89.0)
(s137 0.0)
(s138 4.0)
(s139 5.0)
(s140 5.0)
(s141 2.0)
(s142 0.0)
(s143 4.0)
(s144 92.0)
(s145 5.0)
(s146 2.0)
(s147 0.0)
(s148 48.0)
(s149 48.0)
(s150 5.0)
(s151 2.0)
(s152 0.0)
(s153 4.0)
(s154 92.0)
(s155 5.0)
(s156 88.0)
(s157 0.0)
(s158 5.0)
(s159 5.0)
(s160 5.0)
(s161 2.0)
(s162 86.0)
(s163 5.0)
(s164 5.0)
(s165 5.0)
(s166 2.0)
(s167 87.0)
(s168 4.0)
(s169 5.0)
(s170 5.0)
(s171 2.0)
(s172 87.0)
(s173 4.0)
(s174 5.0)
(s175 5.0)
(s176 89.0)
(s177 0.0)
(s178 4.0)
(s179 5.0)
(s180 5.0)
(s181 89.0)
(s182 0.0)
(s183 4.0)
(s184 5.0)
(s185 5.0)
(s186 2.0)
(s187 86.0)
(s188 5.0)
(s189 5.0)
(s190 5.0)
(s191 2.0)
(s192 87.0)
(s193 4.0)
(s194 5.0)
(s195 5.0)
(s196 89.0)
(s197 0.0)
(s198 4.0)
(s199 5.0)
(s200 5.0)
(s201 2.0)
(s202 86.0)
(s203 5.0)
(s204 5.0)
(s205 5.0)
(s206 2.0)
(s207 87.0)
(s208 4.0)
(s209 5.0)
(s210 5.0)
(s211 2.0)
(s212 0.0)
(s213 4.0)
(s214 92.0)
(s215 5.0)
(s216 89.0)
(s217 0.0)
(s218 4.0)
(s219 5.0)
(s220 5.0)
(s221 2.0)
(s222 0.0)
(s223 48.0)
(s224 48.0)
(s225 5.0)
(s226 2.0)
(s227 87.0)
(s228 4.0)
(s229 5.0)
(s230 5.0)
(s231 89.0)
(s232 0.0)
(s233 4.0)
(s234 5.0)
(s235 5.0)
(s236 87.0)
(s237 0.0)
(s238 4.0)
(s239 7.0)
(s240 5.0)
(s241 2.0)
(s242 0.0)
(s243 4.0)
(s244 92.0)
(s245 5.0)
(s246 89.0)
(s247 0.0)
(s248 4.0)
(s249 5.0)
(s250 5.0)
(s251 88.0)
(s252 0.0)
(s253 5.0)
(s254 5.0)
(s255 5.0)
(s256 2.0)
(s257 87.0)
(s258 4.0)
(s259 5.0)
(s260 5.0)
(s261 87.0)
(s262 0.0)
(s263 4.0)
(s264 7.0)
(s265 5.0)
(s266 89.0)
(s267 0.0)
(s268 4.0)
(s269 5.0)
(s270 5.0)
(s271 2.0)
(s272 87.0)
(s273 4.0)
(s274 5.0)
(s275 5.0)
(s276 2.0)
(s277 87.0)
(s278 4.0)
(s279 5.0)
(s280 5.0)
(s281 2.0)
(s282 87.0)
(s283 4.0)
(s284 5.0)
(s285 5.0)
(s286 89.0)
(s287 0.0)
(s288 4.0)
(s289 5.0)
(s290 5.0)
(s291 87.0)
(s292 0.0)
(s293 4.0)
(s294 7.0)
(s295 5.0)
(s296 2.0)
(s297 0.0)
(s298 4.0)
(s299 92.0)
(s300 5.0)
(s301 2.0)
(s302 86.0)
(s303 5.0)
(s304 5.0)
(s305 (/ 77.0 16.0))
(s306 2.0)
(s307 (/ 1379.0 16.0))
(s308 5.0)
(s309 5.0)
(s310 (/ 77.0 16.0))
(s311 2.0)
(s312 (/ 1395.0 16.0))
(s313 4.0)
(s314 5.0)
(s315 (/ 77.0 16.0))
(s316 (/ 1427.0 16.0))
(s317 0.0)
(s318 4.0)
(s319 5.0)
(s320 (/ 77.0 16.0))
(s321 2.0)
(s322 (/ 1395.0 16.0))
(s323 4.0)
(s324 5.0)
(s325 (/ 77.0 16.0))
(s326 (/ 1427.0 16.0))
(s327 0.0)
(s328 4.0)
(s329 5.0)
(s330 (/ 77.0 16.0))
(s331 2.0)
(s332 (/ 1379.0 16.0))
(s333 5.0)
(s334 5.0)
(s335 (/ 77.0 16.0))
(s336 2.0)
(s337 0.0)
(s338 4.0)
(s339 (/ 1475.0 16.0))
(s340 (/ 77.0 16.0))
(s341 2.0)
(s342 (/ 1379.0 16.0))
(s343 5.0)
(s344 5.0)
(s345 (/ 77.0 16.0))
(s346 2.0)
(s347 (/ 1395.0 16.0))
(s348 4.0)
(s349 5.0)
(s350 (/ 77.0 16.0))
(s351 (/ 1411.0 16.0))
(s352 0.0)
(s353 5.0)
(s354 5.0)
(s355 (/ 77.0 16.0))
(s356 (/ 1427.0 16.0))
(s357 0.0)
(s358 4.0)
(s359 5.0)
(s360 (/ 77.0 16.0))
(s361 (/ 1427.0 16.0))
(s362 0.0)
(s363 4.0)
(s364 5.0)
(s365 (/ 77.0 16.0))
(s366 2.0)
(s367 0.0)
(s368 4.0)
(s369 (/ 1475.0 16.0))
(s370 (/ 77.0 16.0))
(s371 (/ 699.0 8.0))
(s372 0.0)
(s373 4.0)
(s374 (/ 109.0 16.0))
(s375 (/ 77.0 16.0))
(s376 2.0)
(s377 0.0)
(s378 4.0)
(s379 (/ 1475.0 16.0))
(s380 (/ 77.0 16.0))
(s381 2.0)
(s382 (/ 1379.0 16.0))
(s383 5.0)
(s384 5.0)
(s385 (/ 77.0 16.0))
(s386 (/ 699.0 8.0))
(s387 0.0)
(s388 4.0)
(s389 (/ 109.0 16.0))
(s390 (/ 77.0 16.0))
(s391 2.0)
(s392 0.0)
(s393 4.0)
(s394 (/ 1475.0 16.0))
(s395 (/ 77.0 16.0))
(s396 (/ 699.0 8.0))
(s397 0.0)
(s398 4.0)
(s399 (/ 109.0 16.0))
(s400 (/ 77.0 16.0))
(s401 (/ 1427.0 16.0))
(s402 0.0)
(s403 4.0)
(s404 5.0)
(s405 (/ 77.0 16.0))
(s406 (/ 1427.0 16.0))
(s407 0.0)
(s408 4.0)
(s409 5.0)
(s410 (/ 77.0 16.0))
(s411 2.0)
(s412 (/ 1395.0 16.0))
(s413 4.0)
(s414 5.0)
(s415 (/ 77.0 16.0))
(s416 2.0)
(s417 0.0)
(s418 4.0)
(s419 (/ 1475.0 16.0))
(s420 (/ 77.0 16.0))
(s421 2.0)
(s422 0.0)
(s423 4.0)
(s424 (/ 1475.0 16.0))
(s425 (/ 77.0 16.0))
(s426 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 05:33:45] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 05:33:45] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 05:33:45] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 05:33:45] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-01 05:33:50] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-06-01 05:33:50] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 05:34:01] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-06-01 05:34:01] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 05:34:01] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 0 ms to minimize.
[2024-06-01 05:34:01] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1310 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 10/10 constraints]
After SMT, in 60114ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60119ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 80265 ms. Remains : 500/500 places, 801/801 transitions.
Support contains 3 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 5 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2024-06-01 05:34:01] [INFO ] Invariant cache hit.
[2024-06-01 05:34:01] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20116ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20120ms
[2024-06-01 05:34:21] [INFO ] Invariant cache hit.
[2024-06-01 05:34:22] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-01 05:34:22] [INFO ] Invariant cache hit.
[2024-06-01 05:34:22] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-01 05:34:22] [INFO ] Implicit Places using invariants and state equation in 310 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2024-06-01 05:34:22] [INFO ] Invariant cache hit.
[2024-06-01 05:34:22] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 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 Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 05:35:06] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-06-01 05:35:06] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-06-01 05:35:06] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 0 ms to minimize.
[2024-06-01 05:35:06] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 05:35:11] [INFO ] Deduced a trap composed of 3 places in 29 ms of which 1 ms to minimize.
[2024-06-01 05:35:11] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1306 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 6/6 constraints]
After SMT, in 60126ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60131ms
Finished structural reductions in LTL mode , in 1 iterations and 80699 ms. Remains : 500/500 places, 801/801 transitions.
Treatment of property JoinFreeModules-PT-0100-LTLCardinality-14 finished in 338896 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 19 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2024-06-01 05:35:22] [INFO ] Invariant cache hit.
[2024-06-01 05:35:22] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20097ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20103ms
[2024-06-01 05:35:42] [INFO ] Invariant cache hit.
[2024-06-01 05:35:42] [INFO ] Implicit Places using invariants in 94 ms returned []
[2024-06-01 05:35:42] [INFO ] Invariant cache hit.
[2024-06-01 05:35:43] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-01 05:35:43] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 375 ms to find 0 implicit places.
[2024-06-01 05:35:43] [INFO ] Redundant transitions in 6 ms returned []
Running 600 sub problems to find dead transitions.
[2024-06-01 05:35:43] [INFO ] Invariant cache hit.
[2024-06-01 05:35:43] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 05:36:26] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 0 ms to minimize.
[2024-06-01 05:36:27] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-06-01 05:36:27] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 0 ms to minimize.
[2024-06-01 05:36:27] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 05:36:32] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-06-01 05:36:32] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1306 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 6/6 constraints]
After SMT, in 60124ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60129ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 80640 ms. Remains : 500/500 places, 801/801 transitions.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-0100-LTLCardinality-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-0100-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-0100-LTLCardinality-15 finished in 80727 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(((X(X(p1))&&F(p2))||p0))))'
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(F(p0))||G((p1||G(p2))))))'
Found a Lengthening insensitive property : JoinFreeModules-PT-0100-LTLCardinality-09
Stuttering acceptance computed with spot in 222 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 500 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 23 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2024-06-01 05:36:43] [INFO ] Invariant cache hit.
[2024-06-01 05:36:43] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20093ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20098ms
[2024-06-01 05:37:03] [INFO ] Invariant cache hit.
[2024-06-01 05:37:03] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-01 05:37:03] [INFO ] Invariant cache hit.
[2024-06-01 05:37:04] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-01 05:37:04] [INFO ] Implicit Places using invariants and state equation in 265 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
Running 600 sub problems to find dead transitions.
[2024-06-01 05:37:04] [INFO ] Invariant cache hit.
[2024-06-01 05:37:04] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 5.0)
(s1 89.0)
(s2 0.0)
(s3 4.0)
(s4 5.0)
(s5 5.0)
(s6 89.0)
(s7 0.0)
(s8 4.0)
(s9 5.0)
(s10 5.0)
(s11 2.0)
(s12 0.0)
(s13 48.0)
(s14 48.0)
(s15 5.0)
(s16 2.0)
(s17 87.0)
(s18 4.0)
(s19 5.0)
(s20 5.0)
(s21 2.0)
(s22 0.0)
(s23 4.0)
(s24 92.0)
(s25 5.0)
(s26 2.0)
(s27 0.0)
(s28 4.0)
(s29 92.0)
(s30 5.0)
(s31 2.0)
(s32 0.0)
(s33 4.0)
(s34 92.0)
(s35 5.0)
(s36 2.0)
(s37 86.0)
(s38 5.0)
(s39 5.0)
(s40 5.0)
(s41 89.0)
(s42 0.0)
(s43 4.0)
(s44 5.0)
(s45 5.0)
(s46 2.0)
(s47 87.0)
(s48 4.0)
(s49 5.0)
(s50 5.0)
(s51 89.0)
(s52 0.0)
(s53 4.0)
(s54 5.0)
(s55 5.0)
(s56 2.0)
(s57 87.0)
(s58 4.0)
(s59 5.0)
(s60 5.0)
(s61 2.0)
(s62 0.0)
(s63 4.0)
(s64 92.0)
(s65 5.0)
(s66 2.0)
(s67 0.0)
(s68 4.0)
(s69 92.0)
(s70 5.0)
(s71 2.0)
(s72 86.0)
(s73 5.0)
(s74 5.0)
(s75 5.0)
(s76 2.0)
(s77 87.0)
(s78 4.0)
(s79 5.0)
(s80 5.0)
(s81 89.0)
(s82 0.0)
(s83 4.0)
(s84 5.0)
(s85 5.0)
(s86 2.0)
(s87 0.0)
(s88 4.0)
(s89 92.0)
(s90 5.0)
(s91 87.0)
(s92 0.0)
(s93 4.0)
(s94 7.0)
(s95 5.0)
(s96 2.0)
(s97 86.0)
(s98 5.0)
(s99 5.0)
(s100 5.0)
(s101 2.0)
(s102 0.0)
(s103 4.0)
(s104 92.0)
(s105 5.0)
(s106 2.0)
(s107 86.0)
(s108 5.0)
(s109 5.0)
(s110 5.0)
(s111 89.0)
(s112 0.0)
(s113 4.0)
(s114 5.0)
(s115 5.0)
(s116 2.0)
(s117 86.0)
(s118 5.0)
(s119 5.0)
(s120 5.0)
(s121 2.0)
(s122 86.0)
(s123 5.0)
(s124 5.0)
(s125 5.0)
(s126 89.0)
(s127 0.0)
(s128 4.0)
(s129 5.0)
(s130 5.0)
(s131 89.0)
(s132 0.0)
(s133 4.0)
(s134 5.0)
(s135 5.0)
(s136 89.0)
(s137 0.0)
(s138 4.0)
(s139 5.0)
(s140 5.0)
(s141 2.0)
(s142 0.0)
(s143 4.0)
(s144 92.0)
(s145 5.0)
(s146 2.0)
(s147 0.0)
(s148 48.0)
(s149 48.0)
(s150 5.0)
(s151 2.0)
(s152 0.0)
(s153 4.0)
(s154 92.0)
(s155 5.0)
(s156 88.0)
(s157 0.0)
(s158 5.0)
(s159 5.0)
(s160 5.0)
(s161 2.0)
(s162 86.0)
(s163 5.0)
(s164 5.0)
(s165 5.0)
(s166 2.0)
(s167 87.0)
(s168 4.0)
(s169 5.0)
(s170 5.0)
(s171 2.0)
(s172 87.0)
(s173 4.0)
(s174 5.0)
(s175 5.0)
(s176 89.0)
(s177 0.0)
(s178 4.0)
(s179 5.0)
(s180 5.0)
(s181 89.0)
(s182 0.0)
(s183 4.0)
(s184 5.0)
(s185 5.0)
(s186 2.0)
(s187 86.0)
(s188 5.0)
(s189 5.0)
(s190 5.0)
(s191 2.0)
(s192 87.0)
(s193 4.0)
(s194 5.0)
(s195 5.0)
(s196 89.0)
(s197 0.0)
(s198 4.0)
(s199 5.0)
(s200 5.0)
(s201 2.0)
(s202 86.0)
(s203 5.0)
(s204 5.0)
(s205 5.0)
(s206 2.0)
(s207 87.0)
(s208 4.0)
(s209 5.0)
(s210 5.0)
(s211 2.0)
(s212 0.0)
(s213 4.0)
(s214 92.0)
(s215 5.0)
(s216 89.0)
(s217 0.0)
(s218 4.0)
(s219 5.0)
(s220 5.0)
(s221 2.0)
(s222 0.0)
(s223 48.0)
(s224 48.0)
(s225 5.0)
(s226 2.0)
(s227 87.0)
(s228 4.0)
(s229 5.0)
(s230 5.0)
(s231 89.0)
(s232 0.0)
(s233 4.0)
(s234 5.0)
(s235 5.0)
(s236 87.0)
(s237 0.0)
(s238 4.0)
(s239 7.0)
(s240 5.0)
(s241 2.0)
(s242 0.0)
(s243 4.0)
(s244 92.0)
(s245 5.0)
(s246 89.0)
(s247 0.0)
(s248 4.0)
(s249 5.0)
(s250 5.0)
(s251 88.0)
(s252 0.0)
(s253 5.0)
(s254 5.0)
(s255 5.0)
(s256 2.0)
(s257 87.0)
(s258 4.0)
(s259 5.0)
(s260 5.0)
(s261 87.0)
(s262 0.0)
(s263 4.0)
(s264 7.0)
(s265 5.0)
(s266 89.0)
(s267 0.0)
(s268 4.0)
(s269 5.0)
(s270 5.0)
(s271 2.0)
(s272 87.0)
(s273 4.0)
(s274 5.0)
(s275 5.0)
(s276 2.0)
(s277 87.0)
(s278 4.0)
(s279 5.0)
(s280 5.0)
(s281 2.0)
(s282 87.0)
(s283 4.0)
(s284 5.0)
(s285 5.0)
(s286 89.0)
(s287 0.0)
(s288 4.0)
(s289 5.0)
(s290 5.0)
(s291 87.0)
(s292 0.0)
(s293 4.0)
(s294 7.0)
(s295 5.0)
(s296 2.0)
(s297 0.0)
(s298 4.0)
(s299 92.0)
(s300 5.0)
(s301 2.0)
(s302 86.0)
(s303 5.0)
(s304 5.0)
(s305 5.0)
(s306 2.0)
(s307 86.0)
(s308 5.0)
(s309 5.0)
(s310 5.0)
(s311 2.0)
(s312 87.0)
(s313 4.0)
(s314 5.0)
(s315 5.0)
(s316 89.0)
(s317 0.0)
(s318 4.0)
(s319 5.0)
(s320 5.0)
(s321 2.0)
(s322 87.0)
(s323 4.0)
(s324 5.0)
(s325 5.0)
(s326 89.0)
(s327 0.0)
(s328 4.0)
(s329 5.0)
(s330 5.0)
(s331 2.0)
(s332 86.0)
(s333 5.0)
(s334 5.0)
(s335 (/ 77.0 16.0))
(s336 2.0)
(s337 0.0)
(s338 4.0)
(s339 (/ 1475.0 16.0))
(s340 (/ 77.0 16.0))
(s341 2.0)
(s342 (/ 1379.0 16.0))
(s343 5.0)
(s344 5.0)
(s345 (/ 77.0 16.0))
(s346 2.0)
(s347 (/ 1395.0 16.0))
(s348 4.0)
(s349 5.0)
(s350 (/ 77.0 16.0))
(s351 (/ 1411.0 16.0))
(s352 0.0)
(s353 5.0)
(s354 5.0)
(s355 (/ 77.0 16.0))
(s356 (/ 1427.0 16.0))
(s357 0.0)
(s358 4.0)
(s359 5.0)
(s360 (/ 77.0 16.0))
(s361 (/ 1427.0 16.0))
(s362 0.0)
(s363 4.0)
(s364 5.0)
(s365 (/ 77.0 16.0))
(s366 2.0)
(s367 0.0)
(s368 4.0)
(s369 (/ 1475.0 16.0))
(s370 (/ 77.0 16.0))
(s371 (/ 699.0 8.0))
(s372 0.0)
(s373 4.0)
(s374 (/ 109.0 16.0))
(s375 (/ 77.0 16.0))
(s376 2.0)
(s377 0.0)
(s378 4.0)
(s379 (/ 1475.0 16.0))
(s380 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 05:37:48] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 1 ms to minimize.
[2024-06-01 05:37:48] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 05:37:48] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-06-01 05:37:48] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-06-01 05:37:53] [INFO ] Deduced a trap composed of 3 places in 26 ms of which 1 ms to minimize.
[2024-06-01 05:37:53] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1306 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 6/6 constraints]
After SMT, in 60127ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60132ms
Finished structural reductions in LI_LTL mode , in 1 iterations and 80610 ms. Remains : 500/500 places, 801/801 transitions.
Running random walk in product with property : JoinFreeModules-PT-0100-LTLCardinality-09
Product exploration explored 100000 steps with 0 reset in 4062 ms.
Product exploration explored 100000 steps with 0 reset in 4408 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X p1), (X (NOT (AND (NOT p1) p2))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 225 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40193 steps (8 resets) in 273 ms. (146 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 271 ms. (147 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 271 ms. (147 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 283 ms. (140 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 269 ms. (148 steps per ms) remains 2/3 properties
[2024-06-01 05:38:13] [INFO ] Invariant cache hit.
[2024-06-01 05:38:13] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 24/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 48/78 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/1301 variables, and 42 constraints, problems are : Problem set: 0 solved, 2 unsolved in 46 ms.
Refiners :[Positive P Invariants (semi-flows): 6/100 constraints, State Equation: 30/500 constraints, ReadFeed: 6/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 24/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 05:38:14] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 05:38:14] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-06-01 05:38:14] [INFO ] Deduced a trap composed of 3 places in 14 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 48/78 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 05:38:14] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/78 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/78 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/78 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/1301 variables, and 48 constraints, problems are : Problem set: 0 solved, 2 unsolved in 249 ms.
Refiners :[Positive P Invariants (semi-flows): 6/100 constraints, State Equation: 30/500 constraints, ReadFeed: 6/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 304ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 1264 steps, including 1 resets, run visited all 2 properties in 22 ms. (steps per millisecond=57 )
Parikh walk visited 2 properties in 21 ms.
Knowledge obtained : [(AND p1 p0 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X p1), (X (NOT (AND (NOT p1) p2))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1)), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT (OR p2 p0))), (F (NOT (OR p2 p0 p1))), (F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p2 p1))), (F (NOT (OR (NOT p2) p1)))]
Knowledge based reduction with 13 factoid took 509 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 18 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2024-06-01 05:38:15] [INFO ] Invariant cache hit.
[2024-06-01 05:38:15] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20084ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20089ms
[2024-06-01 05:38:35] [INFO ] Invariant cache hit.
[2024-06-01 05:38:35] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-01 05:38:35] [INFO ] Invariant cache hit.
[2024-06-01 05:38:35] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-01 05:38:35] [INFO ] Implicit Places using invariants and state equation in 267 ms returned []
Implicit Place search using SMT with State Equation took 363 ms to find 0 implicit places.
[2024-06-01 05:38:35] [INFO ] Redundant transitions in 6 ms returned []
Running 600 sub problems to find dead transitions.
[2024-06-01 05:38:35] [INFO ] Invariant cache hit.
[2024-06-01 05:38:35] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 05:39:19] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-06-01 05:39:19] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 1 ms to minimize.
[2024-06-01 05:39:19] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-06-01 05:39:19] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 05:39:24] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
[2024-06-01 05:39:24] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 4 ms to minimize.
[2024-06-01 05:39:35] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1307 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 7/7 constraints]
After SMT, in 60125ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60131ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 80613 ms. Remains : 500/500 places, 801/801 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 p1 p2 p0), (X p2), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 14 factoid took 202 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40084 steps (8 resets) in 219 ms. (182 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 214 ms. (186 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 254 ms. (156 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 286 ms. (139 steps per ms) remains 2/3 properties
[2024-06-01 05:39:36] [INFO ] Invariant cache hit.
[2024-06-01 05:39:36] [INFO ] State equation strengthened by 100 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 24/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 48/78 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/78 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/78 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 78/1301 variables, and 42 constraints, problems are : Problem set: 0 solved, 2 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 6/100 constraints, State Equation: 30/500 constraints, ReadFeed: 6/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 24/30 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 05:39:36] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 0 ms to minimize.
[2024-06-01 05:39:36] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
[2024-06-01 05:39:36] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 48/78 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/78 variables, 6/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/78 variables, 2/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/78 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 05:39:36] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/78 variables, 1/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/78 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/78 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 78/1301 variables, and 48 constraints, problems are : Problem set: 0 solved, 2 unsolved in 282 ms.
Refiners :[Positive P Invariants (semi-flows): 6/100 constraints, State Equation: 30/500 constraints, ReadFeed: 6/100 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 350ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 1262 steps, including 1 resets, run visited all 2 properties in 21 ms. (steps per millisecond=60 )
Parikh walk visited 2 properties in 20 ms.
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT (OR p2 p0))), (F (NOT (OR p2 p0 p1))), (F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p2 p1))), (F (NOT (OR (NOT p2) p1)))]
Knowledge based reduction with 14 factoid took 448 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 159 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 4110 ms.
Product exploration explored 100000 steps with 0 reset in 4453 ms.
Support contains 6 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 801/801 transitions.
Applied a total of 0 rules in 11 ms. Remains 500 /500 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Running 600 sub problems to find dead transitions.
[2024-06-01 05:39:46] [INFO ] Invariant cache hit.
[2024-06-01 05:39:46] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
SMT process timed out in 20083ms, After SMT, problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 20089ms
[2024-06-01 05:40:06] [INFO ] Invariant cache hit.
[2024-06-01 05:40:06] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-01 05:40:06] [INFO ] Invariant cache hit.
[2024-06-01 05:40:06] [INFO ] State equation strengthened by 100 read => feed constraints.
[2024-06-01 05:40:06] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 382 ms to find 0 implicit places.
[2024-06-01 05:40:06] [INFO ] Redundant transitions in 7 ms returned []
Running 600 sub problems to find dead transitions.
[2024-06-01 05:40:06] [INFO ] Invariant cache hit.
[2024-06-01 05:40:06] [INFO ] State equation strengthened by 100 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1300/1301 variables, and 700 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/400 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 1 (OVERLAPS) 100/500 variables, 100/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/500 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 3 (OVERLAPS) 800/1300 variables, 500/600 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1300 variables, 100/700 constraints. Problems are: Problem set: 0 solved, 600 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1300 variables, 600/1300 constraints. Problems are: Problem set: 0 solved, 600 unsolved
[2024-06-01 05:40:50] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 2 ms to minimize.
[2024-06-01 05:40:50] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 0 ms to minimize.
[2024-06-01 05:40:50] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
[2024-06-01 05:40:50] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 0 ms to minimize.
[2024-06-01 05:40:55] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-06-01 05:40:55] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 1 ms to minimize.
[2024-06-01 05:41:06] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1300/1301 variables, and 1307 constraints, problems are : Problem set: 0 solved, 600 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 100/100 constraints, State Equation: 500/500 constraints, ReadFeed: 100/100 constraints, PredecessorRefiner: 600/600 constraints, Known Traps: 7/7 constraints]
After SMT, in 60121ms problems are : Problem set: 0 solved, 600 unsolved
Search for dead transitions found 0 dead transitions in 60127ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 80623 ms. Remains : 500/500 places, 801/801 transitions.
Treatment of property JoinFreeModules-PT-0100-LTLCardinality-09 finished in 263691 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 U p1) U X(p0))||X((p1 U X(X(p2))))))))'
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||X(X(p1))))))'
[2024-06-01 05:41:07] [INFO ] Flatten gal took : 49 ms
[2024-06-01 05:41:07] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 05:41:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 500 places, 801 transitions and 2300 arcs took 23 ms.
Total runtime 2132456 ms.
There are residual formulas that ITS could not solve within timeout
Could not compute solution for formula : JoinFreeModules-PT-0100-LTLCardinality-00
FORMULA JoinFreeModules-PT-0100-LTLCardinality-09 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : JoinFreeModules-PT-0100-LTLCardinality-12
FORMULA JoinFreeModules-PT-0100-LTLCardinality-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717220516927

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name JoinFreeModules-PT-0100-LTLCardinality-00
ltl formula formula --ltl=/tmp/3369/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 500 places, 801 transitions and 2300 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.170 real 0.020 user 0.040 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3369/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3369/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3369/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3369/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 902 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 501, there are 804 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( 0/ 4): ~2500 levels ~10000 states ~2010888 transitions
pnml2lts-mc( 0/ 4): ~5000 levels ~20000 states ~4019500 transitions
pnml2lts-mc( 0/ 4): ~10000 levels ~40000 states ~8033384 transitions
pnml2lts-mc( 0/ 4): ~20000 levels ~80000 states ~16103436 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 102887
pnml2lts-mc( 0/ 4): unique transitions count: 21041962
pnml2lts-mc( 0/ 4): - self-loop count: 4
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 128176
pnml2lts-mc( 0/ 4): - claim success count: 102890
pnml2lts-mc( 0/ 4): - cum. max stack depth: 102890
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 102890 states 21042502 transitions, fanout: 204.515
pnml2lts-mc( 0/ 4): Total exploration time 11.670 sec (11.080 sec minimum, 11.245 sec on average)
pnml2lts-mc( 0/ 4): States per second: 8817, Transitions per second: 1803128
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 222.7MB, 11.2 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 61.0%/100.0%
pnml2lts-mc( 0/ 4): Stored 813 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 222.7MB (~256.0MB paged-in)
ltl formula name JoinFreeModules-PT-0100-LTLCardinality-09
ltl formula formula --ltl=/tmp/3369/ltl_1_
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 500 places, 801 transitions and 2300 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.090 real 0.030 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3369/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3369/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3369/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3369/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 902 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 501, there are 812 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( 0/ 4): ~2500 levels ~10000 states ~1994112 transitions
pnml2lts-mc( 0/ 4): ~5000 levels ~20000 states ~4019460 transitions
pnml2lts-mc( 2/ 4): ~10000 levels ~40000 states ~8247156 transitions
pnml2lts-mc( 2/ 4): ~20000 levels ~80000 states ~16597956 transitions
pnml2lts-mc( 2/ 4): ~40000 levels ~160000 states ~33203716 transitions
pnml2lts-mc( 1/ 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: 163620
pnml2lts-mc( 0/ 4): unique transitions count: 34021137
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 208706
pnml2lts-mc( 0/ 4): - claim success count: 163623
pnml2lts-mc( 0/ 4): - cum. max stack depth: 163623
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 163623 states 34021367 transitions, fanout: 207.925
pnml2lts-mc( 0/ 4): Total exploration time 20.270 sec (16.750 sec minimum, 18.403 sec on average)
pnml2lts-mc( 0/ 4): States per second: 8072, Transitions per second: 1678410
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 310.1MB, 9.7 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 100.0%/84.0%
pnml2lts-mc( 0/ 4): Stored 813 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 310.1MB (~256.0MB paged-in)
ltl formula name JoinFreeModules-PT-0100-LTLCardinality-12
ltl formula formula --ltl=/tmp/3369/ltl_2_
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 500 places, 801 transitions and 2300 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.080 real 0.020 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3369/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3369/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3369/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3369/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 19 states
pnml2lts-mc( 0/ 4): There are 901 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 501, there are 866 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( 3/ 4): ~1251 levels ~10000 states ~3061360 transitions
pnml2lts-mc( 2/ 4): ~2501 levels ~20000 states ~5988508 transitions
pnml2lts-mc( 0/ 4): ~4112 levels ~40000 states ~9614800 transitions
pnml2lts-mc( 0/ 4): ~7445 levels ~80000 states ~17235592 transitions
pnml2lts-mc( 1/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 51515
pnml2lts-mc( 0/ 4): unique states count: 95367
pnml2lts-mc( 0/ 4): unique transitions count: 26453787
pnml2lts-mc( 0/ 4): - self-loop count: 4
pnml2lts-mc( 0/ 4): - claim dead count: 88945
pnml2lts-mc( 0/ 4): - claim found count: 26379
pnml2lts-mc( 0/ 4): - claim success count: 95370
pnml2lts-mc( 0/ 4): - cum. max stack depth: 43855
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 95370 states 26455065 transitions, fanout: 277.394
pnml2lts-mc( 0/ 4): Total exploration time 12.570 sec (10.100 sec minimum, 11.513 sec on average)
pnml2lts-mc( 0/ 4): States per second: 7587, Transitions per second: 2104619
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 208.8MB, 11.5 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 56.0%/100.0%
pnml2lts-mc( 0/ 4): Stored 813 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 208.8MB (~256.0MB paged-in)
ltl formula name JoinFreeModules-PT-0100-LTLCardinality-14
ltl formula formula --ltl=/tmp/3369/ltl_3_
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 500 places, 801 transitions and 2300 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.090 real 0.040 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/3369/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/3369/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/3369/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/3369/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 902 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 501, there are 813 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( 3/ 4): ~2500 levels ~10000 states ~2020408 transitions
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~2724!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 11286
pnml2lts-mc( 0/ 4): unique transitions count: 2330054
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1844
pnml2lts-mc( 0/ 4): - claim success count: 11289
pnml2lts-mc( 0/ 4): - cum. max stack depth: 11289
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 11289 states 2330661 transitions, fanout: 206.454
pnml2lts-mc( 0/ 4): Total exploration time 1.740 sec (1.740 sec minimum, 1.740 sec on average)
pnml2lts-mc( 0/ 4): States per second: 6488, Transitions per second: 1339460
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 34.5MB, 15.6 B/state, compr.: 0.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 6.0%/26.0%
pnml2lts-mc( 0/ 4): Stored 813 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 34.5MB (~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-0100"
export BK_EXAMINATION="LTLCardinality"
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-0100, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r504-tall-171649611900051"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0100.tgz
mv JoinFreeModules-PT-0100 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;