Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r150-smll-165276998500203.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is NoC3x3-PT-6B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r150-smll-165276998500203
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 788K
-rw-r--r-- 1 mcc users 6.5K Apr 29 13:04 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 29 13:04 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Apr 29 13:04 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 29 13:04 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 10 09:34 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 08:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 9 08:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 9 08:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 9 08:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 08:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 08:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 552K May 10 09:34 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-6B-LTLCardinality-00
FORMULA_NAME NoC3x3-PT-6B-LTLCardinality-01
FORMULA_NAME NoC3x3-PT-6B-LTLCardinality-02
FORMULA_NAME NoC3x3-PT-6B-LTLCardinality-03
FORMULA_NAME NoC3x3-PT-6B-LTLCardinality-04
FORMULA_NAME NoC3x3-PT-6B-LTLCardinality-05
FORMULA_NAME NoC3x3-PT-6B-LTLCardinality-06
FORMULA_NAME NoC3x3-PT-6B-LTLCardinality-07
FORMULA_NAME NoC3x3-PT-6B-LTLCardinality-08
FORMULA_NAME NoC3x3-PT-6B-LTLCardinality-09
FORMULA_NAME NoC3x3-PT-6B-LTLCardinality-10
FORMULA_NAME NoC3x3-PT-6B-LTLCardinality-11
FORMULA_NAME NoC3x3-PT-6B-LTLCardinality-12
FORMULA_NAME NoC3x3-PT-6B-LTLCardinality-13
FORMULA_NAME NoC3x3-PT-6B-LTLCardinality-14
FORMULA_NAME NoC3x3-PT-6B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1653022282729

Running Version 202205111006
[2022-05-20 04:51:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-20 04:51:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 04:51:25] [INFO ] Load time of PNML (sax parser for PT used): 536 ms
[2022-05-20 04:51:25] [INFO ] Transformed 1544 places.
[2022-05-20 04:51:26] [INFO ] Transformed 2229 transitions.
[2022-05-20 04:51:26] [INFO ] Found NUPN structural information;
[2022-05-20 04:51:26] [INFO ] Parsed PT model containing 1544 places and 2229 transitions in 926 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA NoC3x3-PT-6B-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6B-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6B-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6B-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6B-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 27 out of 1544 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1544/1544 places, 2229/2229 transitions.
Discarding 357 places :
Symmetric choice reduction at 0 with 357 rule applications. Total rules 357 place count 1187 transition count 1872
Iterating global reduction 0 with 357 rules applied. Total rules applied 714 place count 1187 transition count 1872
Discarding 102 places :
Symmetric choice reduction at 0 with 102 rule applications. Total rules 816 place count 1085 transition count 1683
Iterating global reduction 0 with 102 rules applied. Total rules applied 918 place count 1085 transition count 1683
Discarding 86 places :
Symmetric choice reduction at 0 with 86 rule applications. Total rules 1004 place count 999 transition count 1537
Iterating global reduction 0 with 86 rules applied. Total rules applied 1090 place count 999 transition count 1537
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 1110 place count 979 transition count 1497
Iterating global reduction 0 with 20 rules applied. Total rules applied 1130 place count 979 transition count 1497
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 1144 place count 965 transition count 1465
Iterating global reduction 0 with 14 rules applied. Total rules applied 1158 place count 965 transition count 1465
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 1172 place count 951 transition count 1451
Iterating global reduction 0 with 14 rules applied. Total rules applied 1186 place count 951 transition count 1451
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 1188 place count 949 transition count 1447
Iterating global reduction 0 with 2 rules applied. Total rules applied 1190 place count 949 transition count 1447
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 1192 place count 947 transition count 1443
Iterating global reduction 0 with 2 rules applied. Total rules applied 1194 place count 947 transition count 1443
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 1196 place count 945 transition count 1441
Iterating global reduction 0 with 2 rules applied. Total rules applied 1198 place count 945 transition count 1441
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 1202 place count 945 transition count 1437
Applied a total of 1202 rules in 757 ms. Remains 945 /1544 variables (removed 599) and now considering 1437/2229 (removed 792) transitions.
// Phase 1: matrix 1437 rows 945 cols
[2022-05-20 04:51:27] [INFO ] Computed 66 place invariants in 46 ms
[2022-05-20 04:51:28] [INFO ] Implicit Places using invariants in 894 ms returned []
// Phase 1: matrix 1437 rows 945 cols
[2022-05-20 04:51:28] [INFO ] Computed 66 place invariants in 15 ms
[2022-05-20 04:51:30] [INFO ] Implicit Places using invariants and state equation in 2051 ms returned []
Implicit Place search using SMT with State Equation took 3024 ms to find 0 implicit places.
// Phase 1: matrix 1437 rows 945 cols
[2022-05-20 04:51:30] [INFO ] Computed 66 place invariants in 11 ms
[2022-05-20 04:51:31] [INFO ] Dead Transitions using invariants and state equation in 1464 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 945/1544 places, 1437/2229 transitions.
Finished structural reductions, in 1 iterations. Remains : 945/1544 places, 1437/2229 transitions.
Support contains 27 out of 945 places after structural reductions.
[2022-05-20 04:51:32] [INFO ] Flatten gal took : 221 ms
[2022-05-20 04:51:32] [INFO ] Flatten gal took : 127 ms
[2022-05-20 04:51:32] [INFO ] Input system was already deterministic with 1437 transitions.
Support contains 26 out of 945 places (down from 27) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 450 ms. (steps per millisecond=22 ) properties (out of 15) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1437 rows 945 cols
[2022-05-20 04:51:33] [INFO ] Computed 66 place invariants in 7 ms
[2022-05-20 04:51:33] [INFO ] After 223ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 04:51:33] [INFO ] [Nat]Absence check using 66 positive place invariants in 79 ms returned sat
[2022-05-20 04:51:34] [INFO ] After 916ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 04:51:34] [INFO ] After 1028ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 78 ms.
[2022-05-20 04:51:34] [INFO ] After 1448ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 945 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 945/945 places, 1437/1437 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 945 transition count 1402
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 910 transition count 1402
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 70 place count 910 transition count 1306
Deduced a syphon composed of 96 places in 4 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 262 place count 814 transition count 1306
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 296 place count 780 transition count 1155
Iterating global reduction 2 with 34 rules applied. Total rules applied 330 place count 780 transition count 1155
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 330 place count 780 transition count 1153
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 334 place count 778 transition count 1153
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 344 place count 768 transition count 1117
Iterating global reduction 2 with 10 rules applied. Total rules applied 354 place count 768 transition count 1117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 355 place count 768 transition count 1116
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 357 place count 766 transition count 1112
Iterating global reduction 3 with 2 rules applied. Total rules applied 359 place count 766 transition count 1112
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 360 place count 766 transition count 1111
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 361 place count 765 transition count 1109
Iterating global reduction 4 with 1 rules applied. Total rules applied 362 place count 765 transition count 1109
Performed 181 Post agglomeration using F-continuation condition.Transition count delta: 181
Deduced a syphon composed of 181 places in 1 ms
Reduce places removed 181 places and 0 transitions.
Iterating global reduction 4 with 362 rules applied. Total rules applied 724 place count 584 transition count 928
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 728 place count 580 transition count 920
Iterating global reduction 4 with 4 rules applied. Total rules applied 732 place count 580 transition count 920
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 735 place count 577 transition count 913
Iterating global reduction 4 with 3 rules applied. Total rules applied 738 place count 577 transition count 913
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 739 place count 576 transition count 911
Iterating global reduction 4 with 1 rules applied. Total rules applied 740 place count 576 transition count 911
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -32
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 942 place count 475 transition count 943
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 1020 place count 436 transition count 958
Drop transitions removed 25 transitions
Redundant transition composition rules discarded 25 transitions
Iterating global reduction 4 with 25 rules applied. Total rules applied 1045 place count 436 transition count 933
Free-agglomeration rule applied 25 times.
Iterating global reduction 4 with 25 rules applied. Total rules applied 1070 place count 436 transition count 908
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 39 rules applied. Total rules applied 1109 place count 411 transition count 894
Applied a total of 1109 rules in 1464 ms. Remains 411 /945 variables (removed 534) and now considering 894/1437 (removed 543) transitions.
Finished structural reductions, in 1 iterations. Remains : 411/945 places, 894/1437 transitions.
Finished random walk after 7196 steps, including 47 resets, run visited all 1 properties in 63 ms. (steps per millisecond=114 )
Computed a total of 65 stabilizing places and 65 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(X(F(p0))))))'
Support contains 2 out of 945 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 945/945 places, 1437/1437 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 930 transition count 1416
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 930 transition count 1416
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 41 place count 919 transition count 1391
Iterating global reduction 0 with 11 rules applied. Total rules applied 52 place count 919 transition count 1391
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 60 place count 911 transition count 1373
Iterating global reduction 0 with 8 rules applied. Total rules applied 68 place count 911 transition count 1373
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 72 place count 911 transition count 1369
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 77 place count 906 transition count 1361
Iterating global reduction 1 with 5 rules applied. Total rules applied 82 place count 906 transition count 1361
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 83 place count 906 transition count 1360
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 85 place count 904 transition count 1357
Iterating global reduction 2 with 2 rules applied. Total rules applied 87 place count 904 transition count 1357
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 88 place count 903 transition count 1356
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 903 transition count 1356
Applied a total of 89 rules in 321 ms. Remains 903 /945 variables (removed 42) and now considering 1356/1437 (removed 81) transitions.
// Phase 1: matrix 1356 rows 903 cols
[2022-05-20 04:51:36] [INFO ] Computed 66 place invariants in 15 ms
[2022-05-20 04:51:37] [INFO ] Implicit Places using invariants in 846 ms returned []
// Phase 1: matrix 1356 rows 903 cols
[2022-05-20 04:51:37] [INFO ] Computed 66 place invariants in 6 ms
[2022-05-20 04:51:39] [INFO ] Implicit Places using invariants and state equation in 2115 ms returned []
Implicit Place search using SMT with State Equation took 2969 ms to find 0 implicit places.
// Phase 1: matrix 1356 rows 903 cols
[2022-05-20 04:51:39] [INFO ] Computed 66 place invariants in 19 ms
[2022-05-20 04:51:41] [INFO ] Dead Transitions using invariants and state equation in 1806 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 903/945 places, 1356/1437 transitions.
Finished structural reductions, in 1 iterations. Remains : 903/945 places, 1356/1437 transitions.
Stuttering acceptance computed with spot in 539 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-6B-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (NEQ s128 0) (NEQ s568 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 577 steps with 0 reset in 18 ms.
FORMULA NoC3x3-PT-6B-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLCardinality-00 finished in 5758 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((F(p0)&&p0))))'
Support contains 2 out of 945 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 945/945 places, 1437/1437 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 944 transition count 1401
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 909 transition count 1401
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 70 place count 909 transition count 1306
Deduced a syphon composed of 95 places in 6 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 260 place count 814 transition count 1306
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 295 place count 779 transition count 1153
Iterating global reduction 2 with 35 rules applied. Total rules applied 330 place count 779 transition count 1153
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 330 place count 779 transition count 1150
Deduced a syphon composed of 3 places in 5 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 336 place count 776 transition count 1150
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 347 place count 765 transition count 1104
Iterating global reduction 2 with 11 rules applied. Total rules applied 358 place count 765 transition count 1104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 359 place count 765 transition count 1103
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 361 place count 763 transition count 1099
Iterating global reduction 3 with 2 rules applied. Total rules applied 363 place count 763 transition count 1099
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 364 place count 763 transition count 1098
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 365 place count 762 transition count 1096
Iterating global reduction 4 with 1 rules applied. Total rules applied 366 place count 762 transition count 1096
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 0 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 4 with 358 rules applied. Total rules applied 724 place count 583 transition count 917
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 728 place count 579 transition count 909
Iterating global reduction 4 with 4 rules applied. Total rules applied 732 place count 579 transition count 909
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 735 place count 576 transition count 902
Iterating global reduction 4 with 3 rules applied. Total rules applied 738 place count 576 transition count 902
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 739 place count 575 transition count 900
Iterating global reduction 4 with 1 rules applied. Total rules applied 740 place count 575 transition count 900
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
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 942 place count 474 transition count 930
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 1020 place count 435 transition count 945
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 4 with 24 rules applied. Total rules applied 1044 place count 435 transition count 921
Applied a total of 1044 rules in 559 ms. Remains 435 /945 variables (removed 510) and now considering 921/1437 (removed 516) transitions.
// Phase 1: matrix 921 rows 435 cols
[2022-05-20 04:51:42] [INFO ] Computed 66 place invariants in 15 ms
[2022-05-20 04:51:43] [INFO ] Implicit Places using invariants in 448 ms returned [10, 46, 94, 133, 193, 273, 325, 364, 413]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 454 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 426/945 places, 921/1437 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 402 transition count 897
Applied a total of 48 rules in 29 ms. Remains 402 /426 variables (removed 24) and now considering 897/921 (removed 24) transitions.
// Phase 1: matrix 897 rows 402 cols
[2022-05-20 04:51:43] [INFO ] Computed 57 place invariants in 7 ms
[2022-05-20 04:51:43] [INFO ] Implicit Places using invariants in 413 ms returned []
// Phase 1: matrix 897 rows 402 cols
[2022-05-20 04:51:43] [INFO ] Computed 57 place invariants in 27 ms
[2022-05-20 04:51:44] [INFO ] State equation strengthened by 53 read => feed constraints.
[2022-05-20 04:51:44] [INFO ] Implicit Places using invariants and state equation in 1037 ms returned []
Implicit Place search using SMT with State Equation took 1454 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 402/945 places, 897/1437 transitions.
Finished structural reductions, in 2 iterations. Remains : 402/945 places, 897/1437 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-6B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s277 0) (EQ s17 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 780 reset in 1006 ms.
Product exploration explored 100000 steps with 767 reset in 934 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 271 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 106 ms :[(NOT p0), (NOT p0)]
Finished random walk after 804 steps, including 5 resets, run visited all 1 properties in 31 ms. (steps per millisecond=25 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 189 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 897/897 transitions.
Applied a total of 0 rules in 32 ms. Remains 402 /402 variables (removed 0) and now considering 897/897 (removed 0) transitions.
// Phase 1: matrix 897 rows 402 cols
[2022-05-20 04:51:47] [INFO ] Computed 57 place invariants in 9 ms
[2022-05-20 04:51:48] [INFO ] Implicit Places using invariants in 644 ms returned []
// Phase 1: matrix 897 rows 402 cols
[2022-05-20 04:51:48] [INFO ] Computed 57 place invariants in 8 ms
[2022-05-20 04:51:48] [INFO ] State equation strengthened by 53 read => feed constraints.
[2022-05-20 04:51:49] [INFO ] Implicit Places using invariants and state equation in 1317 ms returned []
Implicit Place search using SMT with State Equation took 1981 ms to find 0 implicit places.
[2022-05-20 04:51:49] [INFO ] Redundant transitions in 118 ms returned []
// Phase 1: matrix 897 rows 402 cols
[2022-05-20 04:51:49] [INFO ] Computed 57 place invariants in 8 ms
[2022-05-20 04:51:50] [INFO ] Dead Transitions using invariants and state equation in 1077 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 897/897 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 143 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Finished random walk after 865 steps, including 5 resets, run visited all 1 properties in 9 ms. (steps per millisecond=96 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 162 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 758 reset in 751 ms.
Product exploration explored 100000 steps with 767 reset in 538 ms.
Built C files in :
/tmp/ltsmin545409960178259062
[2022-05-20 04:51:52] [INFO ] Computing symmetric may disable matrix : 897 transitions.
[2022-05-20 04:51:52] [INFO ] Computation of Complete disable matrix. took 9 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 04:51:52] [INFO ] Computing symmetric may enable matrix : 897 transitions.
[2022-05-20 04:51:53] [INFO ] Computation of Complete enable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 04:51:53] [INFO ] Computing Do-Not-Accords matrix : 897 transitions.
[2022-05-20 04:51:53] [INFO ] Computation of Completed DNA matrix. took 68 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 04:51:53] [INFO ] Built C files in 346ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin545409960178259062
Running compilation step : cd /tmp/ltsmin545409960178259062;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin545409960178259062;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin545409960178259062;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 897/897 transitions.
Applied a total of 0 rules in 17 ms. Remains 402 /402 variables (removed 0) and now considering 897/897 (removed 0) transitions.
// Phase 1: matrix 897 rows 402 cols
[2022-05-20 04:51:56] [INFO ] Computed 57 place invariants in 5 ms
[2022-05-20 04:51:56] [INFO ] Implicit Places using invariants in 359 ms returned []
// Phase 1: matrix 897 rows 402 cols
[2022-05-20 04:51:56] [INFO ] Computed 57 place invariants in 5 ms
[2022-05-20 04:51:57] [INFO ] State equation strengthened by 53 read => feed constraints.
[2022-05-20 04:51:57] [INFO ] Implicit Places using invariants and state equation in 874 ms returned []
Implicit Place search using SMT with State Equation took 1235 ms to find 0 implicit places.
[2022-05-20 04:51:57] [INFO ] Redundant transitions in 20 ms returned []
// Phase 1: matrix 897 rows 402 cols
[2022-05-20 04:51:57] [INFO ] Computed 57 place invariants in 3 ms
[2022-05-20 04:51:58] [INFO ] Dead Transitions using invariants and state equation in 619 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 402/402 places, 897/897 transitions.
Built C files in :
/tmp/ltsmin14264087128886780503
[2022-05-20 04:51:58] [INFO ] Computing symmetric may disable matrix : 897 transitions.
[2022-05-20 04:51:58] [INFO ] Computation of Complete disable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 04:51:58] [INFO ] Computing symmetric may enable matrix : 897 transitions.
[2022-05-20 04:51:58] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 04:51:58] [INFO ] Computing Do-Not-Accords matrix : 897 transitions.
[2022-05-20 04:51:58] [INFO ] Computation of Completed DNA matrix. took 47 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2022-05-20 04:51:58] [INFO ] Built C files in 282ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14264087128886780503
Running compilation step : cd /tmp/ltsmin14264087128886780503;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14264087128886780503;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14264087128886780503;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-20 04:52:01] [INFO ] Flatten gal took : 91 ms
[2022-05-20 04:52:01] [INFO ] Flatten gal took : 101 ms
[2022-05-20 04:52:01] [INFO ] Time to serialize gal into /tmp/LTL158241111079788704.gal : 27 ms
[2022-05-20 04:52:01] [INFO ] Time to serialize properties into /tmp/LTL615971892370164828.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL158241111079788704.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL615971892370164828.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1582411...264
Read 1 LTL properties
Checking formula 0 : !((G(F((F("((p1135==0)||(p121==1))"))&&("((p1135==0)||(p121==1))")))))
Formula 0 simplified : !GF("((p1135==0)||(p121==1))" & F"((p1135==0)||(p121==1))")
Detected timeout of ITS tools.
[2022-05-20 04:52:17] [INFO ] Flatten gal took : 62 ms
[2022-05-20 04:52:17] [INFO ] Applying decomposition
[2022-05-20 04:52:17] [INFO ] Flatten gal took : 57 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7317044175130420379.txt' '-o' '/tmp/graph7317044175130420379.bin' '-w' '/tmp/graph7317044175130420379.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7317044175130420379.bin' '-l' '-1' '-v' '-w' '/tmp/graph7317044175130420379.weights' '-q' '0' '-e' '0.001'
[2022-05-20 04:52:17] [INFO ] Decomposing Gal with order
[2022-05-20 04:52:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 04:52:17] [INFO ] Removed a total of 691 redundant transitions.
[2022-05-20 04:52:17] [INFO ] Flatten gal took : 196 ms
[2022-05-20 04:52:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 587 labels/synchronizations in 79 ms.
[2022-05-20 04:52:17] [INFO ] Time to serialize gal into /tmp/LTL13451735137829429840.gal : 18 ms
[2022-05-20 04:52:17] [INFO ] Time to serialize properties into /tmp/LTL9166134389347408219.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13451735137829429840.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9166134389347408219.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1345173...246
Read 1 LTL properties
Checking formula 0 : !((G(F((F("((i5.u24.p1135==0)||(i0.u3.p121==1))"))&&("((i5.u24.p1135==0)||(i0.u3.p121==1))")))))
Formula 0 simplified : !GF("((i5.u24.p1135==0)||(i0.u3.p121==1))" & F"((i5.u24.p1135==0)||(i0.u3.p121==1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15270682942909140268
[2022-05-20 04:52:32] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15270682942909140268
Running compilation step : cd /tmp/ltsmin15270682942909140268;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2211 ms.
Running link step : cd /tmp/ltsmin15270682942909140268;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin15270682942909140268;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((<>((LTLAPp0==true))&&(LTLAPp0==true))))' '--buchi-type=spotba'
LTSmin run took 1219 ms.
FORMULA NoC3x3-PT-6B-LTLCardinality-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property NoC3x3-PT-6B-LTLCardinality-02 finished in 54062 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G((G(X(p0)) U F(G(X(p0)))))))'
Support contains 2 out of 945 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 945/945 places, 1437/1437 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 944 transition count 1401
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 909 transition count 1401
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 70 place count 909 transition count 1305
Deduced a syphon composed of 96 places in 4 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 262 place count 813 transition count 1305
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 297 place count 778 transition count 1152
Iterating global reduction 2 with 35 rules applied. Total rules applied 332 place count 778 transition count 1152
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 332 place count 778 transition count 1149
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 338 place count 775 transition count 1149
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 349 place count 764 transition count 1104
Iterating global reduction 2 with 11 rules applied. Total rules applied 360 place count 764 transition count 1104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 361 place count 764 transition count 1103
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 362 place count 763 transition count 1101
Iterating global reduction 3 with 1 rules applied. Total rules applied 363 place count 763 transition count 1101
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 364 place count 763 transition count 1100
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 1 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 4 with 358 rules applied. Total rules applied 722 place count 584 transition count 921
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 726 place count 580 transition count 913
Iterating global reduction 4 with 4 rules applied. Total rules applied 730 place count 580 transition count 913
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 733 place count 577 transition count 906
Iterating global reduction 4 with 3 rules applied. Total rules applied 736 place count 577 transition count 906
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 737 place count 576 transition count 904
Iterating global reduction 4 with 1 rules applied. Total rules applied 738 place count 576 transition count 904
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 940 place count 475 transition count 934
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 1018 place count 436 transition count 949
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 4 with 24 rules applied. Total rules applied 1042 place count 436 transition count 925
Applied a total of 1042 rules in 302 ms. Remains 436 /945 variables (removed 509) and now considering 925/1437 (removed 512) transitions.
// Phase 1: matrix 925 rows 436 cols
[2022-05-20 04:52:36] [INFO ] Computed 66 place invariants in 5 ms
[2022-05-20 04:52:37] [INFO ] Implicit Places using invariants in 536 ms returned [10, 45, 96, 135, 195, 275, 326, 365, 414]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 544 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 427/945 places, 925/1437 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 403 transition count 901
Applied a total of 48 rules in 32 ms. Remains 403 /427 variables (removed 24) and now considering 901/925 (removed 24) transitions.
// Phase 1: matrix 901 rows 403 cols
[2022-05-20 04:52:37] [INFO ] Computed 57 place invariants in 3 ms
[2022-05-20 04:52:37] [INFO ] Implicit Places using invariants in 374 ms returned []
// Phase 1: matrix 901 rows 403 cols
[2022-05-20 04:52:37] [INFO ] Computed 57 place invariants in 4 ms
[2022-05-20 04:52:38] [INFO ] State equation strengthened by 53 read => feed constraints.
[2022-05-20 04:52:38] [INFO ] Implicit Places using invariants and state equation in 1308 ms returned []
Implicit Place search using SMT with State Equation took 1684 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 403/945 places, 901/1437 transitions.
Finished structural reductions, in 2 iterations. Remains : 403/945 places, 901/1437 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-6B-LTLCardinality-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (EQ s288 0) (EQ s72 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 6096 steps with 40 reset in 49 ms.
FORMULA NoC3x3-PT-6B-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLCardinality-03 finished in 2674 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 945 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 945/945 places, 1437/1437 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 944 transition count 1401
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 909 transition count 1401
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 70 place count 909 transition count 1305
Deduced a syphon composed of 96 places in 5 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 262 place count 813 transition count 1305
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 296 place count 779 transition count 1153
Iterating global reduction 2 with 34 rules applied. Total rules applied 330 place count 779 transition count 1153
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 330 place count 779 transition count 1151
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 334 place count 777 transition count 1151
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 344 place count 767 transition count 1116
Iterating global reduction 2 with 10 rules applied. Total rules applied 354 place count 767 transition count 1116
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 355 place count 767 transition count 1115
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 357 place count 765 transition count 1111
Iterating global reduction 3 with 2 rules applied. Total rules applied 359 place count 765 transition count 1111
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 360 place count 765 transition count 1110
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 361 place count 764 transition count 1108
Iterating global reduction 4 with 1 rules applied. Total rules applied 362 place count 764 transition count 1108
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: 180
Deduced a syphon composed of 180 places in 1 ms
Reduce places removed 180 places and 0 transitions.
Iterating global reduction 4 with 360 rules applied. Total rules applied 722 place count 584 transition count 928
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 726 place count 580 transition count 920
Iterating global reduction 4 with 4 rules applied. Total rules applied 730 place count 580 transition count 920
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 733 place count 577 transition count 913
Iterating global reduction 4 with 3 rules applied. Total rules applied 736 place count 577 transition count 913
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 737 place count 576 transition count 911
Iterating global reduction 4 with 1 rules applied. Total rules applied 738 place count 576 transition count 911
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 940 place count 475 transition count 941
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -17
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 1018 place count 436 transition count 958
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 4 with 24 rules applied. Total rules applied 1042 place count 436 transition count 934
Applied a total of 1042 rules in 398 ms. Remains 436 /945 variables (removed 509) and now considering 934/1437 (removed 503) transitions.
// Phase 1: matrix 934 rows 436 cols
[2022-05-20 04:52:39] [INFO ] Computed 66 place invariants in 5 ms
[2022-05-20 04:52:39] [INFO ] Implicit Places using invariants in 534 ms returned [10, 45, 93, 132, 192, 274, 326, 365, 414]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 537 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 427/945 places, 934/1437 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 403 transition count 910
Applied a total of 48 rules in 22 ms. Remains 403 /427 variables (removed 24) and now considering 910/934 (removed 24) transitions.
// Phase 1: matrix 910 rows 403 cols
[2022-05-20 04:52:39] [INFO ] Computed 57 place invariants in 4 ms
[2022-05-20 04:52:40] [INFO ] Implicit Places using invariants in 305 ms returned []
// Phase 1: matrix 910 rows 403 cols
[2022-05-20 04:52:40] [INFO ] Computed 57 place invariants in 3 ms
[2022-05-20 04:52:40] [INFO ] State equation strengthened by 55 read => feed constraints.
[2022-05-20 04:52:41] [INFO ] Implicit Places using invariants and state equation in 1182 ms returned []
Implicit Place search using SMT with State Equation took 1489 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 403/945 places, 910/1437 transitions.
Finished structural reductions, in 2 iterations. Remains : 403/945 places, 910/1437 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-6B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (NEQ s245 0) (NEQ s299 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 111 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-6B-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLCardinality-05 finished in 2502 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p1 U (G(X(p1)) U G(p1)))||p0)))'
Support contains 4 out of 945 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 945/945 places, 1437/1437 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 929 transition count 1414
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 929 transition count 1414
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 43 place count 918 transition count 1389
Iterating global reduction 0 with 11 rules applied. Total rules applied 54 place count 918 transition count 1389
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 62 place count 910 transition count 1371
Iterating global reduction 0 with 8 rules applied. Total rules applied 70 place count 910 transition count 1371
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 74 place count 910 transition count 1367
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 79 place count 905 transition count 1359
Iterating global reduction 1 with 5 rules applied. Total rules applied 84 place count 905 transition count 1359
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 85 place count 905 transition count 1358
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 87 place count 903 transition count 1355
Iterating global reduction 2 with 2 rules applied. Total rules applied 89 place count 903 transition count 1355
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 90 place count 902 transition count 1354
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 902 transition count 1354
Applied a total of 91 rules in 185 ms. Remains 902 /945 variables (removed 43) and now considering 1354/1437 (removed 83) transitions.
// Phase 1: matrix 1354 rows 902 cols
[2022-05-20 04:52:41] [INFO ] Computed 66 place invariants in 7 ms
[2022-05-20 04:52:42] [INFO ] Implicit Places using invariants in 722 ms returned []
// Phase 1: matrix 1354 rows 902 cols
[2022-05-20 04:52:42] [INFO ] Computed 66 place invariants in 5 ms
[2022-05-20 04:52:44] [INFO ] Implicit Places using invariants and state equation in 1591 ms returned []
Implicit Place search using SMT with State Equation took 2317 ms to find 0 implicit places.
// Phase 1: matrix 1354 rows 902 cols
[2022-05-20 04:52:44] [INFO ] Computed 66 place invariants in 5 ms
[2022-05-20 04:52:45] [INFO ] Dead Transitions using invariants and state equation in 1180 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 902/945 places, 1354/1437 transitions.
Finished structural reductions, in 1 iterations. Remains : 902/945 places, 1354/1437 transitions.
Stuttering acceptance computed with spot in 163 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-6B-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={} source=4 dest: 0}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=2, aps=[p0:(OR (EQ s756 0) (EQ s510 1)), p1:(OR (EQ s784 0) (EQ s113 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1240 ms.
Product exploration explored 100000 steps with 50000 reset in 1120 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 (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 4 factoid took 93 ms. Reduced automaton from 5 states, 8 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA NoC3x3-PT-6B-LTLCardinality-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-6B-LTLCardinality-07 finished in 6353 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(F(p0))))'
Support contains 2 out of 945 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 945/945 places, 1437/1437 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 944 transition count 1401
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 909 transition count 1401
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 70 place count 909 transition count 1305
Deduced a syphon composed of 96 places in 5 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 262 place count 813 transition count 1305
Discarding 34 places :
Symmetric choice reduction at 2 with 34 rule applications. Total rules 296 place count 779 transition count 1153
Iterating global reduction 2 with 34 rules applied. Total rules applied 330 place count 779 transition count 1153
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 330 place count 779 transition count 1150
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 336 place count 776 transition count 1150
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 346 place count 766 transition count 1113
Iterating global reduction 2 with 10 rules applied. Total rules applied 356 place count 766 transition count 1113
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 357 place count 766 transition count 1112
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 359 place count 764 transition count 1108
Iterating global reduction 3 with 2 rules applied. Total rules applied 361 place count 764 transition count 1108
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 362 place count 764 transition count 1107
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 363 place count 763 transition count 1105
Iterating global reduction 4 with 1 rules applied. Total rules applied 364 place count 763 transition count 1105
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 1 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 4 with 358 rules applied. Total rules applied 722 place count 584 transition count 926
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 726 place count 580 transition count 918
Iterating global reduction 4 with 4 rules applied. Total rules applied 730 place count 580 transition count 918
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 733 place count 577 transition count 911
Iterating global reduction 4 with 3 rules applied. Total rules applied 736 place count 577 transition count 911
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 737 place count 576 transition count 909
Iterating global reduction 4 with 1 rules applied. Total rules applied 738 place count 576 transition count 909
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
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 940 place count 475 transition count 939
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 39 places in 1 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 1018 place count 436 transition count 954
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 4 with 24 rules applied. Total rules applied 1042 place count 436 transition count 930
Applied a total of 1042 rules in 395 ms. Remains 436 /945 variables (removed 509) and now considering 930/1437 (removed 507) transitions.
// Phase 1: matrix 930 rows 436 cols
[2022-05-20 04:52:48] [INFO ] Computed 66 place invariants in 3 ms
[2022-05-20 04:52:48] [INFO ] Implicit Places using invariants in 694 ms returned [10, 45, 93, 132, 194, 276, 326, 365, 414]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 696 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 427/945 places, 930/1437 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 403 transition count 906
Applied a total of 48 rules in 36 ms. Remains 403 /427 variables (removed 24) and now considering 906/930 (removed 24) transitions.
// Phase 1: matrix 906 rows 403 cols
[2022-05-20 04:52:49] [INFO ] Computed 57 place invariants in 4 ms
[2022-05-20 04:52:49] [INFO ] Implicit Places using invariants in 579 ms returned []
// Phase 1: matrix 906 rows 403 cols
[2022-05-20 04:52:49] [INFO ] Computed 57 place invariants in 4 ms
[2022-05-20 04:52:50] [INFO ] State equation strengthened by 55 read => feed constraints.
[2022-05-20 04:52:51] [INFO ] Implicit Places using invariants and state equation in 1610 ms returned []
Implicit Place search using SMT with State Equation took 2193 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 403/945 places, 906/1437 transitions.
Finished structural reductions, in 2 iterations. Remains : 403/945 places, 906/1437 transitions.
Stuttering acceptance computed with spot in 112 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-6B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s158 0) (NEQ s247 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 112 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-6B-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLCardinality-08 finished in 3460 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 2 out of 945 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 945/945 places, 1437/1437 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 929 transition count 1415
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 929 transition count 1415
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 43 place count 918 transition count 1390
Iterating global reduction 0 with 11 rules applied. Total rules applied 54 place count 918 transition count 1390
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 61 place count 911 transition count 1374
Iterating global reduction 0 with 7 rules applied. Total rules applied 68 place count 911 transition count 1374
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 72 place count 911 transition count 1370
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 76 place count 907 transition count 1363
Iterating global reduction 1 with 4 rules applied. Total rules applied 80 place count 907 transition count 1363
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 82 place count 905 transition count 1360
Iterating global reduction 1 with 2 rules applied. Total rules applied 84 place count 905 transition count 1360
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 85 place count 904 transition count 1359
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 904 transition count 1359
Applied a total of 86 rules in 272 ms. Remains 904 /945 variables (removed 41) and now considering 1359/1437 (removed 78) transitions.
// Phase 1: matrix 1359 rows 904 cols
[2022-05-20 04:52:51] [INFO ] Computed 66 place invariants in 6 ms
[2022-05-20 04:52:52] [INFO ] Implicit Places using invariants in 933 ms returned []
// Phase 1: matrix 1359 rows 904 cols
[2022-05-20 04:52:52] [INFO ] Computed 66 place invariants in 6 ms
[2022-05-20 04:52:54] [INFO ] Implicit Places using invariants and state equation in 2021 ms returned []
Implicit Place search using SMT with State Equation took 2961 ms to find 0 implicit places.
// Phase 1: matrix 1359 rows 904 cols
[2022-05-20 04:52:54] [INFO ] Computed 66 place invariants in 6 ms
[2022-05-20 04:52:56] [INFO ] Dead Transitions using invariants and state equation in 1545 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 904/945 places, 1359/1437 transitions.
Finished structural reductions, in 1 iterations. Remains : 904/945 places, 1359/1437 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-6B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s76 0) (EQ s639 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 292 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-6B-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLCardinality-09 finished in 4889 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(G(X((G(p0)&&p1)))))'
Support contains 4 out of 945 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 945/945 places, 1437/1437 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 931 transition count 1419
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 931 transition count 1419
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 38 place count 921 transition count 1395
Iterating global reduction 0 with 10 rules applied. Total rules applied 48 place count 921 transition count 1395
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 52 place count 917 transition count 1383
Iterating global reduction 0 with 4 rules applied. Total rules applied 56 place count 917 transition count 1383
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 60 place count 913 transition count 1377
Iterating global reduction 0 with 4 rules applied. Total rules applied 64 place count 913 transition count 1377
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 65 place count 913 transition count 1376
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 912 transition count 1375
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 912 transition count 1375
Applied a total of 67 rules in 176 ms. Remains 912 /945 variables (removed 33) and now considering 1375/1437 (removed 62) transitions.
// Phase 1: matrix 1375 rows 912 cols
[2022-05-20 04:52:56] [INFO ] Computed 66 place invariants in 6 ms
[2022-05-20 04:52:57] [INFO ] Implicit Places using invariants in 1014 ms returned []
// Phase 1: matrix 1375 rows 912 cols
[2022-05-20 04:52:57] [INFO ] Computed 66 place invariants in 6 ms
[2022-05-20 04:52:59] [INFO ] Implicit Places using invariants and state equation in 1842 ms returned []
Implicit Place search using SMT with State Equation took 2858 ms to find 0 implicit places.
// Phase 1: matrix 1375 rows 912 cols
[2022-05-20 04:52:59] [INFO ] Computed 66 place invariants in 5 ms
[2022-05-20 04:53:00] [INFO ] Dead Transitions using invariants and state equation in 1546 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 912/945 places, 1375/1437 transitions.
Finished structural reductions, in 1 iterations. Remains : 912/945 places, 1375/1437 transitions.
Stuttering acceptance computed with spot in 177 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-6B-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s478 0) (EQ s345 1)), p1:(OR (EQ s446 0) (EQ s586 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-6B-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLCardinality-10 finished in 4783 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(F(p0))||p1)))'
Support contains 3 out of 945 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 945/945 places, 1437/1437 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 929 transition count 1414
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 929 transition count 1414
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 43 place count 918 transition count 1388
Iterating global reduction 0 with 11 rules applied. Total rules applied 54 place count 918 transition count 1388
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 61 place count 911 transition count 1372
Iterating global reduction 0 with 7 rules applied. Total rules applied 68 place count 911 transition count 1372
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 72 place count 911 transition count 1368
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 76 place count 907 transition count 1362
Iterating global reduction 1 with 4 rules applied. Total rules applied 80 place count 907 transition count 1362
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 81 place count 907 transition count 1361
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 82 place count 906 transition count 1359
Iterating global reduction 2 with 1 rules applied. Total rules applied 83 place count 906 transition count 1359
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 84 place count 905 transition count 1358
Iterating global reduction 2 with 1 rules applied. Total rules applied 85 place count 905 transition count 1358
Applied a total of 85 rules in 306 ms. Remains 905 /945 variables (removed 40) and now considering 1358/1437 (removed 79) transitions.
// Phase 1: matrix 1358 rows 905 cols
[2022-05-20 04:53:01] [INFO ] Computed 66 place invariants in 4 ms
[2022-05-20 04:53:02] [INFO ] Implicit Places using invariants in 675 ms returned []
// Phase 1: matrix 1358 rows 905 cols
[2022-05-20 04:53:02] [INFO ] Computed 66 place invariants in 4 ms
[2022-05-20 04:53:03] [INFO ] Implicit Places using invariants and state equation in 1597 ms returned []
Implicit Place search using SMT with State Equation took 2276 ms to find 0 implicit places.
// Phase 1: matrix 1358 rows 905 cols
[2022-05-20 04:53:03] [INFO ] Computed 66 place invariants in 7 ms
[2022-05-20 04:53:04] [INFO ] Dead Transitions using invariants and state equation in 1356 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 905/945 places, 1358/1437 transitions.
Finished structural reductions, in 1 iterations. Remains : 905/945 places, 1358/1437 transitions.
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-6B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}]], initial=0, aps=[p0:(OR (EQ s20 0) (EQ s646 1)), p1:(EQ s785 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1682 ms.
Product exploration explored 100000 steps with 50000 reset in 1365 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 (NOT p1)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p1) (NOT p0))))
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 3 states, 3 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA NoC3x3-PT-6B-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-6B-LTLCardinality-11 finished in 7210 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 945 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 945/945 places, 1437/1437 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 944 transition count 1401
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 909 transition count 1401
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 70 place count 909 transition count 1305
Deduced a syphon composed of 96 places in 3 ms
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 2 with 192 rules applied. Total rules applied 262 place count 813 transition count 1305
Discarding 35 places :
Symmetric choice reduction at 2 with 35 rule applications. Total rules 297 place count 778 transition count 1154
Iterating global reduction 2 with 35 rules applied. Total rules applied 332 place count 778 transition count 1154
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 332 place count 778 transition count 1151
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 338 place count 775 transition count 1151
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 350 place count 763 transition count 1104
Iterating global reduction 2 with 12 rules applied. Total rules applied 362 place count 763 transition count 1104
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 363 place count 763 transition count 1103
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 365 place count 761 transition count 1099
Iterating global reduction 3 with 2 rules applied. Total rules applied 367 place count 761 transition count 1099
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 368 place count 761 transition count 1098
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 369 place count 760 transition count 1096
Iterating global reduction 4 with 1 rules applied. Total rules applied 370 place count 760 transition count 1096
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 179
Deduced a syphon composed of 179 places in 1 ms
Reduce places removed 179 places and 0 transitions.
Iterating global reduction 4 with 358 rules applied. Total rules applied 728 place count 581 transition count 917
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 732 place count 577 transition count 909
Iterating global reduction 4 with 4 rules applied. Total rules applied 736 place count 577 transition count 909
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 739 place count 574 transition count 902
Iterating global reduction 4 with 3 rules applied. Total rules applied 742 place count 574 transition count 902
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 743 place count 573 transition count 900
Iterating global reduction 4 with 1 rules applied. Total rules applied 744 place count 573 transition count 900
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
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 946 place count 472 transition count 930
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 1024 place count 433 transition count 945
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 4 with 24 rules applied. Total rules applied 1048 place count 433 transition count 921
Applied a total of 1048 rules in 349 ms. Remains 433 /945 variables (removed 512) and now considering 921/1437 (removed 516) transitions.
// Phase 1: matrix 921 rows 433 cols
[2022-05-20 04:53:08] [INFO ] Computed 66 place invariants in 3 ms
[2022-05-20 04:53:09] [INFO ] Implicit Places using invariants in 466 ms returned [10, 45, 93, 132, 192, 273, 323, 362, 411]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 470 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 424/945 places, 921/1437 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 400 transition count 897
Applied a total of 48 rules in 22 ms. Remains 400 /424 variables (removed 24) and now considering 897/921 (removed 24) transitions.
// Phase 1: matrix 897 rows 400 cols
[2022-05-20 04:53:09] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-20 04:53:09] [INFO ] Implicit Places using invariants in 414 ms returned []
// Phase 1: matrix 897 rows 400 cols
[2022-05-20 04:53:09] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-20 04:53:09] [INFO ] State equation strengthened by 54 read => feed constraints.
[2022-05-20 04:53:10] [INFO ] Implicit Places using invariants and state equation in 1117 ms returned []
Implicit Place search using SMT with State Equation took 1536 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 400/945 places, 897/1437 transitions.
Finished structural reductions, in 2 iterations. Remains : 400/945 places, 897/1437 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-6B-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s238 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 209 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-6B-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6B-LTLCardinality-12 finished in 2431 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0)) U G(!p1)))'
Support contains 4 out of 945 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 945/945 places, 1437/1437 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 932 transition count 1417
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 932 transition count 1417
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 35 place count 923 transition count 1395
Iterating global reduction 0 with 9 rules applied. Total rules applied 44 place count 923 transition count 1395
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 48 place count 919 transition count 1388
Iterating global reduction 0 with 4 rules applied. Total rules applied 52 place count 919 transition count 1388
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 56 place count 919 transition count 1384
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 59 place count 916 transition count 1379
Iterating global reduction 1 with 3 rules applied. Total rules applied 62 place count 916 transition count 1379
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 63 place count 916 transition count 1378
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 915 transition count 1377
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 915 transition count 1377
Applied a total of 65 rules in 150 ms. Remains 915 /945 variables (removed 30) and now considering 1377/1437 (removed 60) transitions.
// Phase 1: matrix 1377 rows 915 cols
[2022-05-20 04:53:10] [INFO ] Computed 66 place invariants in 4 ms
[2022-05-20 04:53:11] [INFO ] Implicit Places using invariants in 984 ms returned []
// Phase 1: matrix 1377 rows 915 cols
[2022-05-20 04:53:11] [INFO ] Computed 66 place invariants in 6 ms
[2022-05-20 04:53:13] [INFO ] Implicit Places using invariants and state equation in 1921 ms returned []
Implicit Place search using SMT with State Equation took 2914 ms to find 0 implicit places.
// Phase 1: matrix 1377 rows 915 cols
[2022-05-20 04:53:13] [INFO ] Computed 66 place invariants in 10 ms
[2022-05-20 04:53:15] [INFO ] Dead Transitions using invariants and state equation in 1541 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 915/945 places, 1377/1437 transitions.
Finished structural reductions, in 1 iterations. Remains : 915/945 places, 1377/1437 transitions.
Stuttering acceptance computed with spot in 226 ms :[p1, (NOT p0), (AND p1 (NOT p0)), true, (AND p1 p0)]
Running random walk in product with property : NoC3x3-PT-6B-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND p1 p0), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s133 0) (EQ s447 1)), p0:(OR (EQ s834 0) (EQ s492 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33239 reset in 1372 ms.
Product exploration explored 100000 steps with 33317 reset in 1413 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 p1 p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT (AND p1 (NOT p0)))), true, (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 696 ms. Reduced automaton from 5 states, 11 edges and 2 AP to 4 states, 10 edges and 2 AP.
Stuttering acceptance computed with spot in 114 ms :[p1, (AND (NOT p1) (NOT p0)), true, (AND p1 p0)]
Incomplete random walk after 10000 steps, including 23 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 1377 rows 915 cols
[2022-05-20 04:53:19] [INFO ] Computed 66 place invariants in 6 ms
[2022-05-20 04:53:19] [INFO ] After 234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-20 04:53:19] [INFO ] [Nat]Absence check using 66 positive place invariants in 60 ms returned sat
[2022-05-20 04:53:21] [INFO ] After 1141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-20 04:53:21] [INFO ] After 1411ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 168 ms.
[2022-05-20 04:53:21] [INFO ] After 1926ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 46 ms.
Support contains 4 out of 915 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 915/915 places, 1377/1377 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 915 transition count 1346
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 1 with 31 rules applied. Total rules applied 62 place count 884 transition count 1346
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 62 place count 884 transition count 1251
Deduced a syphon composed of 95 places in 5 ms
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 2 with 190 rules applied. Total rules applied 252 place count 789 transition count 1251
Discarding 23 places :
Symmetric choice reduction at 2 with 23 rule applications. Total rules 275 place count 766 transition count 1107
Iterating global reduction 2 with 23 rules applied. Total rules applied 298 place count 766 transition count 1107
Performed 181 Post agglomeration using F-continuation condition.Transition count delta: 181
Deduced a syphon composed of 181 places in 0 ms
Reduce places removed 181 places and 0 transitions.
Iterating global reduction 2 with 362 rules applied. Total rules applied 660 place count 585 transition count 926
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 661 place count 584 transition count 917
Iterating global reduction 2 with 1 rules applied. Total rules applied 662 place count 584 transition count 917
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -30
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 2 with 202 rules applied. Total rules applied 864 place count 483 transition count 947
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -15
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 2 with 80 rules applied. Total rules applied 944 place count 443 transition count 962
Drop transitions removed 24 transitions
Redundant transition composition rules discarded 24 transitions
Iterating global reduction 2 with 24 rules applied. Total rules applied 968 place count 443 transition count 938
Free-agglomeration rule applied 25 times.
Iterating global reduction 2 with 25 rules applied. Total rules applied 993 place count 443 transition count 913
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 2 with 39 rules applied. Total rules applied 1032 place count 418 transition count 899
Applied a total of 1032 rules in 235 ms. Remains 418 /915 variables (removed 497) and now considering 899/1377 (removed 478) transitions.
Finished structural reductions, in 1 iterations. Remains : 418/915 places, 899/1377 transitions.
Incomplete random walk after 10000 steps, including 65 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 899 rows 418 cols
[2022-05-20 04:53:22] [INFO ] Computed 66 place invariants in 4 ms
[2022-05-20 04:53:22] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 04:53:22] [INFO ] [Nat]Absence check using 66 positive place invariants in 29 ms returned sat
[2022-05-20 04:53:22] [INFO ] After 532ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 04:53:22] [INFO ] State equation strengthened by 54 read => feed constraints.
[2022-05-20 04:53:23] [INFO ] After 164ms SMT Verify possible using 54 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 04:53:23] [INFO ] After 247ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 372 ms.
[2022-05-20 04:53:23] [INFO ] After 1312ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 418 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 418/418 places, 899/899 transitions.
Applied a total of 0 rules in 18 ms. Remains 418 /418 variables (removed 0) and now considering 899/899 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 418/418 places, 899/899 transitions.
Incomplete random walk after 10000 steps, including 68 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 242494 steps, run timeout after 3001 ms. (steps per millisecond=80 ) properties seen :{}
Probabilistic random walk after 242494 steps, saw 74882 distinct states, run finished after 3011 ms. (steps per millisecond=80 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 899 rows 418 cols
[2022-05-20 04:53:26] [INFO ] Computed 66 place invariants in 4 ms
[2022-05-20 04:53:26] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 04:53:27] [INFO ] [Nat]Absence check using 66 positive place invariants in 32 ms returned sat
[2022-05-20 04:53:27] [INFO ] After 577ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 04:53:27] [INFO ] State equation strengthened by 54 read => feed constraints.
[2022-05-20 04:53:27] [INFO ] After 188ms SMT Verify possible using 54 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 04:53:27] [INFO ] After 290ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 408 ms.
[2022-05-20 04:53:28] [INFO ] After 1448ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 418 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 418/418 places, 899/899 transitions.
Applied a total of 0 rules in 20 ms. Remains 418 /418 variables (removed 0) and now considering 899/899 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 418/418 places, 899/899 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 418/418 places, 899/899 transitions.
Applied a total of 0 rules in 18 ms. Remains 418 /418 variables (removed 0) and now considering 899/899 (removed 0) transitions.
// Phase 1: matrix 899 rows 418 cols
[2022-05-20 04:53:28] [INFO ] Computed 66 place invariants in 4 ms
[2022-05-20 04:53:29] [INFO ] Implicit Places using invariants in 736 ms returned [10, 46, 90, 129, 185, 264, 310, 349, 398]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 739 ms to find 9 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 409/418 places, 899/899 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 0 with 48 rules applied. Total rules applied 48 place count 385 transition count 875
Applied a total of 48 rules in 31 ms. Remains 385 /409 variables (removed 24) and now considering 875/899 (removed 24) transitions.
// Phase 1: matrix 875 rows 385 cols
[2022-05-20 04:53:29] [INFO ] Computed 57 place invariants in 3 ms
[2022-05-20 04:53:29] [INFO ] Implicit Places using invariants in 676 ms returned []
// Phase 1: matrix 875 rows 385 cols
[2022-05-20 04:53:29] [INFO ] Computed 57 place invariants in 4 ms
[2022-05-20 04:53:30] [INFO ] State equation strengthened by 54 read => feed constraints.
[2022-05-20 04:53:30] [INFO ] Implicit Places using invariants and state equation in 1079 ms returned []
Implicit Place search using SMT with State Equation took 1757 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 385/418 places, 875/899 transitions.
Finished structural reductions, in 2 iterations. Remains : 385/418 places, 875/899 transitions.
Incomplete random walk after 10000 steps, including 75 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 4 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 213755 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{}
Probabilistic random walk after 213755 steps, saw 62527 distinct states, run finished after 3002 ms. (steps per millisecond=71 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 875 rows 385 cols
[2022-05-20 04:53:33] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-20 04:53:34] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 04:53:34] [INFO ] [Nat]Absence check using 57 positive place invariants in 19 ms returned sat
[2022-05-20 04:53:34] [INFO ] After 334ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 04:53:34] [INFO ] State equation strengthened by 54 read => feed constraints.
[2022-05-20 04:53:34] [INFO ] After 81ms SMT Verify possible using 54 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-05-20 04:53:34] [INFO ] After 141ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 40 ms.
[2022-05-20 04:53:34] [INFO ] After 613ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 19 ms.
Support contains 4 out of 385 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 385/385 places, 875/875 transitions.
Applied a total of 0 rules in 13 ms. Remains 385 /385 variables (removed 0) and now considering 875/875 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 385/385 places, 875/875 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 385/385 places, 875/875 transitions.
Applied a total of 0 rules in 13 ms. Remains 385 /385 variables (removed 0) and now considering 875/875 (removed 0) transitions.
// Phase 1: matrix 875 rows 385 cols
[2022-05-20 04:53:34] [INFO ] Computed 57 place invariants in 6 ms
[2022-05-20 04:53:35] [INFO ] Implicit Places using invariants in 591 ms returned []
// Phase 1: matrix 875 rows 385 cols
[2022-05-20 04:53:35] [INFO ] Computed 57 place invariants in 4 ms
[2022-05-20 04:53:35] [INFO ] State equation strengthened by 54 read => feed constraints.
[2022-05-20 04:53:36] [INFO ] Implicit Places using invariants and state equation in 1308 ms returned []
Implicit Place search using SMT with State Equation took 1901 ms to find 0 implicit places.
[2022-05-20 04:53:36] [INFO ] Redundant transitions in 14 ms returned []
// Phase 1: matrix 875 rows 385 cols
[2022-05-20 04:53:36] [INFO ] Computed 57 place invariants in 5 ms
[2022-05-20 04:53:37] [INFO ] Dead Transitions using invariants and state equation in 854 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 385/385 places, 875/875 transitions.
Drop transitions removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 385 transition count 863
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 15 place count 385 transition count 863
Applied a total of 15 rules in 36 ms. Remains 385 /385 variables (removed 0) and now considering 863/875 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 863 rows 385 cols
[2022-05-20 04:53:37] [INFO ] Computed 57 place invariants in 2 ms
[2022-05-20 04:53:37] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-05-20 04:53:37] [INFO ] [Nat]Absence check using 57 positive place invariants in 17 ms returned sat
[2022-05-20 04:53:38] [INFO ] After 338ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-05-20 04:53:38] [INFO ] After 401ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2022-05-20 04:53:38] [INFO ] After 527ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-05-20 04:53:38] [INFO ] Flatten gal took : 57 ms
[2022-05-20 04:53:38] [INFO ] Flatten gal took : 53 ms
[2022-05-20 04:53:38] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16273843079008158752.gal : 9 ms
[2022-05-20 04:53:38] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10009732907176953714.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms8156815431948069893;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16273843079008158752.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10009732907176953714.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality10009732907176953714.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 15
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :15 after 16
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :16 after 28
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :28 after 44
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :44 after 79
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :79 after 1087
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1087 after 131527
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :131527 after 505187
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :505187 after 2.07216e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2.07216e+06 after 1.33305e+08
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1.33305e+08 after 5.56744e+08
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :5.56744e+08 after 2.4394e+09
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.4394e+09 after 3.36512e+10
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :3.36512e+10 after 1.25068e+14
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :1.25068e+14 after 2.82409e+14
Detected timeout of ITS tools.
[2022-05-20 04:53:53] [INFO ] Flatten gal took : 50 ms
[2022-05-20 04:53:53] [INFO ] Applying decomposition
[2022-05-20 04:53:53] [INFO ] Flatten gal took : 46 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph13607942419530188918.txt' '-o' '/tmp/graph13607942419530188918.bin' '-w' '/tmp/graph13607942419530188918.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph13607942419530188918.bin' '-l' '-1' '-v' '-w' '/tmp/graph13607942419530188918.weights' '-q' '0' '-e' '0.001'
[2022-05-20 04:53:53] [INFO ] Decomposing Gal with order
[2022-05-20 04:53:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-20 04:53:53] [INFO ] Removed a total of 745 redundant transitions.
[2022-05-20 04:53:53] [INFO ] Flatten gal took : 107 ms
[2022-05-20 04:53:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 539 labels/synchronizations in 60 ms.
[2022-05-20 04:53:53] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10500121724331356768.gal : 11 ms
[2022-05-20 04:53:53] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2238732328965062853.prop : 160 ms
Invoking ITS tools like this :cd /tmp/redAtoms8156815431948069893;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10500121724331356768.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2238732328965062853.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...299
Loading property file /tmp/ReachabilityCardinality2238732328965062853.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :505 after 1513
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1513 after 6049
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :6049 after 18145
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :18145 after 3.59251e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :3.59251e+06 after 1.67227e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.67227e+07 after 2.72811e+08
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2.72811e+08 after 5.50953e+08
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :5.50953e+08 after 5.61731e+08
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :5.61731e+08 after 6.10088e+08
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :6.10088e+08 after 9.54804e+11
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :9.54804e+11 after 1.95506e+12
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6376725854441261080
[2022-05-20 04:54:09] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6376725854441261080
Running compilation step : cd /tmp/ltsmin6376725854441261080;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2300 ms.
Running link step : cd /tmp/ltsmin6376725854441261080;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin6376725854441261080;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '-i' 'apf3==true'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X p0), (X (NOT (AND p1 (NOT p0)))), true, (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (NOT p1)), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1)))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p0) p1))
Knowledge based reduction with 13 factoid took 229 ms. Reduced automaton from 4 states, 10 edges and 2 AP to 1 states, 1 edges and 0 AP.
FORMULA NoC3x3-PT-6B-LTLCardinality-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-6B-LTLCardinality-13 finished in 73704 ms.
All properties solved by simple procedures.
Total runtime 179280 ms.

BK_STOP 1653022464486

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-6B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is NoC3x3-PT-6B, 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 r150-smll-165276998500203"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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