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.r245-tall-171654350300636.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 greatspnxred
Input is NoC3x3-PT-6A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r245-tall-171654350300636
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 784K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:11 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 173K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 07:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 12 07:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 297K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME NoC3x3-PT-6A-LTLFireability-00
FORMULA_NAME NoC3x3-PT-6A-LTLFireability-01
FORMULA_NAME NoC3x3-PT-6A-LTLFireability-02
FORMULA_NAME NoC3x3-PT-6A-LTLFireability-03
FORMULA_NAME NoC3x3-PT-6A-LTLFireability-04
FORMULA_NAME NoC3x3-PT-6A-LTLFireability-05
FORMULA_NAME NoC3x3-PT-6A-LTLFireability-06
FORMULA_NAME NoC3x3-PT-6A-LTLFireability-07
FORMULA_NAME NoC3x3-PT-6A-LTLFireability-08
FORMULA_NAME NoC3x3-PT-6A-LTLFireability-09
FORMULA_NAME NoC3x3-PT-6A-LTLFireability-10
FORMULA_NAME NoC3x3-PT-6A-LTLFireability-11
FORMULA_NAME NoC3x3-PT-6A-LTLFireability-12
FORMULA_NAME NoC3x3-PT-6A-LTLFireability-13
FORMULA_NAME NoC3x3-PT-6A-LTLFireability-14
FORMULA_NAME NoC3x3-PT-6A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716692820113

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-6A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-26 03:07:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-05-26 03:07:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 03:07:01] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2024-05-26 03:07:01] [INFO ] Transformed 512 places.
[2024-05-26 03:07:01] [INFO ] Transformed 1117 transitions.
[2024-05-26 03:07:01] [INFO ] Found NUPN structural information;
[2024-05-26 03:07:01] [INFO ] Parsed PT model containing 512 places and 1117 transitions and 4279 arcs in 220 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA NoC3x3-PT-6A-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 62 out of 512 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 512/512 places, 1117/1117 transitions.
Discarding 67 places :
Symmetric choice reduction at 0 with 67 rule applications. Total rules 67 place count 445 transition count 846
Iterating global reduction 0 with 67 rules applied. Total rules applied 134 place count 445 transition count 846
Applied a total of 134 rules in 68 ms. Remains 445 /512 variables (removed 67) and now considering 846/1117 (removed 271) transitions.
[2024-05-26 03:07:01] [INFO ] Flow matrix only has 837 transitions (discarded 9 similar events)
// Phase 1: matrix 837 rows 445 cols
[2024-05-26 03:07:01] [INFO ] Computed 66 invariants in 27 ms
[2024-05-26 03:07:02] [INFO ] Implicit Places using invariants in 432 ms returned [12, 47, 97, 135, 196, 284, 336, 375, 427]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 461 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 436/512 places, 846/1117 transitions.
Applied a total of 0 rules in 6 ms. Remains 436 /436 variables (removed 0) and now considering 846/846 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 551 ms. Remains : 436/512 places, 846/1117 transitions.
Support contains 62 out of 436 places after structural reductions.
[2024-05-26 03:07:02] [INFO ] Flatten gal took : 93 ms
[2024-05-26 03:07:02] [INFO ] Flatten gal took : 59 ms
[2024-05-26 03:07:02] [INFO ] Input system was already deterministic with 846 transitions.
Reduction of identical properties reduced properties to check from 35 to 32
RANDOM walk for 40000 steps (105 resets) in 1399 ms. (28 steps per ms) remains 2/32 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 107 ms. (370 steps per ms) remains 2/2 properties
[2024-05-26 03:07:03] [INFO ] Flow matrix only has 837 transitions (discarded 9 similar events)
// Phase 1: matrix 837 rows 436 cols
[2024-05-26 03:07:03] [INFO ] Computed 57 invariants in 5 ms
[2024-05-26 03:07:03] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/46 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 390/436 variables, 52/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 03:07:03] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 9 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 837/1273 variables, 436/494 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1273 variables, 17/511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1273 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1273 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1273/1273 variables, and 511 constraints, problems are : Problem set: 0 solved, 2 unsolved in 638 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 436/436 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 41/46 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/46 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 390/436 variables, 52/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/436 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-26 03:07:04] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 837/1273 variables, 436/495 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1273 variables, 17/512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1273 variables, 2/514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1273 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1273 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1273/1273 variables, and 514 constraints, problems are : Problem set: 0 solved, 2 unsolved in 606 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 436/436 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 1289ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 341 ms.
Support contains 3 out of 436 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 436/436 places, 846/846 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 423 transition count 790
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 423 transition count 790
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 74 place count 399 transition count 766
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 80 place count 396 transition count 791
Free-agglomeration rule applied 25 times.
Iterating global reduction 0 with 25 rules applied. Total rules applied 105 place count 396 transition count 766
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 130 place count 371 transition count 766
Applied a total of 130 rules in 103 ms. Remains 371 /436 variables (removed 65) and now considering 766/846 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 103 ms. Remains : 371/436 places, 766/846 transitions.
RANDOM walk for 40000 steps (9 resets) in 171 ms. (232 steps per ms) remains 1/1 properties
BEST_FIRST walk for 36249 steps (7 resets) in 88 ms. (407 steps per ms) remains 0/1 properties
Computed a total of 1 stabilizing places and 1 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(X(G((p0&&(G(!p1)||(!p1&&G(F(p2)))))))))'
Support contains 6 out of 436 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 846/846 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 424 transition count 794
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 424 transition count 794
Applied a total of 24 rules in 48 ms. Remains 424 /436 variables (removed 12) and now considering 794/846 (removed 52) transitions.
[2024-05-26 03:07:05] [INFO ] Flow matrix only has 793 transitions (discarded 1 similar events)
// Phase 1: matrix 793 rows 424 cols
[2024-05-26 03:07:05] [INFO ] Computed 57 invariants in 10 ms
[2024-05-26 03:07:05] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-05-26 03:07:05] [INFO ] Flow matrix only has 793 transitions (discarded 1 similar events)
[2024-05-26 03:07:05] [INFO ] Invariant cache hit.
[2024-05-26 03:07:06] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-26 03:07:06] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 639 ms to find 0 implicit places.
Running 793 sub problems to find dead transitions.
[2024-05-26 03:07:06] [INFO ] Flow matrix only has 793 transitions (discarded 1 similar events)
[2024-05-26 03:07:06] [INFO ] Invariant cache hit.
[2024-05-26 03:07:06] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 1 (OVERLAPS) 1/424 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/424 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 3 (OVERLAPS) 793/1217 variables, 424/481 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1217 variables, 17/498 constraints. Problems are: Problem set: 0 solved, 793 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1217/1217 variables, and 498 constraints, problems are : Problem set: 0 solved, 793 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 424/424 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 793/793 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 793 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 1 (OVERLAPS) 1/424 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/424 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 3 (OVERLAPS) 793/1217 variables, 424/481 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1217 variables, 17/498 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1217 variables, 793/1291 constraints. Problems are: Problem set: 0 solved, 793 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1217/1217 variables, and 1291 constraints, problems are : Problem set: 0 solved, 793 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 424/424 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 793/793 constraints, Known Traps: 0/0 constraints]
After SMT, in 60404ms problems are : Problem set: 0 solved, 793 unsolved
Search for dead transitions found 0 dead transitions in 60424ms
Starting structural reductions in LTL mode, iteration 1 : 424/436 places, 794/846 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61121 ms. Remains : 424/436 places, 794/846 transitions.
Stuttering acceptance computed with spot in 253 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1)]
Running random walk in product with property : NoC3x3-PT-6A-LTLFireability-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 3 ms.
FORMULA NoC3x3-PT-6A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6A-LTLFireability-00 finished in 61463 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((p0||F(G((F(!p1) U X(p2)))))))))'
Support contains 6 out of 436 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 846/846 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 424 transition count 796
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 424 transition count 796
Applied a total of 24 rules in 16 ms. Remains 424 /436 variables (removed 12) and now considering 796/846 (removed 50) transitions.
[2024-05-26 03:08:07] [INFO ] Flow matrix only has 794 transitions (discarded 2 similar events)
// Phase 1: matrix 794 rows 424 cols
[2024-05-26 03:08:07] [INFO ] Computed 57 invariants in 9 ms
[2024-05-26 03:08:07] [INFO ] Implicit Places using invariants in 184 ms returned []
[2024-05-26 03:08:07] [INFO ] Flow matrix only has 794 transitions (discarded 2 similar events)
[2024-05-26 03:08:07] [INFO ] Invariant cache hit.
[2024-05-26 03:08:07] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-26 03:08:07] [INFO ] Implicit Places using invariants and state equation in 498 ms returned []
Implicit Place search using SMT with State Equation took 685 ms to find 0 implicit places.
Running 795 sub problems to find dead transitions.
[2024-05-26 03:08:07] [INFO ] Flow matrix only has 794 transitions (discarded 2 similar events)
[2024-05-26 03:08:07] [INFO ] Invariant cache hit.
[2024-05-26 03:08:07] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 1 (OVERLAPS) 1/424 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/424 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 3 (OVERLAPS) 794/1218 variables, 424/481 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1218 variables, 17/498 constraints. Problems are: Problem set: 0 solved, 795 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1218/1218 variables, and 498 constraints, problems are : Problem set: 0 solved, 795 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 424/424 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 795/795 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 795 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 1 (OVERLAPS) 1/424 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/424 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 3 (OVERLAPS) 794/1218 variables, 424/481 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1218 variables, 17/498 constraints. Problems are: Problem set: 0 solved, 795 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1218 variables, 795/1293 constraints. Problems are: Problem set: 0 solved, 795 unsolved
[2024-05-26 03:09:03] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1218/1218 variables, and 1294 constraints, problems are : Problem set: 0 solved, 795 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 424/424 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 795/795 constraints, Known Traps: 1/1 constraints]
After SMT, in 60322ms problems are : Problem set: 0 solved, 795 unsolved
Search for dead transitions found 0 dead transitions in 60331ms
Starting structural reductions in LTL mode, iteration 1 : 424/436 places, 796/846 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61036 ms. Remains : 424/436 places, 796/846 transitions.
Stuttering acceptance computed with spot in 355 ms :[(AND (NOT p0) (NOT p2)), false, (NOT p2), (AND p1 (NOT p2)), false, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-6A-LTLFireability-01
Stuttering criterion allowed to conclude after 263 steps with 0 reset in 5 ms.
FORMULA NoC3x3-PT-6A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6A-LTLFireability-01 finished in 61421 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((p0&&X((G(p0)||(F(p1)&&F(p0))))))))'
Support contains 3 out of 436 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 846/846 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 423 transition count 791
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 423 transition count 791
Applied a total of 26 rules in 8 ms. Remains 423 /436 variables (removed 13) and now considering 791/846 (removed 55) transitions.
// Phase 1: matrix 791 rows 423 cols
[2024-05-26 03:09:08] [INFO ] Computed 57 invariants in 7 ms
[2024-05-26 03:09:08] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-26 03:09:08] [INFO ] Invariant cache hit.
[2024-05-26 03:09:08] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-26 03:09:09] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
Running 790 sub problems to find dead transitions.
[2024-05-26 03:09:09] [INFO ] Invariant cache hit.
[2024-05-26 03:09:09] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 1 (OVERLAPS) 1/423 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 3 (OVERLAPS) 791/1214 variables, 423/480 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1214 variables, 17/497 constraints. Problems are: Problem set: 0 solved, 790 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1214/1214 variables, and 497 constraints, problems are : Problem set: 0 solved, 790 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 423/423 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 790/790 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 790 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 1 (OVERLAPS) 1/423 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 3 (OVERLAPS) 791/1214 variables, 423/480 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1214 variables, 17/497 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1214 variables, 790/1287 constraints. Problems are: Problem set: 0 solved, 790 unsolved
[2024-05-26 03:10:03] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1214/1214 variables, and 1288 constraints, problems are : Problem set: 0 solved, 790 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 423/423 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 790/790 constraints, Known Traps: 1/1 constraints]
After SMT, in 60295ms problems are : Problem set: 0 solved, 790 unsolved
Search for dead transitions found 0 dead transitions in 60304ms
Starting structural reductions in LTL mode, iteration 1 : 423/436 places, 791/846 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60940 ms. Remains : 423/436 places, 791/846 transitions.
Stuttering acceptance computed with spot in 308 ms :[(NOT p0), (NOT p0), (NOT p0), true, (NOT p0), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-6A-LTLFireability-02
Stuttering criterion allowed to conclude after 328 steps with 0 reset in 3 ms.
FORMULA NoC3x3-PT-6A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6A-LTLFireability-02 finished in 61270 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((p0||X(G(p1))))))'
Support contains 8 out of 436 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 846/846 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 423 transition count 790
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 423 transition count 790
Applied a total of 26 rules in 11 ms. Remains 423 /436 variables (removed 13) and now considering 790/846 (removed 56) transitions.
// Phase 1: matrix 790 rows 423 cols
[2024-05-26 03:10:09] [INFO ] Computed 57 invariants in 5 ms
[2024-05-26 03:10:09] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-26 03:10:09] [INFO ] Invariant cache hit.
[2024-05-26 03:10:10] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-26 03:10:10] [INFO ] Implicit Places using invariants and state equation in 426 ms returned []
Implicit Place search using SMT with State Equation took 610 ms to find 0 implicit places.
Running 789 sub problems to find dead transitions.
[2024-05-26 03:10:10] [INFO ] Invariant cache hit.
[2024-05-26 03:10:10] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 789 unsolved
At refinement iteration 1 (OVERLAPS) 1/423 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 789 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 789 unsolved
At refinement iteration 3 (OVERLAPS) 790/1213 variables, 423/480 constraints. Problems are: Problem set: 0 solved, 789 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1213 variables, 17/497 constraints. Problems are: Problem set: 0 solved, 789 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1213/1213 variables, and 497 constraints, problems are : Problem set: 0 solved, 789 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 423/423 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 789/789 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 789 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 789 unsolved
At refinement iteration 1 (OVERLAPS) 1/423 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 789 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 789 unsolved
At refinement iteration 3 (OVERLAPS) 790/1213 variables, 423/480 constraints. Problems are: Problem set: 0 solved, 789 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1213 variables, 17/497 constraints. Problems are: Problem set: 0 solved, 789 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1213 variables, 789/1286 constraints. Problems are: Problem set: 0 solved, 789 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1213/1213 variables, and 1286 constraints, problems are : Problem set: 0 solved, 789 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 423/423 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 789/789 constraints, Known Traps: 0/0 constraints]
After SMT, in 60275ms problems are : Problem set: 0 solved, 789 unsolved
Search for dead transitions found 0 dead transitions in 60282ms
Starting structural reductions in LTL mode, iteration 1 : 423/436 places, 790/846 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60904 ms. Remains : 423/436 places, 790/846 transitions.
Stuttering acceptance computed with spot in 159 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-6A-LTLFireability-03
Entered a terminal (fully accepting) state of product in 65 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-6A-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6A-LTLFireability-03 finished in 61081 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(p1)||p0))||G(p2)))'
Support contains 4 out of 436 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 846/846 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 423 transition count 791
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 423 transition count 791
Applied a total of 26 rules in 9 ms. Remains 423 /436 variables (removed 13) and now considering 791/846 (removed 55) transitions.
// Phase 1: matrix 791 rows 423 cols
[2024-05-26 03:11:10] [INFO ] Computed 57 invariants in 3 ms
[2024-05-26 03:11:10] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-26 03:11:10] [INFO ] Invariant cache hit.
[2024-05-26 03:11:11] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-26 03:11:11] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 595 ms to find 0 implicit places.
Running 790 sub problems to find dead transitions.
[2024-05-26 03:11:11] [INFO ] Invariant cache hit.
[2024-05-26 03:11:11] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 1 (OVERLAPS) 1/423 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 3 (OVERLAPS) 791/1214 variables, 423/480 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1214 variables, 17/497 constraints. Problems are: Problem set: 0 solved, 790 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1214/1214 variables, and 497 constraints, problems are : Problem set: 0 solved, 790 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 423/423 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 790/790 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 790 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 1 (OVERLAPS) 1/423 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 3 (OVERLAPS) 791/1214 variables, 423/480 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1214 variables, 17/497 constraints. Problems are: Problem set: 0 solved, 790 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1214 variables, 790/1287 constraints. Problems are: Problem set: 0 solved, 790 unsolved
[2024-05-26 03:12:06] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1214/1214 variables, and 1288 constraints, problems are : Problem set: 0 solved, 790 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 423/423 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 790/790 constraints, Known Traps: 1/1 constraints]
After SMT, in 60281ms problems are : Problem set: 0 solved, 790 unsolved
Search for dead transitions found 0 dead transitions in 60288ms
Starting structural reductions in LTL mode, iteration 1 : 423/436 places, 791/846 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60896 ms. Remains : 423/436 places, 791/846 transitions.
Stuttering acceptance computed with spot in 198 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-6A-LTLFireability-04
Product exploration explored 100000 steps with 50000 reset in 987 ms.
Product exploration explored 100000 steps with 50000 reset in 944 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p0) (NOT p1)))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X p2)), (X (X (NOT p1))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 27 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-6A-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-6A-LTLFireability-04 finished in 63092 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 5 out of 436 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 436/436 places, 846/846 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 423 transition count 794
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 423 transition count 794
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 0 with 46 rules applied. Total rules applied 72 place count 400 transition count 771
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 78 place count 397 transition count 796
Applied a total of 78 rules in 42 ms. Remains 397 /436 variables (removed 39) and now considering 796/846 (removed 50) transitions.
[2024-05-26 03:12:13] [INFO ] Flow matrix only has 794 transitions (discarded 2 similar events)
// Phase 1: matrix 794 rows 397 cols
[2024-05-26 03:12:13] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 03:12:14] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-05-26 03:12:14] [INFO ] Flow matrix only has 794 transitions (discarded 2 similar events)
[2024-05-26 03:12:14] [INFO ] Invariant cache hit.
[2024-05-26 03:12:14] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-26 03:12:14] [INFO ] Implicit Places using invariants and state equation in 526 ms returned []
Implicit Place search using SMT with State Equation took 718 ms to find 0 implicit places.
[2024-05-26 03:12:14] [INFO ] Redundant transitions in 41 ms returned []
Running 788 sub problems to find dead transitions.
[2024-05-26 03:12:14] [INFO ] Flow matrix only has 794 transitions (discarded 2 similar events)
[2024-05-26 03:12:14] [INFO ] Invariant cache hit.
[2024-05-26 03:12:14] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 1 (OVERLAPS) 1/397 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/397 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 3 (OVERLAPS) 794/1191 variables, 397/454 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1191 variables, 40/494 constraints. Problems are: Problem set: 0 solved, 788 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1191/1191 variables, and 494 constraints, problems are : Problem set: 0 solved, 788 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 397/397 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 788/788 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 788 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 1 (OVERLAPS) 1/397 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/397 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 3 (OVERLAPS) 794/1191 variables, 397/454 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1191 variables, 40/494 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1191 variables, 788/1282 constraints. Problems are: Problem set: 0 solved, 788 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1191/1191 variables, and 1282 constraints, problems are : Problem set: 0 solved, 788 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 397/397 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 788/788 constraints, Known Traps: 0/0 constraints]
After SMT, in 60434ms problems are : Problem set: 0 solved, 788 unsolved
Search for dead transitions found 0 dead transitions in 60441ms
Starting structural reductions in SI_LTL mode, iteration 1 : 397/436 places, 796/846 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61249 ms. Remains : 397/436 places, 796/846 transitions.
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-6A-LTLFireability-05
Product exploration explored 100000 steps with 300 reset in 393 ms.
Product exploration explored 100000 steps with 308 reset in 469 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p1))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 10 factoid took 272 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (119 resets) in 348 ms. (114 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 162 ms. (245 steps per ms) remains 1/1 properties
[2024-05-26 03:13:16] [INFO ] Flow matrix only has 794 transitions (discarded 2 similar events)
[2024-05-26 03:13:16] [INFO ] Invariant cache hit.
[2024-05-26 03:13:16] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/32 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 365/397 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/397 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 794/1191 variables, 397/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1191 variables, 40/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1191 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1191 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1191/1191 variables, and 494 constraints, problems are : Problem set: 0 solved, 1 unsolved in 236 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 397/397 constraints, ReadFeed: 40/40 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/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 27/32 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 365/397 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/397 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 794/1191 variables, 397/454 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1191 variables, 40/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1191 variables, 1/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1191 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1191 variables, 0/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1191/1191 variables, and 495 constraints, problems are : Problem set: 0 solved, 1 unsolved in 415 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 397/397 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 665ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 128 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=64 )
Parikh walk visited 1 properties in 9 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p1))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F p1), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 10 factoid took 484 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 34 ms :[(AND (NOT p0) (NOT p1))]
Support contains 5 out of 397 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 397/397 places, 796/796 transitions.
Applied a total of 0 rules in 21 ms. Remains 397 /397 variables (removed 0) and now considering 796/796 (removed 0) transitions.
[2024-05-26 03:13:17] [INFO ] Flow matrix only has 794 transitions (discarded 2 similar events)
[2024-05-26 03:13:17] [INFO ] Invariant cache hit.
[2024-05-26 03:13:17] [INFO ] Implicit Places using invariants in 161 ms returned []
[2024-05-26 03:13:17] [INFO ] Flow matrix only has 794 transitions (discarded 2 similar events)
[2024-05-26 03:13:17] [INFO ] Invariant cache hit.
[2024-05-26 03:13:18] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-26 03:13:18] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 685 ms to find 0 implicit places.
[2024-05-26 03:13:18] [INFO ] Redundant transitions in 12 ms returned []
Running 788 sub problems to find dead transitions.
[2024-05-26 03:13:18] [INFO ] Flow matrix only has 794 transitions (discarded 2 similar events)
[2024-05-26 03:13:18] [INFO ] Invariant cache hit.
[2024-05-26 03:13:18] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 1 (OVERLAPS) 1/397 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/397 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 3 (OVERLAPS) 794/1191 variables, 397/454 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1191 variables, 40/494 constraints. Problems are: Problem set: 0 solved, 788 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1191/1191 variables, and 494 constraints, problems are : Problem set: 0 solved, 788 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 397/397 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 788/788 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 788 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 1 (OVERLAPS) 1/397 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/397 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 3 (OVERLAPS) 794/1191 variables, 397/454 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1191 variables, 40/494 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1191 variables, 788/1282 constraints. Problems are: Problem set: 0 solved, 788 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1191/1191 variables, and 1282 constraints, problems are : Problem set: 0 solved, 788 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 397/397 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 788/788 constraints, Known Traps: 0/0 constraints]
After SMT, in 60408ms problems are : Problem set: 0 solved, 788 unsolved
Search for dead transitions found 0 dead transitions in 60416ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61146 ms. Remains : 397/397 places, 796/796 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p1))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 10 factoid took 320 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p1))]
RANDOM walk for 34042 steps (100 resets) in 165 ms. (205 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p1))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F p1), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 10 factoid took 413 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 46 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 308 reset in 362 ms.
Product exploration explored 100000 steps with 304 reset in 381 ms.
Support contains 5 out of 397 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 397/397 places, 796/796 transitions.
Applied a total of 0 rules in 12 ms. Remains 397 /397 variables (removed 0) and now considering 796/796 (removed 0) transitions.
[2024-05-26 03:14:20] [INFO ] Flow matrix only has 794 transitions (discarded 2 similar events)
[2024-05-26 03:14:20] [INFO ] Invariant cache hit.
[2024-05-26 03:14:20] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-26 03:14:20] [INFO ] Flow matrix only has 794 transitions (discarded 2 similar events)
[2024-05-26 03:14:20] [INFO ] Invariant cache hit.
[2024-05-26 03:14:21] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-26 03:14:21] [INFO ] Implicit Places using invariants and state equation in 512 ms returned []
Implicit Place search using SMT with State Equation took 685 ms to find 0 implicit places.
[2024-05-26 03:14:21] [INFO ] Redundant transitions in 14 ms returned []
Running 788 sub problems to find dead transitions.
[2024-05-26 03:14:21] [INFO ] Flow matrix only has 794 transitions (discarded 2 similar events)
[2024-05-26 03:14:21] [INFO ] Invariant cache hit.
[2024-05-26 03:14:21] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 1 (OVERLAPS) 1/397 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/397 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 3 (OVERLAPS) 794/1191 variables, 397/454 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1191 variables, 40/494 constraints. Problems are: Problem set: 0 solved, 788 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 1.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 1.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 1.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 1.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 1.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 1.0)
(s103 0.0)timeout

(s104 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1191/1191 variables, and 494 constraints, problems are : Problem set: 0 solved, 788 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 397/397 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 788/788 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 788 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 1 (OVERLAPS) 1/397 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/397 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 3 (OVERLAPS) 794/1191 variables, 397/454 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1191 variables, 40/494 constraints. Problems are: Problem set: 0 solved, 788 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1191 variables, 788/1282 constraints. Problems are: Problem set: 0 solved, 788 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1191/1191 variables, and 1282 constraints, problems are : Problem set: 0 solved, 788 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 397/397 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 788/788 constraints, Known Traps: 0/0 constraints]
After SMT, in 60410ms problems are : Problem set: 0 solved, 788 unsolved
Search for dead transitions found 0 dead transitions in 60418ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61140 ms. Remains : 397/397 places, 796/796 transitions.
Treatment of property NoC3x3-PT-6A-LTLFireability-05 finished in 188054 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((X(X(F(p1)))&&G(p2)&&p0))))'
Support contains 4 out of 436 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 846/846 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 422 transition count 787
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 422 transition count 787
Applied a total of 28 rules in 11 ms. Remains 422 /436 variables (removed 14) and now considering 787/846 (removed 59) transitions.
// Phase 1: matrix 787 rows 422 cols
[2024-05-26 03:15:21] [INFO ] Computed 57 invariants in 3 ms
[2024-05-26 03:15:22] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-05-26 03:15:22] [INFO ] Invariant cache hit.
[2024-05-26 03:15:22] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-26 03:15:22] [INFO ] Implicit Places using invariants and state equation in 430 ms returned []
Implicit Place search using SMT with State Equation took 601 ms to find 0 implicit places.
Running 786 sub problems to find dead transitions.
[2024-05-26 03:15:22] [INFO ] Invariant cache hit.
[2024-05-26 03:15:22] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 1 (OVERLAPS) 1/422 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 3 (OVERLAPS) 787/1209 variables, 422/479 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1209 variables, 17/496 constraints. Problems are: Problem set: 0 solved, 786 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1209/1209 variables, and 496 constraints, problems are : Problem set: 0 solved, 786 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 422/422 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 786/786 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 786 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 1 (OVERLAPS) 1/422 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 3 (OVERLAPS) 787/1209 variables, 422/479 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1209 variables, 17/496 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1209 variables, 786/1282 constraints. Problems are: Problem set: 0 solved, 786 unsolved
[2024-05-26 03:16:18] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1209/1209 variables, and 1283 constraints, problems are : Problem set: 0 solved, 786 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 422/422 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 786/786 constraints, Known Traps: 1/1 constraints]
After SMT, in 60285ms problems are : Problem set: 0 solved, 786 unsolved
Search for dead transitions found 0 dead transitions in 60292ms
Starting structural reductions in LTL mode, iteration 1 : 422/436 places, 787/846 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60907 ms. Remains : 422/436 places, 787/846 transitions.
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (NOT p2), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-6A-LTLFireability-06
Stuttering criterion allowed to conclude after 467 steps with 0 reset in 3 ms.
FORMULA NoC3x3-PT-6A-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6A-LTLFireability-06 finished in 61174 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 3 out of 436 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 436/436 places, 846/846 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 422 transition count 789
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 422 transition count 789
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 74 place count 398 transition count 765
Applied a total of 74 rules in 33 ms. Remains 398 /436 variables (removed 38) and now considering 765/846 (removed 81) transitions.
// Phase 1: matrix 765 rows 398 cols
[2024-05-26 03:16:23] [INFO ] Computed 57 invariants in 4 ms
[2024-05-26 03:16:23] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-26 03:16:23] [INFO ] Invariant cache hit.
[2024-05-26 03:16:23] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-26 03:16:23] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 602 ms to find 0 implicit places.
[2024-05-26 03:16:23] [INFO ] Redundant transitions in 8 ms returned []
Running 734 sub problems to find dead transitions.
[2024-05-26 03:16:23] [INFO ] Invariant cache hit.
[2024-05-26 03:16:23] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/389 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/389 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 2 (OVERLAPS) 9/398 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 4 (OVERLAPS) 765/1163 variables, 398/455 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1163 variables, 17/472 constraints. Problems are: Problem set: 0 solved, 734 unsolved
[2024-05-26 03:16:51] [INFO ] Deduced a trap composed of 28 places in 76 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1163/1163 variables, and 473 constraints, problems are : Problem set: 0 solved, 734 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 398/398 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 734/734 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 734 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/389 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/389 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/389 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 3 (OVERLAPS) 9/398 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 5 (OVERLAPS) 765/1163 variables, 398/456 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1163 variables, 17/473 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1163 variables, 734/1207 constraints. Problems are: Problem set: 0 solved, 734 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1163/1163 variables, and 1207 constraints, problems are : Problem set: 0 solved, 734 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 398/398 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 734/734 constraints, Known Traps: 1/1 constraints]
After SMT, in 60240ms problems are : Problem set: 0 solved, 734 unsolved
Search for dead transitions found 0 dead transitions in 60247ms
Starting structural reductions in SI_LTL mode, iteration 1 : 398/436 places, 765/846 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60897 ms. Remains : 398/436 places, 765/846 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-6A-LTLFireability-08
Product exploration explored 100000 steps with 297 reset in 351 ms.
Product exploration explored 100000 steps with 297 reset in 353 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
RANDOM walk for 40000 steps (117 resets) in 162 ms. (245 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 82 ms. (481 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 489090 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :0 out of 1
Probabilistic random walk after 489090 steps, saw 252748 distinct states, run finished after 3004 ms. (steps per millisecond=162 ) properties seen :0
[2024-05-26 03:17:27] [INFO ] Invariant cache hit.
[2024-05-26 03:17:27] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 76/102 variables, 26/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 153/255 variables, 27/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 23/278 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/278 variables, 23/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/278 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 269/547 variables, 67/158 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/547 variables, 3/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/547 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/547 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 40/587 variables, 12/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/587 variables, 17/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/587 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 291/878 variables, 92/283 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/878 variables, 6/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/878 variables, 6/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/878 variables, 0/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 24/902 variables, 8/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/902 variables, 22/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/902 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 150/1052 variables, 72/397 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1052 variables, 5/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1052 variables, 3/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1052 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 9/1061 variables, 4/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1061 variables, 5/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1061 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 76/1137 variables, 28/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1137 variables, 2/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1137 variables, 4/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1137 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 7/1144 variables, 4/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1144 variables, 7/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1144 variables, 0/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 19/1163 variables, 12/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1163 variables, 1/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1163 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 0/1163 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1163/1163 variables, and 472 constraints, problems are : Problem set: 0 solved, 1 unsolved in 341 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 398/398 constraints, ReadFeed: 17/17 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 76/102 variables, 26/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 153/255 variables, 27/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/255 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 23/278 variables, 9/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/278 variables, 23/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/278 variables, 0/92 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 269/547 variables, 67/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/547 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/547 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/547 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 40/587 variables, 12/175 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/587 variables, 17/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/587 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 291/878 variables, 92/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/878 variables, 6/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/878 variables, 6/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/878 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 24/902 variables, 8/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/902 variables, 22/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/902 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 150/1052 variables, 72/398 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1052 variables, 5/403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1052 variables, 3/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1052 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 9/1061 variables, 4/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1061 variables, 5/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1061 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 76/1137 variables, 28/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1137 variables, 2/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1137 variables, 4/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1137 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 7/1144 variables, 4/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1144 variables, 7/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1144 variables, 0/460 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 19/1163 variables, 12/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1163 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1163 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 0/1163 variables, 0/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1163/1163 variables, and 473 constraints, problems are : Problem set: 0 solved, 1 unsolved in 385 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 398/398 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 735ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 43 ms.
Support contains 3 out of 398 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 398/398 places, 765/765 transitions.
Free-agglomeration rule applied 31 times.
Iterating global reduction 0 with 31 rules applied. Total rules applied 31 place count 398 transition count 734
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 0 with 31 rules applied. Total rules applied 62 place count 367 transition count 734
Applied a total of 62 rules in 26 ms. Remains 367 /398 variables (removed 31) and now considering 734/765 (removed 31) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 367/398 places, 734/765 transitions.
RANDOM walk for 40000 steps (10 resets) in 151 ms. (263 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (8 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 713118 steps, run timeout after 3001 ms. (steps per millisecond=237 ) properties seen :0 out of 1
Probabilistic random walk after 713118 steps, saw 405434 distinct states, run finished after 3001 ms. (steps per millisecond=237 ) properties seen :0
// Phase 1: matrix 734 rows 367 cols
[2024-05-26 03:17:31] [INFO ] Computed 57 invariants in 6 ms
[2024-05-26 03:17:31] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 76/102 variables, 26/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 150/252 variables, 26/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 22/274 variables, 9/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 22/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 259/533 variables, 62/151 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/533 variables, 3/154 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/533 variables, 1/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/533 variables, 0/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 36/569 variables, 12/167 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/569 variables, 15/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/569 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 279/848 variables, 86/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/848 variables, 6/274 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/848 variables, 6/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/848 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 24/872 variables, 8/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/872 variables, 22/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/872 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 130/1002 variables, 62/372 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1002 variables, 5/377 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1002 variables, 3/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1002 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 9/1011 variables, 4/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/1011 variables, 5/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1011 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (OVERLAPS) 72/1083 variables, 26/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (INCLUDED_ONLY) 0/1083 variables, 2/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1083 variables, 4/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1083 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (OVERLAPS) 7/1090 variables, 4/425 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (INCLUDED_ONLY) 0/1090 variables, 7/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1090 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (OVERLAPS) 11/1101 variables, 8/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (INCLUDED_ONLY) 0/1101 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1101 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (OVERLAPS) 0/1101 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1101/1101 variables, and 441 constraints, problems are : Problem set: 0 solved, 1 unsolved in 304 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 367/367 constraints, ReadFeed: 17/17 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 23/26 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 76/102 variables, 26/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/102 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 150/252 variables, 26/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/252 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/252 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/252 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 22/274 variables, 9/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 22/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 259/533 variables, 62/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/533 variables, 3/155 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/533 variables, 1/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/533 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 36/569 variables, 12/168 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/569 variables, 15/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/569 variables, 0/183 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 279/848 variables, 86/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/848 variables, 6/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/848 variables, 6/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/848 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 24/872 variables, 8/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/872 variables, 22/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/872 variables, 0/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 130/1002 variables, 62/373 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1002 variables, 5/378 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1002 variables, 3/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1002 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 9/1011 variables, 4/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/1011 variables, 5/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/1011 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 72/1083 variables, 26/416 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 34 (INCLUDED_ONLY) 0/1083 variables, 2/418 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 35 (INCLUDED_ONLY) 0/1083 variables, 4/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 36 (INCLUDED_ONLY) 0/1083 variables, 0/422 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 37 (OVERLAPS) 7/1090 variables, 4/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 38 (INCLUDED_ONLY) 0/1090 variables, 7/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 39 (INCLUDED_ONLY) 0/1090 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 40 (OVERLAPS) 11/1101 variables, 8/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 41 (INCLUDED_ONLY) 0/1101 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 42 (INCLUDED_ONLY) 0/1101 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 43 (OVERLAPS) 0/1101 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1101/1101 variables, and 442 constraints, problems are : Problem set: 0 solved, 1 unsolved in 332 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 367/367 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 649ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 3 out of 367 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 367/367 places, 734/734 transitions.
Applied a total of 0 rules in 9 ms. Remains 367 /367 variables (removed 0) and now considering 734/734 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 367/367 places, 734/734 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 367/367 places, 734/734 transitions.
Applied a total of 0 rules in 9 ms. Remains 367 /367 variables (removed 0) and now considering 734/734 (removed 0) transitions.
[2024-05-26 03:17:32] [INFO ] Invariant cache hit.
[2024-05-26 03:17:32] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-05-26 03:17:32] [INFO ] Invariant cache hit.
[2024-05-26 03:17:32] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-26 03:17:33] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 555 ms to find 0 implicit places.
[2024-05-26 03:17:33] [INFO ] Redundant transitions in 7 ms returned []
Running 703 sub problems to find dead transitions.
[2024-05-26 03:17:33] [INFO ] Invariant cache hit.
[2024-05-26 03:17:33] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/367 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/367 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 2 (OVERLAPS) 734/1101 variables, 367/424 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1101 variables, 17/441 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1101 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 5 (OVERLAPS) 0/1101 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 703 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1101/1101 variables, and 441 constraints, problems are : Problem set: 0 solved, 703 unsolved in 28353 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 367/367 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 703/703 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 703 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/367 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/367 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 2 (OVERLAPS) 734/1101 variables, 367/424 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1101 variables, 17/441 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1101 variables, 703/1144 constraints. Problems are: Problem set: 0 solved, 703 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1101 variables, 0/1144 constraints. Problems are: Problem set: 0 solved, 703 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1101/1101 variables, and 1144 constraints, problems are : Problem set: 0 solved, 703 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 367/367 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 703/703 constraints, Known Traps: 0/0 constraints]
After SMT, in 58555ms problems are : Problem set: 0 solved, 703 unsolved
Search for dead transitions found 0 dead transitions in 58573ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59150 ms. Remains : 367/367 places, 734/734 transitions.
Attempting over-approximation, by ignoring read arcs.
Applied a total of 0 rules in 24 ms. Remains 367 /367 variables (removed 0) and now considering 734/734 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-26 03:18:31] [INFO ] Invariant cache hit.
[2024-05-26 03:18:31] [INFO ] [Real]Absence check using 57 positive place invariants in 8 ms returned sat
[2024-05-26 03:18:31] [INFO ] After 248ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-26 03:18:32] [INFO ] [Nat]Absence check using 57 positive place invariants in 8 ms returned sat
[2024-05-26 03:18:32] [INFO ] After 170ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-26 03:18:32] [INFO ] After 212ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-26 03:18:32] [INFO ] After 299ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 585 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Support contains 3 out of 398 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 398/398 places, 765/765 transitions.
Applied a total of 0 rules in 14 ms. Remains 398 /398 variables (removed 0) and now considering 765/765 (removed 0) transitions.
// Phase 1: matrix 765 rows 398 cols
[2024-05-26 03:18:32] [INFO ] Computed 57 invariants in 6 ms
[2024-05-26 03:18:32] [INFO ] Implicit Places using invariants in 183 ms returned []
[2024-05-26 03:18:32] [INFO ] Invariant cache hit.
[2024-05-26 03:18:32] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-26 03:18:33] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 595 ms to find 0 implicit places.
[2024-05-26 03:18:33] [INFO ] Redundant transitions in 8 ms returned []
Running 734 sub problems to find dead transitions.
[2024-05-26 03:18:33] [INFO ] Invariant cache hit.
[2024-05-26 03:18:33] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/389 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/389 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 2 (OVERLAPS) 9/398 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 4 (OVERLAPS) 765/1163 variables, 398/455 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1163 variables, 17/472 constraints. Problems are: Problem set: 0 solved, 734 unsolved
[2024-05-26 03:18:59] [INFO ] Deduced a trap composed of 28 places in 66 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/1163 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 734 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1163/1163 variables, and 473 constraints, problems are : Problem set: 0 solved, 734 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 398/398 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 734/734 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 734 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/389 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/389 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/389 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 3 (OVERLAPS) 9/398 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 5 (OVERLAPS) 765/1163 variables, 398/456 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1163 variables, 17/473 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1163 variables, 734/1207 constraints. Problems are: Problem set: 0 solved, 734 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1163/1163 variables, and 1207 constraints, problems are : Problem set: 0 solved, 734 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 398/398 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 734/734 constraints, Known Traps: 1/1 constraints]
After SMT, in 60256ms problems are : Problem set: 0 solved, 734 unsolved
Search for dead transitions found 0 dead transitions in 60263ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60889 ms. Remains : 398/398 places, 765/765 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 : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 34348 steps (100 resets) in 158 ms. (216 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Product exploration explored 100000 steps with 285 reset in 306 ms.
Product exploration explored 100000 steps with 294 reset in 337 ms.
Support contains 3 out of 398 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 398/398 places, 765/765 transitions.
Applied a total of 0 rules in 9 ms. Remains 398 /398 variables (removed 0) and now considering 765/765 (removed 0) transitions.
[2024-05-26 03:19:34] [INFO ] Invariant cache hit.
[2024-05-26 03:19:34] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-26 03:19:34] [INFO ] Invariant cache hit.
[2024-05-26 03:19:34] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-26 03:19:34] [INFO ] Implicit Places using invariants and state equation in 398 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
[2024-05-26 03:19:34] [INFO ] Redundant transitions in 8 ms returned []
Running 734 sub problems to find dead transitions.
[2024-05-26 03:19:34] [INFO ] Invariant cache hit.
[2024-05-26 03:19:34] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/389 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/389 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 2 (OVERLAPS) 9/398 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 4 (OVERLAPS) 765/1163 variables, 398/455 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1163 variables, 17/472 constraints. Problems are: Problem set: 0 solved, 734 unsolved
[2024-05-26 03:20:01] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 6 (INCLUDED_ONLY) 0/1163 variables, 1/473 constraints. Problems are: Problem set: 0 solved, 734 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1163/1163 variables, and 473 constraints, problems are : Problem set: 0 solved, 734 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 398/398 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 734/734 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 734 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/389 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/389 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/389 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 3 (OVERLAPS) 9/398 variables, 9/58 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/398 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 5 (OVERLAPS) 765/1163 variables, 398/456 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1163 variables, 17/473 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1163 variables, 734/1207 constraints. Problems are: Problem set: 0 solved, 734 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1163/1163 variables, and 1207 constraints, problems are : Problem set: 0 solved, 734 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 398/398 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 734/734 constraints, Known Traps: 1/1 constraints]
After SMT, in 60233ms problems are : Problem set: 0 solved, 734 unsolved
Search for dead transitions found 0 dead transitions in 60240ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60825 ms. Remains : 398/398 places, 765/765 transitions.
Treatment of property NoC3x3-PT-6A-LTLFireability-08 finished in 252144 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 2 out of 436 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 436/436 places, 846/846 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 421 transition count 786
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 421 transition count 786
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 76 place count 397 transition count 762
Applied a total of 76 rules in 20 ms. Remains 397 /436 variables (removed 39) and now considering 762/846 (removed 84) transitions.
// Phase 1: matrix 762 rows 397 cols
[2024-05-26 03:20:35] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 03:20:35] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-26 03:20:35] [INFO ] Invariant cache hit.
[2024-05-26 03:20:35] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-26 03:20:35] [INFO ] Implicit Places using invariants and state equation in 412 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
[2024-05-26 03:20:35] [INFO ] Redundant transitions in 7 ms returned []
Running 731 sub problems to find dead transitions.
[2024-05-26 03:20:35] [INFO ] Invariant cache hit.
[2024-05-26 03:20:35] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/388 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 731 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/388 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 731 unsolved
At refinement iteration 2 (OVERLAPS) 9/397 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 731 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/397 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 731 unsolved
At refinement iteration 4 (OVERLAPS) 762/1159 variables, 397/454 constraints. Problems are: Problem set: 0 solved, 731 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1159 variables, 17/471 constraints. Problems are: Problem set: 0 solved, 731 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1159 variables, 0/471 constraints. Problems are: Problem set: 0 solved, 731 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1159/1159 variables, and 471 constraints, problems are : Problem set: 0 solved, 731 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 397/397 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 731/731 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 731 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/388 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 731 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/388 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 731 unsolved
At refinement iteration 2 (OVERLAPS) 9/397 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 731 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/397 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 731 unsolved
At refinement iteration 4 (OVERLAPS) 762/1159 variables, 397/454 constraints. Problems are: Problem set: 0 solved, 731 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1159 variables, 17/471 constraints. Problems are: Problem set: 0 solved, 731 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1159 variables, 731/1202 constraints. Problems are: Problem set: 0 solved, 731 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1159/1159 variables, and 1202 constraints, problems are : Problem set: 0 solved, 731 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 397/397 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 731/731 constraints, Known Traps: 0/0 constraints]
After SMT, in 60252ms problems are : Problem set: 0 solved, 731 unsolved
Search for dead transitions found 0 dead transitions in 60258ms
Starting structural reductions in SI_LTL mode, iteration 1 : 397/436 places, 762/846 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60877 ms. Remains : 397/436 places, 762/846 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-6A-LTLFireability-09
Stuttering criterion allowed to conclude after 217 steps with 0 reset in 3 ms.
FORMULA NoC3x3-PT-6A-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6A-LTLFireability-09 finished in 60933 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 4 out of 436 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 846/846 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 423 transition count 793
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 423 transition count 793
Applied a total of 26 rules in 10 ms. Remains 423 /436 variables (removed 13) and now considering 793/846 (removed 53) transitions.
[2024-05-26 03:21:36] [INFO ] Flow matrix only has 791 transitions (discarded 2 similar events)
// Phase 1: matrix 791 rows 423 cols
[2024-05-26 03:21:36] [INFO ] Computed 57 invariants in 4 ms
[2024-05-26 03:21:36] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-26 03:21:36] [INFO ] Flow matrix only has 791 transitions (discarded 2 similar events)
[2024-05-26 03:21:36] [INFO ] Invariant cache hit.
[2024-05-26 03:21:36] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-26 03:21:36] [INFO ] Implicit Places using invariants and state equation in 455 ms returned []
Implicit Place search using SMT with State Equation took 637 ms to find 0 implicit places.
Running 792 sub problems to find dead transitions.
[2024-05-26 03:21:36] [INFO ] Flow matrix only has 791 transitions (discarded 2 similar events)
[2024-05-26 03:21:36] [INFO ] Invariant cache hit.
[2024-05-26 03:21:36] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 1 (OVERLAPS) 1/423 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 3 (OVERLAPS) 791/1214 variables, 423/480 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1214 variables, 17/497 constraints. Problems are: Problem set: 0 solved, 792 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1214/1214 variables, and 497 constraints, problems are : Problem set: 0 solved, 792 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 423/423 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 792/792 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 792 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 1 (OVERLAPS) 1/423 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 3 (OVERLAPS) 791/1214 variables, 423/480 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1214 variables, 17/497 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1214 variables, 792/1289 constraints. Problems are: Problem set: 0 solved, 792 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 1214/1214 variables, and 1289 constraints, problems are : Problem set: 0 solved, 792 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 423/423 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 792/792 constraints, Known Traps: 0/0 constraints]
After SMT, in 60281ms problems are : Problem set: 0 solved, 792 unsolved
Search for dead transitions found 0 dead transitions in 60288ms
Starting structural reductions in LTL mode, iteration 1 : 423/436 places, 793/846 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60939 ms. Remains : 423/436 places, 793/846 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-6A-LTLFireability-10
Stuttering criterion allowed to conclude after 1156 steps with 9 reset in 7 ms.
FORMULA NoC3x3-PT-6A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6A-LTLFireability-10 finished in 61087 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G((p1||F(p2))))))'
Support contains 4 out of 436 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 846/846 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 422 transition count 787
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 422 transition count 787
Applied a total of 28 rules in 14 ms. Remains 422 /436 variables (removed 14) and now considering 787/846 (removed 59) transitions.
// Phase 1: matrix 787 rows 422 cols
[2024-05-26 03:22:37] [INFO ] Computed 57 invariants in 7 ms
[2024-05-26 03:22:37] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-05-26 03:22:37] [INFO ] Invariant cache hit.
[2024-05-26 03:22:37] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-26 03:22:37] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 630 ms to find 0 implicit places.
Running 786 sub problems to find dead transitions.
[2024-05-26 03:22:37] [INFO ] Invariant cache hit.
[2024-05-26 03:22:37] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 1 (OVERLAPS) 1/422 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 3 (OVERLAPS) 787/1209 variables, 422/479 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1209 variables, 17/496 constraints. Problems are: Problem set: 0 solved, 786 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1209/1209 variables, and 496 constraints, problems are : Problem set: 0 solved, 786 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 422/422 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 786/786 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 786 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 1 (OVERLAPS) 1/422 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 3 (OVERLAPS) 787/1209 variables, 422/479 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1209 variables, 17/496 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1209 variables, 786/1282 constraints. Problems are: Problem set: 0 solved, 786 unsolved
[2024-05-26 03:23:34] [INFO ] Deduced a trap composed of 15 places in 45 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1209/1209 variables, and 1283 constraints, problems are : Problem set: 0 solved, 786 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 422/422 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 786/786 constraints, Known Traps: 1/1 constraints]
After SMT, in 60275ms problems are : Problem set: 0 solved, 786 unsolved
Search for dead transitions found 0 dead transitions in 60282ms
Starting structural reductions in LTL mode, iteration 1 : 422/436 places, 787/846 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60927 ms. Remains : 422/436 places, 787/846 transitions.
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-6A-LTLFireability-11
Stuttering criterion allowed to conclude after 386 steps with 1 reset in 3 ms.
FORMULA NoC3x3-PT-6A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6A-LTLFireability-11 finished in 61134 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&&F(p1)))))'
Support contains 4 out of 436 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 846/846 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 423 transition count 794
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 423 transition count 794
Applied a total of 26 rules in 11 ms. Remains 423 /436 variables (removed 13) and now considering 794/846 (removed 52) transitions.
[2024-05-26 03:23:38] [INFO ] Flow matrix only has 792 transitions (discarded 2 similar events)
// Phase 1: matrix 792 rows 423 cols
[2024-05-26 03:23:38] [INFO ] Computed 57 invariants in 7 ms
[2024-05-26 03:23:38] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-05-26 03:23:38] [INFO ] Flow matrix only has 792 transitions (discarded 2 similar events)
[2024-05-26 03:23:38] [INFO ] Invariant cache hit.
[2024-05-26 03:23:38] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-26 03:23:39] [INFO ] Implicit Places using invariants and state equation in 449 ms returned []
Implicit Place search using SMT with State Equation took 640 ms to find 0 implicit places.
Running 793 sub problems to find dead transitions.
[2024-05-26 03:23:39] [INFO ] Flow matrix only has 792 transitions (discarded 2 similar events)
[2024-05-26 03:23:39] [INFO ] Invariant cache hit.
[2024-05-26 03:23:39] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 1 (OVERLAPS) 1/423 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 3 (OVERLAPS) 792/1215 variables, 423/480 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1215 variables, 17/497 constraints. Problems are: Problem set: 0 solved, 793 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1215/1215 variables, and 497 constraints, problems are : Problem set: 0 solved, 793 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 423/423 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 793/793 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 793 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 1 (OVERLAPS) 1/423 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 3 (OVERLAPS) 792/1215 variables, 423/480 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1215 variables, 17/497 constraints. Problems are: Problem set: 0 solved, 793 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1215 variables, 793/1290 constraints. Problems are: Problem set: 0 solved, 793 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1215/1215 variables, and 1290 constraints, problems are : Problem set: 0 solved, 793 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 423/423 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 793/793 constraints, Known Traps: 0/0 constraints]
After SMT, in 60278ms problems are : Problem set: 0 solved, 793 unsolved
Search for dead transitions found 0 dead transitions in 60285ms
Starting structural reductions in LTL mode, iteration 1 : 423/436 places, 794/846 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60939 ms. Remains : 423/436 places, 794/846 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : NoC3x3-PT-6A-LTLFireability-12
Entered a terminal (fully accepting) state of product in 4340 steps with 13 reset in 19 ms.
FORMULA NoC3x3-PT-6A-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6A-LTLFireability-12 finished in 61121 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((F((G(F(p1))||G(p2)))&&p0)))))'
Support contains 4 out of 436 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 846/846 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 424 transition count 793
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 424 transition count 793
Applied a total of 24 rules in 9 ms. Remains 424 /436 variables (removed 12) and now considering 793/846 (removed 53) transitions.
// Phase 1: matrix 793 rows 424 cols
[2024-05-26 03:24:39] [INFO ] Computed 57 invariants in 2 ms
[2024-05-26 03:24:39] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-26 03:24:39] [INFO ] Invariant cache hit.
[2024-05-26 03:24:39] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-26 03:24:40] [INFO ] Implicit Places using invariants and state equation in 422 ms returned []
Implicit Place search using SMT with State Equation took 613 ms to find 0 implicit places.
Running 792 sub problems to find dead transitions.
[2024-05-26 03:24:40] [INFO ] Invariant cache hit.
[2024-05-26 03:24:40] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 1 (OVERLAPS) 1/424 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/424 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 3 (OVERLAPS) 793/1217 variables, 424/481 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1217 variables, 17/498 constraints. Problems are: Problem set: 0 solved, 792 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1217/1217 variables, and 498 constraints, problems are : Problem set: 0 solved, 792 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 424/424 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 792/792 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 792 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/423 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 1 (OVERLAPS) 1/424 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/424 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 3 (OVERLAPS) 793/1217 variables, 424/481 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1217 variables, 17/498 constraints. Problems are: Problem set: 0 solved, 792 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1217 variables, 792/1290 constraints. Problems are: Problem set: 0 solved, 792 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1217/1217 variables, and 1290 constraints, problems are : Problem set: 0 solved, 792 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 424/424 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 792/792 constraints, Known Traps: 0/0 constraints]
After SMT, in 60270ms problems are : Problem set: 0 solved, 792 unsolved
Search for dead transitions found 0 dead transitions in 60276ms
Starting structural reductions in LTL mode, iteration 1 : 424/436 places, 793/846 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60901 ms. Remains : 424/436 places, 793/846 transitions.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p1) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-6A-LTLFireability-13
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-6A-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6A-LTLFireability-13 finished in 61109 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G((!p0 U p1)))))'
Support contains 3 out of 436 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 436/436 places, 846/846 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 422 transition count 789
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 422 transition count 789
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 74 place count 398 transition count 765
Applied a total of 74 rules in 36 ms. Remains 398 /436 variables (removed 38) and now considering 765/846 (removed 81) transitions.
// Phase 1: matrix 765 rows 398 cols
[2024-05-26 03:25:40] [INFO ] Computed 57 invariants in 4 ms
[2024-05-26 03:25:40] [INFO ] Implicit Places using invariants in 171 ms returned []
[2024-05-26 03:25:40] [INFO ] Invariant cache hit.
[2024-05-26 03:25:41] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-26 03:25:41] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
[2024-05-26 03:25:41] [INFO ] Redundant transitions in 8 ms returned []
Running 734 sub problems to find dead transitions.
[2024-05-26 03:25:41] [INFO ] Invariant cache hit.
[2024-05-26 03:25:41] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/389 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/389 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 2 (OVERLAPS) 9/398 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 4 (OVERLAPS) 765/1163 variables, 398/455 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1163 variables, 17/472 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1163 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 734 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1163/1163 variables, and 472 constraints, problems are : Problem set: 0 solved, 734 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 398/398 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 734/734 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 734 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/389 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/389 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 2 (OVERLAPS) 9/398 variables, 9/57 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/398 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 4 (OVERLAPS) 765/1163 variables, 398/455 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1163 variables, 17/472 constraints. Problems are: Problem set: 0 solved, 734 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1163 variables, 734/1206 constraints. Problems are: Problem set: 0 solved, 734 unsolved
[2024-05-26 03:26:28] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1163/1163 variables, and 1207 constraints, problems are : Problem set: 0 solved, 734 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 398/398 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 734/734 constraints, Known Traps: 1/1 constraints]
After SMT, in 60231ms problems are : Problem set: 0 solved, 734 unsolved
Search for dead transitions found 0 dead transitions in 60237ms
Starting structural reductions in SI_LTL mode, iteration 1 : 398/436 places, 765/846 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 60915 ms. Remains : 398/436 places, 765/846 transitions.
Stuttering acceptance computed with spot in 134 ms :[(NOT p1), (NOT p1), true, (NOT p1)]
Running random walk in product with property : NoC3x3-PT-6A-LTLFireability-14
Entered a terminal (fully accepting) state of product in 125 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-6A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6A-LTLFireability-14 finished in 61073 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((p0||G(p1)||X(F(p2))))))'
Support contains 3 out of 436 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 436/436 places, 846/846 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 422 transition count 787
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 422 transition count 787
Applied a total of 28 rules in 9 ms. Remains 422 /436 variables (removed 14) and now considering 787/846 (removed 59) transitions.
// Phase 1: matrix 787 rows 422 cols
[2024-05-26 03:26:41] [INFO ] Computed 57 invariants in 5 ms
[2024-05-26 03:26:41] [INFO ] Implicit Places using invariants in 186 ms returned []
[2024-05-26 03:26:41] [INFO ] Invariant cache hit.
[2024-05-26 03:26:42] [INFO ] State equation strengthened by 17 read => feed constraints.
[2024-05-26 03:26:42] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
Running 786 sub problems to find dead transitions.
[2024-05-26 03:26:42] [INFO ] Invariant cache hit.
[2024-05-26 03:26:42] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 1 (OVERLAPS) 1/422 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 3 (OVERLAPS) 787/1209 variables, 422/479 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1209 variables, 17/496 constraints. Problems are: Problem set: 0 solved, 786 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1209/1209 variables, and 496 constraints, problems are : Problem set: 0 solved, 786 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 422/422 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 786/786 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 786 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 1 (OVERLAPS) 1/422 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 3 (OVERLAPS) 787/1209 variables, 422/479 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1209 variables, 17/496 constraints. Problems are: Problem set: 0 solved, 786 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1209 variables, 786/1282 constraints. Problems are: Problem set: 0 solved, 786 unsolved
[2024-05-26 03:27:38] [INFO ] Deduced a trap composed of 15 places in 46 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1209/1209 variables, and 1283 constraints, problems are : Problem set: 0 solved, 786 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 422/422 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 786/786 constraints, Known Traps: 1/1 constraints]
After SMT, in 60274ms problems are : Problem set: 0 solved, 786 unsolved
Search for dead transitions found 0 dead transitions in 60281ms
Starting structural reductions in LTL mode, iteration 1 : 422/436 places, 787/846 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60951 ms. Remains : 422/436 places, 787/846 transitions.
Stuttering acceptance computed with spot in 216 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-6A-LTLFireability-15
Product exploration explored 100000 steps with 33333 reset in 701 ms.
Product exploration explored 100000 steps with 33333 reset in 707 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 17 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-6A-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-6A-LTLFireability-15 finished in 62617 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
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)))'
[2024-05-26 03:27:44] [INFO ] Flatten gal took : 55 ms
[2024-05-26 03:27:44] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-05-26 03:27:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 436 places, 846 transitions and 3178 arcs took 8 ms.
Total runtime 1243433 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running NoC3x3-PT-6A

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/414/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 436
TRANSITIONS: 846
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.018s, Sys 0.001s]


SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.002s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1506
MODEL NAME: /home/mcc/execution/414/model
436 places, 846 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.

BK_TIME_CONFINEMENT_REACHED

--------------------
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
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="NoC3x3-PT-6A"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is NoC3x3-PT-6A, 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 r245-tall-171654350300636"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-6A.tgz
mv NoC3x3-PT-6A 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 ;