Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.5K Feb 26 10:13 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Feb 26 10:13 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 10:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 10:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Feb 25 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Feb 26 10:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 10:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Feb 26 10:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 26 10:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:28 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:28 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 608K Mar 5 18:23 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-4B-LTLFireability-00
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-01
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-02
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-03
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-04
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-05
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-06
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-07
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-08
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-09
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-10
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-11
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-12
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-13
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-14
FORMULA_NAME NoC3x3-PT-4B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678848528958

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-4B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-15 02:48:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-15 02:48:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 02:48:53] [INFO ] Load time of PNML (sax parser for PT used): 382 ms
[2023-03-15 02:48:53] [INFO ] Transformed 2328 places.
[2023-03-15 02:48:53] [INFO ] Transformed 2701 transitions.
[2023-03-15 02:48:53] [INFO ] Found NUPN structural information;
[2023-03-15 02:48:53] [INFO ] Parsed PT model containing 2328 places and 2701 transitions and 6091 arcs in 594 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA NoC3x3-PT-4B-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-4B-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-4B-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 2328 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2328/2328 places, 2701/2701 transitions.
Discarding 607 places :
Symmetric choice reduction at 0 with 607 rule applications. Total rules 607 place count 1721 transition count 2094
Iterating global reduction 0 with 607 rules applied. Total rules applied 1214 place count 1721 transition count 2094
Discarding 307 places :
Symmetric choice reduction at 0 with 307 rule applications. Total rules 1521 place count 1414 transition count 1787
Iterating global reduction 0 with 307 rules applied. Total rules applied 1828 place count 1414 transition count 1787
Ensure Unique test removed 107 transitions
Reduce isomorphic transitions removed 107 transitions.
Iterating post reduction 0 with 107 rules applied. Total rules applied 1935 place count 1414 transition count 1680
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 1967 place count 1382 transition count 1648
Iterating global reduction 1 with 32 rules applied. Total rules applied 1999 place count 1382 transition count 1648
Applied a total of 1999 rules in 1504 ms. Remains 1382 /2328 variables (removed 946) and now considering 1648/2701 (removed 1053) transitions.
// Phase 1: matrix 1648 rows 1382 cols
[2023-03-15 02:48:55] [INFO ] Computed 66 place invariants in 38 ms
[2023-03-15 02:48:56] [INFO ] Implicit Places using invariants in 1249 ms returned []
[2023-03-15 02:48:56] [INFO ] Invariant cache hit.
[2023-03-15 02:48:59] [INFO ] Implicit Places using invariants and state equation in 2399 ms returned []
Implicit Place search using SMT with State Equation took 3689 ms to find 0 implicit places.
[2023-03-15 02:48:59] [INFO ] Invariant cache hit.
[2023-03-15 02:49:01] [INFO ] Dead Transitions using invariants and state equation in 2265 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1382/2328 places, 1648/2701 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7461 ms. Remains : 1382/2328 places, 1648/2701 transitions.
Support contains 31 out of 1382 places after structural reductions.
[2023-03-15 02:49:02] [INFO ] Flatten gal took : 283 ms
[2023-03-15 02:49:02] [INFO ] Flatten gal took : 154 ms
[2023-03-15 02:49:02] [INFO ] Input system was already deterministic with 1648 transitions.
Support contains 30 out of 1382 places (down from 31) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 959 ms. (steps per millisecond=10 ) properties (out of 25) seen :12
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 210 ms. (steps per millisecond=47 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 163 ms. (steps per millisecond=61 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 130 ms. (steps per millisecond=76 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-15 02:49:04] [INFO ] Invariant cache hit.
[2023-03-15 02:49:06] [INFO ] [Real]Absence check using 66 positive place invariants in 99 ms returned sat
[2023-03-15 02:49:06] [INFO ] After 1268ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:10
[2023-03-15 02:49:07] [INFO ] [Nat]Absence check using 66 positive place invariants in 59 ms returned sat
[2023-03-15 02:49:09] [INFO ] After 2019ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :10
[2023-03-15 02:49:11] [INFO ] After 3995ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :10
Attempting to minimize the solution found.
Minimization took 1016 ms.
[2023-03-15 02:49:12] [INFO ] After 6204ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :10
Fused 11 Parikh solutions to 9 different solutions.
Parikh walk visited 9 properties in 331 ms.
Support contains 2 out of 1382 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1382/1382 places, 1648/1648 transitions.
Graph (trivial) has 1295 edges and 1382 vertex of which 865 / 1382 are part of one of the 33 SCC in 13 ms
Free SCC test removed 832 places
Drop transitions removed 1010 transitions
Reduce isomorphic transitions removed 1010 transitions.
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 36 Pre rules applied. Total rules applied 1 place count 550 transition count 602
Deduced a syphon composed of 36 places in 3 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 0 with 72 rules applied. Total rules applied 73 place count 514 transition count 602
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 102 place count 485 transition count 541
Iterating global reduction 0 with 29 rules applied. Total rules applied 131 place count 485 transition count 541
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 131 place count 485 transition count 540
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 133 place count 484 transition count 540
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 137 place count 480 transition count 534
Iterating global reduction 0 with 4 rules applied. Total rules applied 141 place count 480 transition count 534
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Deduced a syphon composed of 99 places in 1 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 0 with 198 rules applied. Total rules applied 339 place count 381 transition count 435
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -14
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 341 place count 380 transition count 449
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 343 place count 380 transition count 447
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 349 place count 380 transition count 441
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 351 place count 379 transition count 452
Free-agglomeration rule applied 200 times.
Iterating global reduction 1 with 200 rules applied. Total rules applied 551 place count 379 transition count 252
Reduce places removed 200 places and 0 transitions.
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Graph (complete) has 488 edges and 179 vertex of which 5 are kept as prefixes of interest. Removing 174 places using SCC suffix rule.2 ms
Discarding 174 places :
Also discarding 194 output transitions
Drop transitions removed 194 transitions
Iterating post reduction 1 with 237 rules applied. Total rules applied 788 place count 5 transition count 22
Drop transitions removed 14 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 805 place count 5 transition count 5
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 806 place count 4 transition count 4
Applied a total of 806 rules in 403 ms. Remains 4 /1382 variables (removed 1378) and now considering 4/1648 (removed 1644) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 403 ms. Remains : 4/1382 places, 4/1648 transitions.
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 1382 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1382/1382 places, 1648/1648 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1368 transition count 1634
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1368 transition count 1634
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 33 place count 1368 transition count 1629
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 1366 transition count 1627
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 1366 transition count 1627
Applied a total of 37 rules in 305 ms. Remains 1366 /1382 variables (removed 16) and now considering 1627/1648 (removed 21) transitions.
// Phase 1: matrix 1627 rows 1366 cols
[2023-03-15 02:49:14] [INFO ] Computed 66 place invariants in 19 ms
[2023-03-15 02:49:14] [INFO ] Implicit Places using invariants in 732 ms returned []
[2023-03-15 02:49:14] [INFO ] Invariant cache hit.
[2023-03-15 02:49:16] [INFO ] Implicit Places using invariants and state equation in 2022 ms returned []
Implicit Place search using SMT with State Equation took 2760 ms to find 0 implicit places.
[2023-03-15 02:49:16] [INFO ] Invariant cache hit.
[2023-03-15 02:49:18] [INFO ] Dead Transitions using invariants and state equation in 2194 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1366/1382 places, 1627/1648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5263 ms. Remains : 1366/1382 places, 1627/1648 transitions.
Stuttering acceptance computed with spot in 317 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-4B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s1315 1) (EQ s1320 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 1161 steps with 2 reset in 32 ms.
FORMULA NoC3x3-PT-4B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4B-LTLFireability-00 finished in 5727 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 1382 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1382/1382 places, 1648/1648 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1366 transition count 1632
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1366 transition count 1632
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 38 place count 1366 transition count 1626
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 1364 transition count 1624
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 1364 transition count 1624
Applied a total of 42 rules in 324 ms. Remains 1364 /1382 variables (removed 18) and now considering 1624/1648 (removed 24) transitions.
// Phase 1: matrix 1624 rows 1364 cols
[2023-03-15 02:49:19] [INFO ] Computed 66 place invariants in 15 ms
[2023-03-15 02:49:20] [INFO ] Implicit Places using invariants in 893 ms returned []
[2023-03-15 02:49:20] [INFO ] Invariant cache hit.
[2023-03-15 02:49:22] [INFO ] Implicit Places using invariants and state equation in 2068 ms returned []
Implicit Place search using SMT with State Equation took 2970 ms to find 0 implicit places.
[2023-03-15 02:49:22] [INFO ] Invariant cache hit.
[2023-03-15 02:49:24] [INFO ] Dead Transitions using invariants and state equation in 1756 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1364/1382 places, 1624/1648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5063 ms. Remains : 1364/1382 places, 1624/1648 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-4B-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (EQ s1115 1) (EQ s1139 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-4B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4B-LTLFireability-01 finished in 5208 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 3 out of 1382 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1382/1382 places, 1648/1648 transitions.
Graph (trivial) has 1292 edges and 1382 vertex of which 849 / 1382 are part of one of the 33 SCC in 5 ms
Free SCC test removed 816 places
Ensure Unique test removed 956 transitions
Reduce isomorphic transitions removed 956 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 565 transition count 685
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 9 rules applied. Total rules applied 16 place count 559 transition count 682
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 19 place count 557 transition count 681
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 22 place count 556 transition count 679
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 23 place count 555 transition count 679
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 37 Pre rules applied. Total rules applied 23 place count 555 transition count 642
Deduced a syphon composed of 37 places in 3 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 5 with 74 rules applied. Total rules applied 97 place count 518 transition count 642
Discarding 29 places :
Symmetric choice reduction at 5 with 29 rule applications. Total rules 126 place count 489 transition count 581
Iterating global reduction 5 with 29 rules applied. Total rules applied 155 place count 489 transition count 581
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 155 place count 489 transition count 580
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 157 place count 488 transition count 580
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 161 place count 484 transition count 574
Iterating global reduction 5 with 4 rules applied. Total rules applied 165 place count 484 transition count 574
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 5 with 202 rules applied. Total rules applied 367 place count 383 transition count 473
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 369 place count 383 transition count 471
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 370 place count 382 transition count 470
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 266 edges and 373 vertex of which 48 / 373 are part of one of the 24 SCC in 0 ms
Free SCC test removed 24 places
Iterating post reduction 6 with 10 rules applied. Total rules applied 380 place count 349 transition count 470
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 7 with 48 rules applied. Total rules applied 428 place count 349 transition count 422
Applied a total of 428 rules in 274 ms. Remains 349 /1382 variables (removed 1033) and now considering 422/1648 (removed 1226) transitions.
[2023-03-15 02:49:24] [INFO ] Flow matrix only has 390 transitions (discarded 32 similar events)
// Phase 1: matrix 390 rows 349 cols
[2023-03-15 02:49:24] [INFO ] Computed 57 place invariants in 4 ms
[2023-03-15 02:49:25] [INFO ] Implicit Places using invariants in 373 ms returned []
[2023-03-15 02:49:25] [INFO ] Flow matrix only has 390 transitions (discarded 32 similar events)
[2023-03-15 02:49:25] [INFO ] Invariant cache hit.
[2023-03-15 02:49:25] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-15 02:49:26] [INFO ] Implicit Places using invariants and state equation in 846 ms returned []
Implicit Place search using SMT with State Equation took 1233 ms to find 0 implicit places.
[2023-03-15 02:49:26] [INFO ] Redundant transitions in 50 ms returned []
[2023-03-15 02:49:26] [INFO ] Flow matrix only has 390 transitions (discarded 32 similar events)
[2023-03-15 02:49:26] [INFO ] Invariant cache hit.
[2023-03-15 02:49:26] [INFO ] Dead Transitions using invariants and state equation in 563 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 349/1382 places, 422/1648 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2139 ms. Remains : 349/1382 places, 422/1648 transitions.
Stuttering acceptance computed with spot in 209 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-4B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s189 1) (EQ s118 1)), p1:(EQ s248 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4B-LTLFireability-02 finished in 2376 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 1382 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1382/1382 places, 1648/1648 transitions.
Graph (trivial) has 1292 edges and 1382 vertex of which 848 / 1382 are part of one of the 33 SCC in 3 ms
Free SCC test removed 815 places
Ensure Unique test removed 957 transitions
Reduce isomorphic transitions removed 957 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 566 transition count 682
Reduce places removed 8 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 11 rules applied. Total rules applied 20 place count 558 transition count 679
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 22 place count 556 transition count 679
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 22 place count 556 transition count 642
Deduced a syphon composed of 37 places in 3 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 96 place count 519 transition count 642
Discarding 28 places :
Symmetric choice reduction at 3 with 28 rule applications. Total rules 124 place count 491 transition count 582
Iterating global reduction 3 with 28 rules applied. Total rules applied 152 place count 491 transition count 582
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 152 place count 491 transition count 581
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 154 place count 490 transition count 581
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 158 place count 486 transition count 575
Iterating global reduction 3 with 4 rules applied. Total rules applied 162 place count 486 transition count 575
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
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 364 place count 385 transition count 474
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 366 place count 385 transition count 472
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 4 with 2 rules applied. Total rules applied 368 place count 384 transition count 475
Applied a total of 368 rules in 200 ms. Remains 384 /1382 variables (removed 998) and now considering 475/1648 (removed 1173) transitions.
[2023-03-15 02:49:27] [INFO ] Flow matrix only has 443 transitions (discarded 32 similar events)
// Phase 1: matrix 443 rows 384 cols
[2023-03-15 02:49:27] [INFO ] Computed 66 place invariants in 5 ms
[2023-03-15 02:49:27] [INFO ] Implicit Places using invariants in 439 ms returned [10, 46, 87, 123, 178, 282, 321, 364]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 446 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 376/1382 places, 475/1648 transitions.
Graph (trivial) has 263 edges and 376 vertex of which 40 / 376 are part of one of the 20 SCC in 1 ms
Free SCC test removed 20 places
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 355 transition count 434
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 5 place count 355 transition count 432
Applied a total of 5 rules in 56 ms. Remains 355 /376 variables (removed 21) and now considering 432/475 (removed 43) transitions.
[2023-03-15 02:49:27] [INFO ] Flow matrix only has 400 transitions (discarded 32 similar events)
// Phase 1: matrix 400 rows 355 cols
[2023-03-15 02:49:27] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-15 02:49:28] [INFO ] Implicit Places using invariants in 384 ms returned []
[2023-03-15 02:49:28] [INFO ] Flow matrix only has 400 transitions (discarded 32 similar events)
[2023-03-15 02:49:28] [INFO ] Invariant cache hit.
[2023-03-15 02:49:28] [INFO ] State equation strengthened by 16 read => feed constraints.
[2023-03-15 02:49:28] [INFO ] Implicit Places using invariants and state equation in 847 ms returned []
Implicit Place search using SMT with State Equation took 1235 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 355/1382 places, 432/1648 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1940 ms. Remains : 355/1382 places, 432/1648 transitions.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-4B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s279 0) (EQ s20 0) (EQ s222 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 223 steps with 2 reset in 12 ms.
FORMULA NoC3x3-PT-4B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4B-LTLFireability-04 finished in 2034 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G(p1))))'
Support contains 2 out of 1382 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1382/1382 places, 1648/1648 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1367 transition count 1633
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1367 transition count 1633
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 36 place count 1367 transition count 1627
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 38 place count 1365 transition count 1625
Iterating global reduction 1 with 2 rules applied. Total rules applied 40 place count 1365 transition count 1625
Applied a total of 40 rules in 318 ms. Remains 1365 /1382 variables (removed 17) and now considering 1625/1648 (removed 23) transitions.
// Phase 1: matrix 1625 rows 1365 cols
[2023-03-15 02:49:29] [INFO ] Computed 66 place invariants in 11 ms
[2023-03-15 02:49:30] [INFO ] Implicit Places using invariants in 909 ms returned []
[2023-03-15 02:49:30] [INFO ] Invariant cache hit.
[2023-03-15 02:49:32] [INFO ] Implicit Places using invariants and state equation in 1997 ms returned []
Implicit Place search using SMT with State Equation took 2915 ms to find 0 implicit places.
[2023-03-15 02:49:32] [INFO ] Invariant cache hit.
[2023-03-15 02:49:34] [INFO ] Dead Transitions using invariants and state equation in 1953 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1365/1382 places, 1625/1648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5188 ms. Remains : 1365/1382 places, 1625/1648 transitions.
Stuttering acceptance computed with spot in 133 ms :[(NOT p1), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-4B-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(EQ s773 1), p0:(EQ s925 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-4B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4B-LTLFireability-05 finished in 5352 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (p1||G(p0)))))'
Support contains 2 out of 1382 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1382/1382 places, 1648/1648 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1368 transition count 1634
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1368 transition count 1634
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 33 place count 1368 transition count 1629
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 1366 transition count 1627
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 1366 transition count 1627
Applied a total of 37 rules in 195 ms. Remains 1366 /1382 variables (removed 16) and now considering 1627/1648 (removed 21) transitions.
// Phase 1: matrix 1627 rows 1366 cols
[2023-03-15 02:49:34] [INFO ] Computed 66 place invariants in 11 ms
[2023-03-15 02:49:35] [INFO ] Implicit Places using invariants in 770 ms returned []
[2023-03-15 02:49:35] [INFO ] Invariant cache hit.
[2023-03-15 02:49:37] [INFO ] Implicit Places using invariants and state equation in 1751 ms returned []
Implicit Place search using SMT with State Equation took 2527 ms to find 0 implicit places.
[2023-03-15 02:49:37] [INFO ] Invariant cache hit.
[2023-03-15 02:49:38] [INFO ] Dead Transitions using invariants and state equation in 1853 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1366/1382 places, 1627/1648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4577 ms. Remains : 1366/1382 places, 1627/1648 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-4B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(NEQ s934 1), p0:(NEQ s914 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1624 ms.
Product exploration explored 100000 steps with 50000 reset in 1358 ms.
Computed a total of 65 stabilizing places and 65 stable transitions
Computed a total of 65 stabilizing places and 65 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p1 p0)
Knowledge based reduction with 6 factoid took 183 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-4B-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-4B-LTLFireability-07 finished in 7890 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0||G(F(p1)))))))'
Support contains 2 out of 1382 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1382/1382 places, 1648/1648 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1368 transition count 1634
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1368 transition count 1634
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 33 place count 1368 transition count 1629
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 35 place count 1366 transition count 1627
Iterating global reduction 1 with 2 rules applied. Total rules applied 37 place count 1366 transition count 1627
Applied a total of 37 rules in 222 ms. Remains 1366 /1382 variables (removed 16) and now considering 1627/1648 (removed 21) transitions.
// Phase 1: matrix 1627 rows 1366 cols
[2023-03-15 02:49:42] [INFO ] Computed 66 place invariants in 7 ms
[2023-03-15 02:49:43] [INFO ] Implicit Places using invariants in 667 ms returned []
[2023-03-15 02:49:43] [INFO ] Invariant cache hit.
[2023-03-15 02:49:44] [INFO ] Implicit Places using invariants and state equation in 1734 ms returned []
Implicit Place search using SMT with State Equation took 2405 ms to find 0 implicit places.
[2023-03-15 02:49:44] [INFO ] Invariant cache hit.
[2023-03-15 02:49:46] [INFO ] Dead Transitions using invariants and state equation in 1565 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1366/1382 places, 1627/1648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4201 ms. Remains : 1366/1382 places, 1627/1648 transitions.
Stuttering acceptance computed with spot in 218 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-4B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s1175 1), p1:(EQ s1223 0)], 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]]
Product exploration explored 100000 steps with 72 reset in 496 ms.
Product exploration explored 100000 steps with 72 reset in 832 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 (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 380 ms. (steps per millisecond=26 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-15 02:49:48] [INFO ] Invariant cache hit.
[2023-03-15 02:49:49] [INFO ] After 373ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 02:49:49] [INFO ] [Nat]Absence check using 66 positive place invariants in 50 ms returned sat
[2023-03-15 02:49:50] [INFO ] After 1252ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 02:49:51] [INFO ] After 1587ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 198 ms.
[2023-03-15 02:49:51] [INFO ] After 2137ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 894 steps, including 1 resets, run visited all 2 properties in 46 ms. (steps per millisecond=19 )
Parikh walk visited 2 properties in 48 ms.
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 2 factoid took 231 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 279 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 292 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 2 out of 1366 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1366/1366 places, 1627/1627 transitions.
Applied a total of 0 rules in 99 ms. Remains 1366 /1366 variables (removed 0) and now considering 1627/1627 (removed 0) transitions.
[2023-03-15 02:49:52] [INFO ] Invariant cache hit.
[2023-03-15 02:49:53] [INFO ] Implicit Places using invariants in 760 ms returned []
[2023-03-15 02:49:53] [INFO ] Invariant cache hit.
[2023-03-15 02:49:54] [INFO ] Implicit Places using invariants and state equation in 1783 ms returned []
Implicit Place search using SMT with State Equation took 2546 ms to find 0 implicit places.
[2023-03-15 02:49:54] [INFO ] Invariant cache hit.
[2023-03-15 02:49:56] [INFO ] Dead Transitions using invariants and state equation in 1756 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4403 ms. Remains : 1366/1366 places, 1627/1627 transitions.
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 (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 129 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 290 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 02:49:57] [INFO ] Invariant cache hit.
[2023-03-15 02:49:57] [INFO ] [Real]Absence check using 66 positive place invariants in 73 ms returned sat
[2023-03-15 02:49:58] [INFO ] After 996ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-15 02:49:58] [INFO ] After 1104ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 61 ms.
[2023-03-15 02:49:58] [INFO ] After 1607ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 322 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=161 )
Parikh walk visited 1 properties in 3 ms.
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p1)), (F p0)]
Knowledge based reduction with 2 factoid took 172 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 273 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 305 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 70 reset in 363 ms.
Product exploration explored 100000 steps with 70 reset in 461 ms.
Applying partial POR strategy [false, false, false, true, true, true]
Stuttering acceptance computed with spot in 314 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Support contains 2 out of 1366 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1366/1366 places, 1627/1627 transitions.
Graph (trivial) has 1277 edges and 1366 vertex of which 858 / 1366 are part of one of the 33 SCC in 3 ms
Free SCC test removed 825 places
Ensure Unique test removed 966 transitions
Reduce isomorphic transitions removed 966 transitions.
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 37 Pre rules applied. Total rules applied 1 place count 541 transition count 709
Deduced a syphon composed of 37 places in 2 ms
Iterating global reduction 0 with 37 rules applied. Total rules applied 38 place count 541 transition count 709
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 64 place count 515 transition count 649
Deduced a syphon composed of 37 places in 3 ms
Iterating global reduction 0 with 26 rules applied. Total rules applied 90 place count 515 transition count 649
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 116 place count 489 transition count 589
Deduced a syphon composed of 11 places in 2 ms
Iterating global reduction 0 with 26 rules applied. Total rules applied 142 place count 489 transition count 589
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 108 places in 1 ms
Iterating global reduction 0 with 97 rules applied. Total rules applied 239 place count 489 transition count 589
Deduced a syphon composed of 108 places in 1 ms
Applied a total of 239 rules in 221 ms. Remains 489 /1366 variables (removed 877) and now considering 589/1627 (removed 1038) transitions.
[2023-03-15 02:50:01] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-15 02:50:01] [INFO ] Flow matrix only has 557 transitions (discarded 32 similar events)
// Phase 1: matrix 557 rows 489 cols
[2023-03-15 02:50:01] [INFO ] Computed 66 place invariants in 8 ms
[2023-03-15 02:50:02] [INFO ] Dead Transitions using invariants and state equation in 506 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 489/1366 places, 589/1627 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 788 ms. Remains : 489/1366 places, 589/1627 transitions.
Built C files in :
/tmp/ltsmin638014141328410038
[2023-03-15 02:50:02] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin638014141328410038
Running compilation step : cd /tmp/ltsmin638014141328410038;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin638014141328410038;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin638014141328410038;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 1366 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1366/1366 places, 1627/1627 transitions.
Applied a total of 0 rules in 60 ms. Remains 1366 /1366 variables (removed 0) and now considering 1627/1627 (removed 0) transitions.
// Phase 1: matrix 1627 rows 1366 cols
[2023-03-15 02:50:05] [INFO ] Computed 66 place invariants in 6 ms
[2023-03-15 02:50:05] [INFO ] Implicit Places using invariants in 522 ms returned []
[2023-03-15 02:50:05] [INFO ] Invariant cache hit.
[2023-03-15 02:50:07] [INFO ] Implicit Places using invariants and state equation in 1476 ms returned []
Implicit Place search using SMT with State Equation took 2000 ms to find 0 implicit places.
[2023-03-15 02:50:07] [INFO ] Invariant cache hit.
[2023-03-15 02:50:09] [INFO ] Dead Transitions using invariants and state equation in 1716 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3776 ms. Remains : 1366/1366 places, 1627/1627 transitions.
Built C files in :
/tmp/ltsmin11078884214107703354
[2023-03-15 02:50:09] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11078884214107703354
Running compilation step : cd /tmp/ltsmin11078884214107703354;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11078884214107703354;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11078884214107703354;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-15 02:50:12] [INFO ] Flatten gal took : 106 ms
[2023-03-15 02:50:12] [INFO ] Flatten gal took : 113 ms
[2023-03-15 02:50:12] [INFO ] Time to serialize gal into /tmp/LTL8086348453201689745.gal : 20 ms
[2023-03-15 02:50:12] [INFO ] Time to serialize properties into /tmp/LTL13678222400959871816.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8086348453201689745.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3265616070071085329.hoa' '-atoms' '/tmp/LTL13678222400959871816.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL13678222400959871816.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3265616070071085329.hoa
Detected timeout of ITS tools.
[2023-03-15 02:50:27] [INFO ] Flatten gal took : 133 ms
[2023-03-15 02:50:27] [INFO ] Flatten gal took : 66 ms
[2023-03-15 02:50:27] [INFO ] Time to serialize gal into /tmp/LTL4730914989750703008.gal : 24 ms
[2023-03-15 02:50:27] [INFO ] Time to serialize properties into /tmp/LTL18058390853147759407.ltl : 7 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4730914989750703008.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18058390853147759407.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(("(p1990==1)")||(G(F("(p2073==0)"))))))))
Formula 0 simplified : XXX(!"(p1990==1)" & FG!"(p2073==0)")
Detected timeout of ITS tools.
[2023-03-15 02:50:42] [INFO ] Flatten gal took : 45 ms
[2023-03-15 02:50:42] [INFO ] Applying decomposition
[2023-03-15 02:50:43] [INFO ] Flatten gal took : 44 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph16873646937579480165.txt' '-o' '/tmp/graph16873646937579480165.bin' '-w' '/tmp/graph16873646937579480165.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph16873646937579480165.bin' '-l' '-1' '-v' '-w' '/tmp/graph16873646937579480165.weights' '-q' '0' '-e' '0.001'
[2023-03-15 02:50:43] [INFO ] Decomposing Gal with order
[2023-03-15 02:50:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 02:50:43] [INFO ] Removed a total of 490 redundant transitions.
[2023-03-15 02:50:43] [INFO ] Flatten gal took : 179 ms
[2023-03-15 02:50:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 74 labels/synchronizations in 54 ms.
[2023-03-15 02:50:43] [INFO ] Time to serialize gal into /tmp/LTL408693075005869294.gal : 30 ms
[2023-03-15 02:50:43] [INFO ] Time to serialize properties into /tmp/LTL13434909765609552005.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL408693075005869294.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13434909765609552005.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(X(("(i24.u437.p1990==1)")||(G(F("(i25.u455.p2073==0)"))))))))
Formula 0 simplified : XXX(!"(i24.u437.p1990==1)" & FG!"(i25.u455.p2073==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9387337276856741436
[2023-03-15 02:50:59] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9387337276856741436
Running compilation step : cd /tmp/ltsmin9387337276856741436;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9387337276856741436;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9387337276856741436;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property NoC3x3-PT-4B-LTLFireability-08 finished in 79862 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U p1))'
Support contains 2 out of 1382 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1382/1382 places, 1648/1648 transitions.
Graph (trivial) has 1295 edges and 1382 vertex of which 848 / 1382 are part of one of the 33 SCC in 2 ms
Free SCC test removed 815 places
Ensure Unique test removed 956 transitions
Reduce isomorphic transitions removed 956 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 566 transition count 681
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 14 rules applied. Total rules applied 25 place count 556 transition count 677
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 27 place count 555 transition count 676
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 28 place count 554 transition count 676
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 37 Pre rules applied. Total rules applied 28 place count 554 transition count 639
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 102 place count 517 transition count 639
Discarding 29 places :
Symmetric choice reduction at 4 with 29 rule applications. Total rules 131 place count 488 transition count 578
Iterating global reduction 4 with 29 rules applied. Total rules applied 160 place count 488 transition count 578
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 160 place count 488 transition count 577
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 162 place count 487 transition count 577
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 166 place count 483 transition count 571
Iterating global reduction 4 with 4 rules applied. Total rules applied 170 place count 483 transition count 571
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: 101
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 372 place count 382 transition count 470
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 373 place count 382 transition count 469
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 374 place count 381 transition count 468
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 266 edges and 372 vertex of which 46 / 372 are part of one of the 23 SCC in 1 ms
Free SCC test removed 23 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 11 rules applied. Total rules applied 385 place count 349 transition count 467
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 47 transitions
Reduce isomorphic transitions removed 47 transitions.
Iterating post reduction 6 with 48 rules applied. Total rules applied 433 place count 348 transition count 420
Applied a total of 433 rules in 111 ms. Remains 348 /1382 variables (removed 1034) and now considering 420/1648 (removed 1228) transitions.
[2023-03-15 02:51:02] [INFO ] Flow matrix only has 388 transitions (discarded 32 similar events)
// Phase 1: matrix 388 rows 348 cols
[2023-03-15 02:51:02] [INFO ] Computed 57 place invariants in 1 ms
[2023-03-15 02:51:02] [INFO ] Implicit Places using invariants in 523 ms returned []
[2023-03-15 02:51:02] [INFO ] Flow matrix only has 388 transitions (discarded 32 similar events)
[2023-03-15 02:51:02] [INFO ] Invariant cache hit.
[2023-03-15 02:51:03] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-15 02:51:03] [INFO ] Implicit Places using invariants and state equation in 602 ms returned []
Implicit Place search using SMT with State Equation took 1140 ms to find 0 implicit places.
[2023-03-15 02:51:03] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-15 02:51:03] [INFO ] Flow matrix only has 388 transitions (discarded 32 similar events)
[2023-03-15 02:51:03] [INFO ] Invariant cache hit.
[2023-03-15 02:51:03] [INFO ] Dead Transitions using invariants and state equation in 395 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 348/1382 places, 420/1648 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1661 ms. Remains : 348/1382 places, 420/1648 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-4B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s187 1), p0:(EQ s118 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-4B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4B-LTLFireability-09 finished in 1787 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((G(p1)&&p0))||X(p2)))'
Support contains 3 out of 1382 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1382/1382 places, 1648/1648 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 1366 transition count 1632
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 1366 transition count 1632
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 38 place count 1366 transition count 1626
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 40 place count 1364 transition count 1624
Iterating global reduction 1 with 2 rules applied. Total rules applied 42 place count 1364 transition count 1624
Applied a total of 42 rules in 299 ms. Remains 1364 /1382 variables (removed 18) and now considering 1624/1648 (removed 24) transitions.
// Phase 1: matrix 1624 rows 1364 cols
[2023-03-15 02:51:04] [INFO ] Computed 66 place invariants in 11 ms
[2023-03-15 02:51:05] [INFO ] Implicit Places using invariants in 860 ms returned []
[2023-03-15 02:51:05] [INFO ] Invariant cache hit.
[2023-03-15 02:51:06] [INFO ] Implicit Places using invariants and state equation in 1796 ms returned []
Implicit Place search using SMT with State Equation took 2658 ms to find 0 implicit places.
[2023-03-15 02:51:06] [INFO ] Invariant cache hit.
[2023-03-15 02:51:08] [INFO ] Dead Transitions using invariants and state equation in 1900 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1364/1382 places, 1624/1648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4858 ms. Remains : 1364/1382 places, 1624/1648 transitions.
Stuttering acceptance computed with spot in 255 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-4B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={} source=0 dest: 2}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 3}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s617 1) (EQ s775 1)), p1:(AND (EQ s617 1) (EQ s775 1)), p2:(AND (OR (EQ s617 0) (EQ s775 0) (EQ s1088 0)) (EQ s617 1) (EQ s775 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1608 steps with 0 reset in 20 ms.
FORMULA NoC3x3-PT-4B-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4B-LTLFireability-11 finished in 5168 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(p1&&F(p2)&&X(p3)))))'
Support contains 4 out of 1382 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1382/1382 places, 1648/1648 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1369 transition count 1635
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1369 transition count 1635
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 31 place count 1369 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 1368 transition count 1629
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 1368 transition count 1629
Applied a total of 33 rules in 258 ms. Remains 1368 /1382 variables (removed 14) and now considering 1629/1648 (removed 19) transitions.
// Phase 1: matrix 1629 rows 1368 cols
[2023-03-15 02:51:09] [INFO ] Computed 66 place invariants in 8 ms
[2023-03-15 02:51:10] [INFO ] Implicit Places using invariants in 800 ms returned []
[2023-03-15 02:51:10] [INFO ] Invariant cache hit.
[2023-03-15 02:51:11] [INFO ] Implicit Places using invariants and state equation in 1804 ms returned []
Implicit Place search using SMT with State Equation took 2605 ms to find 0 implicit places.
[2023-03-15 02:51:11] [INFO ] Invariant cache hit.
[2023-03-15 02:51:13] [INFO ] Dead Transitions using invariants and state equation in 1968 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1368/1382 places, 1629/1648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4832 ms. Remains : 1368/1382 places, 1629/1648 transitions.
Stuttering acceptance computed with spot in 386 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), true, (NOT p0), (NOT p2), (NOT p3), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : NoC3x3-PT-4B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 5}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 6}, { cond=(AND p0 p1), acceptance={} source=1 dest: 7}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=7 dest: 2}, { cond=(AND p0 (NOT p3)), acceptance={} source=7 dest: 3}]], initial=0, aps=[p0:(EQ s483 1), p1:(EQ s623 0), p2:(EQ s879 0), p3:(EQ s238 0)], 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, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 1359 ms.
Product exploration explored 100000 steps with 33333 reset in 1190 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 (NOT p0) p1 p2 p3), (X (AND (NOT p0) p1)), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 p1))), (X (X (NOT (AND p0 (NOT p3))))), true, (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X p2)), (X (X p3))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p0) (NOT p3)))))
Knowledge based reduction with 15 factoid took 373 ms. Reduced automaton from 8 states, 16 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-4B-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-4B-LTLFireability-12 finished in 8199 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 1382 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1382/1382 places, 1648/1648 transitions.
Graph (trivial) has 1298 edges and 1382 vertex of which 867 / 1382 are part of one of the 33 SCC in 2 ms
Free SCC test removed 834 places
Ensure Unique test removed 981 transitions
Reduce isomorphic transitions removed 981 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 36 Pre rules applied. Total rules applied 1 place count 547 transition count 630
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 0 with 72 rules applied. Total rules applied 73 place count 511 transition count 630
Discarding 28 places :
Symmetric choice reduction at 0 with 28 rule applications. Total rules 101 place count 483 transition count 570
Iterating global reduction 0 with 28 rules applied. Total rules applied 129 place count 483 transition count 570
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 129 place count 483 transition count 569
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 131 place count 482 transition count 569
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 134 place count 479 transition count 565
Iterating global reduction 0 with 3 rules applied. Total rules applied 137 place count 479 transition count 565
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 0 with 196 rules applied. Total rules applied 333 place count 381 transition count 467
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 334 place count 380 transition count 466
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 265 edges and 371 vertex of which 48 / 371 are part of one of the 24 SCC in 1 ms
Free SCC test removed 24 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 344 place count 347 transition count 466
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 392 place count 347 transition count 418
Applied a total of 392 rules in 97 ms. Remains 347 /1382 variables (removed 1035) and now considering 418/1648 (removed 1230) transitions.
[2023-03-15 02:51:17] [INFO ] Flow matrix only has 385 transitions (discarded 33 similar events)
// Phase 1: matrix 385 rows 347 cols
[2023-03-15 02:51:17] [INFO ] Computed 57 place invariants in 1 ms
[2023-03-15 02:51:17] [INFO ] Implicit Places using invariants in 462 ms returned []
[2023-03-15 02:51:17] [INFO ] Flow matrix only has 385 transitions (discarded 33 similar events)
[2023-03-15 02:51:17] [INFO ] Invariant cache hit.
[2023-03-15 02:51:17] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-15 02:51:18] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 906 ms to find 0 implicit places.
[2023-03-15 02:51:18] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-15 02:51:18] [INFO ] Flow matrix only has 385 transitions (discarded 33 similar events)
[2023-03-15 02:51:18] [INFO ] Invariant cache hit.
[2023-03-15 02:51:18] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 347/1382 places, 418/1648 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1284 ms. Remains : 347/1382 places, 418/1648 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-4B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s141 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 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-4B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4B-LTLFireability-13 finished in 1334 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 1382 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1382/1382 places, 1648/1648 transitions.
Graph (trivial) has 1297 edges and 1382 vertex of which 866 / 1382 are part of one of the 33 SCC in 1 ms
Free SCC test removed 833 places
Ensure Unique test removed 979 transitions
Reduce isomorphic transitions removed 979 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 36 Pre rules applied. Total rules applied 1 place count 548 transition count 632
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 0 with 72 rules applied. Total rules applied 73 place count 512 transition count 632
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 102 place count 483 transition count 571
Iterating global reduction 0 with 29 rules applied. Total rules applied 131 place count 483 transition count 571
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 131 place count 483 transition count 570
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 133 place count 482 transition count 570
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 137 place count 478 transition count 564
Iterating global reduction 0 with 4 rules applied. Total rules applied 141 place count 478 transition count 564
Performed 98 Post agglomeration using F-continuation condition.Transition count delta: 98
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 0 with 196 rules applied. Total rules applied 337 place count 380 transition count 466
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 338 place count 379 transition count 465
Reduce places removed 9 places and 0 transitions.
Graph (trivial) has 265 edges and 370 vertex of which 48 / 370 are part of one of the 24 SCC in 0 ms
Free SCC test removed 24 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 348 place count 346 transition count 465
Ensure Unique test removed 48 transitions
Reduce isomorphic transitions removed 48 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 396 place count 346 transition count 417
Applied a total of 396 rules in 74 ms. Remains 346 /1382 variables (removed 1036) and now considering 417/1648 (removed 1231) transitions.
[2023-03-15 02:51:18] [INFO ] Flow matrix only has 385 transitions (discarded 32 similar events)
// Phase 1: matrix 385 rows 346 cols
[2023-03-15 02:51:18] [INFO ] Computed 57 place invariants in 1 ms
[2023-03-15 02:51:18] [INFO ] Implicit Places using invariants in 272 ms returned []
[2023-03-15 02:51:18] [INFO ] Flow matrix only has 385 transitions (discarded 32 similar events)
[2023-03-15 02:51:18] [INFO ] Invariant cache hit.
[2023-03-15 02:51:19] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-15 02:51:19] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 710 ms to find 0 implicit places.
[2023-03-15 02:51:19] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-15 02:51:19] [INFO ] Flow matrix only has 385 transitions (discarded 32 similar events)
[2023-03-15 02:51:19] [INFO ] Invariant cache hit.
[2023-03-15 02:51:19] [INFO ] Dead Transitions using invariants and state equation in 374 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 346/1382 places, 417/1648 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1170 ms. Remains : 346/1382 places, 417/1648 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-4B-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s63 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-4B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-4B-LTLFireability-14 finished in 1281 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p0)||X(p1))))))'
Support contains 2 out of 1382 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1382/1382 places, 1648/1648 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1367 transition count 1633
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1367 transition count 1633
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 36 place count 1367 transition count 1627
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 37 place count 1366 transition count 1626
Iterating global reduction 1 with 1 rules applied. Total rules applied 38 place count 1366 transition count 1626
Applied a total of 38 rules in 288 ms. Remains 1366 /1382 variables (removed 16) and now considering 1626/1648 (removed 22) transitions.
// Phase 1: matrix 1626 rows 1366 cols
[2023-03-15 02:51:20] [INFO ] Computed 66 place invariants in 8 ms
[2023-03-15 02:51:20] [INFO ] Implicit Places using invariants in 740 ms returned []
[2023-03-15 02:51:20] [INFO ] Invariant cache hit.
[2023-03-15 02:51:22] [INFO ] Implicit Places using invariants and state equation in 1488 ms returned []
Implicit Place search using SMT with State Equation took 2232 ms to find 0 implicit places.
[2023-03-15 02:51:22] [INFO ] Invariant cache hit.
[2023-03-15 02:51:24] [INFO ] Dead Transitions using invariants and state equation in 1918 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1366/1382 places, 1626/1648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4440 ms. Remains : 1366/1382 places, 1626/1648 transitions.
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-4B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s366 1), p1:(AND (EQ s366 0) (EQ s1260 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 955 ms.
Product exploration explored 100000 steps with 25000 reset in 772 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 (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 126 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 02:51:26] [INFO ] Invariant cache hit.
[2023-03-15 02:51:26] [INFO ] After 277ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 02:51:27] [INFO ] [Nat]Absence check using 66 positive place invariants in 79 ms returned sat
[2023-03-15 02:51:28] [INFO ] After 1177ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 02:51:28] [INFO ] After 1284ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-03-15 02:51:28] [INFO ] After 1808ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 856 steps, including 1 resets, run visited all 1 properties in 4 ms. (steps per millisecond=214 )
Parikh walk visited 1 properties in 5 ms.
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 135 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 235 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 1366 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1366/1366 places, 1626/1626 transitions.
Applied a total of 0 rules in 78 ms. Remains 1366 /1366 variables (removed 0) and now considering 1626/1626 (removed 0) transitions.
[2023-03-15 02:51:29] [INFO ] Invariant cache hit.
[2023-03-15 02:51:30] [INFO ] Implicit Places using invariants in 769 ms returned []
[2023-03-15 02:51:30] [INFO ] Invariant cache hit.
[2023-03-15 02:51:31] [INFO ] Implicit Places using invariants and state equation in 1761 ms returned []
Implicit Place search using SMT with State Equation took 2533 ms to find 0 implicit places.
[2023-03-15 02:51:31] [INFO ] Invariant cache hit.
[2023-03-15 02:51:33] [INFO ] Dead Transitions using invariants and state equation in 1843 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4469 ms. Remains : 1366/1366 places, 1626/1626 transitions.
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 (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 02:51:34] [INFO ] Invariant cache hit.
[2023-03-15 02:51:34] [INFO ] After 275ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 02:51:34] [INFO ] [Nat]Absence check using 66 positive place invariants in 70 ms returned sat
[2023-03-15 02:51:35] [INFO ] After 1048ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 02:51:36] [INFO ] After 1155ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 64 ms.
[2023-03-15 02:51:36] [INFO ] After 1606ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 333 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=111 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 144 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 25000 reset in 1116 ms.
Product exploration explored 100000 steps with 25000 reset in 751 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 1366 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1366/1366 places, 1626/1626 transitions.
Graph (trivial) has 1274 edges and 1366 vertex of which 842 / 1366 are part of one of the 33 SCC in 2 ms
Free SCC test removed 809 places
Ensure Unique test removed 946 transitions
Reduce isomorphic transitions removed 946 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 557 transition count 680
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 557 transition count 679
Performed 38 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 38 Pre rules applied. Total rules applied 8 place count 557 transition count 727
Deduced a syphon composed of 44 places in 1 ms
Iterating global reduction 2 with 38 rules applied. Total rules applied 46 place count 557 transition count 727
Discarding 28 places :
Symmetric choice reduction at 2 with 28 rule applications. Total rules 74 place count 529 transition count 665
Deduced a syphon composed of 42 places in 2 ms
Iterating global reduction 2 with 28 rules applied. Total rules applied 102 place count 529 transition count 665
Discarding 26 places :
Symmetric choice reduction at 2 with 26 rule applications. Total rules 128 place count 503 transition count 605
Deduced a syphon composed of 16 places in 1 ms
Iterating global reduction 2 with 26 rules applied. Total rules applied 154 place count 503 transition count 605
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 118 places in 1 ms
Iterating global reduction 2 with 102 rules applied. Total rules applied 256 place count 503 transition count 605
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 257 place count 503 transition count 604
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 264 place count 496 transition count 597
Deduced a syphon composed of 111 places in 1 ms
Iterating global reduction 3 with 7 rules applied. Total rules applied 271 place count 496 transition count 597
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 112 places in 0 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 272 place count 496 transition count 603
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 273 place count 496 transition count 602
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 274 place count 495 transition count 598
Deduced a syphon composed of 111 places in 0 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 275 place count 495 transition count 598
Deduced a syphon composed of 111 places in 0 ms
Applied a total of 275 rules in 132 ms. Remains 495 /1366 variables (removed 871) and now considering 598/1626 (removed 1028) transitions.
[2023-03-15 02:51:39] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-15 02:51:39] [INFO ] Flow matrix only has 566 transitions (discarded 32 similar events)
// Phase 1: matrix 566 rows 495 cols
[2023-03-15 02:51:39] [INFO ] Computed 66 place invariants in 7 ms
[2023-03-15 02:51:39] [INFO ] Dead Transitions using invariants and state equation in 750 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 495/1366 places, 598/1626 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 895 ms. Remains : 495/1366 places, 598/1626 transitions.
Built C files in :
/tmp/ltsmin4888670881892757041
[2023-03-15 02:51:40] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4888670881892757041
Running compilation step : cd /tmp/ltsmin4888670881892757041;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4888670881892757041;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4888670881892757041;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 1366 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1366/1366 places, 1626/1626 transitions.
Applied a total of 0 rules in 56 ms. Remains 1366 /1366 variables (removed 0) and now considering 1626/1626 (removed 0) transitions.
// Phase 1: matrix 1626 rows 1366 cols
[2023-03-15 02:51:43] [INFO ] Computed 66 place invariants in 5 ms
[2023-03-15 02:51:43] [INFO ] Implicit Places using invariants in 660 ms returned []
[2023-03-15 02:51:43] [INFO ] Invariant cache hit.
[2023-03-15 02:51:45] [INFO ] Implicit Places using invariants and state equation in 1838 ms returned []
Implicit Place search using SMT with State Equation took 2500 ms to find 0 implicit places.
[2023-03-15 02:51:45] [INFO ] Invariant cache hit.
[2023-03-15 02:51:47] [INFO ] Dead Transitions using invariants and state equation in 1442 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4004 ms. Remains : 1366/1366 places, 1626/1626 transitions.
Built C files in :
/tmp/ltsmin11484831179776115520
[2023-03-15 02:51:47] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11484831179776115520
Running compilation step : cd /tmp/ltsmin11484831179776115520;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11484831179776115520;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11484831179776115520;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-15 02:51:50] [INFO ] Flatten gal took : 40 ms
[2023-03-15 02:51:50] [INFO ] Flatten gal took : 40 ms
[2023-03-15 02:51:50] [INFO ] Time to serialize gal into /tmp/LTL14546420711147426750.gal : 10 ms
[2023-03-15 02:51:50] [INFO ] Time to serialize properties into /tmp/LTL7742019368164376705.prop : 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14546420711147426750.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5838280625020505053.hoa' '-atoms' '/tmp/LTL7742019368164376705.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL7742019368164376705.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5838280625020505053.hoa
Detected timeout of ITS tools.
[2023-03-15 02:52:05] [INFO ] Flatten gal took : 37 ms
[2023-03-15 02:52:05] [INFO ] Flatten gal took : 41 ms
[2023-03-15 02:52:05] [INFO ] Time to serialize gal into /tmp/LTL1400445243502365756.gal : 8 ms
[2023-03-15 02:52:05] [INFO ] Time to serialize properties into /tmp/LTL11853814683219885816.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1400445243502365756.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11853814683219885816.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G("(p589==1)"))||(X("((p589==0)&&(p2138==0))")))))))
Formula 0 simplified : XXG(F!"(p589==1)" & X!"((p589==0)&&(p2138==0))")
Detected timeout of ITS tools.
[2023-03-15 02:52:20] [INFO ] Flatten gal took : 33 ms
[2023-03-15 02:52:20] [INFO ] Applying decomposition
[2023-03-15 02:52:20] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph7151524707888575100.txt' '-o' '/tmp/graph7151524707888575100.bin' '-w' '/tmp/graph7151524707888575100.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7151524707888575100.bin' '-l' '-1' '-v' '-w' '/tmp/graph7151524707888575100.weights' '-q' '0' '-e' '0.001'
[2023-03-15 02:52:20] [INFO ] Decomposing Gal with order
[2023-03-15 02:52:20] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 02:52:20] [INFO ] Removed a total of 473 redundant transitions.
[2023-03-15 02:52:20] [INFO ] Flatten gal took : 137 ms
[2023-03-15 02:52:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 34 labels/synchronizations in 40 ms.
[2023-03-15 02:52:21] [INFO ] Time to serialize gal into /tmp/LTL5238245089349459726.gal : 28 ms
[2023-03-15 02:52:21] [INFO ] Time to serialize properties into /tmp/LTL77652345151439282.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5238245089349459726.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL77652345151439282.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...252
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G("(i7.i0.i1.u140.p589==1)"))||(X("((i7.i0.i1.u140.p589==0)&&(i28.u468.p2138==0))")))))))
Formula 0 simplified : XXG(F!"(i7.i0.i1.u140.p589==1)" & X!"((i7.i0.i1.u140.p589==0)&&(i28.u468.p2138==0))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10810212816032502493
[2023-03-15 02:52:36] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10810212816032502493
Running compilation step : cd /tmp/ltsmin10810212816032502493;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10810212816032502493;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10810212816032502493;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property NoC3x3-PT-4B-LTLFireability-15 finished in 79329 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0||G(F(p1)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p0)||X(p1))))))'
Found a Shortening insensitive property : NoC3x3-PT-4B-LTLFireability-15
Stuttering acceptance computed with spot in 162 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 1382 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1382/1382 places, 1648/1648 transitions.
Graph (trivial) has 1295 edges and 1382 vertex of which 851 / 1382 are part of one of the 33 SCC in 1 ms
Free SCC test removed 818 places
Ensure Unique test removed 961 transitions
Reduce isomorphic transitions removed 961 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 563 transition count 680
Reduce places removed 6 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 557 transition count 679
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 17 place count 556 transition count 677
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 18 place count 555 transition count 677
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 37 Pre rules applied. Total rules applied 18 place count 555 transition count 640
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 92 place count 518 transition count 640
Discarding 28 places :
Symmetric choice reduction at 4 with 28 rule applications. Total rules 120 place count 490 transition count 580
Iterating global reduction 4 with 28 rules applied. Total rules applied 148 place count 490 transition count 580
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 148 place count 490 transition count 579
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 150 place count 489 transition count 579
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 153 place count 486 transition count 574
Iterating global reduction 4 with 3 rules applied. Total rules applied 156 place count 486 transition count 574
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 1 ms
Reduce places removed 102 places and 0 transitions.
Iterating global reduction 4 with 204 rules applied. Total rules applied 360 place count 384 transition count 472
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 362 place count 384 transition count 470
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 364 place count 383 transition count 473
Applied a total of 364 rules in 93 ms. Remains 383 /1382 variables (removed 999) and now considering 473/1648 (removed 1175) transitions.
[2023-03-15 02:52:39] [INFO ] Flow matrix only has 441 transitions (discarded 32 similar events)
// Phase 1: matrix 441 rows 383 cols
[2023-03-15 02:52:39] [INFO ] Computed 66 place invariants in 2 ms
[2023-03-15 02:52:40] [INFO ] Implicit Places using invariants in 525 ms returned [10, 44, 85, 123, 178, 240, 281, 318, 363]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 530 ms to find 9 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 374/1382 places, 473/1648 transitions.
Graph (trivial) has 267 edges and 374 vertex of which 46 / 374 are part of one of the 23 SCC in 1 ms
Free SCC test removed 23 places
Ensure Unique test removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 350 transition count 426
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 5 place count 350 transition count 424
Applied a total of 5 rules in 24 ms. Remains 350 /374 variables (removed 24) and now considering 424/473 (removed 49) transitions.
[2023-03-15 02:52:40] [INFO ] Flow matrix only has 392 transitions (discarded 32 similar events)
// Phase 1: matrix 392 rows 350 cols
[2023-03-15 02:52:40] [INFO ] Computed 57 place invariants in 7 ms
[2023-03-15 02:52:40] [INFO ] Implicit Places using invariants in 484 ms returned []
[2023-03-15 02:52:40] [INFO ] Flow matrix only has 392 transitions (discarded 32 similar events)
[2023-03-15 02:52:40] [INFO ] Invariant cache hit.
[2023-03-15 02:52:41] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-15 02:52:41] [INFO ] Implicit Places using invariants and state equation in 787 ms returned []
Implicit Place search using SMT with State Equation took 1273 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 350/1382 places, 424/1648 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1922 ms. Remains : 350/1382 places, 424/1648 transitions.
Running random walk in product with property : NoC3x3-PT-4B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(EQ s78 1), p1:(AND (EQ s78 0) (EQ s324 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 24140 reset in 1533 ms.
Product exploration explored 100000 steps with 24210 reset in 1185 ms.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 558 steps, including 7 resets, run visited all 2 properties in 9 ms. (steps per millisecond=62 )
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 125 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 350 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 350/350 places, 424/424 transitions.
Applied a total of 0 rules in 6 ms. Remains 350 /350 variables (removed 0) and now considering 424/424 (removed 0) transitions.
[2023-03-15 02:52:44] [INFO ] Flow matrix only has 392 transitions (discarded 32 similar events)
[2023-03-15 02:52:44] [INFO ] Invariant cache hit.
[2023-03-15 02:52:45] [INFO ] Implicit Places using invariants in 331 ms returned []
[2023-03-15 02:52:45] [INFO ] Flow matrix only has 392 transitions (discarded 32 similar events)
[2023-03-15 02:52:45] [INFO ] Invariant cache hit.
[2023-03-15 02:52:45] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-15 02:52:45] [INFO ] Implicit Places using invariants and state equation in 729 ms returned []
Implicit Place search using SMT with State Equation took 1063 ms to find 0 implicit places.
[2023-03-15 02:52:45] [INFO ] Flow matrix only has 392 transitions (discarded 32 similar events)
[2023-03-15 02:52:45] [INFO ] Invariant cache hit.
[2023-03-15 02:52:46] [INFO ] Dead Transitions using invariants and state equation in 289 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1359 ms. Remains : 350/350 places, 424/424 transitions.
Computed a total of 1 stabilizing places and 2 stable transitions
Computed a total of 1 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 121 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 755 steps, including 9 resets, run visited all 2 properties in 12 ms. (steps per millisecond=62 )
Knowledge obtained : [(AND (NOT p0) p1), true]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 189 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 203 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 24070 reset in 1458 ms.
Product exploration explored 100000 steps with 24165 reset in 1364 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 350 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 350/350 places, 424/424 transitions.
Applied a total of 0 rules in 12 ms. Remains 350 /350 variables (removed 0) and now considering 424/424 (removed 0) transitions.
[2023-03-15 02:52:50] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-15 02:52:50] [INFO ] Flow matrix only has 392 transitions (discarded 32 similar events)
[2023-03-15 02:52:50] [INFO ] Invariant cache hit.
[2023-03-15 02:52:50] [INFO ] Dead Transitions using invariants and state equation in 311 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 332 ms. Remains : 350/350 places, 424/424 transitions.
Built C files in :
/tmp/ltsmin17581083217025177545
[2023-03-15 02:52:50] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17581083217025177545
Running compilation step : cd /tmp/ltsmin17581083217025177545;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1052 ms.
Running link step : cd /tmp/ltsmin17581083217025177545;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin17581083217025177545;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9143348328585967040.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 350 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 350/350 places, 424/424 transitions.
Applied a total of 0 rules in 4 ms. Remains 350 /350 variables (removed 0) and now considering 424/424 (removed 0) transitions.
[2023-03-15 02:53:05] [INFO ] Flow matrix only has 392 transitions (discarded 32 similar events)
[2023-03-15 02:53:05] [INFO ] Invariant cache hit.
[2023-03-15 02:53:06] [INFO ] Implicit Places using invariants in 314 ms returned []
[2023-03-15 02:53:06] [INFO ] Flow matrix only has 392 transitions (discarded 32 similar events)
[2023-03-15 02:53:06] [INFO ] Invariant cache hit.
[2023-03-15 02:53:06] [INFO ] State equation strengthened by 14 read => feed constraints.
[2023-03-15 02:53:07] [INFO ] Implicit Places using invariants and state equation in 797 ms returned []
Implicit Place search using SMT with State Equation took 1114 ms to find 0 implicit places.
[2023-03-15 02:53:07] [INFO ] Flow matrix only has 392 transitions (discarded 32 similar events)
[2023-03-15 02:53:07] [INFO ] Invariant cache hit.
[2023-03-15 02:53:07] [INFO ] Dead Transitions using invariants and state equation in 379 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1500 ms. Remains : 350/350 places, 424/424 transitions.
Built C files in :
/tmp/ltsmin230776281336553821
[2023-03-15 02:53:07] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin230776281336553821
Running compilation step : cd /tmp/ltsmin230776281336553821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1201 ms.
Running link step : cd /tmp/ltsmin230776281336553821;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin230776281336553821;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4595001943645040545.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-15 02:53:22] [INFO ] Flatten gal took : 14 ms
[2023-03-15 02:53:22] [INFO ] Flatten gal took : 13 ms
[2023-03-15 02:53:22] [INFO ] Time to serialize gal into /tmp/LTL10410758795903175289.gal : 3 ms
[2023-03-15 02:53:22] [INFO ] Time to serialize properties into /tmp/LTL10581431969496427775.prop : 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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10410758795903175289.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11337208189739165582.hoa' '-atoms' '/tmp/LTL10581431969496427775.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL10581431969496427775.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11337208189739165582.hoa
Detected timeout of ITS tools.
[2023-03-15 02:53:37] [INFO ] Flatten gal took : 15 ms
[2023-03-15 02:53:37] [INFO ] Flatten gal took : 11 ms
[2023-03-15 02:53:37] [INFO ] Time to serialize gal into /tmp/LTL9880951928266278367.gal : 4 ms
[2023-03-15 02:53:37] [INFO ] Time to serialize properties into /tmp/LTL7499208682156076924.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9880951928266278367.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7499208682156076924.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G("(p589==1)"))||(X("((p589==0)&&(p2138==0))")))))))
Formula 0 simplified : XXG(F!"(p589==1)" & X!"((p589==0)&&(p2138==0))")
Detected timeout of ITS tools.
[2023-03-15 02:53:52] [INFO ] Flatten gal took : 10 ms
[2023-03-15 02:53:52] [INFO ] Applying decomposition
[2023-03-15 02:53:52] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph17629787277197229923.txt' '-o' '/tmp/graph17629787277197229923.bin' '-w' '/tmp/graph17629787277197229923.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17629787277197229923.bin' '-l' '-1' '-v' '-w' '/tmp/graph17629787277197229923.weights' '-q' '0' '-e' '0.001'
[2023-03-15 02:53:52] [INFO ] Decomposing Gal with order
[2023-03-15 02:53:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 02:53:52] [INFO ] Removed a total of 77 redundant transitions.
[2023-03-15 02:53:52] [INFO ] Flatten gal took : 20 ms
[2023-03-15 02:53:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 12 ms.
[2023-03-15 02:53:52] [INFO ] Time to serialize gal into /tmp/LTL7460111154477313787.gal : 7 ms
[2023-03-15 02:53:52] [INFO ] Time to serialize properties into /tmp/LTL16599032741727111198.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7460111154477313787.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16599032741727111198.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(F((G("(i2.u9.p589==1)"))||(X("((i2.u9.p589==0)&&(i9.u40.p2138==0))")))))))
Formula 0 simplified : XXG(F!"(i2.u9.p589==1)" & X!"((i2.u9.p589==0)&&(i9.u40.p2138==0))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Computing Next relation with stutter on 2.80706e+38 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
348 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.56188,100888,1,0,119108,21742,2615,342825,1143,148799,27383
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
Treatment of property NoC3x3-PT-4B-LTLFireability-15 finished in 77644 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-15 02:53:56] [INFO ] Flatten gal took : 33 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16222491271087456489
[2023-03-15 02:53:56] [INFO ] Too many transitions (1648) to apply POR reductions. Disabling POR matrices.
[2023-03-15 02:53:56] [INFO ] Applying decomposition
[2023-03-15 02:53:57] [INFO ] Built C files in 46ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16222491271087456489
Running compilation step : cd /tmp/ltsmin16222491271087456489;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-15 02:53:57] [INFO ] Flatten gal took : 48 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph692838750671609160.txt' '-o' '/tmp/graph692838750671609160.bin' '-w' '/tmp/graph692838750671609160.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph692838750671609160.bin' '-l' '-1' '-v' '-w' '/tmp/graph692838750671609160.weights' '-q' '0' '-e' '0.001'
[2023-03-15 02:53:57] [INFO ] Decomposing Gal with order
[2023-03-15 02:53:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 02:53:57] [INFO ] Removed a total of 486 redundant transitions.
[2023-03-15 02:53:57] [INFO ] Flatten gal took : 118 ms
[2023-03-15 02:53:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 44 ms.
[2023-03-15 02:53:57] [INFO ] Time to serialize gal into /tmp/LTLFireability5969742115073482006.gal : 23 ms
[2023-03-15 02:53:57] [INFO ] Time to serialize properties into /tmp/LTLFireability4622940873738110763.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5969742115073482006.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability4622940873738110763.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 2 LTL properties
Checking formula 0 : !((X(X(X(("(i25.i1.i0.u449.p1990==1)")||(G(F("(i26.u465.p2073==0)"))))))))
Formula 0 simplified : XXX(!"(i25.i1.i0.u449.p1990==1)" & FG!"(i26.u465.p2073==0)")
Compilation finished in 5038 ms.
Running link step : cd /tmp/ltsmin16222491271087456489;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin16222491271087456489;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(X(((LTLAPp0==true)||[](<>((LTLAPp1==true)))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t223, t341, t654, t740, t1094, t1250, i0.t1215, i2.t1129, i2.u82.t1169, i7.i1.t978, i7.i1.i3....548
Computing Next relation with stutter on 1.01228e+40 deadlock states
7 unique states visited
7 strongly connected components in search stack
7 transitions explored
7 items max in DFS search stack
4752 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,47.8357,1174064,1,0,2.27657e+06,790,19790,5.56771e+06,415,4022,1364478
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA NoC3x3-PT-4B-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(X(F((G("(i7.i0.i1.u147.p589==1)"))||(X("((i7.i0.i1.u147.p589==0)&&(i30.u478.p2138==0))")))))))
Formula 1 simplified : XXG(F!"(i7.i0.i1.u147.p589==1)" & X!"((i7.i0.i1.u147.p589==0)&&(i30.u478.p2138==0))")
Computing Next relation with stutter on 1.01228e+40 deadlock states
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 items max in DFS search stack
0 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,47.8401,1174328,1,0,2.27657e+06,790,19833,5.56771e+06,416,4022,1364561
no accepting run found
Formula 1 is TRUE no accepting run found.
FORMULA NoC3x3-PT-4B-LTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 424749 ms.

BK_STOP 1678848958837

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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-4B"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is NoC3x3-PT-4B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r261-smll-167863536100284"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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