Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 988K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:24 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.4K May 19 07:14 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 19 15:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 525K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716691857895

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-5B
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-26 02:50:59] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-26 02:50:59] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-26 02:50:59] [INFO ] Load time of PNML (sax parser for PT used): 112 ms
[2024-05-26 02:50:59] [INFO ] Transformed 1571 places.
[2024-05-26 02:50:59] [INFO ] Transformed 2173 transitions.
[2024-05-26 02:50:59] [INFO ] Found NUPN structural information;
[2024-05-26 02:50:59] [INFO ] Parsed PT model containing 1571 places and 2173 transitions and 6109 arcs in 196 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA NoC3x3-PT-5B-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5B-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5B-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5B-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5B-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5B-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5B-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5B-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-5B-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 1571 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1571/1571 places, 2173/2173 transitions.
Discarding 433 places :
Symmetric choice reduction at 0 with 433 rule applications. Total rules 433 place count 1138 transition count 1740
Iterating global reduction 0 with 433 rules applied. Total rules applied 866 place count 1138 transition count 1740
Discarding 111 places :
Symmetric choice reduction at 0 with 111 rule applications. Total rules 977 place count 1027 transition count 1621
Iterating global reduction 0 with 111 rules applied. Total rules applied 1088 place count 1027 transition count 1621
Discarding 89 places :
Symmetric choice reduction at 0 with 89 rule applications. Total rules 1177 place count 938 transition count 1468
Iterating global reduction 0 with 89 rules applied. Total rules applied 1266 place count 938 transition count 1468
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 1289 place count 915 transition count 1422
Iterating global reduction 0 with 23 rules applied. Total rules applied 1312 place count 915 transition count 1422
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 1317 place count 910 transition count 1412
Iterating global reduction 0 with 5 rules applied. Total rules applied 1322 place count 910 transition count 1412
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 1327 place count 905 transition count 1407
Iterating global reduction 0 with 5 rules applied. Total rules applied 1332 place count 905 transition count 1407
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1333 place count 904 transition count 1405
Iterating global reduction 0 with 1 rules applied. Total rules applied 1334 place count 904 transition count 1405
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1335 place count 903 transition count 1402
Iterating global reduction 0 with 1 rules applied. Total rules applied 1336 place count 903 transition count 1402
Applied a total of 1336 rules in 427 ms. Remains 903 /1571 variables (removed 668) and now considering 1402/2173 (removed 771) transitions.
// Phase 1: matrix 1402 rows 903 cols
[2024-05-26 02:51:00] [INFO ] Computed 66 invariants in 29 ms
[2024-05-26 02:51:00] [INFO ] Implicit Places using invariants in 455 ms returned []
[2024-05-26 02:51:00] [INFO ] Invariant cache hit.
[2024-05-26 02:51:01] [INFO ] Implicit Places using invariants and state equation in 801 ms returned []
Implicit Place search using SMT with State Equation took 1291 ms to find 0 implicit places.
[2024-05-26 02:51:01] [INFO ] Invariant cache hit.
[2024-05-26 02:51:01] [INFO ] Dead Transitions using invariants and state equation in 514 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 903/1571 places, 1402/2173 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2233 ms. Remains : 903/1571 places, 1402/2173 transitions.
Support contains 24 out of 903 places after structural reductions.
[2024-05-26 02:51:02] [INFO ] Flatten gal took : 109 ms
[2024-05-26 02:51:02] [INFO ] Flatten gal took : 69 ms
[2024-05-26 02:51:02] [INFO ] Input system was already deterministic with 1402 transitions.
Support contains 22 out of 903 places (down from 24) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 331 ms. (steps per millisecond=30 ) properties (out of 15) seen :12
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-26 02:51:02] [INFO ] Invariant cache hit.
[2024-05-26 02:51:03] [INFO ] [Real]Absence check using 66 positive place invariants in 24 ms returned sat
[2024-05-26 02:51:03] [INFO ] After 186ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-26 02:51:03] [INFO ] [Nat]Absence check using 66 positive place invariants in 27 ms returned sat
[2024-05-26 02:51:03] [INFO ] After 580ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-26 02:51:03] [INFO ] Deduced a trap composed of 52 places in 74 ms of which 5 ms to minimize.
[2024-05-26 02:51:04] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 157 ms
[2024-05-26 02:51:04] [INFO ] After 864ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 86 ms.
[2024-05-26 02:51:04] [INFO ] After 1149ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 17 ms.
Support contains 3 out of 903 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 903/903 places, 1402/1402 transitions.
Drop transitions removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 74 place count 903 transition count 1328
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 1 with 74 rules applied. Total rules applied 148 place count 829 transition count 1328
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 148 place count 829 transition count 1292
Deduced a syphon composed of 36 places in 3 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 220 place count 793 transition count 1292
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 251 place count 762 transition count 1190
Iterating global reduction 2 with 31 rules applied. Total rules applied 282 place count 762 transition count 1190
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 282 place count 762 transition count 1189
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 284 place count 761 transition count 1189
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 291 place count 754 transition count 1177
Iterating global reduction 2 with 7 rules applied. Total rules applied 298 place count 754 transition count 1177
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 300 place count 752 transition count 1173
Iterating global reduction 2 with 2 rules applied. Total rules applied 302 place count 752 transition count 1173
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 304 place count 750 transition count 1167
Iterating global reduction 2 with 2 rules applied. Total rules applied 306 place count 750 transition count 1167
Performed 192 Post agglomeration using F-continuation condition.Transition count delta: 192
Deduced a syphon composed of 192 places in 0 ms
Reduce places removed 192 places and 0 transitions.
Iterating global reduction 2 with 384 rules applied. Total rules applied 690 place count 558 transition count 975
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 693 place count 558 transition count 972
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 694 place count 557 transition count 970
Iterating global reduction 3 with 1 rules applied. Total rules applied 695 place count 557 transition count 970
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 696 place count 556 transition count 968
Iterating global reduction 3 with 1 rules applied. Total rules applied 697 place count 556 transition count 968
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 698 place count 555 transition count 966
Iterating global reduction 3 with 1 rules applied. Total rules applied 699 place count 555 transition count 966
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 700 place count 554 transition count 963
Iterating global reduction 3 with 1 rules applied. Total rules applied 701 place count 554 transition count 963
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 702 place count 554 transition count 962
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 904 place count 453 transition count 990
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 4 with 14 rules applied. Total rules applied 918 place count 453 transition count 976
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 5 with 68 rules applied. Total rules applied 986 place count 419 transition count 984
Drop transitions removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 5 with 62 rules applied. Total rules applied 1048 place count 419 transition count 922
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 1057 place count 410 transition count 922
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 1057 place count 410 transition count 917
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 1067 place count 405 transition count 917
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 1103 place count 387 transition count 899
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 1105 place count 386 transition count 902
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1106 place count 386 transition count 901
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 1107 place count 385 transition count 901
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 7 with 6 rules applied. Total rules applied 1113 place count 385 transition count 901
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 1114 place count 384 transition count 900
Applied a total of 1114 rules in 407 ms. Remains 384 /903 variables (removed 519) and now considering 900/1402 (removed 502) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 409 ms. Remains : 384/903 places, 900/1402 transitions.
Finished random walk after 793 steps, including 3 resets, run visited all 2 properties in 11 ms. (steps per millisecond=72 )
Parikh walk visited 0 properties in 0 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(!p0 U (G(!p0)||(!p0&&G(p1))))))'
Support contains 3 out of 903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 903/903 places, 1402/1402 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 889 transition count 1387
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 889 transition count 1387
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 35 place count 882 transition count 1377
Iterating global reduction 0 with 7 rules applied. Total rules applied 42 place count 882 transition count 1377
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 880 transition count 1373
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 880 transition count 1373
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 878 transition count 1369
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 878 transition count 1369
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 877 transition count 1367
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 877 transition count 1367
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 876 transition count 1364
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 876 transition count 1364
Applied a total of 54 rules in 116 ms. Remains 876 /903 variables (removed 27) and now considering 1364/1402 (removed 38) transitions.
// Phase 1: matrix 1364 rows 876 cols
[2024-05-26 02:51:05] [INFO ] Computed 66 invariants in 16 ms
[2024-05-26 02:51:05] [INFO ] Implicit Places using invariants in 279 ms returned []
[2024-05-26 02:51:05] [INFO ] Invariant cache hit.
[2024-05-26 02:51:06] [INFO ] Implicit Places using invariants and state equation in 763 ms returned []
Implicit Place search using SMT with State Equation took 1046 ms to find 0 implicit places.
[2024-05-26 02:51:06] [INFO ] Invariant cache hit.
[2024-05-26 02:51:06] [INFO ] Dead Transitions using invariants and state equation in 497 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 876/903 places, 1364/1402 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1663 ms. Remains : 876/903 places, 1364/1402 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 435 ms :[true, (NOT p0), false, false, p0, (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-5B-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 5}], [{ cond=p0, acceptance={} source=3 dest: 1}, { cond=(NOT p0), acceptance={} source=3 dest: 2}], [{ cond=p0, acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 5}, { cond=(AND p1 p0), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 0}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=3, aps=[p0:(OR (EQ s393 0) (EQ s683 1)), p1:(NEQ s618 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 680 ms.
Product exploration explored 100000 steps with 50000 reset in 618 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 19 ms. Reduced automaton from 7 states, 15 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-5B-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-5B-LTLCardinality-01 finished in 3491 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 903/903 places, 1402/1402 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 74 transitions
Trivial Post-agglo rules discarded 74 transitions
Performed 74 trivial Post agglomeration. Transition count delta: 74
Iterating post reduction 0 with 74 rules applied. Total rules applied 74 place count 902 transition count 1327
Reduce places removed 74 places and 0 transitions.
Iterating post reduction 1 with 74 rules applied. Total rules applied 148 place count 828 transition count 1327
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 148 place count 828 transition count 1291
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 220 place count 792 transition count 1291
Discarding 32 places :
Symmetric choice reduction at 2 with 32 rule applications. Total rules 252 place count 760 transition count 1187
Iterating global reduction 2 with 32 rules applied. Total rules applied 284 place count 760 transition count 1187
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 284 place count 760 transition count 1186
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 286 place count 759 transition count 1186
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 293 place count 752 transition count 1174
Iterating global reduction 2 with 7 rules applied. Total rules applied 300 place count 752 transition count 1174
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 302 place count 750 transition count 1170
Iterating global reduction 2 with 2 rules applied. Total rules applied 304 place count 750 transition count 1170
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 306 place count 748 transition count 1164
Iterating global reduction 2 with 2 rules applied. Total rules applied 308 place count 748 transition count 1164
Performed 190 Post agglomeration using F-continuation condition.Transition count delta: 190
Deduced a syphon composed of 190 places in 1 ms
Reduce places removed 190 places and 0 transitions.
Iterating global reduction 2 with 380 rules applied. Total rules applied 688 place count 558 transition count 974
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 691 place count 558 transition count 971
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 692 place count 557 transition count 969
Iterating global reduction 3 with 1 rules applied. Total rules applied 693 place count 557 transition count 969
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 694 place count 556 transition count 967
Iterating global reduction 3 with 1 rules applied. Total rules applied 695 place count 556 transition count 967
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 696 place count 555 transition count 965
Iterating global reduction 3 with 1 rules applied. Total rules applied 697 place count 555 transition count 965
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 698 place count 554 transition count 962
Iterating global reduction 3 with 1 rules applied. Total rules applied 699 place count 554 transition count 962
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 700 place count 554 transition count 961
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 902 place count 453 transition count 989
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 914 place count 453 transition count 977
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 5 with 72 rules applied. Total rules applied 986 place count 417 transition count 985
Drop transitions removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 5 with 62 rules applied. Total rules applied 1048 place count 417 transition count 923
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 1057 place count 408 transition count 923
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 5 Pre rules applied. Total rules applied 1057 place count 408 transition count 918
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 6 with 10 rules applied. Total rules applied 1067 place count 403 transition count 918
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 6 with 36 rules applied. Total rules applied 1103 place count 385 transition count 900
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 6 with 3 rules applied. Total rules applied 1106 place count 385 transition count 900
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 1107 place count 384 transition count 899
Applied a total of 1107 rules in 269 ms. Remains 384 /903 variables (removed 519) and now considering 899/1402 (removed 503) transitions.
// Phase 1: matrix 899 rows 384 cols
[2024-05-26 02:51:08] [INFO ] Computed 57 invariants in 8 ms
[2024-05-26 02:51:08] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-26 02:51:08] [INFO ] Invariant cache hit.
[2024-05-26 02:51:09] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-26 02:51:09] [INFO ] Implicit Places using invariants and state equation in 456 ms returned []
Implicit Place search using SMT with State Equation took 625 ms to find 0 implicit places.
[2024-05-26 02:51:09] [INFO ] Redundant transitions in 46 ms returned []
[2024-05-26 02:51:09] [INFO ] Invariant cache hit.
[2024-05-26 02:51:09] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 384/903 places, 899/1402 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1230 ms. Remains : 384/903 places, 899/1402 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-5B-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s201 0) (EQ s223 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 261 steps with 0 reset in 3 ms.
FORMULA NoC3x3-PT-5B-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLCardinality-02 finished in 1289 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1)||X(((G(p1)||p2) U p3))))'
Support contains 5 out of 903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 903/903 places, 1402/1402 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 889 transition count 1387
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 889 transition count 1387
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 36 place count 881 transition count 1376
Iterating global reduction 0 with 8 rules applied. Total rules applied 44 place count 881 transition count 1376
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 879 transition count 1373
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 879 transition count 1373
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 877 transition count 1370
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 877 transition count 1370
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 875 transition count 1365
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 875 transition count 1365
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 874 transition count 1362
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 874 transition count 1362
Applied a total of 58 rules in 100 ms. Remains 874 /903 variables (removed 29) and now considering 1362/1402 (removed 40) transitions.
// Phase 1: matrix 1362 rows 874 cols
[2024-05-26 02:51:09] [INFO ] Computed 66 invariants in 6 ms
[2024-05-26 02:51:10] [INFO ] Implicit Places using invariants in 260 ms returned []
[2024-05-26 02:51:10] [INFO ] Invariant cache hit.
[2024-05-26 02:51:10] [INFO ] Implicit Places using invariants and state equation in 797 ms returned []
Implicit Place search using SMT with State Equation took 1059 ms to find 0 implicit places.
[2024-05-26 02:51:10] [INFO ] Invariant cache hit.
[2024-05-26 02:51:11] [INFO ] Dead Transitions using invariants and state equation in 479 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 874/903 places, 1362/1402 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1640 ms. Remains : 874/903 places, 1362/1402 transitions.
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-5B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND p1 (NOT p3)) (AND (NOT p3) p2)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 3}, { cond=(AND p1 (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) (NOT p3) p2), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) p0 (NOT p3) p2), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p1) p0 (NOT p3) (NOT p2)), acceptance={0} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s844 1), p0:(EQ s704 1), p3:(AND (EQ s452 1) (OR (EQ s718 0) (EQ s626 1))), p2:(OR (EQ s718 0) (EQ s626 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 449 steps with 0 reset in 9 ms.
FORMULA NoC3x3-PT-5B-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLCardinality-05 finished in 1931 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 903/903 places, 1402/1402 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 73 transitions
Trivial Post-agglo rules discarded 73 transitions
Performed 73 trivial Post agglomeration. Transition count delta: 73
Iterating post reduction 0 with 73 rules applied. Total rules applied 73 place count 902 transition count 1328
Reduce places removed 73 places and 0 transitions.
Iterating post reduction 1 with 73 rules applied. Total rules applied 146 place count 829 transition count 1328
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 36 Pre rules applied. Total rules applied 146 place count 829 transition count 1292
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 218 place count 793 transition count 1292
Discarding 33 places :
Symmetric choice reduction at 2 with 33 rule applications. Total rules 251 place count 760 transition count 1187
Iterating global reduction 2 with 33 rules applied. Total rules applied 284 place count 760 transition count 1187
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 284 place count 760 transition count 1186
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 286 place count 759 transition count 1186
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 294 place count 751 transition count 1173
Iterating global reduction 2 with 8 rules applied. Total rules applied 302 place count 751 transition count 1173
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 304 place count 749 transition count 1169
Iterating global reduction 2 with 2 rules applied. Total rules applied 306 place count 749 transition count 1169
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 308 place count 747 transition count 1163
Iterating global reduction 2 with 2 rules applied. Total rules applied 310 place count 747 transition count 1163
Performed 191 Post agglomeration using F-continuation condition.Transition count delta: 191
Deduced a syphon composed of 191 places in 0 ms
Reduce places removed 191 places and 0 transitions.
Iterating global reduction 2 with 382 rules applied. Total rules applied 692 place count 556 transition count 972
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 695 place count 556 transition count 969
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 897 place count 455 transition count 997
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 911 place count 455 transition count 983
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 985 place count 418 transition count 991
Drop transitions removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 4 with 62 rules applied. Total rules applied 1047 place count 418 transition count 929
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1056 place count 409 transition count 929
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 1056 place count 409 transition count 924
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 1066 place count 404 transition count 924
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 5 with 38 rules applied. Total rules applied 1104 place count 385 transition count 905
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1105 place count 384 transition count 904
Applied a total of 1105 rules in 189 ms. Remains 384 /903 variables (removed 519) and now considering 904/1402 (removed 498) transitions.
// Phase 1: matrix 904 rows 384 cols
[2024-05-26 02:51:11] [INFO ] Computed 57 invariants in 14 ms
[2024-05-26 02:51:11] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-26 02:51:11] [INFO ] Invariant cache hit.
[2024-05-26 02:51:12] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-26 02:51:12] [INFO ] Implicit Places using invariants and state equation in 466 ms returned []
Implicit Place search using SMT with State Equation took 663 ms to find 0 implicit places.
[2024-05-26 02:51:12] [INFO ] Redundant transitions in 16 ms returned []
[2024-05-26 02:51:12] [INFO ] Invariant cache hit.
[2024-05-26 02:51:12] [INFO ] Dead Transitions using invariants and state equation in 303 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 384/903 places, 904/1402 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1179 ms. Remains : 384/903 places, 904/1402 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-5B-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s345 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 483 reset in 446 ms.
Product exploration explored 100000 steps with 489 reset in 493 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Finished random walk after 3670 steps, including 20 resets, run visited all 1 properties in 26 ms. (steps per millisecond=141 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 1 out of 384 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 384/384 places, 904/904 transitions.
Applied a total of 0 rules in 13 ms. Remains 384 /384 variables (removed 0) and now considering 904/904 (removed 0) transitions.
[2024-05-26 02:51:14] [INFO ] Invariant cache hit.
[2024-05-26 02:51:14] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-26 02:51:14] [INFO ] Invariant cache hit.
[2024-05-26 02:51:14] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-26 02:51:14] [INFO ] Implicit Places using invariants and state equation in 406 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
[2024-05-26 02:51:14] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-26 02:51:14] [INFO ] Invariant cache hit.
[2024-05-26 02:51:14] [INFO ] Dead Transitions using invariants and state equation in 268 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 872 ms. Remains : 384/384 places, 904/904 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Finished random walk after 8934 steps, including 45 resets, run visited all 1 properties in 49 ms. (steps per millisecond=182 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 107 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 496 reset in 391 ms.
Stack based approach found an accepted trace after 35756 steps with 167 reset with depth 267 and stack size 267 in 154 ms.
FORMULA NoC3x3-PT-5B-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-5B-LTLCardinality-07 finished in 4354 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 1 out of 903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 903/903 places, 1402/1402 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 887 transition count 1384
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 887 transition count 1384
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 41 place count 878 transition count 1371
Iterating global reduction 0 with 9 rules applied. Total rules applied 50 place count 878 transition count 1371
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 53 place count 875 transition count 1366
Iterating global reduction 0 with 3 rules applied. Total rules applied 56 place count 875 transition count 1366
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 59 place count 872 transition count 1360
Iterating global reduction 0 with 3 rules applied. Total rules applied 62 place count 872 transition count 1360
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 870 transition count 1355
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 870 transition count 1355
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 869 transition count 1352
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 869 transition count 1352
Applied a total of 68 rules in 96 ms. Remains 869 /903 variables (removed 34) and now considering 1352/1402 (removed 50) transitions.
// Phase 1: matrix 1352 rows 869 cols
[2024-05-26 02:51:16] [INFO ] Computed 66 invariants in 11 ms
[2024-05-26 02:51:16] [INFO ] Implicit Places using invariants in 236 ms returned []
[2024-05-26 02:51:16] [INFO ] Invariant cache hit.
[2024-05-26 02:51:16] [INFO ] Implicit Places using invariants and state equation in 714 ms returned []
Implicit Place search using SMT with State Equation took 952 ms to find 0 implicit places.
[2024-05-26 02:51:16] [INFO ] Invariant cache hit.
[2024-05-26 02:51:17] [INFO ] Dead Transitions using invariants and state equation in 488 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 869/903 places, 1352/1402 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1538 ms. Remains : 869/903 places, 1352/1402 transitions.
Stuttering acceptance computed with spot in 158 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-5B-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(NEQ s819 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, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 45 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-5B-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-5B-LTLCardinality-09 finished in 1724 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||(X(F(p1))&&(F(p1) U p2))))'
Support contains 4 out of 903 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 903/903 places, 1402/1402 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 889 transition count 1386
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 889 transition count 1386
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 37 place count 880 transition count 1374
Iterating global reduction 0 with 9 rules applied. Total rules applied 46 place count 880 transition count 1374
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 877 transition count 1369
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 877 transition count 1369
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 874 transition count 1363
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 874 transition count 1363
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 872 transition count 1358
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 872 transition count 1358
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 871 transition count 1355
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 871 transition count 1355
Applied a total of 64 rules in 108 ms. Remains 871 /903 variables (removed 32) and now considering 1355/1402 (removed 47) transitions.
// Phase 1: matrix 1355 rows 871 cols
[2024-05-26 02:51:17] [INFO ] Computed 66 invariants in 16 ms
[2024-05-26 02:51:18] [INFO ] Implicit Places using invariants in 274 ms returned []
[2024-05-26 02:51:18] [INFO ] Invariant cache hit.
[2024-05-26 02:51:18] [INFO ] Implicit Places using invariants and state equation in 757 ms returned []
Implicit Place search using SMT with State Equation took 1038 ms to find 0 implicit places.
[2024-05-26 02:51:18] [INFO ] Invariant cache hit.
[2024-05-26 02:51:19] [INFO ] Dead Transitions using invariants and state equation in 484 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 871/903 places, 1355/1402 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1633 ms. Remains : 871/903 places, 1355/1402 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : NoC3x3-PT-5B-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=(NOT p2), acceptance={} source=4 dest: 4}]], initial=0, aps=[p2:(OR (EQ s801 0) (EQ s434 1)), p1:(OR (EQ s700 0) (EQ s229 1)), p0:(AND (EQ s434 0) (EQ s801 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, 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 589 ms.
Product exploration explored 100000 steps with 50000 reset in 570 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p2 p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X p1)), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 11 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-5B-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-5B-LTLCardinality-11 finished in 3026 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p1 U p2)||p0))))'
Support contains 6 out of 903 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 903/903 places, 1402/1402 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 71 place count 902 transition count 1330
Reduce places removed 71 places and 0 transitions.
Iterating post reduction 1 with 71 rules applied. Total rules applied 142 place count 831 transition count 1330
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 142 place count 831 transition count 1295
Deduced a syphon composed of 35 places in 2 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 212 place count 796 transition count 1295
Discarding 31 places :
Symmetric choice reduction at 2 with 31 rule applications. Total rules 243 place count 765 transition count 1197
Iterating global reduction 2 with 31 rules applied. Total rules applied 274 place count 765 transition count 1197
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 274 place count 765 transition count 1196
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 276 place count 764 transition count 1196
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 284 place count 756 transition count 1183
Iterating global reduction 2 with 8 rules applied. Total rules applied 292 place count 756 transition count 1183
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 294 place count 754 transition count 1179
Iterating global reduction 2 with 2 rules applied. Total rules applied 296 place count 754 transition count 1179
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 298 place count 752 transition count 1173
Iterating global reduction 2 with 2 rules applied. Total rules applied 300 place count 752 transition count 1173
Performed 190 Post agglomeration using F-continuation condition.Transition count delta: 190
Deduced a syphon composed of 190 places in 0 ms
Reduce places removed 190 places and 0 transitions.
Iterating global reduction 2 with 380 rules applied. Total rules applied 680 place count 562 transition count 983
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 683 place count 562 transition count 980
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 684 place count 561 transition count 978
Iterating global reduction 3 with 1 rules applied. Total rules applied 685 place count 561 transition count 978
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 686 place count 560 transition count 976
Iterating global reduction 3 with 1 rules applied. Total rules applied 687 place count 560 transition count 976
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 688 place count 559 transition count 974
Iterating global reduction 3 with 1 rules applied. Total rules applied 689 place count 559 transition count 974
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 690 place count 558 transition count 971
Iterating global reduction 3 with 1 rules applied. Total rules applied 691 place count 558 transition count 971
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -31
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 893 place count 457 transition count 1002
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 3 with 14 rules applied. Total rules applied 907 place count 457 transition count 988
Performed 35 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 977 place count 422 transition count 996
Drop transitions removed 59 transitions
Redundant transition composition rules discarded 59 transitions
Iterating global reduction 4 with 59 rules applied. Total rules applied 1036 place count 422 transition count 937
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 1045 place count 413 transition count 937
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 1045 place count 413 transition count 932
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 1055 place count 408 transition count 932
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 5 with 34 rules applied. Total rules applied 1089 place count 391 transition count 915
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1093 place count 389 transition count 918
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 1095 place count 389 transition count 918
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1096 place count 388 transition count 917
Applied a total of 1096 rules in 211 ms. Remains 388 /903 variables (removed 515) and now considering 917/1402 (removed 485) transitions.
// Phase 1: matrix 917 rows 388 cols
[2024-05-26 02:51:20] [INFO ] Computed 57 invariants in 3 ms
[2024-05-26 02:51:21] [INFO ] Implicit Places using invariants in 303 ms returned []
[2024-05-26 02:51:21] [INFO ] Invariant cache hit.
[2024-05-26 02:51:21] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-26 02:51:21] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 758 ms to find 0 implicit places.
[2024-05-26 02:51:21] [INFO ] Redundant transitions in 17 ms returned []
[2024-05-26 02:51:21] [INFO ] Invariant cache hit.
[2024-05-26 02:51:21] [INFO ] Dead Transitions using invariants and state equation in 273 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 388/903 places, 917/1402 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1269 ms. Remains : 388/903 places, 917/1402 transitions.
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-5B-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(OR p0 p2 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=0 dest: 1}], [{ cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s110 0) (EQ s53 1)), p2:(OR (EQ s357 0) (EQ s153 1)), p1:(OR (EQ s342 0) (EQ s155 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 480 reset in 446 ms.
Product exploration explored 100000 steps with 487 reset in 431 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (OR p0 p2 p1)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (OR p0 p2 p1))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 100 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 47 resets, run finished after 184 ms. (steps per millisecond=54 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-26 02:51:23] [INFO ] Invariant cache hit.
[2024-05-26 02:51:23] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-26 02:51:23] [INFO ] [Nat]Absence check using 57 positive place invariants in 8 ms returned sat
[2024-05-26 02:51:23] [INFO ] After 248ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-26 02:51:23] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-26 02:51:23] [INFO ] After 70ms SMT Verify possible using 32 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-26 02:51:23] [INFO ] After 160ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 82 ms.
[2024-05-26 02:51:24] [INFO ] After 586ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 6 out of 388 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 388/388 places, 917/917 transitions.
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 388 transition count 916
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 387 transition count 916
Applied a total of 2 rules in 18 ms. Remains 387 /388 variables (removed 1) and now considering 916/917 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 387/388 places, 916/917 transitions.
Incomplete random walk after 10000 steps, including 48 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 331197 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :{}
Probabilistic random walk after 331197 steps, saw 85771 distinct states, run finished after 3002 ms. (steps per millisecond=110 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 916 rows 387 cols
[2024-05-26 02:51:27] [INFO ] Computed 57 invariants in 5 ms
[2024-05-26 02:51:27] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-26 02:51:27] [INFO ] [Nat]Absence check using 57 positive place invariants in 8 ms returned sat
[2024-05-26 02:51:27] [INFO ] After 292ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-26 02:51:27] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-26 02:51:27] [INFO ] After 92ms SMT Verify possible using 32 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-26 02:51:27] [INFO ] After 211ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 87 ms.
[2024-05-26 02:51:28] [INFO ] After 682ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 137 steps, including 2 resets, run visited all 2 properties in 2 ms. (steps per millisecond=68 )
Parikh walk visited 2 properties in 4 ms.
Knowledge obtained : [(AND p0 p2 p1), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (OR p0 p2 p1)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND p0 (NOT p2) p1))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (OR p0 p2 p1))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p2) p1))))]
False Knowledge obtained : [(F (AND p0 p1 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (OR p0 p1 p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 11 factoid took 235 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 388 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 388/388 places, 917/917 transitions.
Applied a total of 0 rules in 14 ms. Remains 388 /388 variables (removed 0) and now considering 917/917 (removed 0) transitions.
// Phase 1: matrix 917 rows 388 cols
[2024-05-26 02:51:28] [INFO ] Computed 57 invariants in 4 ms
[2024-05-26 02:51:28] [INFO ] Implicit Places using invariants in 168 ms returned []
[2024-05-26 02:51:28] [INFO ] Invariant cache hit.
[2024-05-26 02:51:28] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-26 02:51:29] [INFO ] Implicit Places using invariants and state equation in 453 ms returned []
Implicit Place search using SMT with State Equation took 624 ms to find 0 implicit places.
[2024-05-26 02:51:29] [INFO ] Redundant transitions in 14 ms returned []
[2024-05-26 02:51:29] [INFO ] Invariant cache hit.
[2024-05-26 02:51:29] [INFO ] Dead Transitions using invariants and state equation in 298 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 976 ms. Remains : 388/388 places, 917/917 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (OR p0 p1 p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (OR p0 p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 86 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 49 resets, run finished after 181 ms. (steps per millisecond=55 ) properties (out of 5) seen :2
Finished Best-First random walk after 8578 steps, including 2 resets, run visited all 3 properties in 18 ms. (steps per millisecond=476 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (OR p0 p1 p2)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (OR p0 p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (AND p0 p1 (NOT p2))), (F (AND p0 (NOT p1) (NOT p2))), (F (NOT (OR p0 p1 p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 11 factoid took 212 ms. Reduced automaton from 2 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 481 reset in 406 ms.
Product exploration explored 100000 steps with 476 reset in 431 ms.
Built C files in :
/tmp/ltsmin16316060147575091075
[2024-05-26 02:51:31] [INFO ] Computing symmetric may disable matrix : 917 transitions.
[2024-05-26 02:51:31] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 02:51:31] [INFO ] Computing symmetric may enable matrix : 917 transitions.
[2024-05-26 02:51:31] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 02:51:31] [INFO ] Computing Do-Not-Accords matrix : 917 transitions.
[2024-05-26 02:51:31] [INFO ] Computation of Completed DNA matrix. took 31 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 02:51:31] [INFO ] Built C files in 173ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16316060147575091075
Running compilation step : cd /tmp/ltsmin16316060147575091075;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2523 ms.
Running link step : cd /tmp/ltsmin16316060147575091075;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 59 ms.
Running LTSmin : cd /tmp/ltsmin16316060147575091075;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2518272325412964976.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 388 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 388/388 places, 917/917 transitions.
Applied a total of 0 rules in 14 ms. Remains 388 /388 variables (removed 0) and now considering 917/917 (removed 0) transitions.
[2024-05-26 02:51:46] [INFO ] Invariant cache hit.
[2024-05-26 02:51:46] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-05-26 02:51:46] [INFO ] Invariant cache hit.
[2024-05-26 02:51:46] [INFO ] State equation strengthened by 32 read => feed constraints.
[2024-05-26 02:51:46] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 611 ms to find 0 implicit places.
[2024-05-26 02:51:46] [INFO ] Redundant transitions in 12 ms returned []
[2024-05-26 02:51:46] [INFO ] Invariant cache hit.
[2024-05-26 02:51:47] [INFO ] Dead Transitions using invariants and state equation in 269 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 911 ms. Remains : 388/388 places, 917/917 transitions.
Built C files in :
/tmp/ltsmin3425941775507988111
[2024-05-26 02:51:47] [INFO ] Computing symmetric may disable matrix : 917 transitions.
[2024-05-26 02:51:47] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 02:51:47] [INFO ] Computing symmetric may enable matrix : 917 transitions.
[2024-05-26 02:51:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 02:51:47] [INFO ] Computing Do-Not-Accords matrix : 917 transitions.
[2024-05-26 02:51:47] [INFO ] Computation of Completed DNA matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 02:51:47] [INFO ] Built C files in 171ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3425941775507988111
Running compilation step : cd /tmp/ltsmin3425941775507988111;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2340 ms.
Running link step : cd /tmp/ltsmin3425941775507988111;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin3425941775507988111;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15319109933261266755.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-26 02:52:02] [INFO ] Flatten gal took : 41 ms
[2024-05-26 02:52:02] [INFO ] Flatten gal took : 39 ms
[2024-05-26 02:52:02] [INFO ] Time to serialize gal into /tmp/LTL16673666638535415083.gal : 10 ms
[2024-05-26 02:52:03] [INFO ] Time to serialize properties into /tmp/LTL3485727013704717122.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16673666638535415083.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10198278343404168329.hoa' '-atoms' '/tmp/LTL3485727013704717122.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL3485727013704717122.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10198278343404168329.hoa
Detected timeout of ITS tools.
[2024-05-26 02:52:18] [INFO ] Flatten gal took : 42 ms
[2024-05-26 02:52:18] [INFO ] Flatten gal took : 33 ms
[2024-05-26 02:52:18] [INFO ] Time to serialize gal into /tmp/LTL15433225266066542483.gal : 6 ms
[2024-05-26 02:52:18] [INFO ] Time to serialize properties into /tmp/LTL7885125446748453315.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15433225266066542483.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7885125446748453315.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(("((p463==0)||(p275==1))")||(("((p1403==0)||(p627==1))")U("((p1478==0)||(p623==1))"))))))
Formula 0 simplified : GF(!"((p463==0)||(p275==1))" & (!"((p1403==0)||(p627==1))" R !"((p1478==0)||(p623==1))"))
Detected timeout of ITS tools.
[2024-05-26 02:52:33] [INFO ] Flatten gal took : 31 ms
[2024-05-26 02:52:33] [INFO ] Applying decomposition
[2024-05-26 02:52:33] [INFO ] Flatten gal took : 39 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph3514965703096437852.txt' '-o' '/tmp/graph3514965703096437852.bin' '-w' '/tmp/graph3514965703096437852.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph3514965703096437852.bin' '-l' '-1' '-v' '-w' '/tmp/graph3514965703096437852.weights' '-q' '0' '-e' '0.001'
[2024-05-26 02:52:33] [INFO ] Decomposing Gal with order
[2024-05-26 02:52:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 02:52:33] [INFO ] Removed a total of 582 redundant transitions.
[2024-05-26 02:52:33] [INFO ] Flatten gal took : 124 ms
[2024-05-26 02:52:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 692 labels/synchronizations in 43 ms.
[2024-05-26 02:52:33] [INFO ] Time to serialize gal into /tmp/LTL3896158788325922420.gal : 9 ms
[2024-05-26 02:52:33] [INFO ] Time to serialize properties into /tmp/LTL8124805509180920573.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3896158788325922420.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8124805509180920573.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G(("((i3.u17.p463==0)||(i1.u6.p275==1))")||(("((i8.u35.p1403==0)||(i4.u26.p627==1))")U("((i8.u41.p1478==0)||(i5.u19.p623==1))")))...158
Formula 0 simplified : GF(!"((i3.u17.p463==0)||(i1.u6.p275==1))" & (!"((i8.u35.p1403==0)||(i4.u26.p627==1))" R !"((i8.u41.p1478==0)||(i5.u19.p623==1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15639461403018869439
[2024-05-26 02:52:48] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15639461403018869439
Running compilation step : cd /tmp/ltsmin15639461403018869439;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1399 ms.
Running link step : cd /tmp/ltsmin15639461403018869439;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin15639461403018869439;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((((LTLAPp1==true) U (LTLAPp2==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property NoC3x3-PT-5B-LTLCardinality-12 finished in 103384 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((p1 U p2)||p0))))'
[2024-05-26 02:53:04] [INFO ] Flatten gal took : 36 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7384384569868000228
[2024-05-26 02:53:04] [INFO ] Computing symmetric may disable matrix : 1402 transitions.
[2024-05-26 02:53:04] [INFO ] Applying decomposition
[2024-05-26 02:53:04] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 02:53:04] [INFO ] Computing symmetric may enable matrix : 1402 transitions.
[2024-05-26 02:53:04] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-26 02:53:04] [INFO ] Flatten gal took : 47 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8314108013198855935.txt' '-o' '/tmp/graph8314108013198855935.bin' '-w' '/tmp/graph8314108013198855935.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8314108013198855935.bin' '-l' '-1' '-v' '-w' '/tmp/graph8314108013198855935.weights' '-q' '0' '-e' '0.001'
[2024-05-26 02:53:04] [INFO ] Decomposing Gal with order
[2024-05-26 02:53:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 02:53:04] [INFO ] Removed a total of 1252 redundant transitions.
[2024-05-26 02:53:04] [INFO ] Flatten gal took : 104 ms
[2024-05-26 02:53:04] [INFO ] Computing Do-Not-Accords matrix : 1402 transitions.
[2024-05-26 02:53:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 143 labels/synchronizations in 42 ms.
[2024-05-26 02:53:04] [INFO ] Time to serialize gal into /tmp/LTLCardinality6814886295802522565.gal : 18 ms
[2024-05-26 02:53:04] [INFO ] Time to serialize properties into /tmp/LTLCardinality8107222645383679409.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality6814886295802522565.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8107222645383679409.ltl' '-c' '-stutter-deadlock'
[2024-05-26 02:53:04] [INFO ] Computation of Completed DNA matrix. took 26 ms. Total solver calls (SAT/UNSAT): 0(0/0)

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
[2024-05-26 02:53:04] [INFO ] Built C files in 458ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7384384569868000228
Running compilation step : cd /tmp/ltsmin7384384569868000228;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Checking formula 0 : !((F(G(("((i4.u110.p463==0)||(i1.u70.p275==1))")||(("((i11.i2.i4.u293.p1403==0)||(i8.i0.i0.u145.p627==1))")U("((i11.i2.i5.u301.p1478==...184
Formula 0 simplified : GF(!"((i4.u110.p463==0)||(i1.u70.p275==1))" & (!"((i11.i2.i4.u293.p1403==0)||(i8.i0.i0.u145.p627==1))" R !"((i11.i2.i5.u301.p1478==0...179
Compilation finished in 4852 ms.
Running link step : cd /tmp/ltsmin7384384569868000228;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 72 ms.
Running LTSmin : cd /tmp/ltsmin7384384569868000228;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((((LTLAPp1==true) U (LTLAPp2==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-26 03:13:47] [INFO ] Applying decomposition
[2024-05-26 03:13:48] [INFO ] Flatten gal took : 144 ms
[2024-05-26 03:13:48] [INFO ] Decomposing Gal with order
[2024-05-26 03:13:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-26 03:13:49] [INFO ] Removed a total of 778 redundant transitions.
[2024-05-26 03:13:50] [INFO ] Flatten gal took : 278 ms
[2024-05-26 03:13:51] [INFO ] Fuse similar labels procedure discarded/fused a total of 1576 labels/synchronizations in 1163 ms.
[2024-05-26 03:13:51] [INFO ] Time to serialize gal into /tmp/LTLCardinality17403133927431397373.gal : 63 ms
[2024-05-26 03:13:51] [INFO ] Time to serialize properties into /tmp/LTLCardinality14619797891849105862.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality17403133927431397373.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14619797891849105862.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((F(G(("((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0....698
Formula 0 simplified : GF(!"((i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0...693
Detected timeout of ITS tools.
[2024-05-26 03:34:35] [INFO ] Flatten gal took : 747 ms
[2024-05-26 03:34:37] [INFO ] Input system was already deterministic with 1402 transitions.
[2024-05-26 03:34:37] [INFO ] Transformed 903 places.
[2024-05-26 03:34:37] [INFO ] Transformed 1402 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2024-05-26 03:34:37] [INFO ] Time to serialize gal into /tmp/LTLCardinality10224593399698049782.gal : 19 ms
[2024-05-26 03:34:37] [INFO ] Time to serialize properties into /tmp/LTLCardinality8989584169281617345.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality10224593399698049782.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality8989584169281617345.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G(("((p463==0)||(p275==1))")||(("((p1403==0)||(p627==1))")U("((p1478==0)||(p623==1))"))))))
Formula 0 simplified : GF(!"((p463==0)||(p275==1))" & (!"((p1403==0)||(p627==1))" R !"((p1478==0)||(p623==1))"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 4692100 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16143232 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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