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.r488-tall-171631132500356.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 Diffusion2D-PT-D50N150, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631132500356
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.8M
-rw-r--r-- 1 mcc users 6.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.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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.3K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.5K Apr 22 14:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 11 14:17 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Apr 11 14:17 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 14:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 11 14:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 22 14:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 22 14:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 7.3M 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 Diffusion2D-PT-D50N150-LTLFireability-00
FORMULA_NAME Diffusion2D-PT-D50N150-LTLFireability-01
FORMULA_NAME Diffusion2D-PT-D50N150-LTLFireability-02
FORMULA_NAME Diffusion2D-PT-D50N150-LTLFireability-03
FORMULA_NAME Diffusion2D-PT-D50N150-LTLFireability-04
FORMULA_NAME Diffusion2D-PT-D50N150-LTLFireability-05
FORMULA_NAME Diffusion2D-PT-D50N150-LTLFireability-06
FORMULA_NAME Diffusion2D-PT-D50N150-LTLFireability-07
FORMULA_NAME Diffusion2D-PT-D50N150-LTLFireability-08
FORMULA_NAME Diffusion2D-PT-D50N150-LTLFireability-09
FORMULA_NAME Diffusion2D-PT-D50N150-LTLFireability-10
FORMULA_NAME Diffusion2D-PT-D50N150-LTLFireability-11
FORMULA_NAME Diffusion2D-PT-D50N150-LTLFireability-12
FORMULA_NAME Diffusion2D-PT-D50N150-LTLFireability-13
FORMULA_NAME Diffusion2D-PT-D50N150-LTLFireability-14
FORMULA_NAME Diffusion2D-PT-D50N150-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717191554192

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Diffusion2D-PT-D50N150
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 21:39:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-31 21:39:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 21:39:16] [INFO ] Load time of PNML (sax parser for PT used): 577 ms
[2024-05-31 21:39:16] [INFO ] Transformed 2500 places.
[2024-05-31 21:39:16] [INFO ] Transformed 19404 transitions.
[2024-05-31 21:39:16] [INFO ] Parsed PT model containing 2500 places and 19404 transitions and 38808 arcs in 735 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Diffusion2D-PT-D50N150-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Diffusion2D-PT-D50N150-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 694 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2024-05-31 21:39:17] [INFO ] Computed 1 invariants in 161 ms
[2024-05-31 21:39:17] [INFO ] Implicit Places using invariants in 624 ms returned []
Implicit Place search using SMT only with invariants took 751 ms to find 0 implicit places.
Running 19396 sub problems to find dead transitions.
[2024-05-31 21:39:18] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2499/21904 variables, and 0 constraints, problems are : Problem set: 0 solved, 19396 unsolved in 30414 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 19396/19396 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2499/21904 variables, and 0 constraints, problems are : Problem set: 0 solved, 19396 unsolved in 30474 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 0/19396 constraints, Known Traps: 0/0 constraints]
After SMT, in 99379ms problems are : Problem set: 0 solved, 19396 unsolved
Search for dead transitions found 0 dead transitions in 99618ms
Finished structural reductions in LTL mode , in 1 iterations and 101163 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Support contains 36 out of 2500 places after structural reductions.
[2024-05-31 21:40:58] [INFO ] Flatten gal took : 569 ms
[2024-05-31 21:40:58] [INFO ] Flatten gal took : 411 ms
[2024-05-31 21:40:59] [INFO ] Input system was already deterministic with 19404 transitions.
RANDOM walk for 40492 steps (8 resets) in 164 ms. (245 steps per ms) remains 32/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 31/32 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 37 ms. (105 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 25 ms. (154 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4003 steps (8 resets) in 24 ms. (160 steps per ms) remains 31/31 properties
BEST_FIRST walk for 4004 steps (8 resets) in 26 ms. (148 steps per ms) remains 31/31 properties
Interrupted probabilistic random walk after 118379 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :4 out of 31
Probabilistic random walk after 118379 steps, saw 98191 distinct states, run finished after 3005 ms. (steps per millisecond=39 ) properties seen :4
[2024-05-31 21:41:03] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 2473/2500 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2500 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 3 (OVERLAPS) 19404/21904 variables, 2500/2501 constraints. Problems are: Problem set: 0 solved, 27 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 21904/21904 variables, and 2501 constraints, problems are : Problem set: 0 solved, 27 unsolved in 5021 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2500/2500 constraints, PredecessorRefiner: 27/27 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 27 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 1 (OVERLAPS) 2473/2500 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2500 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 27 unsolved
SMT process timed out in 10166ms, After SMT, problems are : Problem set: 0 solved, 27 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 27 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 18974 edges and 2500 vertex of which 2473 / 2500 are part of one of the 1 SCC in 32 ms
Free SCC test removed 2472 places
Drop transitions (Empty/Sink Transition effects.) removed 18974 transitions
Ensure Unique test removed 374 transitions
Reduce isomorphic transitions removed 19348 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 4 place count 28 transition count 53
Applied a total of 4 rules in 83 ms. Remains 28 /2500 variables (removed 2472) and now considering 53/19404 (removed 19351) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 28/2500 places, 53/19404 transitions.
RANDOM walk for 40469 steps (8 resets) in 34 ms. (1156 steps per ms) remains 1/27 properties
BEST_FIRST walk for 220 steps (0 resets) in 4 ms. (44 steps per ms) remains 0/1 properties
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1)&&X(G(p2)))))'
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 354 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2024-05-31 21:41:14] [INFO ] Invariant cache hit.
[2024-05-31 21:41:14] [INFO ] Implicit Places using invariants in 257 ms returned []
Implicit Place search using SMT only with invariants took 262 ms to find 0 implicit places.
Running 19396 sub problems to find dead transitions.
[2024-05-31 21:41:14] [INFO ] Invariant cache hit.
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 2499/21904 variables, and 0 constraints, problems are : Problem set: 0 solved, 19396 unsolved in 30246 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 19396/19396 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2499/21904 variables, and 0 constraints, problems are : Problem set: 0 solved, 19396 unsolved in 30218 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 0/19396 constraints, Known Traps: 0/0 constraints]
After SMT, in 100462ms problems are : Problem set: 0 solved, 19396 unsolved
Search for dead transitions found 0 dead transitions in 100643ms
Finished structural reductions in LTL mode , in 1 iterations and 101308 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 353 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2))]
Running random walk in product with property : Diffusion2D-PT-D50N150-LTLFireability-00
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 4 ms.
FORMULA Diffusion2D-PT-D50N150-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N150-LTLFireability-00 finished in 101756 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(F(p1))||p0))))'
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19356 edges and 2500 vertex of which 2497 / 2500 are part of one of the 1 SCC in 15 ms
Free SCC test removed 2496 places
Ensure Unique test removed 19397 transitions
Reduce isomorphic transitions removed 19397 transitions.
Applied a total of 1 rules in 44 ms. Remains 4 /2500 variables (removed 2496) and now considering 7/19404 (removed 19397) transitions.
// Phase 1: matrix 7 rows 4 cols
[2024-05-31 21:42:55] [INFO ] Computed 1 invariants in 0 ms
[2024-05-31 21:42:55] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-31 21:42:55] [INFO ] Invariant cache hit.
[2024-05-31 21:42:55] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 37 ms to find 0 implicit places.
[2024-05-31 21:42:55] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-31 21:42:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/10 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/11 variables, and 5 constraints, problems are : Problem set: 0 solved, 3 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/4 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/10 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/10 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/11 variables, and 8 constraints, problems are : Problem set: 0 solved, 3 unsolved in 36 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 69ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 69ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/2500 places, 7/19404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 163 ms. Remains : 4/2500 places, 7/19404 transitions.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Diffusion2D-PT-D50N150-LTLFireability-01
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 1 ms.
FORMULA Diffusion2D-PT-D50N150-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N150-LTLFireability-01 finished in 292 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1)&&F((G(F(p1))||(F(p1)&&G(p2))))))'
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19356 edges and 2500 vertex of which 2497 / 2500 are part of one of the 1 SCC in 6 ms
Free SCC test removed 2496 places
Ensure Unique test removed 19397 transitions
Reduce isomorphic transitions removed 19397 transitions.
Applied a total of 1 rules in 32 ms. Remains 4 /2500 variables (removed 2496) and now considering 7/19404 (removed 19397) transitions.
[2024-05-31 21:42:55] [INFO ] Invariant cache hit.
[2024-05-31 21:42:55] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-31 21:42:55] [INFO ] Invariant cache hit.
[2024-05-31 21:42:55] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-05-31 21:42:55] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-31 21:42:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/10 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/11 variables, and 5 constraints, problems are : Problem set: 0 solved, 3 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/4 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/10 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/10 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/11 variables, and 8 constraints, problems are : Problem set: 0 solved, 3 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 59ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 59ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/2500 places, 7/19404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 140 ms. Remains : 4/2500 places, 7/19404 transitions.
Stuttering acceptance computed with spot in 233 ms :[(NOT p1), (NOT p0), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : Diffusion2D-PT-D50N150-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D50N150-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N150-LTLFireability-02 finished in 403 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 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19388 edges and 2500 vertex of which 2499 / 2500 are part of one of the 1 SCC in 5 ms
Free SCC test removed 2498 places
Ensure Unique test removed 19401 transitions
Reduce isomorphic transitions removed 19401 transitions.
Applied a total of 1 rules in 23 ms. Remains 2 /2500 variables (removed 2498) and now considering 3/19404 (removed 19401) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-05-31 21:42:56] [INFO ] Computed 1 invariants in 1 ms
[2024-05-31 21:42:56] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-31 21:42:56] [INFO ] Invariant cache hit.
[2024-05-31 21:42:56] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-31 21:42:56] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-05-31 21:42:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 20 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 19 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 41ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 41ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/2500 places, 3/19404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 110 ms. Remains : 2/2500 places, 3/19404 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N150-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D50N150-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N150-LTLFireability-03 finished in 164 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||(p1&&X(p2)))))))'
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 349 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2024-05-31 21:42:56] [INFO ] Computed 1 invariants in 102 ms
[2024-05-31 21:42:57] [INFO ] Implicit Places using invariants in 392 ms returned []
Implicit Place search using SMT only with invariants took 395 ms to find 0 implicit places.
Running 19396 sub problems to find dead transitions.
[2024-05-31 21:42:57] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2499/21904 variables, and 0 constraints, problems are : Problem set: 0 solved, 19396 unsolved in 30219 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 19396/19396 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19396 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 Int declared 2499/21904 variables, and 0 constraints, problems are : Problem set: 0 solved, 19396 unsolved in 30348 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 0/19396 constraints, Known Traps: 0/0 constraints]
After SMT, in 100263ms problems are : Problem set: 0 solved, 19396 unsolved
Search for dead transitions found 0 dead transitions in 100443ms
Finished structural reductions in LTL mode , in 1 iterations and 101233 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 212 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : Diffusion2D-PT-D50N150-LTLFireability-04
Entered a terminal (fully accepting) state of product in 4342 steps with 0 reset in 136 ms.
FORMULA Diffusion2D-PT-D50N150-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N150-LTLFireability-04 finished in 101630 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(F(p1)))))'
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 347 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2024-05-31 21:44:38] [INFO ] Invariant cache hit.
[2024-05-31 21:44:38] [INFO ] Implicit Places using invariants in 275 ms returned []
Implicit Place search using SMT only with invariants took 276 ms to find 0 implicit places.
Running 19396 sub problems to find dead transitions.
[2024-05-31 21:44:38] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2499/21904 variables, and 0 constraints, problems are : Problem set: 0 solved, 19396 unsolved in 30221 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 19396/19396 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19396 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2499/21904 variables, and 0 constraints, problems are : Problem set: 0 solved, 19396 unsolved in 30217 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 0/19396 constraints, Known Traps: 0/0 constraints]
After SMT, in 97341ms problems are : Problem set: 0 solved, 19396 unsolved
Search for dead transitions found 0 dead transitions in 97488ms
Finished structural reductions in LTL mode , in 1 iterations and 98148 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 220 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Diffusion2D-PT-D50N150-LTLFireability-05
Product exploration explored 100000 steps with 6 reset in 4183 ms.
Stack based approach found an accepted trace after 62 steps with 0 reset with depth 63 and stack size 63 in 6 ms.
FORMULA Diffusion2D-PT-D50N150-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Diffusion2D-PT-D50N150-LTLFireability-05 finished in 102609 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(((p1 U (p2||G(p1)))||p0)))))))'
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 347 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2024-05-31 21:46:21] [INFO ] Invariant cache hit.
[2024-05-31 21:46:21] [INFO ] Implicit Places using invariants in 280 ms returned []
Implicit Place search using SMT only with invariants took 281 ms to find 0 implicit places.
Running 19396 sub problems to find dead transitions.
[2024-05-31 21:46:21] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2499/21904 variables, and 0 constraints, problems are : Problem set: 0 solved, 19396 unsolved in 30203 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 19396/19396 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19396 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2499/21904 variables, and 0 constraints, problems are : Problem set: 0 solved, 19396 unsolved in 30216 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 0/19396 constraints, Known Traps: 0/0 constraints]
After SMT, in 97266ms problems are : Problem set: 0 solved, 19396 unsolved
Search for dead transitions found 0 dead transitions in 97435ms
Finished structural reductions in LTL mode , in 1 iterations and 98112 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 247 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : Diffusion2D-PT-D50N150-LTLFireability-06
Product exploration explored 100000 steps with 20000 reset in 1072 ms.
Product exploration explored 100000 steps with 20000 reset in 930 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 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 80 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 6 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
RANDOM walk for 40481 steps (8 resets) in 28 ms. (1395 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 123 ms. (322 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 137 ms. (289 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 79 ms. (500 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 95 ms. (416 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 187187 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :0 out of 5
Probabilistic random walk after 187187 steps, saw 151506 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
[2024-05-31 21:48:04] [INFO ] Invariant cache hit.
Problem apf2 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 2497/2500 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2500 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 19404/21904 variables, 2500/2501 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 21904/21904 variables, and 2501 constraints, problems are : Problem set: 1 solved, 4 unsolved in 5022 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2500/2500 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 2497/2500 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2500 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 19404/21904 variables, 2500/2501 constraints. Problems are: Problem set: 1 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 21904/21904 variables, and 2505 constraints, problems are : Problem set: 1 solved, 4 unsolved in 5025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2500/2500 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 10095ms problems are : Problem set: 1 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19356 edges and 2500 vertex of which 2497 / 2500 are part of one of the 1 SCC in 13 ms
Free SCC test removed 2496 places
Drop transitions (Empty/Sink Transition effects.) removed 19356 transitions
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 19398 transitions.
Applied a total of 1 rules in 26 ms. Remains 4 /2500 variables (removed 2496) and now considering 6/19404 (removed 19398) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 4/2500 places, 6/19404 transitions.
RANDOM walk for 36859 steps (7 resets) in 7 ms. (4607 steps per ms) remains 0/4 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p2 p1), (G (OR p0 (NOT p1) p2))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR p0 p1 p2)))]
Knowledge based reduction with 2 factoid took 162 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 356 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2024-05-31 21:48:15] [INFO ] Invariant cache hit.
[2024-05-31 21:48:16] [INFO ] Implicit Places using invariants in 253 ms returned []
Implicit Place search using SMT only with invariants took 255 ms to find 0 implicit places.
Running 19396 sub problems to find dead transitions.
[2024-05-31 21:48:16] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2499/21904 variables, and 0 constraints, problems are : Problem set: 0 solved, 19396 unsolved in 30219 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 19396/19396 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19396 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 Int declared 2499/21904 variables, and 0 constraints, problems are : Problem set: 0 solved, 19396 unsolved in 30218 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 0/19396 constraints, Known Traps: 0/0 constraints]
After SMT, in 99285ms problems are : Problem set: 0 solved, 19396 unsolved
Search for dead transitions found 0 dead transitions in 99461ms
Finished structural reductions in LTL mode , in 1 iterations and 100104 ms. Remains : 2500/2500 places, 19404/19404 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 p2)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 76 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
RANDOM walk for 40468 steps (8 resets) in 16 ms. (2380 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 58 ms. (678 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 62 ms. (634 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 48 ms. (816 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 202954 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :0 out of 3
Probabilistic random walk after 202954 steps, saw 163993 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
[2024-05-31 21:49:58] [INFO ] Invariant cache hit.
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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2497/2500 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2500 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 21904/21904 variables, and 2501 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5039 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2500/2500 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 2497/2500 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2500 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 21904/21904 variables, and 2501 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2500/2500 constraints, PredecessorRefiner: 0/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 10092ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19356 edges and 2500 vertex of which 2497 / 2500 are part of one of the 1 SCC in 4 ms
Free SCC test removed 2496 places
Drop transitions (Empty/Sink Transition effects.) removed 19356 transitions
Ensure Unique test removed 42 transitions
Reduce isomorphic transitions removed 19398 transitions.
Applied a total of 1 rules in 18 ms. Remains 4 /2500 variables (removed 2496) and now considering 6/19404 (removed 19398) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 4/2500 places, 6/19404 transitions.
RANDOM walk for 34594 steps (7 resets) in 9 ms. (3459 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p2)]
False Knowledge obtained : [(F (NOT p2)), (F (NOT p0)), (F (NOT (OR p0 p2)))]
Knowledge based reduction with 1 factoid took 172 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 5 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 202 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 20000 reset in 1101 ms.
Product exploration explored 100000 steps with 20000 reset in 1068 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 209 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19356 edges and 2500 vertex of which 2497 / 2500 are part of one of the 1 SCC in 4 ms
Free SCC test removed 2496 places
Ensure Unique test removed 19397 transitions
Reduce isomorphic transitions removed 19397 transitions.
Applied a total of 1 rules in 17 ms. Remains 4 /2500 variables (removed 2496) and now considering 7/19404 (removed 19397) transitions.
[2024-05-31 21:50:12] [INFO ] Redundant transitions in 1 ms returned []
Running 3 sub problems to find dead transitions.
// Phase 1: matrix 7 rows 4 cols
[2024-05-31 21:50:12] [INFO ] Computed 1 invariants in 0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/10 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/11 variables, and 5 constraints, problems are : Problem set: 0 solved, 3 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/4 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/10 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/10 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/11 variables, and 8 constraints, problems are : Problem set: 0 solved, 3 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 64ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 64ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/2500 places, 7/19404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 89 ms. Remains : 4/2500 places, 7/19404 transitions.
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 479 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2024-05-31 21:50:13] [INFO ] Computed 1 invariants in 95 ms
[2024-05-31 21:50:13] [INFO ] Implicit Places using invariants in 433 ms returned []
Implicit Place search using SMT only with invariants took 434 ms to find 0 implicit places.
Running 19396 sub problems to find dead transitions.
[2024-05-31 21:50:13] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2499/21904 variables, and 0 constraints, problems are : Problem set: 0 solved, 19396 unsolved in 30248 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 19396/19396 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2499/21904 variables, and 0 constraints, problems are : Problem set: 0 solved, 19396 unsolved in 30221 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 0/19396 constraints, Known Traps: 0/0 constraints]
After SMT, in 100803ms problems are : Problem set: 0 solved, 19396 unsolved
Search for dead transitions found 0 dead transitions in 100957ms
Finished structural reductions in LTL mode , in 1 iterations and 101893 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Treatment of property Diffusion2D-PT-D50N150-LTLFireability-06 finished in 334691 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||G(p1)))))'
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 539 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2024-05-31 21:51:55] [INFO ] Invariant cache hit.
[2024-05-31 21:51:56] [INFO ] Implicit Places using invariants in 280 ms returned []
Implicit Place search using SMT only with invariants took 281 ms to find 0 implicit places.
Running 19396 sub problems to find dead transitions.
[2024-05-31 21:51:56] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2499/21904 variables, and 0 constraints, problems are : Problem set: 0 solved, 19396 unsolved in 30220 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 19396/19396 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2499/21904 variables, and 0 constraints, problems are : Problem set: 0 solved, 19396 unsolved in 30234 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 0/19396 constraints, Known Traps: 0/0 constraints]
After SMT, in 98469ms problems are : Problem set: 0 solved, 19396 unsolved
Search for dead transitions found 0 dead transitions in 98627ms
Finished structural reductions in LTL mode , in 1 iterations and 99473 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 155 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Diffusion2D-PT-D50N150-LTLFireability-07
Entered a terminal (fully accepting) state of product in 46531 steps with 0 reset in 3302 ms.
FORMULA Diffusion2D-PT-D50N150-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N150-LTLFireability-07 finished in 102988 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(!p0) U G(p1)))'
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19356 edges and 2500 vertex of which 2497 / 2500 are part of one of the 1 SCC in 4 ms
Free SCC test removed 2496 places
Ensure Unique test removed 19397 transitions
Reduce isomorphic transitions removed 19397 transitions.
Applied a total of 1 rules in 16 ms. Remains 4 /2500 variables (removed 2496) and now considering 7/19404 (removed 19397) transitions.
// Phase 1: matrix 7 rows 4 cols
[2024-05-31 21:53:38] [INFO ] Computed 1 invariants in 0 ms
[2024-05-31 21:53:38] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-31 21:53:38] [INFO ] Invariant cache hit.
[2024-05-31 21:53:38] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2024-05-31 21:53:38] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-31 21:53:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/10 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/11 variables, and 5 constraints, problems are : Problem set: 0 solved, 3 unsolved in 31 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/4 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/10 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/10 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/11 variables, and 8 constraints, problems are : Problem set: 0 solved, 3 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 63ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 63ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/2500 places, 7/19404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 128 ms. Remains : 4/2500 places, 7/19404 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p1), p0]
Running random walk in product with property : Diffusion2D-PT-D50N150-LTLFireability-10
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D50N150-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N150-LTLFireability-10 finished in 235 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 493 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
// Phase 1: matrix 19404 rows 2500 cols
[2024-05-31 21:53:39] [INFO ] Computed 1 invariants in 91 ms
[2024-05-31 21:53:39] [INFO ] Implicit Places using invariants in 328 ms returned []
Implicit Place search using SMT only with invariants took 332 ms to find 0 implicit places.
Running 19396 sub problems to find dead transitions.
[2024-05-31 21:53:39] [INFO ] Invariant cache hit.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2499/21904 variables, and 0 constraints, problems are : Problem set: 0 solved, 19396 unsolved in 30208 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 19396/19396 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19396 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2499/21904 variables, and 0 constraints, problems are : Problem set: 0 solved, 19396 unsolved in 30204 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 0/19396 constraints, Known Traps: 0/0 constraints]
After SMT, in 96750ms problems are : Problem set: 0 solved, 19396 unsolved
Search for dead transitions found 0 dead transitions in 96906ms
Finished structural reductions in LTL mode , in 1 iterations and 97756 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Diffusion2D-PT-D50N150-LTLFireability-11
Product exploration explored 100000 steps with 11 reset in 3393 ms.
Stack based approach found an accepted trace after 3220 steps with 0 reset with depth 3221 and stack size 1727 in 132 ms.
FORMULA Diffusion2D-PT-D50N150-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Diffusion2D-PT-D50N150-LTLFireability-11 finished in 101462 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||(G(p1)&&F((p2||X(p3))))))'
Support contains 4 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Applied a total of 0 rules in 480 ms. Remains 2500 /2500 variables (removed 0) and now considering 19404/19404 (removed 0) transitions.
[2024-05-31 21:55:20] [INFO ] Invariant cache hit.
[2024-05-31 21:55:20] [INFO ] Implicit Places using invariants in 258 ms returned []
Implicit Place search using SMT only with invariants took 259 ms to find 0 implicit places.
Running 19396 sub problems to find dead transitions.
[2024-05-31 21:55:21] [INFO ] Invariant cache hit.
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 2499/21904 variables, and 0 constraints, problems are : Problem set: 0 solved, 19396 unsolved in 30219 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 19396/19396 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19396 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 Int declared 2499/21904 variables, and 0 constraints, problems are : Problem set: 0 solved, 19396 unsolved in 30221 ms.
Refiners :[Positive P Invariants (semi-flows): 0/1 constraints, State Equation: 0/2500 constraints, PredecessorRefiner: 0/19396 constraints, Known Traps: 0/0 constraints]
After SMT, in 99683ms problems are : Problem set: 0 solved, 19396 unsolved
Search for dead transitions found 0 dead transitions in 99856ms
Finished structural reductions in LTL mode , in 1 iterations and 100623 ms. Remains : 2500/2500 places, 19404/19404 transitions.
Stuttering acceptance computed with spot in 283 ms :[true, (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p1), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N150-LTLFireability-12
Entered a terminal (fully accepting) state of product in 35861 steps with 0 reset in 2206 ms.
FORMULA Diffusion2D-PT-D50N150-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N150-LTLFireability-12 finished in 103166 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19388 edges and 2500 vertex of which 2499 / 2500 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2498 places
Ensure Unique test removed 19401 transitions
Reduce isomorphic transitions removed 19401 transitions.
Applied a total of 1 rules in 22 ms. Remains 2 /2500 variables (removed 2498) and now considering 3/19404 (removed 19401) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-05-31 21:57:03] [INFO ] Computed 1 invariants in 0 ms
[2024-05-31 21:57:03] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-31 21:57:03] [INFO ] Invariant cache hit.
[2024-05-31 21:57:03] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-05-31 21:57:03] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-05-31 21:57:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 21 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 50ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 50ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/2500 places, 3/19404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 118 ms. Remains : 2/2500 places, 3/19404 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : Diffusion2D-PT-D50N150-LTLFireability-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D50N150-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N150-LTLFireability-13 finished in 189 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 2 out of 2500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19372 edges and 2500 vertex of which 2498 / 2500 are part of one of the 1 SCC in 5 ms
Free SCC test removed 2497 places
Ensure Unique test removed 19399 transitions
Reduce isomorphic transitions removed 19399 transitions.
Applied a total of 1 rules in 18 ms. Remains 3 /2500 variables (removed 2497) and now considering 5/19404 (removed 19399) transitions.
// Phase 1: matrix 5 rows 3 cols
[2024-05-31 21:57:03] [INFO ] Computed 1 invariants in 0 ms
[2024-05-31 21:57:03] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-31 21:57:03] [INFO ] Invariant cache hit.
[2024-05-31 21:57:03] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
[2024-05-31 21:57:03] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2024-05-31 21:57:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/7 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 0/7 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 7/8 variables, and 4 constraints, problems are : Problem set: 0 solved, 2 unsolved in 27 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 3/3 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 1/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 4/7 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 0/7 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 7/8 variables, and 6 constraints, problems are : Problem set: 0 solved, 2 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 3/3 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 54ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 54ms
Starting structural reductions in SI_LTL mode, iteration 1 : 3/2500 places, 5/19404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115 ms. Remains : 3/2500 places, 5/19404 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Diffusion2D-PT-D50N150-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D50N150-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N150-LTLFireability-14 finished in 296 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&&X(F(p1)))||G(F(p1))))&&F(G((p2||F(p3)))))))'
Support contains 3 out of 2500 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19340 edges and 2500 vertex of which 2496 / 2500 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2495 places
Ensure Unique test removed 19395 transitions
Reduce isomorphic transitions removed 19395 transitions.
Applied a total of 1 rules in 16 ms. Remains 5 /2500 variables (removed 2495) and now considering 9/19404 (removed 19395) transitions.
// Phase 1: matrix 9 rows 5 cols
[2024-05-31 21:57:03] [INFO ] Computed 1 invariants in 0 ms
[2024-05-31 21:57:03] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-05-31 21:57:03] [INFO ] Invariant cache hit.
[2024-05-31 21:57:03] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-05-31 21:57:03] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-05-31 21:57:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/13 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 13/14 variables, and 6 constraints, problems are : Problem set: 0 solved, 4 unsolved in 34 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 1/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 8/13 variables, 5/6 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/13 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/13 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 13/14 variables, and 10 constraints, problems are : Problem set: 0 solved, 4 unsolved in 33 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 68ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 69ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/2500 places, 9/19404 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 134 ms. Remains : 5/2500 places, 9/19404 transitions.
Stuttering acceptance computed with spot in 129 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : Diffusion2D-PT-D50N150-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Diffusion2D-PT-D50N150-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Diffusion2D-PT-D50N150-LTLFireability-15 finished in 301 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(((p1 U (p2||G(p1)))||p0)))))))'
Found a Shortening insensitive property : Diffusion2D-PT-D50N150-LTLFireability-06
Stuttering acceptance computed with spot in 211 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 3 out of 2500 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 2500/2500 places, 19404/19404 transitions.
Graph (trivial) has 19356 edges and 2500 vertex of which 2497 / 2500 are part of one of the 1 SCC in 4 ms
Free SCC test removed 2496 places
Ensure Unique test removed 19397 transitions
Reduce isomorphic transitions removed 19397 transitions.
Applied a total of 1 rules in 16 ms. Remains 4 /2500 variables (removed 2496) and now considering 7/19404 (removed 19397) transitions.
// Phase 1: matrix 7 rows 4 cols
[2024-05-31 21:57:04] [INFO ] Computed 1 invariants in 0 ms
[2024-05-31 21:57:04] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-31 21:57:04] [INFO ] Invariant cache hit.
[2024-05-31 21:57:04] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Running 3 sub problems to find dead transitions.
[2024-05-31 21:57:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/10 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/11 variables, and 5 constraints, problems are : Problem set: 0 solved, 3 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/4 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/10 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/10 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/11 variables, and 8 constraints, problems are : Problem set: 0 solved, 3 unsolved in 29 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 59ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 60ms
Starting structural reductions in LI_LTL mode, iteration 1 : 4/2500 places, 7/19404 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 115 ms. Remains : 4/2500 places, 7/19404 transitions.
Running random walk in product with property : Diffusion2D-PT-D50N150-LTLFireability-06
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
Treatment of property Diffusion2D-PT-D50N150-LTLFireability-06 finished in 454 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2024-05-31 21:57:04] [INFO ] Flatten gal took : 294 ms
[2024-05-31 21:57:04] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-05-31 21:57:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 2500 places, 19404 transitions and 38808 arcs took 57 ms.
Total runtime 1069496 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA Diffusion2D-PT-D50N150-LTLFireability-06 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717192633709

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name Diffusion2D-PT-D50N150-LTLFireability-06
ltl formula formula --ltl=/tmp/1281/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 2500 places, 19404 transitions and 38808 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 1.850 real 0.630 user 0.670 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1281/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1281/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1281/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1281/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): There are 2501 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 2501, there are 19412 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):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2002
pnml2lts-mc( 0/ 4): unique states count: 2002
pnml2lts-mc( 0/ 4): unique transitions count: 9240
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 7462
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 2053
pnml2lts-mc( 0/ 4): - cum. max stack depth: 20
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 2053 states 9980 transitions, fanout: 4.861
pnml2lts-mc( 0/ 4): Total exploration time 2.740 sec (2.720 sec minimum, 2.733 sec on average)
pnml2lts-mc( 0/ 4): States per second: 749, Transitions per second: 3642
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 30.6 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 19914 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.1MB (~257.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="Diffusion2D-PT-D50N150"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is Diffusion2D-PT-D50N150, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r488-tall-171631132500356"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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