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.r508-tall-171654352000627.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is NoC3x3-PT-5B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r508-tall-171654352000627
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 988K
-rw-r--r-- 1 mcc users 7.4K 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.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K 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 Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K 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 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 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:28 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 525K 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-5B-LTLCardinality-00
FORMULA_NAME NoC3x3-PT-5B-LTLCardinality-01
FORMULA_NAME NoC3x3-PT-5B-LTLCardinality-02
FORMULA_NAME NoC3x3-PT-5B-LTLCardinality-03
FORMULA_NAME NoC3x3-PT-5B-LTLCardinality-04
FORMULA_NAME NoC3x3-PT-5B-LTLCardinality-05
FORMULA_NAME NoC3x3-PT-5B-LTLCardinality-06
FORMULA_NAME NoC3x3-PT-5B-LTLCardinality-07
FORMULA_NAME NoC3x3-PT-5B-LTLCardinality-08
FORMULA_NAME NoC3x3-PT-5B-LTLCardinality-09
FORMULA_NAME NoC3x3-PT-5B-LTLCardinality-10
FORMULA_NAME NoC3x3-PT-5B-LTLCardinality-11
FORMULA_NAME NoC3x3-PT-5B-LTLCardinality-12
FORMULA_NAME NoC3x3-PT-5B-LTLCardinality-13
FORMULA_NAME NoC3x3-PT-5B-LTLCardinality-14
FORMULA_NAME NoC3x3-PT-5B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717242447151

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-5B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 11:47:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 11:47:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 11:47:28] [INFO ] Load time of PNML (sax parser for PT used): 171 ms
[2024-06-01 11:47:28] [INFO ] Transformed 1571 places.
[2024-06-01 11:47:28] [INFO ] Transformed 2173 transitions.
[2024-06-01 11:47:28] [INFO ] Found NUPN structural information;
[2024-06-01 11:47:28] [INFO ] Parsed PT model containing 1571 places and 2173 transitions and 6109 arcs in 302 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA NoC3x3-PT-5B-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5B-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5B-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5B-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5B-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5B-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5B-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5B-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5B-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 1571 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1571/1571 places, 2173/2173 transitions.
Discarding 433 places :
Symmetric choice reduction at 0 with 433 rule applications. Total rules 433 place count 1138 transition count 1740
Iterating global reduction 0 with 433 rules applied. Total rules applied 866 place count 1138 transition count 1740
Discarding 111 places :
Symmetric choice reduction at 0 with 111 rule applications. Total rules 977 place count 1027 transition count 1621
Iterating global reduction 0 with 111 rules applied. Total rules applied 1088 place count 1027 transition count 1621
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 1177 place count 938 transition count 1468
Iterating global reduction 0 with 89 rules applied. Total rules applied 1266 place count 938 transition count 1468
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 1289 place count 915 transition count 1422
Iterating global reduction 0 with 23 rules applied. Total rules applied 1312 place count 915 transition count 1422
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 1317 place count 910 transition count 1412
Iterating global reduction 0 with 5 rules applied. Total rules applied 1322 place count 910 transition count 1412
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 1327 place count 905 transition count 1407
Iterating global reduction 0 with 5 rules applied. Total rules applied 1332 place count 905 transition count 1407
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1333 place count 904 transition count 1405
Iterating global reduction 0 with 1 rules applied. Total rules applied 1334 place count 904 transition count 1405
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1335 place count 903 transition count 1402
Iterating global reduction 0 with 1 rules applied. Total rules applied 1336 place count 903 transition count 1402
Applied a total of 1336 rules in 401 ms. Remains 903 /1571 variables (removed 668) and now considering 1402/2173 (removed 771) transitions.
// Phase 1: matrix 1402 rows 903 cols
[2024-06-01 11:47:29] [INFO ] Computed 66 invariants in 28 ms
[2024-06-01 11:47:29] [INFO ] Implicit Places using invariants in 519 ms returned []
[2024-06-01 11:47:29] [INFO ] Invariant cache hit.
[2024-06-01 11:47:30] [INFO ] Implicit Places using invariants and state equation in 816 ms returned []
Implicit Place search using SMT with State Equation took 1365 ms to find 0 implicit places.
Running 1401 sub problems to find dead transitions.
[2024-06-01 11:47:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/902 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1401 unsolved
SMT process timed out in 30547ms, After SMT, problems are : Problem set: 0 solved, 1401 unsolved
Search for dead transitions found 0 dead transitions in 30573ms
Starting structural reductions in LTL mode, iteration 1 : 903/1571 places, 1402/2173 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32365 ms. Remains : 903/1571 places, 1402/2173 transitions.
Support contains 24 out of 903 places after structural reductions.
[2024-06-01 11:48:01] [INFO ] Flatten gal took : 121 ms
[2024-06-01 11:48:01] [INFO ] Flatten gal took : 70 ms
[2024-06-01 11:48:01] [INFO ] Input system was already deterministic with 1402 transitions.
Support contains 22 out of 903 places (down from 24) after GAL structural reductions.
RANDOM walk for 40000 steps (59 resets) in 1363 ms. (29 steps per ms) remains 1/15 properties
BEST_FIRST walk for 40003 steps (9 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
[2024-06-01 11:48:02] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 862/903 variables, 65/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/903 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1402/2305 variables, 903/969 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2305 variables, 0/969 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/2305 variables, 0/969 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2305/2305 variables, and 969 constraints, problems are : Problem set: 0 solved, 1 unsolved in 559 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 903/903 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 862/903 variables, 65/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/903 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1402/2305 variables, 903/969 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2305 variables, 1/970 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2305 variables, 0/970 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/2305 variables, 0/970 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2305/2305 variables, and 970 constraints, problems are : Problem set: 0 solved, 1 unsolved in 678 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, State Equation: 903/903 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1255ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 65 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=32 )
Parikh walk visited 1 properties in 7 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(!p0 U (G(!p0)||(!p0&&G(p1))))))'
Support contains 3 out of 903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 903/903 places, 1402/1402 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 889 transition count 1387
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 889 transition count 1387
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 882 transition count 1377
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 882 transition count 1377
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 880 transition count 1373
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 880 transition count 1373
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 878 transition count 1369
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 878 transition count 1369
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 877 transition count 1367
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 877 transition count 1367
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 876 transition count 1364
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 876 transition count 1364
Applied a total of 54 rules in 142 ms. Remains 876 /903 variables (removed 27) and now considering 1364/1402 (removed 38) transitions.
// Phase 1: matrix 1364 rows 876 cols
[2024-06-01 11:48:03] [INFO ] Computed 66 invariants in 15 ms
[2024-06-01 11:48:04] [INFO ] Implicit Places using invariants in 274 ms returned []
[2024-06-01 11:48:04] [INFO ] Invariant cache hit.
[2024-06-01 11:48:05] [INFO ] Implicit Places using invariants and state equation in 834 ms returned []
Implicit Place search using SMT with State Equation took 1110 ms to find 0 implicit places.
Running 1363 sub problems to find dead transitions.
[2024-06-01 11:48:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/875 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1363 unsolved
SMT process timed out in 30462ms, After SMT, problems are : Problem set: 0 solved, 1363 unsolved
Search for dead transitions found 0 dead transitions in 30474ms
Starting structural reductions in LTL mode, iteration 1 : 876/903 places, 1364/1402 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31731 ms. Remains : 876/903 places, 1364/1402 transitions.
Stuttering acceptance computed with spot in 358 ms :[true, (NOT p0), false, false, p0, (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-5B-LTLCardinality-01
Product exploration explored 100000 steps with 50000 reset in 428 ms.
Product exploration explored 100000 steps with 50000 reset in 299 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (AND p1 p0))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 22 ms. Reduced automaton from 7 states, 15 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-5B-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-5B-LTLCardinality-01 finished in 32956 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 903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 903/903 places, 1402/1402 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 74 place count 902 transition count 1327
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 1 with 74 rules applied. Total rules applied 148 place count 828 transition count 1327
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 148 place count 828 transition count 1291
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 220 place count 792 transition count 1291
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 252 place count 760 transition count 1187
Iterating global reduction 2 with 32 rules applied. Total rules applied 284 place count 760 transition count 1187
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 284 place count 760 transition count 1186
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 286 place count 759 transition count 1186
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 293 place count 752 transition count 1174
Iterating global reduction 2 with 7 rules applied. Total rules applied 300 place count 752 transition count 1174
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 302 place count 750 transition count 1170
Iterating global reduction 2 with 2 rules applied. Total rules applied 304 place count 750 transition count 1170
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 306 place count 748 transition count 1164
Iterating global reduction 2 with 2 rules applied. Total rules applied 308 place count 748 transition count 1164
Performed 190 Post agglomeration using F-continuation condition.Transition count delta: 190
Deduced a syphon composed of 190 places in 1 ms
Reduce places removed 190 places and 0 transitions.
Iterating global reduction 2 with 380 rules applied. Total rules applied 688 place count 558 transition count 974
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 691 place count 558 transition count 971
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 692 place count 557 transition count 969
Iterating global reduction 3 with 1 rules applied. Total rules applied 693 place count 557 transition count 969
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 694 place count 556 transition count 967
Iterating global reduction 3 with 1 rules applied. Total rules applied 695 place count 556 transition count 967
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 696 place count 555 transition count 965
Iterating global reduction 3 with 1 rules applied. Total rules applied 697 place count 555 transition count 965
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 698 place count 554 transition count 962
Iterating global reduction 3 with 1 rules applied. Total rules applied 699 place count 554 transition count 962
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 700 place count 554 transition count 961
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 902 place count 453 transition count 989
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 914 place count 453 transition count 977
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 986 place count 417 transition count 985
Drop transitions (Redundant composition of simpler transitions.) removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 5 with 62 rules applied. Total rules applied 1048 place count 417 transition count 923
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 1057 place count 408 transition count 923
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 1057 place count 408 transition count 918
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 1067 place count 403 transition count 918
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 1103 place count 385 transition count 900
Partial Post-agglomeration rule applied 3 times.
Drop transitions (Partial Post agglomeration) removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 1106 place count 385 transition count 900
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1107 place count 384 transition count 899
Applied a total of 1107 rules in 378 ms. Remains 384 /903 variables (removed 519) and now considering 899/1402 (removed 503) transitions.
// Phase 1: matrix 899 rows 384 cols
[2024-06-01 11:48:37] [INFO ] Computed 57 invariants in 7 ms
[2024-06-01 11:48:37] [INFO ] Implicit Places using invariants in 194 ms returned []
[2024-06-01 11:48:37] [INFO ] Invariant cache hit.
[2024-06-01 11:48:37] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-06-01 11:48:37] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 638 ms to find 0 implicit places.
[2024-06-01 11:48:37] [INFO ] Redundant transitions in 45 ms returned []
Running 843 sub problems to find dead transitions.
[2024-06-01 11:48:37] [INFO ] Invariant cache hit.
[2024-06-01 11:48:37] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 843 unsolved
[2024-06-01 11:48:43] [INFO ] Deduced a trap composed of 54 places in 101 ms of which 10 ms to minimize.
[2024-06-01 11:48:44] [INFO ] Deduced a trap composed of 50 places in 102 ms of which 2 ms to minimize.
[2024-06-01 11:48:44] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
[2024-06-01 11:48:44] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:48:45] [INFO ] Deduced a trap composed of 17 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:48:45] [INFO ] Deduced a trap composed of 16 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:48:45] [INFO ] Deduced a trap composed of 26 places in 98 ms of which 1 ms to minimize.
[2024-06-01 11:48:45] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 2 ms to minimize.
[2024-06-01 11:48:46] [INFO ] Deduced a trap composed of 31 places in 88 ms of which 9 ms to minimize.
[2024-06-01 11:48:47] [INFO ] Deduced a trap composed of 24 places in 44 ms of which 1 ms to minimize.
[2024-06-01 11:48:48] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 2 ms to minimize.
[2024-06-01 11:48:48] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:48:48] [INFO ] Deduced a trap composed of 19 places in 55 ms of which 1 ms to minimize.
[2024-06-01 11:48:48] [INFO ] Deduced a trap composed of 30 places in 47 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 14/71 constraints. Problems are: Problem set: 0 solved, 843 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 843 unsolved
At refinement iteration 3 (OVERLAPS) 899/1283 variables, 384/455 constraints. Problems are: Problem set: 0 solved, 843 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1283 variables, 31/486 constraints. Problems are: Problem set: 0 solved, 843 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 1.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 1.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 1.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
timeout
( org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1283/1283 variables, and 486 constraints, problems are : Problem set: 0 solved, 843 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 384/384 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 843/843 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 843 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 843 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 14/71 constraints. Problems are: Problem set: 0 solved, 843 unsolved
[2024-06-01 11:49:10] [INFO ] Deduced a trap composed of 70 places in 92 ms of which 2 ms to minimize.
[2024-06-01 11:49:10] [INFO ] Deduced a trap composed of 80 places in 104 ms of which 2 ms to minimize.
[2024-06-01 11:49:10] [INFO ] Deduced a trap composed of 82 places in 108 ms of which 2 ms to minimize.
[2024-06-01 11:49:10] [INFO ] Deduced a trap composed of 35 places in 120 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 4/75 constraints. Problems are: Problem set: 0 solved, 843 unsolved
[2024-06-01 11:49:17] [INFO ] Deduced a trap composed of 72 places in 82 ms of which 2 ms to minimize.
[2024-06-01 11:49:18] [INFO ] Deduced a trap composed of 19 places in 81 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 843 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 843 unsolved
At refinement iteration 5 (OVERLAPS) 899/1283 variables, 384/461 constraints. Problems are: Problem set: 0 solved, 843 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1283 variables, 31/492 constraints. Problems are: Problem set: 0 solved, 843 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1283 variables, 843/1335 constraints. Problems are: Problem set: 0 solved, 843 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1283/1283 variables, and 1335 constraints, problems are : Problem set: 0 solved, 843 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 384/384 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 843/843 constraints, Known Traps: 20/20 constraints]
After SMT, in 60372ms problems are : Problem set: 0 solved, 843 unsolved
Search for dead transitions found 0 dead transitions in 60379ms
Starting structural reductions in SI_LTL mode, iteration 1 : 384/903 places, 899/1402 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61453 ms. Remains : 384/903 places, 899/1402 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-5B-LTLCardinality-02
Stuttering criterion allowed to conclude after 141 steps with 0 reset in 3 ms.
FORMULA NoC3x3-PT-5B-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLCardinality-02 finished in 61511 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||X(((G(p1)||p2) U p3))))'
Support contains 5 out of 903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 903/903 places, 1402/1402 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 889 transition count 1387
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 889 transition count 1387
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 881 transition count 1376
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 881 transition count 1376
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 879 transition count 1373
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 879 transition count 1373
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 877 transition count 1370
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 877 transition count 1370
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 875 transition count 1365
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 875 transition count 1365
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 874 transition count 1362
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 874 transition count 1362
Applied a total of 58 rules in 101 ms. Remains 874 /903 variables (removed 29) and now considering 1362/1402 (removed 40) transitions.
// Phase 1: matrix 1362 rows 874 cols
[2024-06-01 11:49:38] [INFO ] Computed 66 invariants in 13 ms
[2024-06-01 11:49:38] [INFO ] Implicit Places using invariants in 307 ms returned []
[2024-06-01 11:49:38] [INFO ] Invariant cache hit.
[2024-06-01 11:49:39] [INFO ] Implicit Places using invariants and state equation in 783 ms returned []
Implicit Place search using SMT with State Equation took 1092 ms to find 0 implicit places.
Running 1361 sub problems to find dead transitions.
[2024-06-01 11:49:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/873 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1361 unsolved
SMT process timed out in 30299ms, After SMT, problems are : Problem set: 0 solved, 1361 unsolved
Search for dead transitions found 0 dead transitions in 30312ms
Starting structural reductions in LTL mode, iteration 1 : 874/903 places, 1362/1402 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31508 ms. Remains : 874/903 places, 1362/1402 transitions.
Stuttering acceptance computed with spot in 230 ms :[(AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-5B-LTLCardinality-05
Stuttering criterion allowed to conclude after 658 steps with 0 reset in 10 ms.
FORMULA NoC3x3-PT-5B-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLCardinality-05 finished in 31772 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 903/903 places, 1402/1402 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 73 place count 902 transition count 1328
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 1 with 73 rules applied. Total rules applied 146 place count 829 transition count 1328
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 146 place count 829 transition count 1292
Deduced a syphon composed of 36 places in 10 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 218 place count 793 transition count 1292
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 251 place count 760 transition count 1187
Iterating global reduction 2 with 33 rules applied. Total rules applied 284 place count 760 transition count 1187
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 284 place count 760 transition count 1186
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 286 place count 759 transition count 1186
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 294 place count 751 transition count 1173
Iterating global reduction 2 with 8 rules applied. Total rules applied 302 place count 751 transition count 1173
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 304 place count 749 transition count 1169
Iterating global reduction 2 with 2 rules applied. Total rules applied 306 place count 749 transition count 1169
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 308 place count 747 transition count 1163
Iterating global reduction 2 with 2 rules applied. Total rules applied 310 place count 747 transition count 1163
Performed 191 Post agglomeration using F-continuation condition.Transition count delta: 191
Deduced a syphon composed of 191 places in 0 ms
Reduce places removed 191 places and 0 transitions.
Iterating global reduction 2 with 382 rules applied. Total rules applied 692 place count 556 transition count 972
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 695 place count 556 transition count 969
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 897 place count 455 transition count 997
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 911 place count 455 transition count 983
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 985 place count 418 transition count 991
Drop transitions (Redundant composition of simpler transitions.) removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 4 with 62 rules applied. Total rules applied 1047 place count 418 transition count 929
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1056 place count 409 transition count 929
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 1056 place count 409 transition count 924
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 1066 place count 404 transition count 924
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 1104 place count 385 transition count 905
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1105 place count 384 transition count 904
Applied a total of 1105 rules in 220 ms. Remains 384 /903 variables (removed 519) and now considering 904/1402 (removed 498) transitions.
// Phase 1: matrix 904 rows 384 cols
[2024-06-01 11:50:10] [INFO ] Computed 57 invariants in 5 ms
[2024-06-01 11:50:10] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-06-01 11:50:10] [INFO ] Invariant cache hit.
[2024-06-01 11:50:10] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-06-01 11:50:10] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 682 ms to find 0 implicit places.
[2024-06-01 11:50:10] [INFO ] Redundant transitions in 16 ms returned []
Running 849 sub problems to find dead transitions.
[2024-06-01 11:50:10] [INFO ] Invariant cache hit.
[2024-06-01 11:50:10] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 849 unsolved
[2024-06-01 11:50:16] [INFO ] Deduced a trap composed of 54 places in 75 ms of which 1 ms to minimize.
[2024-06-01 11:50:16] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 1 ms to minimize.
[2024-06-01 11:50:17] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 1 ms to minimize.
[2024-06-01 11:50:17] [INFO ] Deduced a trap composed of 30 places in 88 ms of which 2 ms to minimize.
[2024-06-01 11:50:18] [INFO ] Deduced a trap composed of 28 places in 82 ms of which 1 ms to minimize.
[2024-06-01 11:50:18] [INFO ] Deduced a trap composed of 34 places in 94 ms of which 1 ms to minimize.
[2024-06-01 11:50:18] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-06-01 11:50:18] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 0 ms to minimize.
[2024-06-01 11:50:18] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-06-01 11:50:19] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 2 ms to minimize.
[2024-06-01 11:50:20] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 0 ms to minimize.
[2024-06-01 11:50:21] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:50:21] [INFO ] Deduced a trap composed of 19 places in 43 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 13/70 constraints. Problems are: Problem set: 0 solved, 849 unsolved
[2024-06-01 11:50:25] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 5 ms to minimize.
[2024-06-01 11:50:25] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 2 ms to minimize.
[2024-06-01 11:50:28] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:50:28] [INFO ] Deduced a trap composed of 27 places in 56 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 849 unsolved
[2024-06-01 11:50:31] [INFO ] Deduced a trap composed of 55 places in 101 ms of which 2 ms to minimize.
[2024-06-01 11:50:31] [INFO ] Deduced a trap composed of 67 places in 95 ms of which 2 ms to minimize.
[2024-06-01 11:50:31] [INFO ] Deduced a trap composed of 89 places in 99 ms of which 3 ms to minimize.
[2024-06-01 11:50:31] [INFO ] Deduced a trap composed of 78 places in 114 ms of which 2 ms to minimize.
[2024-06-01 11:50:32] [INFO ] Deduced a trap composed of 71 places in 136 ms of which 2 ms to minimize.
[2024-06-01 11:50:32] [INFO ] Deduced a trap composed of 87 places in 112 ms of which 2 ms to minimize.
[2024-06-01 11:50:32] [INFO ] Deduced a trap composed of 69 places in 114 ms of which 2 ms to minimize.
[2024-06-01 11:50:32] [INFO ] Deduced a trap composed of 46 places in 120 ms of which 2 ms to minimize.
[2024-06-01 11:50:34] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 1 ms to minimize.
[2024-06-01 11:50:35] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 0 ms to minimize.
(s340 0.0timeout
^^^^^^^^^^
(error "Invalid token: 0.0timeout")
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.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 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.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 1.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.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 1.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 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 1.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 1.0)
(s264 1.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 1.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 1.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 1.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 1.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 1.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 1.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 1.0)
(s340 0.0timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 849 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 384/1288 variables, and 84 constraints, problems are : Problem set: 0 solved, 849 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/384 constraints, ReadFeed: 0/31 constraints, PredecessorRefiner: 849/849 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 849 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 849 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 27/84 constraints. Problems are: Problem set: 0 solved, 849 unsolved
[2024-06-01 11:50:43] [INFO ] Deduced a trap composed of 46 places in 108 ms of which 2 ms to minimize.
[2024-06-01 11:50:43] [INFO ] Deduced a trap composed of 79 places in 98 ms of which 2 ms to minimize.
[2024-06-01 11:50:43] [INFO ] Deduced a trap composed of 92 places in 115 ms of which 2 ms to minimize.
[2024-06-01 11:50:43] [INFO ] Deduced a trap composed of 89 places in 121 ms of which 3 ms to minimize.
[2024-06-01 11:50:44] [INFO ] Deduced a trap composed of 98 places in 116 ms of which 1 ms to minimize.
[2024-06-01 11:50:44] [INFO ] Deduced a trap composed of 105 places in 113 ms of which 2 ms to minimize.
[2024-06-01 11:50:44] [INFO ] Deduced a trap composed of 79 places in 118 ms of which 2 ms to minimize.
[2024-06-01 11:50:44] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 2 ms to minimize.
[2024-06-01 11:50:46] [INFO ] Deduced a trap composed of 58 places in 96 ms of which 2 ms to minimize.
[2024-06-01 11:50:46] [INFO ] Deduced a trap composed of 53 places in 96 ms of which 14 ms to minimize.
[2024-06-01 11:50:46] [INFO ] Deduced a trap composed of 71 places in 97 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 11/95 constraints. Problems are: Problem set: 0 solved, 849 unsolved
[2024-06-01 11:50:51] [INFO ] Deduced a trap composed of 115 places in 111 ms of which 2 ms to minimize.
[2024-06-01 11:50:51] [INFO ] Deduced a trap composed of 96 places in 113 ms of which 2 ms to minimize.
[2024-06-01 11:50:51] [INFO ] Deduced a trap composed of 80 places in 116 ms of which 1 ms to minimize.
[2024-06-01 11:50:51] [INFO ] Deduced a trap composed of 65 places in 125 ms of which 2 ms to minimize.
[2024-06-01 11:50:52] [INFO ] Deduced a trap composed of 26 places in 123 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 5/100 constraints. Problems are: Problem set: 0 solved, 849 unsolved
[2024-06-01 11:50:58] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 1 ms to minimize.
[2024-06-01 11:50:58] [INFO ] Deduced a trap composed of 92 places in 117 ms of which 2 ms to minimize.
[2024-06-01 11:50:58] [INFO ] Deduced a trap composed of 113 places in 109 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 849 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 849 unsolved
At refinement iteration 6 (OVERLAPS) 904/1288 variables, 384/487 constraints. Problems are: Problem set: 0 solved, 849 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1288 variables, 31/518 constraints. Problems are: Problem set: 0 solved, 849 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1288/1288 variables, and 1367 constraints, problems are : Problem set: 0 solved, 849 unsolved in 30091 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 384/384 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 849/849 constraints, Known Traps: 46/46 constraints]
After SMT, in 60403ms problems are : Problem set: 0 solved, 849 unsolved
Search for dead transitions found 0 dead transitions in 60410ms
Starting structural reductions in SI_LTL mode, iteration 1 : 384/903 places, 904/1402 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61333 ms. Remains : 384/903 places, 904/1402 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-5B-LTLCardinality-07
Product exploration explored 100000 steps with 492 reset in 473 ms.
Product exploration explored 100000 steps with 485 reset in 529 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 85 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 41 ms :[(NOT p0)]
RANDOM walk for 18476 steps (84 resets) in 149 ms. (123 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 96 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 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Support contains 1 out of 384 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 384/384 places, 904/904 transitions.
Applied a total of 0 rules in 15 ms. Remains 384 /384 variables (removed 0) and now considering 904/904 (removed 0) transitions.
[2024-06-01 11:51:12] [INFO ] Invariant cache hit.
[2024-06-01 11:51:12] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-06-01 11:51:12] [INFO ] Invariant cache hit.
[2024-06-01 11:51:13] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-06-01 11:51:13] [INFO ] Implicit Places using invariants and state equation in 465 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
[2024-06-01 11:51:13] [INFO ] Redundant transitions in 13 ms returned []
Running 849 sub problems to find dead transitions.
[2024-06-01 11:51:13] [INFO ] Invariant cache hit.
[2024-06-01 11:51:13] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 849 unsolved
[2024-06-01 11:51:19] [INFO ] Deduced a trap composed of 54 places in 74 ms of which 1 ms to minimize.
[2024-06-01 11:51:19] [INFO ] Deduced a trap composed of 60 places in 68 ms of which 1 ms to minimize.
[2024-06-01 11:51:20] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 1 ms to minimize.
[2024-06-01 11:51:20] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 1 ms to minimize.
[2024-06-01 11:51:20] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 1 ms to minimize.
[2024-06-01 11:51:20] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 2 ms to minimize.
[2024-06-01 11:51:21] [INFO ] Deduced a trap composed of 21 places in 76 ms of which 1 ms to minimize.
[2024-06-01 11:51:21] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 0 ms to minimize.
[2024-06-01 11:51:21] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 1 ms to minimize.
[2024-06-01 11:51:22] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 1 ms to minimize.
[2024-06-01 11:51:23] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:51:24] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-06-01 11:51:24] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 13/70 constraints. Problems are: Problem set: 0 solved, 849 unsolved
[2024-06-01 11:51:27] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 2 ms to minimize.
[2024-06-01 11:51:27] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 2 ms to minimize.
[2024-06-01 11:51:30] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-06-01 11:51:31] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 849 unsolved
[2024-06-01 11:51:34] [INFO ] Deduced a trap composed of 55 places in 100 ms of which 2 ms to minimize.
[2024-06-01 11:51:34] [INFO ] Deduced a trap composed of 67 places in 98 ms of which 1 ms to minimize.
[2024-06-01 11:51:34] [INFO ] Deduced a trap composed of 89 places in 95 ms of which 1 ms to minimize.
[2024-06-01 11:51:34] [INFO ] Deduced a trap composed of 78 places in 118 ms of which 2 ms to minimize.
[2024-06-01 11:51:34] [INFO ] Deduced a trap composed of 71 places in 118 ms of which 2 ms to minimize.
[2024-06-01 11:51:34] [INFO ] Deduced a trap composed of 87 places in 113 ms of which 2 ms to minimize.
[2024-06-01 11:51:35] [INFO ] Deduced a trap composed of 69 places in 116 ms of which 2 ms to minimize.
[2024-06-01 11:51:35] [INFO ] Deduced a trap composed of 46 places in 113 ms of which 1 ms to minimize.
[2024-06-01 11:51:36] [INFO ] Deduced a trap composed of 45 places in 99 ms of which 2 ms to minimize.
[2024-06-01 11:51:38] [INFO ] Deduced a trap composed of 16 places in 49 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.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 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 1.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 1.0)
(s60 1.0)
(s61 0.0)
(s62 0.0)
(s63 0.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 1.0)
(s75 1.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.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 1.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 0.0)
(s103 1.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 1.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 1.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 1.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 1.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 1.0)
(s212 1.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 1.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 1.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 1.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 1.0)
(s264 1.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 1.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 1.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 1.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 1.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 1.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 1.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 1.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 1.0)
(s326 0.0)
(s327 1.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 1.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 1.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 1.0)
(s362 0.0)
(s363 0.0)
(s364 0.0)
(s365 0.0)
(s366 1.0)
(s367 1.0)
(s368 0.0)
(s369 0.0)
(s370 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 849 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 384/1288 variables, and 84 constraints, problems are : Problem set: 0 solved, 849 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/384 constraints, ReadFeed: 0/31 constraints, PredecessorRefiner: 849/849 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 849 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 849 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 27/84 constraints. Problems are: Problem set: 0 solved, 849 unsolved
[2024-06-01 11:51:45] [INFO ] Deduced a trap composed of 46 places in 106 ms of which 2 ms to minimize.
[2024-06-01 11:51:45] [INFO ] Deduced a trap composed of 79 places in 90 ms of which 2 ms to minimize.
[2024-06-01 11:51:46] [INFO ] Deduced a trap composed of 92 places in 118 ms of which 1 ms to minimize.
[2024-06-01 11:51:46] [INFO ] Deduced a trap composed of 89 places in 115 ms of which 1 ms to minimize.
[2024-06-01 11:51:46] [INFO ] Deduced a trap composed of 98 places in 107 ms of which 2 ms to minimize.
[2024-06-01 11:51:46] [INFO ] Deduced a trap composed of 105 places in 117 ms of which 2 ms to minimize.
[2024-06-01 11:51:46] [INFO ] Deduced a trap composed of 79 places in 116 ms of which 2 ms to minimize.
[2024-06-01 11:51:47] [INFO ] Deduced a trap composed of 27 places in 115 ms of which 2 ms to minimize.
[2024-06-01 11:51:48] [INFO ] Deduced a trap composed of 58 places in 87 ms of which 2 ms to minimize.
[2024-06-01 11:51:48] [INFO ] Deduced a trap composed of 53 places in 80 ms of which 2 ms to minimize.
[2024-06-01 11:51:49] [INFO ] Deduced a trap composed of 71 places in 94 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 11/95 constraints. Problems are: Problem set: 0 solved, 849 unsolved
[2024-06-01 11:51:53] [INFO ] Deduced a trap composed of 115 places in 111 ms of which 2 ms to minimize.
[2024-06-01 11:51:53] [INFO ] Deduced a trap composed of 96 places in 111 ms of which 2 ms to minimize.
[2024-06-01 11:51:54] [INFO ] Deduced a trap composed of 80 places in 114 ms of which 2 ms to minimize.
[2024-06-01 11:51:54] [INFO ] Deduced a trap composed of 65 places in 122 ms of which 2 ms to minimize.
[2024-06-01 11:51:54] [INFO ] Deduced a trap composed of 26 places in 118 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 5/100 constraints. Problems are: Problem set: 0 solved, 849 unsolved
[2024-06-01 11:52:00] [INFO ] Deduced a trap composed of 83 places in 90 ms of which 2 ms to minimize.
[2024-06-01 11:52:00] [INFO ] Deduced a trap composed of 92 places in 110 ms of which 2 ms to minimize.
[2024-06-01 11:52:01] [INFO ] Deduced a trap composed of 113 places in 110 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 849 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 849 unsolved
At refinement iteration 6 (OVERLAPS) 904/1288 variables, 384/487 constraints. Problems are: Problem set: 0 solved, 849 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1288 variables, 31/518 constraints. Problems are: Problem set: 0 solved, 849 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1288/1288 variables, and 1367 constraints, problems are : Problem set: 0 solved, 849 unsolved in 30080 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 384/384 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 849/849 constraints, Known Traps: 46/46 constraints]
After SMT, in 60394ms problems are : Problem set: 0 solved, 849 unsolved
Search for dead transitions found 0 dead transitions in 60402ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61077 ms. Remains : 384/384 places, 904/904 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 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 28 ms :[(NOT p0)]
RANDOM walk for 30348 steps (138 resets) in 141 ms. (213 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 104 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 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 481 reset in 375 ms.
Product exploration explored 100000 steps with 489 reset in 414 ms.
Support contains 1 out of 384 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 384/384 places, 904/904 transitions.
Applied a total of 0 rules in 19 ms. Remains 384 /384 variables (removed 0) and now considering 904/904 (removed 0) transitions.
[2024-06-01 11:52:15] [INFO ] Invariant cache hit.
[2024-06-01 11:52:15] [INFO ] Implicit Places using invariants in 307 ms returned []
[2024-06-01 11:52:15] [INFO ] Invariant cache hit.
[2024-06-01 11:52:15] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-06-01 11:52:15] [INFO ] Implicit Places using invariants and state equation in 468 ms returned []
Implicit Place search using SMT with State Equation took 778 ms to find 0 implicit places.
[2024-06-01 11:52:15] [INFO ] Redundant transitions in 11 ms returned []
Running 849 sub problems to find dead transitions.
[2024-06-01 11:52:15] [INFO ] Invariant cache hit.
[2024-06-01 11:52:15] [INFO ] State equation strengthened by 31 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 849 unsolved
[2024-06-01 11:52:22] [INFO ] Deduced a trap composed of 54 places in 68 ms of which 1 ms to minimize.
[2024-06-01 11:52:22] [INFO ] Deduced a trap composed of 60 places in 76 ms of which 1 ms to minimize.
[2024-06-01 11:52:22] [INFO ] Deduced a trap composed of 50 places in 92 ms of which 1 ms to minimize.
[2024-06-01 11:52:23] [INFO ] Deduced a trap composed of 30 places in 81 ms of which 1 ms to minimize.
[2024-06-01 11:52:23] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 2 ms to minimize.
[2024-06-01 11:52:23] [INFO ] Deduced a trap composed of 34 places in 76 ms of which 1 ms to minimize.
[2024-06-01 11:52:23] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
[2024-06-01 11:52:23] [INFO ] Deduced a trap composed of 16 places in 37 ms of which 0 ms to minimize.
[2024-06-01 11:52:23] [INFO ] Deduced a trap composed of 32 places in 54 ms of which 1 ms to minimize.
[2024-06-01 11:52:25] [INFO ] Deduced a trap composed of 29 places in 97 ms of which 1 ms to minimize.
[2024-06-01 11:52:26] [INFO ] Deduced a trap composed of 24 places in 38 ms of which 1 ms to minimize.
[2024-06-01 11:52:26] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 0 ms to minimize.
[2024-06-01 11:52:27] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 13/70 constraints. Problems are: Problem set: 0 solved, 849 unsolved
[2024-06-01 11:52:30] [INFO ] Deduced a trap composed of 40 places in 97 ms of which 1 ms to minimize.
[2024-06-01 11:52:30] [INFO ] Deduced a trap composed of 42 places in 96 ms of which 1 ms to minimize.
[2024-06-01 11:52:33] [INFO ] Deduced a trap composed of 15 places in 40 ms of which 0 ms to minimize.
[2024-06-01 11:52:33] [INFO ] Deduced a trap composed of 27 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 4/74 constraints. Problems are: Problem set: 0 solved, 849 unsolved
[2024-06-01 11:52:36] [INFO ] Deduced a trap composed of 55 places in 92 ms of which 2 ms to minimize.
[2024-06-01 11:52:36] [INFO ] Deduced a trap composed of 67 places in 93 ms of which 1 ms to minimize.
[2024-06-01 11:52:36] [INFO ] Deduced a trap composed of 89 places in 96 ms of which 1 ms to minimize.
[2024-06-01 11:52:37] [INFO ] Deduced a trap composed of 78 places in 113 ms of which 2 ms to minimize.
[2024-06-01 11:52:37] [INFO ] Deduced a trap composed of 71 places in 116 ms of which 2 ms to minimize.
[2024-06-01 11:52:37] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 2 ms to minimize.
[2024-06-01 11:52:37] [INFO ] Deduced a trap composed of 69 places in 110 ms of which 2 ms to minimize.
[2024-06-01 11:52:37] [INFO ] Deduced a trap composed of 46 places in 113 ms of which 2 ms to minimize.
[2024-06-01 11:52:39] [INFO ] Deduced a trap composed of 45 places in 93 ms of which 1 ms to minimize.
[2024-06-01 11:52:41] [INFO ] Deduced a trap composed of 16 places in 53 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 849 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 384/1288 variables, and 84 constraints, problems are : Problem set: 0 solved, 849 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/384 constraints, ReadFeed: 0/31 constraints, PredecessorRefiner: 849/849 constraints, Known Traps: 27/27 constraints]
Escalating to Integer solving :Problem set: 0 solved, 849 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 849 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 27/84 constraints. Problems are: Problem set: 0 solved, 849 unsolved
[2024-06-01 11:52:48] [INFO ] Deduced a trap composed of 46 places in 99 ms of which 1 ms to minimize.
[2024-06-01 11:52:48] [INFO ] Deduced a trap composed of 79 places in 91 ms of which 2 ms to minimize.
[2024-06-01 11:52:48] [INFO ] Deduced a trap composed of 92 places in 108 ms of which 2 ms to minimize.
[2024-06-01 11:52:48] [INFO ] Deduced a trap composed of 89 places in 109 ms of which 3 ms to minimize.
[2024-06-01 11:52:48] [INFO ] Deduced a trap composed of 98 places in 112 ms of which 1 ms to minimize.
[2024-06-01 11:52:49] [INFO ] Deduced a trap composed of 105 places in 113 ms of which 2 ms to minimize.
[2024-06-01 11:52:49] [INFO ] Deduced a trap composed of 79 places in 115 ms of which 2 ms to minimize.
[2024-06-01 11:52:49] [INFO ] Deduced a trap composed of 27 places in 118 ms of which 2 ms to minimize.
[2024-06-01 11:52:51] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 1 ms to minimize.
[2024-06-01 11:52:51] [INFO ] Deduced a trap composed of 53 places in 75 ms of which 2 ms to minimize.
[2024-06-01 11:52:51] [INFO ] Deduced a trap composed of 71 places in 100 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 11/95 constraints. Problems are: Problem set: 0 solved, 849 unsolved
[2024-06-01 11:52:56] [INFO ] Deduced a trap composed of 115 places in 113 ms of which 2 ms to minimize.
[2024-06-01 11:52:56] [INFO ] Deduced a trap composed of 96 places in 114 ms of which 2 ms to minimize.
[2024-06-01 11:52:56] [INFO ] Deduced a trap composed of 80 places in 110 ms of which 2 ms to minimize.
[2024-06-01 11:52:56] [INFO ] Deduced a trap composed of 65 places in 125 ms of which 2 ms to minimize.
[2024-06-01 11:52:56] [INFO ] Deduced a trap composed of 26 places in 119 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/384 variables, 5/100 constraints. Problems are: Problem set: 0 solved, 849 unsolved
[2024-06-01 11:53:03] [INFO ] Deduced a trap composed of 83 places in 96 ms of which 2 ms to minimize.
[2024-06-01 11:53:03] [INFO ] Deduced a trap composed of 92 places in 112 ms of which 2 ms to minimize.
[2024-06-01 11:53:03] [INFO ] Deduced a trap composed of 113 places in 108 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/384 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 849 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/384 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 849 unsolved
At refinement iteration 6 (OVERLAPS) 904/1288 variables, 384/487 constraints. Problems are: Problem set: 0 solved, 849 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1288 variables, 31/518 constraints. Problems are: Problem set: 0 solved, 849 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1288/1288 variables, and 1367 constraints, problems are : Problem set: 0 solved, 849 unsolved in 30097 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 384/384 constraints, ReadFeed: 31/31 constraints, PredecessorRefiner: 849/849 constraints, Known Traps: 46/46 constraints]
After SMT, in 60407ms problems are : Problem set: 0 solved, 849 unsolved
Search for dead transitions found 0 dead transitions in 60414ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61227 ms. Remains : 384/384 places, 904/904 transitions.
Treatment of property NoC3x3-PT-5B-LTLCardinality-07 finished in 186426 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(G(p0)))))'
Support contains 1 out of 903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 903/903 places, 1402/1402 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 887 transition count 1384
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 887 transition count 1384
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 41 place count 878 transition count 1371
Iterating global reduction 0 with 9 rules applied. Total rules applied 50 place count 878 transition count 1371
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 53 place count 875 transition count 1366
Iterating global reduction 0 with 3 rules applied. Total rules applied 56 place count 875 transition count 1366
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 59 place count 872 transition count 1360
Iterating global reduction 0 with 3 rules applied. Total rules applied 62 place count 872 transition count 1360
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 870 transition count 1355
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 870 transition count 1355
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 869 transition count 1352
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 869 transition count 1352
Applied a total of 68 rules in 152 ms. Remains 869 /903 variables (removed 34) and now considering 1352/1402 (removed 50) transitions.
// Phase 1: matrix 1352 rows 869 cols
[2024-06-01 11:53:16] [INFO ] Computed 66 invariants in 5 ms
[2024-06-01 11:53:16] [INFO ] Implicit Places using invariants in 284 ms returned []
[2024-06-01 11:53:16] [INFO ] Invariant cache hit.
[2024-06-01 11:53:17] [INFO ] Implicit Places using invariants and state equation in 791 ms returned []
Implicit Place search using SMT with State Equation took 1077 ms to find 0 implicit places.
Running 1351 sub problems to find dead transitions.
[2024-06-01 11:53:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/868 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1351 unsolved
SMT process timed out in 30305ms, After SMT, problems are : Problem set: 0 solved, 1351 unsolved
Search for dead transitions found 0 dead transitions in 30317ms
Starting structural reductions in LTL mode, iteration 1 : 869/903 places, 1352/1402 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31550 ms. Remains : 869/903 places, 1352/1402 transitions.
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-5B-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 18 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-5B-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLCardinality-09 finished in 31734 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)||(X(F(p1))&&(F(p1) U p2))))'
Support contains 4 out of 903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 903/903 places, 1402/1402 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 889 transition count 1386
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 889 transition count 1386
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 37 place count 880 transition count 1374
Iterating global reduction 0 with 9 rules applied. Total rules applied 46 place count 880 transition count 1374
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 877 transition count 1369
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 877 transition count 1369
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 874 transition count 1363
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 874 transition count 1363
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 872 transition count 1358
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 872 transition count 1358
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 871 transition count 1355
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 871 transition count 1355
Applied a total of 64 rules in 95 ms. Remains 871 /903 variables (removed 32) and now considering 1355/1402 (removed 47) transitions.
// Phase 1: matrix 1355 rows 871 cols
[2024-06-01 11:53:48] [INFO ] Computed 66 invariants in 4 ms
[2024-06-01 11:53:48] [INFO ] Implicit Places using invariants in 239 ms returned []
[2024-06-01 11:53:48] [INFO ] Invariant cache hit.
[2024-06-01 11:53:49] [INFO ] Implicit Places using invariants and state equation in 809 ms returned []
Implicit Place search using SMT with State Equation took 1050 ms to find 0 implicit places.
Running 1354 sub problems to find dead transitions.
[2024-06-01 11:53:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/870 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1354 unsolved
SMT process timed out in 30307ms, After SMT, problems are : Problem set: 0 solved, 1354 unsolved
Search for dead transitions found 0 dead transitions in 30318ms
Starting structural reductions in LTL mode, iteration 1 : 871/903 places, 1355/1402 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31468 ms. Remains : 871/903 places, 1355/1402 transitions.
Stuttering acceptance computed with spot in 189 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : NoC3x3-PT-5B-LTLCardinality-11
Product exploration explored 100000 steps with 50000 reset in 293 ms.
Product exploration explored 100000 steps with 50000 reset in 305 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p0)))), (X p2), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X 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 9 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-5B-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-5B-LTLCardinality-11 finished in 32319 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(((p1 U p2)||p0))))'
Support contains 6 out of 903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 903/903 places, 1402/1402 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 902 transition count 1330
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 142 place count 831 transition count 1330
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 142 place count 831 transition count 1295
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 212 place count 796 transition count 1295
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 243 place count 765 transition count 1197
Iterating global reduction 2 with 31 rules applied. Total rules applied 274 place count 765 transition count 1197
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 274 place count 765 transition count 1196
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 276 place count 764 transition count 1196
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 284 place count 756 transition count 1183
Iterating global reduction 2 with 8 rules applied. Total rules applied 292 place count 756 transition count 1183
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 294 place count 754 transition count 1179
Iterating global reduction 2 with 2 rules applied. Total rules applied 296 place count 754 transition count 1179
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 298 place count 752 transition count 1173
Iterating global reduction 2 with 2 rules applied. Total rules applied 300 place count 752 transition count 1173
Performed 190 Post agglomeration using F-continuation condition.Transition count delta: 190
Deduced a syphon composed of 190 places in 0 ms
Reduce places removed 190 places and 0 transitions.
Iterating global reduction 2 with 380 rules applied. Total rules applied 680 place count 562 transition count 983
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 683 place count 562 transition count 980
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 684 place count 561 transition count 978
Iterating global reduction 3 with 1 rules applied. Total rules applied 685 place count 561 transition count 978
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 686 place count 560 transition count 976
Iterating global reduction 3 with 1 rules applied. Total rules applied 687 place count 560 transition count 976
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 688 place count 559 transition count 974
Iterating global reduction 3 with 1 rules applied. Total rules applied 689 place count 559 transition count 974
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 690 place count 558 transition count 971
Iterating global reduction 3 with 1 rules applied. Total rules applied 691 place count 558 transition count 971
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 893 place count 457 transition count 1002
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 907 place count 457 transition count 988
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 977 place count 422 transition count 996
Drop transitions (Redundant composition of simpler transitions.) removed 59 transitions
Redundant transition composition rules discarded 59 transitions
Iterating global reduction 4 with 59 rules applied. Total rules applied 1036 place count 422 transition count 937
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1045 place count 413 transition count 937
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 1045 place count 413 transition count 932
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 1055 place count 408 transition count 932
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 1089 place count 391 transition count 915
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1093 place count 389 transition count 918
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 1095 place count 389 transition count 918
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1096 place count 388 transition count 917
Applied a total of 1096 rules in 236 ms. Remains 388 /903 variables (removed 515) and now considering 917/1402 (removed 485) transitions.
// Phase 1: matrix 917 rows 388 cols
[2024-06-01 11:54:20] [INFO ] Computed 57 invariants in 4 ms
[2024-06-01 11:54:21] [INFO ] Implicit Places using invariants in 352 ms returned []
[2024-06-01 11:54:21] [INFO ] Invariant cache hit.
[2024-06-01 11:54:21] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-06-01 11:54:21] [INFO ] Implicit Places using invariants and state equation in 447 ms returned []
Implicit Place search using SMT with State Equation took 801 ms to find 0 implicit places.
[2024-06-01 11:54:21] [INFO ] Redundant transitions in 12 ms returned []
Running 862 sub problems to find dead transitions.
[2024-06-01 11:54:21] [INFO ] Invariant cache hit.
[2024-06-01 11:54:21] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/388 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 862 unsolved
[2024-06-01 11:54:27] [INFO ] Deduced a trap composed of 58 places in 71 ms of which 1 ms to minimize.
[2024-06-01 11:54:27] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-06-01 11:54:28] [INFO ] Deduced a trap composed of 52 places in 84 ms of which 1 ms to minimize.
[2024-06-01 11:54:28] [INFO ] Deduced a trap composed of 28 places in 84 ms of which 2 ms to minimize.
[2024-06-01 11:54:29] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 1 ms to minimize.
[2024-06-01 11:54:29] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 1 ms to minimize.
[2024-06-01 11:54:29] [INFO ] Deduced a trap composed of 60 places in 96 ms of which 2 ms to minimize.
[2024-06-01 11:54:29] [INFO ] Deduced a trap composed of 40 places in 69 ms of which 1 ms to minimize.
[2024-06-01 11:54:29] [INFO ] Deduced a trap composed of 42 places in 95 ms of which 1 ms to minimize.
[2024-06-01 11:54:29] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 1 ms to minimize.
[2024-06-01 11:54:31] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 1 ms to minimize.
[2024-06-01 11:54:31] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
[2024-06-01 11:54:32] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 1 ms to minimize.
[2024-06-01 11:54:32] [INFO ] Deduced a trap composed of 18 places in 40 ms of which 1 ms to minimize.
[2024-06-01 11:54:33] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 1 ms to minimize.
[2024-06-01 11:54:33] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/388 variables, 16/73 constraints. Problems are: Problem set: 0 solved, 862 unsolved
[2024-06-01 11:54:39] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/388 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 862 unsolved
[2024-06-01 11:54:42] [INFO ] Deduced a trap composed of 43 places in 72 ms of which 1 ms to minimize.
[2024-06-01 11:54:43] [INFO ] Deduced a trap composed of 28 places in 94 ms of which 1 ms to minimize.
[2024-06-01 11:54:44] [INFO ] Deduced a trap composed of 58 places in 96 ms of which 2 ms to minimize.
[2024-06-01 11:54:45] [INFO ] Deduced a trap composed of 74 places in 103 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.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 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 1.0)
(s63 0.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 0.0)
(s76 1.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 1.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 1.0)
(s139 1.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 1.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 1.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 1.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 1.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 1.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 1.0)
(s217 1.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 1.0)
(s235 1.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 1.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 1.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 1.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 1.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 1.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 1.0)
(s282 0.0)
(s283 0.0)
(s284 1.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 1.0)
(s295 0.0)
(s296 0.0)
(s297 1.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 1.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 1.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/388 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 388/1305 variables, and 78 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/388 constraints, ReadFeed: 0/32 constraints, PredecessorRefiner: 862/862 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 862 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/388 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/388 variables, 21/78 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/388 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 3 (OVERLAPS) 917/1305 variables, 388/466 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1305 variables, 32/498 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1305 variables, 862/1360 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1305/1305 variables, and 1360 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 388/388 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 862/862 constraints, Known Traps: 21/21 constraints]
After SMT, in 60353ms problems are : Problem set: 0 solved, 862 unsolved
Search for dead transitions found 0 dead transitions in 60360ms
Starting structural reductions in SI_LTL mode, iteration 1 : 388/903 places, 917/1402 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61417 ms. Remains : 388/903 places, 917/1402 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-5B-LTLCardinality-12
Product exploration explored 100000 steps with 486 reset in 573 ms.
Product exploration explored 100000 steps with 471 reset in 471 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND p0 (NOT p2) p1))), (X (OR p0 p2 p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (OR p0 p2 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 110 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (191 resets) in 374 ms. (106 steps per ms) remains 2/7 properties
BEST_FIRST walk for 40003 steps (9 resets) in 212 ms. (187 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (9 resets) in 209 ms. (190 steps per ms) remains 1/2 properties
[2024-06-01 11:55:23] [INFO ] Invariant cache hit.
[2024-06-01 11:55:23] [INFO ] State equation strengthened by 32 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/48 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 221/269 variables, 48/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 373/642 variables, 66/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 13/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/642 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 48/690 variables, 15/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/690 variables, 25/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/690 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 326/1016 variables, 116/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1016 variables, 7/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1016 variables, 9/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1016 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 30/1046 variables, 13/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1046 variables, 26/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1046 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 206/1252 variables, 62/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1252 variables, 1/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1252 variables, 8/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1252 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 27/1279 variables, 13/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1279 variables, 25/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1279 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 26/1305 variables, 20/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1305 variables, 3/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1305 variables, 2/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1305 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/1305 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1305/1305 variables, and 477 constraints, problems are : Problem set: 0 solved, 1 unsolved in 341 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 388/388 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/48 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 221/269 variables, 48/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 373/642 variables, 66/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 13/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/642 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/642 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 48/690 variables, 15/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/690 variables, 25/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/690 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 326/1016 variables, 116/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1016 variables, 7/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1016 variables, 9/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1016 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 30/1046 variables, 13/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1046 variables, 26/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1046 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 206/1252 variables, 62/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1252 variables, 1/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1252 variables, 8/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1252 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 27/1279 variables, 13/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1279 variables, 25/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1279 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 26/1305 variables, 20/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1305 variables, 3/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1305 variables, 2/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1305 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/1305 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1305/1305 variables, and 478 constraints, problems are : Problem set: 0 solved, 1 unsolved in 400 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 388/388 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 754ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 47 ms.
Support contains 6 out of 388 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 388/388 places, 917/917 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 388 transition count 916
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 387 transition count 916
Applied a total of 2 rules in 20 ms. Remains 387 /388 variables (removed 1) and now considering 916/917 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 387/388 places, 916/917 transitions.
RANDOM walk for 40000 steps (191 resets) in 283 ms. (140 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (11 resets) in 103 ms. (384 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 450117 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :0 out of 1
Probabilistic random walk after 450117 steps, saw 112095 distinct states, run finished after 3004 ms. (steps per millisecond=149 ) properties seen :0
// Phase 1: matrix 916 rows 387 cols
[2024-06-01 11:55:27] [INFO ] Computed 57 invariants in 6 ms
[2024-06-01 11:55:27] [INFO ] State equation strengthened by 32 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/47 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 220/267 variables, 47/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 373/640 variables, 66/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/640 variables, 13/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/640 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 48/688 variables, 15/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/688 variables, 25/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/688 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 326/1014 variables, 116/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1014 variables, 7/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1014 variables, 9/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1014 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 30/1044 variables, 13/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1044 variables, 26/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1044 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 206/1250 variables, 62/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1250 variables, 1/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1250 variables, 8/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1250 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 27/1277 variables, 13/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1277 variables, 25/451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1277 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 26/1303 variables, 20/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1303 variables, 3/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1303 variables, 2/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1303 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/1303 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1303/1303 variables, and 476 constraints, problems are : Problem set: 0 solved, 1 unsolved in 349 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 387/387 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/47 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 220/267 variables, 47/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 373/640 variables, 66/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/640 variables, 13/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/640 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/640 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 48/688 variables, 15/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/688 variables, 25/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/688 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 326/1014 variables, 116/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1014 variables, 7/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1014 variables, 9/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1014 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 30/1044 variables, 13/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1044 variables, 26/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1044 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 206/1250 variables, 62/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1250 variables, 1/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1250 variables, 8/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1250 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 27/1277 variables, 13/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1277 variables, 25/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1277 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 26/1303 variables, 20/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1303 variables, 3/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1303 variables, 2/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1303 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/1303 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1303/1303 variables, and 477 constraints, problems are : Problem set: 0 solved, 1 unsolved in 378 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 387/387 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 744ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 72 ms.
Support contains 6 out of 387 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 387/387 places, 916/916 transitions.
Applied a total of 0 rules in 9 ms. Remains 387 /387 variables (removed 0) and now considering 916/916 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 387/387 places, 916/916 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 387/387 places, 916/916 transitions.
Applied a total of 0 rules in 8 ms. Remains 387 /387 variables (removed 0) and now considering 916/916 (removed 0) transitions.
[2024-06-01 11:55:28] [INFO ] Invariant cache hit.
[2024-06-01 11:55:28] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-06-01 11:55:28] [INFO ] Invariant cache hit.
[2024-06-01 11:55:28] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-06-01 11:55:28] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 634 ms to find 0 implicit places.
[2024-06-01 11:55:28] [INFO ] Redundant transitions in 12 ms returned []
Running 861 sub problems to find dead transitions.
[2024-06-01 11:55:28] [INFO ] Invariant cache hit.
[2024-06-01 11:55:28] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/387 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 861 unsolved
[2024-06-01 11:55:35] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 1 ms to minimize.
[2024-06-01 11:55:35] [INFO ] Deduced a trap composed of 52 places in 83 ms of which 1 ms to minimize.
[2024-06-01 11:55:35] [INFO ] Deduced a trap composed of 17 places in 85 ms of which 1 ms to minimize.
[2024-06-01 11:55:36] [INFO ] Deduced a trap composed of 55 places in 107 ms of which 1 ms to minimize.
[2024-06-01 11:55:36] [INFO ] Deduced a trap composed of 65 places in 116 ms of which 2 ms to minimize.
[2024-06-01 11:55:36] [INFO ] Deduced a trap composed of 70 places in 116 ms of which 2 ms to minimize.
[2024-06-01 11:55:36] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 2 ms to minimize.
[2024-06-01 11:55:37] [INFO ] Deduced a trap composed of 34 places in 115 ms of which 2 ms to minimize.
[2024-06-01 11:55:37] [INFO ] Deduced a trap composed of 18 places in 116 ms of which 2 ms to minimize.
[2024-06-01 11:55:37] [INFO ] Deduced a trap composed of 81 places in 109 ms of which 2 ms to minimize.
[2024-06-01 11:55:37] [INFO ] Deduced a trap composed of 40 places in 127 ms of which 2 ms to minimize.
[2024-06-01 11:55:37] [INFO ] Deduced a trap composed of 42 places in 110 ms of which 2 ms to minimize.
[2024-06-01 11:55:37] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 1 ms to minimize.
[2024-06-01 11:55:37] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 1 ms to minimize.
[2024-06-01 11:55:37] [INFO ] Deduced a trap composed of 27 places in 50 ms of which 1 ms to minimize.
[2024-06-01 11:55:38] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 2 ms to minimize.
[2024-06-01 11:55:39] [INFO ] Deduced a trap composed of 29 places in 100 ms of which 2 ms to minimize.
[2024-06-01 11:55:39] [INFO ] Deduced a trap composed of 59 places in 89 ms of which 2 ms to minimize.
[2024-06-01 11:55:40] [INFO ] Deduced a trap composed of 72 places in 102 ms of which 2 ms to minimize.
[2024-06-01 11:55:40] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/387 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 861 unsolved
[2024-06-01 11:55:42] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 1 ms to minimize.
[2024-06-01 11:55:42] [INFO ] Deduced a trap composed of 51 places in 85 ms of which 2 ms to minimize.
[2024-06-01 11:55:43] [INFO ] Deduced a trap composed of 28 places in 110 ms of which 2 ms to minimize.
[2024-06-01 11:55:43] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 2 ms to minimize.
[2024-06-01 11:55:43] [INFO ] Deduced a trap composed of 28 places in 107 ms of which 1 ms to minimize.
[2024-06-01 11:55:44] [INFO ] Deduced a trap composed of 55 places in 98 ms of which 2 ms to minimize.
[2024-06-01 11:55:46] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 0 ms to minimize.
[2024-06-01 11:55:46] [INFO ] Deduced a trap composed of 15 places in 28 ms of which 0 ms to minimize.
[2024-06-01 11:55:46] [INFO ] Deduced a trap composed of 19 places in 49 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 9/86 constraints. Problems are: Problem set: 0 solved, 861 unsolved
[2024-06-01 11:55:49] [INFO ] Deduced a trap composed of 71 places in 102 ms of which 2 ms to minimize.
[2024-06-01 11:55:49] [INFO ] Deduced a trap composed of 95 places in 96 ms of which 1 ms to minimize.
[2024-06-01 11:55:50] [INFO ] Deduced a trap composed of 72 places in 100 ms of which 2 ms to minimize.
[2024-06-01 11:55:50] [INFO ] Deduced a trap composed of 86 places in 117 ms of which 2 ms to minimize.
[2024-06-01 11:55:50] [INFO ] Deduced a trap composed of 106 places in 108 ms of which 2 ms to minimize.
[2024-06-01 11:55:50] [INFO ] Deduced a trap composed of 101 places in 113 ms of which 2 ms to minimize.
[2024-06-01 11:55:50] [INFO ] Deduced a trap composed of 93 places in 105 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/387 variables, 7/93 constraints. Problems are: Problem set: 0 solved, 861 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 387/1303 variables, and 93 constraints, problems are : Problem set: 0 solved, 861 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/387 constraints, ReadFeed: 0/32 constraints, PredecessorRefiner: 861/861 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 861 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/387 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 861 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/387 variables, 36/93 constraints. Problems are: Problem set: 0 solved, 861 unsolved
[2024-06-01 11:56:00] [INFO ] Deduced a trap composed of 43 places in 77 ms of which 1 ms to minimize.
[2024-06-01 11:56:01] [INFO ] Deduced a trap composed of 85 places in 97 ms of which 1 ms to minimize.
[2024-06-01 11:56:01] [INFO ] Deduced a trap composed of 45 places in 92 ms of which 1 ms to minimize.
[2024-06-01 11:56:01] [INFO ] Deduced a trap composed of 37 places in 95 ms of which 2 ms to minimize.
[2024-06-01 11:56:01] [INFO ] Deduced a trap composed of 67 places in 97 ms of which 1 ms to minimize.
[2024-06-01 11:56:01] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 1 ms to minimize.
[2024-06-01 11:56:02] [INFO ] Deduced a trap composed of 64 places in 104 ms of which 1 ms to minimize.
[2024-06-01 11:56:02] [INFO ] Deduced a trap composed of 88 places in 122 ms of which 2 ms to minimize.
[2024-06-01 11:56:02] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 1 ms to minimize.
[2024-06-01 11:56:02] [INFO ] Deduced a trap composed of 98 places in 110 ms of which 2 ms to minimize.
[2024-06-01 11:56:02] [INFO ] Deduced a trap composed of 92 places in 117 ms of which 1 ms to minimize.
[2024-06-01 11:56:02] [INFO ] Deduced a trap composed of 30 places in 134 ms of which 2 ms to minimize.
[2024-06-01 11:56:03] [INFO ] Deduced a trap composed of 29 places in 132 ms of which 3 ms to minimize.
[2024-06-01 11:56:03] [INFO ] Deduced a trap composed of 50 places in 110 ms of which 2 ms to minimize.
[2024-06-01 11:56:03] [INFO ] Deduced a trap composed of 49 places in 113 ms of which 1 ms to minimize.
[2024-06-01 11:56:03] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 2 ms to minimize.
[2024-06-01 11:56:03] [INFO ] Deduced a trap composed of 83 places in 121 ms of which 3 ms to minimize.
[2024-06-01 11:56:03] [INFO ] Deduced a trap composed of 29 places in 113 ms of which 2 ms to minimize.
[2024-06-01 11:56:04] [INFO ] Deduced a trap composed of 55 places in 114 ms of which 2 ms to minimize.
[2024-06-01 11:56:05] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 861 unsolved
[2024-06-01 11:56:06] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 1 ms to minimize.
[2024-06-01 11:56:07] [INFO ] Deduced a trap composed of 93 places in 126 ms of which 1 ms to minimize.
[2024-06-01 11:56:07] [INFO ] Deduced a trap composed of 44 places in 77 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/387 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 861 unsolved
[2024-06-01 11:56:14] [INFO ] Deduced a trap composed of 77 places in 123 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/387 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 861 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 861 unsolved
At refinement iteration 6 (OVERLAPS) 916/1303 variables, 387/504 constraints. Problems are: Problem set: 0 solved, 861 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1303 variables, 32/536 constraints. Problems are: Problem set: 0 solved, 861 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1303 variables, 861/1397 constraints. Problems are: Problem set: 0 solved, 861 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1303/1303 variables, and 1397 constraints, problems are : Problem set: 0 solved, 861 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 387/387 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 861/861 constraints, Known Traps: 60/60 constraints]
After SMT, in 60344ms problems are : Problem set: 0 solved, 861 unsolved
Search for dead transitions found 0 dead transitions in 60351ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61013 ms. Remains : 387/387 places, 916/916 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 387 transition count 888
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 385 transition count 881
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 385 transition count 881
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 33 place count 385 transition count 881
Applied a total of 33 rules in 26 ms. Remains 385 /387 variables (removed 2) and now considering 881/916 (removed 35) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 881 rows 385 cols
[2024-06-01 11:56:29] [INFO ] Computed 57 invariants in 8 ms
[2024-06-01 11:56:29] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 11:56:29] [INFO ] [Nat]Absence check using 57 positive place invariants in 8 ms returned sat
[2024-06-01 11:56:29] [INFO ] After 209ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 11:56:29] [INFO ] After 264ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 11:56:29] [INFO ] After 383ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 560 ms.
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND p0 (NOT p2) p1))), (X (OR p0 p2 p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (OR p0 p2 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p2 (NOT p1)))), (F (NOT p0)), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT p2)), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT p1))]
Knowledge based reduction with 17 factoid took 292 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 388 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 388/388 places, 917/917 transitions.
Applied a total of 0 rules in 7 ms. Remains 388 /388 variables (removed 0) and now considering 917/917 (removed 0) transitions.
// Phase 1: matrix 917 rows 388 cols
[2024-06-01 11:56:30] [INFO ] Computed 57 invariants in 8 ms
[2024-06-01 11:56:30] [INFO ] Implicit Places using invariants in 169 ms returned []
[2024-06-01 11:56:30] [INFO ] Invariant cache hit.
[2024-06-01 11:56:30] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-06-01 11:56:30] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 614 ms to find 0 implicit places.
[2024-06-01 11:56:30] [INFO ] Redundant transitions in 11 ms returned []
Running 862 sub problems to find dead transitions.
[2024-06-01 11:56:30] [INFO ] Invariant cache hit.
[2024-06-01 11:56:30] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/388 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 862 unsolved
[2024-06-01 11:56:37] [INFO ] Deduced a trap composed of 58 places in 73 ms of which 1 ms to minimize.
[2024-06-01 11:56:37] [INFO ] Deduced a trap composed of 27 places in 67 ms of which 0 ms to minimize.
[2024-06-01 11:56:37] [INFO ] Deduced a trap composed of 52 places in 91 ms of which 2 ms to minimize.
[2024-06-01 11:56:38] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 2 ms to minimize.
[2024-06-01 11:56:38] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
[2024-06-01 11:56:38] [INFO ] Deduced a trap composed of 18 places in 76 ms of which 2 ms to minimize.
[2024-06-01 11:56:38] [INFO ] Deduced a trap composed of 60 places in 96 ms of which 2 ms to minimize.
[2024-06-01 11:56:38] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 1 ms to minimize.
[2024-06-01 11:56:39] [INFO ] Deduced a trap composed of 42 places in 98 ms of which 1 ms to minimize.
[2024-06-01 11:56:39] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2024-06-01 11:56:40] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 1 ms to minimize.
[2024-06-01 11:56:41] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 2 ms to minimize.
[2024-06-01 11:56:41] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2024-06-01 11:56:42] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-01 11:56:42] [INFO ] Deduced a trap composed of 27 places in 51 ms of which 1 ms to minimize.
[2024-06-01 11:56:43] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/388 variables, 16/73 constraints. Problems are: Problem set: 0 solved, 862 unsolved
[2024-06-01 11:56:49] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/388 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 862 unsolved
[2024-06-01 11:56:51] [INFO ] Deduced a trap composed of 43 places in 70 ms of which 2 ms to minimize.
[2024-06-01 11:56:52] [INFO ] Deduced a trap composed of 28 places in 91 ms of which 1 ms to minimize.
[2024-06-01 11:56:54] [INFO ] Deduced a trap composed of 58 places in 113 ms of which 1 ms to minimize.
[2024-06-01 11:56:54] [INFO ] Deduced a trap composed of 74 places in 106 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/388 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 388/1305 variables, and 78 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/388 constraints, ReadFeed: 0/32 constraints, PredecessorRefiner: 862/862 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 862 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/388 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/388 variables, 21/78 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/388 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 3 (OVERLAPS) 917/1305 variables, 388/466 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1305 variables, 32/498 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1305 variables, 862/1360 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1305/1305 variables, and 1360 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 388/388 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 862/862 constraints, Known Traps: 21/21 constraints]
After SMT, in 60325ms problems are : Problem set: 0 solved, 862 unsolved
Search for dead transitions found 0 dead transitions in 60332ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60971 ms. Remains : 388/388 places, 917/917 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND p0 (NOT p2) p1))), (X (OR p0 p2 p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (OR p0 p2 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 128 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (191 resets) in 267 ms. (149 steps per ms) remains 1/7 properties
BEST_FIRST walk for 40004 steps (10 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
[2024-06-01 11:57:31] [INFO ] Invariant cache hit.
[2024-06-01 11:57:31] [INFO ] State equation strengthened by 32 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/48 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 221/269 variables, 48/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 373/642 variables, 66/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 13/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/642 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 48/690 variables, 15/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/690 variables, 25/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/690 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 326/1016 variables, 116/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1016 variables, 7/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1016 variables, 9/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1016 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 30/1046 variables, 13/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1046 variables, 26/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1046 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 206/1252 variables, 62/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1252 variables, 1/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1252 variables, 8/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1252 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 27/1279 variables, 13/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1279 variables, 25/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1279 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 26/1305 variables, 20/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1305 variables, 3/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1305 variables, 2/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1305 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/1305 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1305/1305 variables, and 477 constraints, problems are : Problem set: 0 solved, 1 unsolved in 326 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 388/388 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 42/48 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/48 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 221/269 variables, 48/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 373/642 variables, 66/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/642 variables, 13/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/642 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/642 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 48/690 variables, 15/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/690 variables, 25/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/690 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 326/1016 variables, 116/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1016 variables, 7/296 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1016 variables, 9/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1016 variables, 0/305 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 30/1046 variables, 13/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1046 variables, 26/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1046 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 206/1252 variables, 62/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1252 variables, 1/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1252 variables, 8/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1252 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 27/1279 variables, 13/428 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1279 variables, 25/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1279 variables, 0/453 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 26/1305 variables, 20/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1305 variables, 3/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1305 variables, 2/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1305 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/1305 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1305/1305 variables, and 478 constraints, problems are : Problem set: 0 solved, 1 unsolved in 418 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 388/388 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 751ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 61 ms.
Support contains 6 out of 388 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 388/388 places, 917/917 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 388 transition count 916
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 387 transition count 916
Applied a total of 2 rules in 15 ms. Remains 387 /388 variables (removed 1) and now considering 916/917 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 387/388 places, 916/917 transitions.
RANDOM walk for 40000 steps (192 resets) in 212 ms. (187 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (10 resets) in 59 ms. (666 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 458887 steps, run timeout after 3001 ms. (steps per millisecond=152 ) properties seen :0 out of 1
Probabilistic random walk after 458887 steps, saw 113989 distinct states, run finished after 3001 ms. (steps per millisecond=152 ) properties seen :0
// Phase 1: matrix 916 rows 387 cols
[2024-06-01 11:57:35] [INFO ] Computed 57 invariants in 7 ms
[2024-06-01 11:57:35] [INFO ] State equation strengthened by 32 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/47 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 220/267 variables, 47/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 373/640 variables, 66/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/640 variables, 13/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/640 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 48/688 variables, 15/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/688 variables, 25/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/688 variables, 0/171 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 326/1014 variables, 116/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1014 variables, 7/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1014 variables, 9/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1014 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 30/1044 variables, 13/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1044 variables, 26/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1044 variables, 0/342 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 206/1250 variables, 62/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1250 variables, 1/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1250 variables, 8/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1250 variables, 0/413 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 27/1277 variables, 13/426 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1277 variables, 25/451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1277 variables, 0/451 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 26/1303 variables, 20/471 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/1303 variables, 3/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1303 variables, 2/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1303 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/1303 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1303/1303 variables, and 476 constraints, problems are : Problem set: 0 solved, 1 unsolved in 300 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 387/387 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 41/47 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 220/267 variables, 47/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 373/640 variables, 66/118 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/640 variables, 13/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/640 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/640 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 48/688 variables, 15/147 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/688 variables, 25/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/688 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 326/1014 variables, 116/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1014 variables, 7/295 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1014 variables, 9/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1014 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 30/1044 variables, 13/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1044 variables, 26/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1044 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 206/1250 variables, 62/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1250 variables, 1/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1250 variables, 8/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1250 variables, 0/414 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 27/1277 variables, 13/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1277 variables, 25/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1277 variables, 0/452 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 26/1303 variables, 20/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1303 variables, 3/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1303 variables, 2/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1303 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/1303 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1303/1303 variables, and 477 constraints, problems are : Problem set: 0 solved, 1 unsolved in 428 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 387/387 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 741ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 69 ms.
Support contains 6 out of 387 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 387/387 places, 916/916 transitions.
Applied a total of 0 rules in 7 ms. Remains 387 /387 variables (removed 0) and now considering 916/916 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 387/387 places, 916/916 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 387/387 places, 916/916 transitions.
Applied a total of 0 rules in 7 ms. Remains 387 /387 variables (removed 0) and now considering 916/916 (removed 0) transitions.
[2024-06-01 11:57:36] [INFO ] Invariant cache hit.
[2024-06-01 11:57:36] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-06-01 11:57:36] [INFO ] Invariant cache hit.
[2024-06-01 11:57:36] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-06-01 11:57:37] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 665 ms to find 0 implicit places.
[2024-06-01 11:57:37] [INFO ] Redundant transitions in 12 ms returned []
Running 861 sub problems to find dead transitions.
[2024-06-01 11:57:37] [INFO ] Invariant cache hit.
[2024-06-01 11:57:37] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/387 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 861 unsolved
[2024-06-01 11:57:43] [INFO ] Deduced a trap composed of 58 places in 66 ms of which 2 ms to minimize.
[2024-06-01 11:57:43] [INFO ] Deduced a trap composed of 52 places in 77 ms of which 1 ms to minimize.
[2024-06-01 11:57:43] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-06-01 11:57:44] [INFO ] Deduced a trap composed of 55 places in 103 ms of which 1 ms to minimize.
[2024-06-01 11:57:44] [INFO ] Deduced a trap composed of 65 places in 111 ms of which 1 ms to minimize.
[2024-06-01 11:57:44] [INFO ] Deduced a trap composed of 70 places in 114 ms of which 2 ms to minimize.
[2024-06-01 11:57:44] [INFO ] Deduced a trap composed of 40 places in 124 ms of which 2 ms to minimize.
[2024-06-01 11:57:45] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 2 ms to minimize.
[2024-06-01 11:57:45] [INFO ] Deduced a trap composed of 18 places in 120 ms of which 2 ms to minimize.
[2024-06-01 11:57:45] [INFO ] Deduced a trap composed of 81 places in 114 ms of which 2 ms to minimize.
[2024-06-01 11:57:45] [INFO ] Deduced a trap composed of 40 places in 120 ms of which 2 ms to minimize.
[2024-06-01 11:57:45] [INFO ] Deduced a trap composed of 42 places in 122 ms of which 1 ms to minimize.
[2024-06-01 11:57:45] [INFO ] Deduced a trap composed of 16 places in 39 ms of which 1 ms to minimize.
[2024-06-01 11:57:46] [INFO ] Deduced a trap composed of 26 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:57:46] [INFO ] Deduced a trap composed of 27 places in 48 ms of which 1 ms to minimize.
[2024-06-01 11:57:46] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 1 ms to minimize.
[2024-06-01 11:57:47] [INFO ] Deduced a trap composed of 29 places in 106 ms of which 1 ms to minimize.
[2024-06-01 11:57:47] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 2 ms to minimize.
[2024-06-01 11:57:48] [INFO ] Deduced a trap composed of 72 places in 102 ms of which 2 ms to minimize.
[2024-06-01 11:57:49] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/387 variables, 20/77 constraints. Problems are: Problem set: 0 solved, 861 unsolved
[2024-06-01 11:57:50] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 1 ms to minimize.
[2024-06-01 11:57:51] [INFO ] Deduced a trap composed of 51 places in 90 ms of which 2 ms to minimize.
[2024-06-01 11:57:51] [INFO ] Deduced a trap composed of 28 places in 109 ms of which 2 ms to minimize.
[2024-06-01 11:57:51] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 2 ms to minimize.
[2024-06-01 11:57:51] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 2 ms to minimize.
[2024-06-01 11:57:52] [INFO ] Deduced a trap composed of 55 places in 95 ms of which 2 ms to minimize.
[2024-06-01 11:57:54] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-01 11:57:54] [INFO ] Deduced a trap composed of 15 places in 31 ms of which 1 ms to minimize.
[2024-06-01 11:57:55] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 9/86 constraints. Problems are: Problem set: 0 solved, 861 unsolved
[2024-06-01 11:57:58] [INFO ] Deduced a trap composed of 71 places in 93 ms of which 1 ms to minimize.
[2024-06-01 11:57:58] [INFO ] Deduced a trap composed of 95 places in 95 ms of which 1 ms to minimize.
[2024-06-01 11:57:58] [INFO ] Deduced a trap composed of 72 places in 106 ms of which 2 ms to minimize.
[2024-06-01 11:57:58] [INFO ] Deduced a trap composed of 86 places in 115 ms of which 1 ms to minimize.
[2024-06-01 11:57:58] [INFO ] Deduced a trap composed of 106 places in 110 ms of which 2 ms to minimize.
[2024-06-01 11:57:58] [INFO ] Deduced a trap composed of 101 places in 105 ms of which 2 ms to minimize.
[2024-06-01 11:57:59] [INFO ] Deduced a trap composed of 93 places in 107 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 1.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 1.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 1.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 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 1.0)
(s30 1.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 1.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 1.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 1.0)
(s62 1.0)
(s63 0.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 0.0)
(s76 1.0)
(s77 1.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 1.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 1.0)
(s119 0.0)
(s120 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/387 variables, 7/93 constraints. Problems are: Problem set: 0 solved, 861 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 387/1303 variables, and 93 constraints, problems are : Problem set: 0 solved, 861 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/387 constraints, ReadFeed: 0/32 constraints, PredecessorRefiner: 861/861 constraints, Known Traps: 36/36 constraints]
Escalating to Integer solving :Problem set: 0 solved, 861 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/387 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 861 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/387 variables, 36/93 constraints. Problems are: Problem set: 0 solved, 861 unsolved
[2024-06-01 11:58:08] [INFO ] Deduced a trap composed of 43 places in 76 ms of which 2 ms to minimize.
[2024-06-01 11:58:09] [INFO ] Deduced a trap composed of 85 places in 101 ms of which 2 ms to minimize.
[2024-06-01 11:58:09] [INFO ] Deduced a trap composed of 45 places in 90 ms of which 1 ms to minimize.
[2024-06-01 11:58:09] [INFO ] Deduced a trap composed of 37 places in 99 ms of which 2 ms to minimize.
[2024-06-01 11:58:10] [INFO ] Deduced a trap composed of 67 places in 102 ms of which 1 ms to minimize.
[2024-06-01 11:58:10] [INFO ] Deduced a trap composed of 61 places in 94 ms of which 2 ms to minimize.
[2024-06-01 11:58:10] [INFO ] Deduced a trap composed of 64 places in 103 ms of which 2 ms to minimize.
[2024-06-01 11:58:10] [INFO ] Deduced a trap composed of 88 places in 118 ms of which 2 ms to minimize.
[2024-06-01 11:58:10] [INFO ] Deduced a trap composed of 87 places in 114 ms of which 2 ms to minimize.
[2024-06-01 11:58:10] [INFO ] Deduced a trap composed of 98 places in 113 ms of which 2 ms to minimize.
[2024-06-01 11:58:10] [INFO ] Deduced a trap composed of 92 places in 115 ms of which 2 ms to minimize.
[2024-06-01 11:58:11] [INFO ] Deduced a trap composed of 30 places in 125 ms of which 2 ms to minimize.
[2024-06-01 11:58:11] [INFO ] Deduced a trap composed of 29 places in 128 ms of which 2 ms to minimize.
[2024-06-01 11:58:11] [INFO ] Deduced a trap composed of 50 places in 114 ms of which 2 ms to minimize.
[2024-06-01 11:58:11] [INFO ] Deduced a trap composed of 49 places in 111 ms of which 2 ms to minimize.
[2024-06-01 11:58:11] [INFO ] Deduced a trap composed of 30 places in 114 ms of which 2 ms to minimize.
[2024-06-01 11:58:11] [INFO ] Deduced a trap composed of 83 places in 125 ms of which 2 ms to minimize.
[2024-06-01 11:58:12] [INFO ] Deduced a trap composed of 29 places in 104 ms of which 1 ms to minimize.
[2024-06-01 11:58:12] [INFO ] Deduced a trap composed of 55 places in 123 ms of which 2 ms to minimize.
[2024-06-01 11:58:13] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 20/113 constraints. Problems are: Problem set: 0 solved, 861 unsolved
[2024-06-01 11:58:14] [INFO ] Deduced a trap composed of 64 places in 78 ms of which 1 ms to minimize.
[2024-06-01 11:58:15] [INFO ] Deduced a trap composed of 93 places in 117 ms of which 1 ms to minimize.
[2024-06-01 11:58:16] [INFO ] Deduced a trap composed of 44 places in 79 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/387 variables, 3/116 constraints. Problems are: Problem set: 0 solved, 861 unsolved
[2024-06-01 11:58:22] [INFO ] Deduced a trap composed of 77 places in 122 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/387 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 861 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/387 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 861 unsolved
At refinement iteration 6 (OVERLAPS) 916/1303 variables, 387/504 constraints. Problems are: Problem set: 0 solved, 861 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1303 variables, 32/536 constraints. Problems are: Problem set: 0 solved, 861 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1303 variables, 861/1397 constraints. Problems are: Problem set: 0 solved, 861 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1303/1303 variables, and 1397 constraints, problems are : Problem set: 0 solved, 861 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 387/387 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 861/861 constraints, Known Traps: 60/60 constraints]
After SMT, in 60354ms problems are : Problem set: 0 solved, 861 unsolved
Search for dead transitions found 0 dead transitions in 60363ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61055 ms. Remains : 387/387 places, 916/916 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Redundant composition of simpler transitions.) removed 28 transitions
Redundant transition composition rules discarded 28 transitions
Iterating global reduction 0 with 28 rules applied. Total rules applied 28 place count 387 transition count 888
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 385 transition count 881
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 385 transition count 881
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 33 place count 385 transition count 881
Applied a total of 33 rules in 25 ms. Remains 385 /387 variables (removed 2) and now considering 881/916 (removed 35) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 881 rows 385 cols
[2024-06-01 11:58:37] [INFO ] Computed 57 invariants in 6 ms
[2024-06-01 11:58:37] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 11:58:37] [INFO ] [Nat]Absence check using 57 positive place invariants in 11 ms returned sat
[2024-06-01 11:58:37] [INFO ] After 196ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 11:58:37] [INFO ] After 256ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 11:58:37] [INFO ] After 354ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 444 ms.
Knowledge obtained : [(AND p0 p2 p1), (X p2), (X (NOT (AND p0 (NOT p2) p1))), (X (OR p0 p2 p1)), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (OR p0 p2 p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR p0 p2 (NOT p1)))), (F (NOT p0)), (F (NOT (OR (NOT p0) p2 p1))), (F (NOT p2)), (F (NOT (OR (NOT p0) p2 (NOT p1)))), (F (NOT p1))]
Knowledge based reduction with 17 factoid took 285 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 481 reset in 382 ms.
Product exploration explored 100000 steps with 487 reset in 424 ms.
Support contains 6 out of 388 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 388/388 places, 917/917 transitions.
Applied a total of 0 rules in 7 ms. Remains 388 /388 variables (removed 0) and now considering 917/917 (removed 0) transitions.
// Phase 1: matrix 917 rows 388 cols
[2024-06-01 11:58:39] [INFO ] Computed 57 invariants in 6 ms
[2024-06-01 11:58:39] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-06-01 11:58:39] [INFO ] Invariant cache hit.
[2024-06-01 11:58:39] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-06-01 11:58:39] [INFO ] Implicit Places using invariants and state equation in 443 ms returned []
Implicit Place search using SMT with State Equation took 620 ms to find 0 implicit places.
[2024-06-01 11:58:39] [INFO ] Redundant transitions in 15 ms returned []
Running 862 sub problems to find dead transitions.
[2024-06-01 11:58:39] [INFO ] Invariant cache hit.
[2024-06-01 11:58:39] [INFO ] State equation strengthened by 32 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/388 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 862 unsolved
[2024-06-01 11:58:46] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 1 ms to minimize.
[2024-06-01 11:58:46] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:58:46] [INFO ] Deduced a trap composed of 52 places in 86 ms of which 1 ms to minimize.
[2024-06-01 11:58:47] [INFO ] Deduced a trap composed of 28 places in 95 ms of which 1 ms to minimize.
[2024-06-01 11:58:47] [INFO ] Deduced a trap composed of 34 places in 71 ms of which 1 ms to minimize.
[2024-06-01 11:58:47] [INFO ] Deduced a trap composed of 18 places in 74 ms of which 1 ms to minimize.
[2024-06-01 11:58:47] [INFO ] Deduced a trap composed of 60 places in 108 ms of which 2 ms to minimize.
[2024-06-01 11:58:47] [INFO ] Deduced a trap composed of 40 places in 73 ms of which 1 ms to minimize.
[2024-06-01 11:58:48] [INFO ] Deduced a trap composed of 42 places in 118 ms of which 1 ms to minimize.
[2024-06-01 11:58:48] [INFO ] Deduced a trap composed of 16 places in 33 ms of which 0 ms to minimize.
[2024-06-01 11:58:49] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 2 ms to minimize.
[2024-06-01 11:58:50] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2024-06-01 11:58:50] [INFO ] Deduced a trap composed of 24 places in 82 ms of which 1 ms to minimize.
[2024-06-01 11:58:51] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2024-06-01 11:58:51] [INFO ] Deduced a trap composed of 27 places in 49 ms of which 1 ms to minimize.
[2024-06-01 11:58:52] [INFO ] Deduced a trap composed of 15 places in 39 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/388 variables, 16/73 constraints. Problems are: Problem set: 0 solved, 862 unsolved
[2024-06-01 11:58:58] [INFO ] Deduced a trap composed of 15 places in 38 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/388 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 862 unsolved
[2024-06-01 11:59:00] [INFO ] Deduced a trap composed of 43 places in 79 ms of which 1 ms to minimize.
[2024-06-01 11:59:01] [INFO ] Deduced a trap composed of 28 places in 83 ms of which 1 ms to minimize.
[2024-06-01 11:59:03] [INFO ] Deduced a trap composed of 58 places in 85 ms of which 2 ms to minimize.
[2024-06-01 11:59:03] [INFO ] Deduced a trap composed of 74 places in 105 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 3 (INCLUDED_ONLY) 0/388 variables, 4/78 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 388/1305 variables, and 78 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 0/388 constraints, ReadFeed: 0/32 constraints, PredecessorRefiner: 862/862 constraints, Known Traps: 21/21 constraints]
Escalating to Integer solving :Problem set: 0 solved, 862 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/388 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/388 variables, 21/78 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/388 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 3 (OVERLAPS) 917/1305 variables, 388/466 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1305 variables, 32/498 constraints. Problems are: Problem set: 0 solved, 862 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1305 variables, 862/1360 constraints. Problems are: Problem set: 0 solved, 862 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1305/1305 variables, and 1360 constraints, problems are : Problem set: 0 solved, 862 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 388/388 constraints, ReadFeed: 32/32 constraints, PredecessorRefiner: 862/862 constraints, Known Traps: 21/21 constraints]
After SMT, in 60317ms problems are : Problem set: 0 solved, 862 unsolved
Search for dead transitions found 0 dead transitions in 60323ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60971 ms. Remains : 388/388 places, 917/917 transitions.
Treatment of property NoC3x3-PT-5B-LTLCardinality-12 finished in 319803 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)))'
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(((p1 U p2)||p0))))'
[2024-06-01 11:59:40] [INFO ] Flatten gal took : 52 ms
[2024-06-01 11:59:40] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 11:59:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 903 places, 1402 transitions and 4209 arcs took 16 ms.
Total runtime 732308 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA NoC3x3-PT-5B-LTLCardinality-07 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA NoC3x3-PT-5B-LTLCardinality-12 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717245623793

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name NoC3x3-PT-5B-LTLCardinality-07
ltl formula formula --ltl=/tmp/2117/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 903 places, 1402 transitions and 4209 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.260 real 0.030 user 0.050 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2117/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2117/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2117/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2117/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 904 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 904, there are 1408 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~2500 levels ~10000 states ~107856 transitions
pnml2lts-mc( 2/ 4): ~2126 levels ~20000 states ~104708 transitions
pnml2lts-mc( 2/ 4): ~2126 levels ~40000 states ~205492 transitions
pnml2lts-mc( 2/ 4): ~2126 levels ~80000 states ~406968 transitions
pnml2lts-mc( 2/ 4): ~2148 levels ~160000 states ~794616 transitions
pnml2lts-mc( 2/ 4): ~2154 levels ~320000 states ~1654712 transitions
pnml2lts-mc( 2/ 4): ~2154 levels ~640000 states ~3822012 transitions
pnml2lts-mc( 0/ 4): ~18886 levels ~1280000 states ~7301540 transitions
pnml2lts-mc( 1/ 4): ~31085 levels ~2560000 states ~15605804 transitions
pnml2lts-mc( 1/ 4): ~68129 levels ~5120000 states ~30110576 transitions
pnml2lts-mc( 0/ 4): ~68781 levels ~10240000 states ~60911356 transitions
pnml2lts-mc( 0/ 4): ~85093 levels ~20480000 states ~130043660 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 27933649
pnml2lts-mc( 0/ 4): unique states count: 32283892
pnml2lts-mc( 0/ 4): unique transitions count: 235498655
pnml2lts-mc( 0/ 4): - self-loop count: 716
pnml2lts-mc( 0/ 4): - claim dead count: 185189545
pnml2lts-mc( 0/ 4): - claim found count: 16505401
pnml2lts-mc( 0/ 4): - claim success count: 32283913
pnml2lts-mc( 0/ 4): - cum. max stack depth: 567062
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 32283913 states 235498685 transitions, fanout: 7.295
pnml2lts-mc( 0/ 4): Total exploration time 1323.430 sec (1323.400 sec minimum, 1323.418 sec on average)
pnml2lts-mc( 0/ 4): States per second: 24394, Transitions per second: 177946
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 305.4MB, 9.5 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/77.0%
pnml2lts-mc( 0/ 4): Stored 1432 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 305.4MB (~256.0MB paged-in)
ltl formula name NoC3x3-PT-5B-LTLCardinality-12
ltl formula formula --ltl=/tmp/2117/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 903 places, 1402 transitions and 4209 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.130 real 0.060 user 0.020 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2117/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2117/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2117/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2117/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 904 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 904, there are 1894 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~2500 levels ~10000 states ~271628 transitions
pnml2lts-mc( 1/ 4): ~5000 levels ~20000 states ~553484 transitions
pnml2lts-mc( 1/ 4): ~10000 levels ~40000 states ~1172988 transitions
pnml2lts-mc( 3/ 4): ~20000 levels ~80000 states ~1837432 transitions
pnml2lts-mc( 0/ 4): ~25545 levels ~160000 states ~3648920 transitions
pnml2lts-mc( 0/ 4): ~27671 levels ~320000 states ~6074128 transitions
pnml2lts-mc( 0/ 4): ~45835 levels ~640000 states ~11426284 transitions
pnml2lts-mc( 3/ 4): ~133051 levels ~1280000 states ~20911320 transitions
pnml2lts-mc( 3/ 4): ~212490 levels ~2560000 states ~40348200 transitions
pnml2lts-mc( 3/ 4): ~343969 levels ~5120000 states ~76818340 transitions
pnml2lts-mc( 3/ 4): ~649822 levels ~10240000 states ~148412956 transitions
pnml2lts-mc( 3/ 4): ~1172278 levels ~20480000 states ~304463072 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 18543682
pnml2lts-mc( 0/ 4): unique states count: 26367054
pnml2lts-mc( 0/ 4): unique transitions count: 444266931
pnml2lts-mc( 0/ 4): - self-loop count: 8370
pnml2lts-mc( 0/ 4): - claim dead count: 301152687
pnml2lts-mc( 0/ 4): - claim found count: 79277430
pnml2lts-mc( 0/ 4): - claim success count: 26367078
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4480253
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 26367078 states 444267043 transitions, fanout: 16.849
pnml2lts-mc( 0/ 4): Total exploration time 1117.790 sec (1117.730 sec minimum, 1117.752 sec on average)
pnml2lts-mc( 0/ 4): States per second: 23589, Transitions per second: 397451
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 301.3MB, 9.4 B/state, compr.: 0.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/70.0%
pnml2lts-mc( 0/ 4): Stored 1432 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 301.3MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NoC3x3-PT-5B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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