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-167863536200308.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-6A, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r261-smll-167863536200308
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 736K
-rw-r--r-- 1 mcc users 7.5K Feb 26 10:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 10:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 09:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Feb 26 09:59 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.8K Feb 25 16:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 10:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 26 10:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 10:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 10:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 16:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:29 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 297K 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-6A-LTLFireability-00
FORMULA_NAME NoC3x3-PT-6A-LTLFireability-01
FORMULA_NAME NoC3x3-PT-6A-LTLFireability-02
FORMULA_NAME NoC3x3-PT-6A-LTLFireability-03
FORMULA_NAME NoC3x3-PT-6A-LTLFireability-04
FORMULA_NAME NoC3x3-PT-6A-LTLFireability-05
FORMULA_NAME NoC3x3-PT-6A-LTLFireability-06
FORMULA_NAME NoC3x3-PT-6A-LTLFireability-07
FORMULA_NAME NoC3x3-PT-6A-LTLFireability-08
FORMULA_NAME NoC3x3-PT-6A-LTLFireability-09
FORMULA_NAME NoC3x3-PT-6A-LTLFireability-10
FORMULA_NAME NoC3x3-PT-6A-LTLFireability-11
FORMULA_NAME NoC3x3-PT-6A-LTLFireability-12
FORMULA_NAME NoC3x3-PT-6A-LTLFireability-13
FORMULA_NAME NoC3x3-PT-6A-LTLFireability-14
FORMULA_NAME NoC3x3-PT-6A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678874697272

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-6A
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-15 10:05:01] [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 10:05:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 10:05:01] [INFO ] Load time of PNML (sax parser for PT used): 224 ms
[2023-03-15 10:05:01] [INFO ] Transformed 512 places.
[2023-03-15 10:05:01] [INFO ] Transformed 1117 transitions.
[2023-03-15 10:05:01] [INFO ] Found NUPN structural information;
[2023-03-15 10:05:01] [INFO ] Parsed PT model containing 512 places and 1117 transitions and 4279 arcs in 395 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 32 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA NoC3x3-PT-6A-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6A-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6A-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6A-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-6A-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 512 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 512/512 places, 1117/1117 transitions.
Discarding 71 places :
Symmetric choice reduction at 0 with 71 rule applications. Total rules 71 place count 441 transition count 828
Iterating global reduction 0 with 71 rules applied. Total rules applied 142 place count 441 transition count 828
Applied a total of 142 rules in 147 ms. Remains 441 /512 variables (removed 71) and now considering 828/1117 (removed 289) transitions.
[2023-03-15 10:05:01] [INFO ] Flow matrix only has 823 transitions (discarded 5 similar events)
// Phase 1: matrix 823 rows 441 cols
[2023-03-15 10:05:02] [INFO ] Computed 66 place invariants in 44 ms
[2023-03-15 10:05:03] [INFO ] Implicit Places using invariants in 1053 ms returned [11, 46, 95, 133, 283, 334, 371, 423]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 1119 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 433/512 places, 828/1117 transitions.
Applied a total of 0 rules in 23 ms. Remains 433 /433 variables (removed 0) and now considering 828/828 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1295 ms. Remains : 433/512 places, 828/1117 transitions.
Support contains 41 out of 433 places after structural reductions.
[2023-03-15 10:05:03] [INFO ] Flatten gal took : 246 ms
[2023-03-15 10:05:03] [INFO ] Flatten gal took : 112 ms
[2023-03-15 10:05:03] [INFO ] Input system was already deterministic with 828 transitions.
Incomplete random walk after 10000 steps, including 26 resets, run finished after 674 ms. (steps per millisecond=14 ) properties (out of 22) seen :19
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-15 10:05:04] [INFO ] Flow matrix only has 823 transitions (discarded 5 similar events)
// Phase 1: matrix 823 rows 433 cols
[2023-03-15 10:05:04] [INFO ] Computed 58 place invariants in 6 ms
[2023-03-15 10:05:04] [INFO ] [Real]Absence check using 58 positive place invariants in 17 ms returned sat
[2023-03-15 10:05:05] [INFO ] After 590ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 10:05:05] [INFO ] [Nat]Absence check using 58 positive place invariants in 26 ms returned sat
[2023-03-15 10:05:06] [INFO ] After 453ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 10:05:06] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-15 10:05:06] [INFO ] After 150ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 10:05:06] [INFO ] After 287ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 102 ms.
[2023-03-15 10:05:06] [INFO ] After 1030ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 4 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 828/828 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 425 transition count 795
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 425 transition count 795
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 54 place count 406 transition count 776
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 60 place count 403 transition count 801
Free-agglomeration rule applied 25 times.
Iterating global reduction 0 with 25 rules applied. Total rules applied 85 place count 403 transition count 776
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 110 place count 378 transition count 776
Applied a total of 110 rules in 189 ms. Remains 378 /433 variables (removed 55) and now considering 776/828 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 191 ms. Remains : 378/433 places, 776/828 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 426979 steps, run timeout after 3001 ms. (steps per millisecond=142 ) properties seen :{}
Probabilistic random walk after 426979 steps, saw 295507 distinct states, run finished after 3002 ms. (steps per millisecond=142 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 10:05:09] [INFO ] Flow matrix only has 775 transitions (discarded 1 similar events)
// Phase 1: matrix 775 rows 378 cols
[2023-03-15 10:05:09] [INFO ] Computed 58 place invariants in 6 ms
[2023-03-15 10:05:09] [INFO ] [Real]Absence check using 58 positive place invariants in 18 ms returned sat
[2023-03-15 10:05:10] [INFO ] After 459ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 10:05:10] [INFO ] [Nat]Absence check using 58 positive place invariants in 14 ms returned sat
[2023-03-15 10:05:10] [INFO ] After 366ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 10:05:10] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-15 10:05:10] [INFO ] After 108ms SMT Verify possible using 41 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 10:05:10] [INFO ] After 294ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 86 ms.
[2023-03-15 10:05:11] [INFO ] After 863ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 378 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 776/776 transitions.
Applied a total of 0 rules in 28 ms. Remains 378 /378 variables (removed 0) and now considering 776/776 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 378/378 places, 776/776 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 776/776 transitions.
Applied a total of 0 rules in 21 ms. Remains 378 /378 variables (removed 0) and now considering 776/776 (removed 0) transitions.
[2023-03-15 10:05:11] [INFO ] Flow matrix only has 775 transitions (discarded 1 similar events)
[2023-03-15 10:05:11] [INFO ] Invariant cache hit.
[2023-03-15 10:05:11] [INFO ] Implicit Places using invariants in 284 ms returned [166]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 288 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 377/378 places, 776/776 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 373 transition count 772
Applied a total of 8 rules in 28 ms. Remains 373 /377 variables (removed 4) and now considering 772/776 (removed 4) transitions.
[2023-03-15 10:05:11] [INFO ] Flow matrix only has 771 transitions (discarded 1 similar events)
// Phase 1: matrix 771 rows 373 cols
[2023-03-15 10:05:11] [INFO ] Computed 57 place invariants in 4 ms
[2023-03-15 10:05:11] [INFO ] Implicit Places using invariants in 269 ms returned []
[2023-03-15 10:05:11] [INFO ] Flow matrix only has 771 transitions (discarded 1 similar events)
[2023-03-15 10:05:11] [INFO ] Invariant cache hit.
[2023-03-15 10:05:12] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-15 10:05:12] [INFO ] Implicit Places using invariants and state equation in 796 ms returned []
Implicit Place search using SMT with State Equation took 1072 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 373/378 places, 772/776 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1410 ms. Remains : 373/378 places, 772/776 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 481121 steps, run timeout after 3001 ms. (steps per millisecond=160 ) properties seen :{}
Probabilistic random walk after 481121 steps, saw 376060 distinct states, run finished after 3001 ms. (steps per millisecond=160 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 10:05:15] [INFO ] Flow matrix only has 771 transitions (discarded 1 similar events)
[2023-03-15 10:05:15] [INFO ] Invariant cache hit.
[2023-03-15 10:05:15] [INFO ] [Real]Absence check using 57 positive place invariants in 26 ms returned sat
[2023-03-15 10:05:16] [INFO ] After 541ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 10:05:16] [INFO ] [Nat]Absence check using 57 positive place invariants in 19 ms returned sat
[2023-03-15 10:05:16] [INFO ] After 381ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 10:05:16] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-15 10:05:16] [INFO ] After 126ms SMT Verify possible using 41 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 10:05:16] [INFO ] After 241ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-15 10:05:16] [INFO ] After 802ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 373 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 373/373 places, 772/772 transitions.
Applied a total of 0 rules in 44 ms. Remains 373 /373 variables (removed 0) and now considering 772/772 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 373/373 places, 772/772 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 373/373 places, 772/772 transitions.
Applied a total of 0 rules in 30 ms. Remains 373 /373 variables (removed 0) and now considering 772/772 (removed 0) transitions.
[2023-03-15 10:05:17] [INFO ] Flow matrix only has 771 transitions (discarded 1 similar events)
[2023-03-15 10:05:17] [INFO ] Invariant cache hit.
[2023-03-15 10:05:17] [INFO ] Implicit Places using invariants in 378 ms returned []
[2023-03-15 10:05:17] [INFO ] Flow matrix only has 771 transitions (discarded 1 similar events)
[2023-03-15 10:05:17] [INFO ] Invariant cache hit.
[2023-03-15 10:05:17] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-15 10:05:18] [INFO ] Implicit Places using invariants and state equation in 986 ms returned []
Implicit Place search using SMT with State Equation took 1380 ms to find 0 implicit places.
[2023-03-15 10:05:18] [INFO ] Redundant transitions in 54 ms returned []
[2023-03-15 10:05:18] [INFO ] Flow matrix only has 771 transitions (discarded 1 similar events)
[2023-03-15 10:05:18] [INFO ] Invariant cache hit.
[2023-03-15 10:05:18] [INFO ] Dead Transitions using invariants and state equation in 518 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1990 ms. Remains : 373/373 places, 772/772 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 373 transition count 771
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 6 place count 373 transition count 771
Applied a total of 6 rules in 36 ms. Remains 373 /373 variables (removed 0) and now considering 771/772 (removed 1) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 771 rows 373 cols
[2023-03-15 10:05:19] [INFO ] Computed 57 place invariants in 5 ms
[2023-03-15 10:05:19] [INFO ] [Real]Absence check using 57 positive place invariants in 22 ms returned sat
[2023-03-15 10:05:19] [INFO ] After 535ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 10:05:19] [INFO ] [Nat]Absence check using 57 positive place invariants in 23 ms returned sat
[2023-03-15 10:05:20] [INFO ] After 474ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 10:05:20] [INFO ] After 619ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 100 ms.
[2023-03-15 10:05:20] [INFO ] After 849ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Computed a total of 2 stabilizing places and 1 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' '!(F(p0))'
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 433/433 places, 828/828 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 423 transition count 787
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 423 transition count 787
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 60 place count 403 transition count 767
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 66 place count 400 transition count 792
Applied a total of 66 rules in 96 ms. Remains 400 /433 variables (removed 33) and now considering 792/828 (removed 36) transitions.
// Phase 1: matrix 792 rows 400 cols
[2023-03-15 10:05:21] [INFO ] Computed 58 place invariants in 8 ms
[2023-03-15 10:05:21] [INFO ] Implicit Places using invariants in 863 ms returned []
[2023-03-15 10:05:21] [INFO ] Invariant cache hit.
[2023-03-15 10:05:22] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-15 10:05:23] [INFO ] Implicit Places using invariants and state equation in 1163 ms returned []
Implicit Place search using SMT with State Equation took 2041 ms to find 0 implicit places.
[2023-03-15 10:05:23] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-15 10:05:23] [INFO ] Invariant cache hit.
[2023-03-15 10:05:23] [INFO ] Dead Transitions using invariants and state equation in 880 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 400/433 places, 792/828 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3058 ms. Remains : 400/433 places, 792/828 transitions.
Stuttering acceptance computed with spot in 252 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-6A-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s171 1) (EQ s209 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 582 steps with 4 reset in 24 ms.
FORMULA NoC3x3-PT-6A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6A-LTLFireability-00 finished in 3443 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((p0 U X(p1)))||F(G(p2))))'
Support contains 6 out of 433 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 828/828 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 424 transition count 791
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 424 transition count 791
Applied a total of 18 rules in 17 ms. Remains 424 /433 variables (removed 9) and now considering 791/828 (removed 37) transitions.
[2023-03-15 10:05:24] [INFO ] Flow matrix only has 790 transitions (discarded 1 similar events)
// Phase 1: matrix 790 rows 424 cols
[2023-03-15 10:05:24] [INFO ] Computed 58 place invariants in 8 ms
[2023-03-15 10:05:24] [INFO ] Implicit Places using invariants in 369 ms returned [184]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 373 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 423/433 places, 791/828 transitions.
Applied a total of 0 rules in 6 ms. Remains 423 /423 variables (removed 0) and now considering 791/791 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 398 ms. Remains : 423/433 places, 791/828 transitions.
Stuttering acceptance computed with spot in 262 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : NoC3x3-PT-6A-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s9 1) (EQ s127 1)), p2:(OR (AND (EQ s8 1) (EQ s14 1)) (AND (EQ s168 1) (EQ s191 1))), p1:(AND (EQ s168 1) (EQ s191 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 246 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-6A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6A-LTLFireability-01 finished in 694 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(G(p0)))))'
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 828/828 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 423 transition count 787
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 423 transition count 787
Applied a total of 20 rules in 13 ms. Remains 423 /433 variables (removed 10) and now considering 787/828 (removed 41) transitions.
// Phase 1: matrix 787 rows 423 cols
[2023-03-15 10:05:24] [INFO ] Computed 58 place invariants in 5 ms
[2023-03-15 10:05:25] [INFO ] Implicit Places using invariants in 531 ms returned [183]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 536 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 422/433 places, 787/828 transitions.
Applied a total of 0 rules in 9 ms. Remains 422 /422 variables (removed 0) and now considering 787/787 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 559 ms. Remains : 422/433 places, 787/828 transitions.
Stuttering acceptance computed with spot in 185 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-6A-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (EQ s79 1) (EQ s90 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-6A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6A-LTLFireability-02 finished in 766 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(F(p0))&&F((!p1 U (p2||G(!p1))))))'
Support contains 4 out of 433 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 828/828 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 425 transition count 792
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 425 transition count 792
Applied a total of 16 rules in 18 ms. Remains 425 /433 variables (removed 8) and now considering 792/828 (removed 36) transitions.
// Phase 1: matrix 792 rows 425 cols
[2023-03-15 10:05:25] [INFO ] Computed 58 place invariants in 5 ms
[2023-03-15 10:05:26] [INFO ] Implicit Places using invariants in 468 ms returned [184]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 471 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 424/433 places, 792/828 transitions.
Applied a total of 0 rules in 8 ms. Remains 424 /424 variables (removed 0) and now considering 792/792 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 500 ms. Remains : 424/433 places, 792/828 transitions.
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (AND (NOT p2) p1)]
Running random walk in product with property : NoC3x3-PT-6A-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (NOT (AND (EQ s270 1) (EQ s412 1))) (NOT (AND (EQ s119 1) (EQ s129 1)))), p0:(OR (EQ s270 0) (EQ s412 0)), p1:(AND (EQ s119 1) (EQ s129 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1857 ms.
Product exploration explored 100000 steps with 50000 reset in 1745 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 7 factoid took 168 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-6A-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-6A-LTLFireability-04 finished in 4507 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)||G(p1))))'
Support contains 5 out of 433 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 433/433 places, 828/828 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 424 transition count 794
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 424 transition count 794
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 58 place count 404 transition count 774
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 64 place count 401 transition count 799
Applied a total of 64 rules in 38 ms. Remains 401 /433 variables (removed 32) and now considering 799/828 (removed 29) transitions.
[2023-03-15 10:05:30] [INFO ] Flow matrix only has 797 transitions (discarded 2 similar events)
// Phase 1: matrix 797 rows 401 cols
[2023-03-15 10:05:30] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-15 10:05:30] [INFO ] Implicit Places using invariants in 399 ms returned [173]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 401 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 400/433 places, 799/828 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 397 transition count 796
Applied a total of 6 rules in 22 ms. Remains 397 /400 variables (removed 3) and now considering 796/799 (removed 3) transitions.
[2023-03-15 10:05:30] [INFO ] Flow matrix only has 794 transitions (discarded 2 similar events)
// Phase 1: matrix 794 rows 397 cols
[2023-03-15 10:05:30] [INFO ] Computed 57 place invariants in 4 ms
[2023-03-15 10:05:31] [INFO ] Implicit Places using invariants in 360 ms returned []
[2023-03-15 10:05:31] [INFO ] Flow matrix only has 794 transitions (discarded 2 similar events)
[2023-03-15 10:05:31] [INFO ] Invariant cache hit.
[2023-03-15 10:05:31] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-15 10:05:31] [INFO ] Implicit Places using invariants and state equation in 935 ms returned []
Implicit Place search using SMT with State Equation took 1297 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 397/433 places, 796/828 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1758 ms. Remains : 397/433 places, 796/828 transitions.
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-6A-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(OR (NEQ s25 1) (NEQ s173 1)), p1:(OR (EQ s17 1) (AND (EQ s164 1) (EQ s181 1)))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 308 reset in 774 ms.
Product exploration explored 100000 steps with 304 reset in 587 ms.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 7 factoid took 359 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 53 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 33 resets, run finished after 173 ms. (steps per millisecond=57 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 10:05:34] [INFO ] Flow matrix only has 794 transitions (discarded 2 similar events)
[2023-03-15 10:05:34] [INFO ] Invariant cache hit.
[2023-03-15 10:05:34] [INFO ] [Real]Absence check using 57 positive place invariants in 26 ms returned sat
[2023-03-15 10:05:34] [INFO ] After 583ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 10:05:34] [INFO ] [Nat]Absence check using 57 positive place invariants in 23 ms returned sat
[2023-03-15 10:05:35] [INFO ] After 461ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 10:05:35] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-15 10:05:35] [INFO ] After 122ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 10:05:35] [INFO ] After 291ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 181 ms.
[2023-03-15 10:05:35] [INFO ] After 1068ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 5 out of 397 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 397/397 places, 796/796 transitions.
Free-agglomeration rule applied 23 times.
Iterating global reduction 0 with 23 rules applied. Total rules applied 23 place count 397 transition count 773
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 46 place count 374 transition count 773
Applied a total of 46 rules in 30 ms. Remains 374 /397 variables (removed 23) and now considering 773/796 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 374/397 places, 773/796 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 451256 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :{}
Probabilistic random walk after 451256 steps, saw 280760 distinct states, run finished after 3004 ms. (steps per millisecond=150 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 10:05:38] [INFO ] Flow matrix only has 771 transitions (discarded 2 similar events)
// Phase 1: matrix 771 rows 374 cols
[2023-03-15 10:05:38] [INFO ] Computed 57 place invariants in 5 ms
[2023-03-15 10:05:38] [INFO ] [Real]Absence check using 57 positive place invariants in 24 ms returned sat
[2023-03-15 10:05:39] [INFO ] After 549ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 10:05:39] [INFO ] [Nat]Absence check using 57 positive place invariants in 23 ms returned sat
[2023-03-15 10:05:39] [INFO ] After 441ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 10:05:39] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-15 10:05:40] [INFO ] After 118ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 10:05:40] [INFO ] After 250ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 146 ms.
[2023-03-15 10:05:40] [INFO ] After 984ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 5 out of 374 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 374/374 places, 773/773 transitions.
Applied a total of 0 rules in 12 ms. Remains 374 /374 variables (removed 0) and now considering 773/773 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 374/374 places, 773/773 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 374/374 places, 773/773 transitions.
Applied a total of 0 rules in 11 ms. Remains 374 /374 variables (removed 0) and now considering 773/773 (removed 0) transitions.
[2023-03-15 10:05:40] [INFO ] Flow matrix only has 771 transitions (discarded 2 similar events)
[2023-03-15 10:05:40] [INFO ] Invariant cache hit.
[2023-03-15 10:05:40] [INFO ] Implicit Places using invariants in 408 ms returned []
[2023-03-15 10:05:40] [INFO ] Flow matrix only has 771 transitions (discarded 2 similar events)
[2023-03-15 10:05:40] [INFO ] Invariant cache hit.
[2023-03-15 10:05:41] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-15 10:05:41] [INFO ] Implicit Places using invariants and state equation in 1028 ms returned []
Implicit Place search using SMT with State Equation took 1440 ms to find 0 implicit places.
[2023-03-15 10:05:41] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-15 10:05:41] [INFO ] Flow matrix only has 771 transitions (discarded 2 similar events)
[2023-03-15 10:05:41] [INFO ] Invariant cache hit.
[2023-03-15 10:05:42] [INFO ] Dead Transitions using invariants and state equation in 624 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2109 ms. Remains : 374/374 places, 773/773 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 374 transition count 771
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 374 transition count 771
Applied a total of 7 rules in 23 ms. Remains 374 /374 variables (removed 0) and now considering 771/773 (removed 2) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 771 rows 374 cols
[2023-03-15 10:05:42] [INFO ] Computed 57 place invariants in 6 ms
[2023-03-15 10:05:42] [INFO ] [Real]Absence check using 57 positive place invariants in 17 ms returned sat
[2023-03-15 10:05:43] [INFO ] After 509ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 10:05:43] [INFO ] [Nat]Absence check using 57 positive place invariants in 18 ms returned sat
[2023-03-15 10:05:43] [INFO ] After 323ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 10:05:43] [INFO ] After 382ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-15 10:05:43] [INFO ] After 529ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 540 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Support contains 5 out of 397 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 397/397 places, 796/796 transitions.
Applied a total of 0 rules in 13 ms. Remains 397 /397 variables (removed 0) and now considering 796/796 (removed 0) transitions.
[2023-03-15 10:05:44] [INFO ] Flow matrix only has 794 transitions (discarded 2 similar events)
// Phase 1: matrix 794 rows 397 cols
[2023-03-15 10:05:44] [INFO ] Computed 57 place invariants in 5 ms
[2023-03-15 10:05:44] [INFO ] Implicit Places using invariants in 365 ms returned []
[2023-03-15 10:05:44] [INFO ] Flow matrix only has 794 transitions (discarded 2 similar events)
[2023-03-15 10:05:44] [INFO ] Invariant cache hit.
[2023-03-15 10:05:44] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-15 10:05:45] [INFO ] Implicit Places using invariants and state equation in 857 ms returned []
Implicit Place search using SMT with State Equation took 1225 ms to find 0 implicit places.
[2023-03-15 10:05:45] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-15 10:05:45] [INFO ] Flow matrix only has 794 transitions (discarded 2 similar events)
[2023-03-15 10:05:45] [INFO ] Invariant cache hit.
[2023-03-15 10:05:46] [INFO ] Dead Transitions using invariants and state equation in 674 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1943 ms. Remains : 397/397 places, 796/796 transitions.
Computed a total of 1 stabilizing places and 8 stable transitions
Computed a total of 1 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1))))]
Knowledge based reduction with 7 factoid took 492 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 31 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-15 10:05:46] [INFO ] Flow matrix only has 794 transitions (discarded 2 similar events)
[2023-03-15 10:05:46] [INFO ] Invariant cache hit.
[2023-03-15 10:05:47] [INFO ] [Real]Absence check using 57 positive place invariants in 23 ms returned sat
[2023-03-15 10:05:47] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 10:05:47] [INFO ] [Nat]Absence check using 57 positive place invariants in 22 ms returned sat
[2023-03-15 10:05:47] [INFO ] After 573ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 10:05:47] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-15 10:05:47] [INFO ] After 236ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 10:05:48] [INFO ] After 444ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 180 ms.
[2023-03-15 10:05:48] [INFO ] After 1356ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 17 ms.
Support contains 5 out of 397 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 397/397 places, 796/796 transitions.
Free-agglomeration rule applied 23 times.
Iterating global reduction 0 with 23 rules applied. Total rules applied 23 place count 397 transition count 773
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 46 place count 374 transition count 773
Applied a total of 46 rules in 28 ms. Remains 374 /397 variables (removed 23) and now considering 773/796 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 374/397 places, 773/796 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 232812 steps, run timeout after 3001 ms. (steps per millisecond=77 ) properties seen :{}
Probabilistic random walk after 232812 steps, saw 204576 distinct states, run finished after 3002 ms. (steps per millisecond=77 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-15 10:05:51] [INFO ] Flow matrix only has 771 transitions (discarded 2 similar events)
// Phase 1: matrix 771 rows 374 cols
[2023-03-15 10:05:51] [INFO ] Computed 57 place invariants in 5 ms
[2023-03-15 10:05:51] [INFO ] [Real]Absence check using 57 positive place invariants in 18 ms returned sat
[2023-03-15 10:05:51] [INFO ] After 104ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 10:05:51] [INFO ] [Nat]Absence check using 57 positive place invariants in 18 ms returned sat
[2023-03-15 10:05:52] [INFO ] After 394ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 10:05:52] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-15 10:05:52] [INFO ] After 214ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 10:05:52] [INFO ] After 366ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 160 ms.
[2023-03-15 10:05:52] [INFO ] After 1034ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 24 ms.
Support contains 5 out of 374 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 374/374 places, 773/773 transitions.
Applied a total of 0 rules in 11 ms. Remains 374 /374 variables (removed 0) and now considering 773/773 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 374/374 places, 773/773 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 374/374 places, 773/773 transitions.
Applied a total of 0 rules in 14 ms. Remains 374 /374 variables (removed 0) and now considering 773/773 (removed 0) transitions.
[2023-03-15 10:05:52] [INFO ] Flow matrix only has 771 transitions (discarded 2 similar events)
[2023-03-15 10:05:52] [INFO ] Invariant cache hit.
[2023-03-15 10:05:53] [INFO ] Implicit Places using invariants in 318 ms returned []
[2023-03-15 10:05:53] [INFO ] Flow matrix only has 771 transitions (discarded 2 similar events)
[2023-03-15 10:05:53] [INFO ] Invariant cache hit.
[2023-03-15 10:05:53] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-15 10:05:53] [INFO ] Implicit Places using invariants and state equation in 889 ms returned []
Implicit Place search using SMT with State Equation took 1213 ms to find 0 implicit places.
[2023-03-15 10:05:54] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-15 10:05:54] [INFO ] Flow matrix only has 771 transitions (discarded 2 similar events)
[2023-03-15 10:05:54] [INFO ] Invariant cache hit.
[2023-03-15 10:05:54] [INFO ] Dead Transitions using invariants and state equation in 678 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1929 ms. Remains : 374/374 places, 773/773 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 374 transition count 771
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 7 place count 374 transition count 771
Applied a total of 7 rules in 33 ms. Remains 374 /374 variables (removed 0) and now considering 771/773 (removed 2) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 771 rows 374 cols
[2023-03-15 10:05:54] [INFO ] Computed 57 place invariants in 5 ms
[2023-03-15 10:05:54] [INFO ] [Real]Absence check using 57 positive place invariants in 20 ms returned sat
[2023-03-15 10:05:54] [INFO ] After 129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 10:05:54] [INFO ] [Nat]Absence check using 57 positive place invariants in 21 ms returned sat
[2023-03-15 10:05:55] [INFO ] After 484ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 10:05:55] [INFO ] After 736ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 112 ms.
[2023-03-15 10:05:55] [INFO ] After 982ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 7 factoid took 421 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 37 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 308 reset in 757 ms.
Product exploration explored 100000 steps with 305 reset in 496 ms.
Built C files in :
/tmp/ltsmin9894612939484834531
[2023-03-15 10:05:57] [INFO ] Computing symmetric may disable matrix : 796 transitions.
[2023-03-15 10:05:57] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 10:05:57] [INFO ] Computing symmetric may enable matrix : 796 transitions.
[2023-03-15 10:05:57] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 10:05:57] [INFO ] Computing Do-Not-Accords matrix : 796 transitions.
[2023-03-15 10:05:57] [INFO ] Computation of Completed DNA matrix. took 50 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 10:05:57] [INFO ] Built C files in 260ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9894612939484834531
Running compilation step : cd /tmp/ltsmin9894612939484834531;'/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/ltsmin9894612939484834531;'/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/ltsmin9894612939484834531;'/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 5 out of 397 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 397/397 places, 796/796 transitions.
Applied a total of 0 rules in 24 ms. Remains 397 /397 variables (removed 0) and now considering 796/796 (removed 0) transitions.
[2023-03-15 10:06:01] [INFO ] Flow matrix only has 794 transitions (discarded 2 similar events)
// Phase 1: matrix 794 rows 397 cols
[2023-03-15 10:06:01] [INFO ] Computed 57 place invariants in 2 ms
[2023-03-15 10:06:01] [INFO ] Implicit Places using invariants in 418 ms returned []
[2023-03-15 10:06:01] [INFO ] Flow matrix only has 794 transitions (discarded 2 similar events)
[2023-03-15 10:06:01] [INFO ] Invariant cache hit.
[2023-03-15 10:06:01] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-15 10:06:02] [INFO ] Implicit Places using invariants and state equation in 1213 ms returned []
Implicit Place search using SMT with State Equation took 1634 ms to find 0 implicit places.
[2023-03-15 10:06:02] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-15 10:06:02] [INFO ] Flow matrix only has 794 transitions (discarded 2 similar events)
[2023-03-15 10:06:02] [INFO ] Invariant cache hit.
[2023-03-15 10:06:03] [INFO ] Dead Transitions using invariants and state equation in 642 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2331 ms. Remains : 397/397 places, 796/796 transitions.
Built C files in :
/tmp/ltsmin17741571158786096618
[2023-03-15 10:06:03] [INFO ] Computing symmetric may disable matrix : 796 transitions.
[2023-03-15 10:06:03] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 10:06:03] [INFO ] Computing symmetric may enable matrix : 796 transitions.
[2023-03-15 10:06:03] [INFO ] Computation of Complete enable matrix. took 8 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 10:06:03] [INFO ] Computing Do-Not-Accords matrix : 796 transitions.
[2023-03-15 10:06:03] [INFO ] Computation of Completed DNA matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-15 10:06:03] [INFO ] Built C files in 155ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17741571158786096618
Running compilation step : cd /tmp/ltsmin17741571158786096618;'/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/ltsmin17741571158786096618;'/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/ltsmin17741571158786096618;'/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 10:06:06] [INFO ] Flatten gal took : 115 ms
[2023-03-15 10:06:06] [INFO ] Flatten gal took : 116 ms
[2023-03-15 10:06:06] [INFO ] Time to serialize gal into /tmp/LTL13349875827466737304.gal : 15 ms
[2023-03-15 10:06:06] [INFO ] Time to serialize properties into /tmp/LTL2281918887643551837.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/LTL13349875827466737304.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10956746739785128287.hoa' '-atoms' '/tmp/LTL2281918887643551837.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...319
Loading property file /tmp/LTL2281918887643551837.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10956746739785128287.hoa
Detected timeout of ITS tools.
[2023-03-15 10:06:22] [INFO ] Flatten gal took : 53 ms
[2023-03-15 10:06:22] [INFO ] Flatten gal took : 49 ms
[2023-03-15 10:06:22] [INFO ] Time to serialize gal into /tmp/LTL4974999409795149205.gal : 6 ms
[2023-03-15 10:06:22] [INFO ] Time to serialize properties into /tmp/LTL7540113394920731469.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4974999409795149205.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7540113394920731469.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 : !((F((G("((p31!=1)||(p226!=1))"))||(G("((p23==1)||((p211==1)&&(p236==1)))")))))
Formula 0 simplified : G(F!"((p31!=1)||(p226!=1))" & F!"((p23==1)||((p211==1)&&(p236==1)))")
Detected timeout of ITS tools.
[2023-03-15 10:06:37] [INFO ] Flatten gal took : 53 ms
[2023-03-15 10:06:37] [INFO ] Applying decomposition
[2023-03-15 10:06:37] [INFO ] Flatten gal took : 46 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/graph2392881818799978280.txt' '-o' '/tmp/graph2392881818799978280.bin' '-w' '/tmp/graph2392881818799978280.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2392881818799978280.bin' '-l' '-1' '-v' '-w' '/tmp/graph2392881818799978280.weights' '-q' '0' '-e' '0.001'
[2023-03-15 10:06:37] [INFO ] Decomposing Gal with order
[2023-03-15 10:06:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-15 10:06:37] [INFO ] Removed a total of 1077 redundant transitions.
[2023-03-15 10:06:37] [INFO ] Flatten gal took : 294 ms
[2023-03-15 10:06:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 639 labels/synchronizations in 91 ms.
[2023-03-15 10:06:38] [INFO ] Time to serialize gal into /tmp/LTL11782005523505935619.gal : 23 ms
[2023-03-15 10:06:38] [INFO ] Time to serialize properties into /tmp/LTL3238398722743090889.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/LTL11782005523505935619.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3238398722743090889.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 : !((F((G("((i1.i1.u10.p31!=1)||(i6.i0.u28.p226!=1))"))||(G("((i0.u4.p23==1)||((i6.i0.u27.p211==1)&&(i6.i0.u28.p236==1)))")))))
Formula 0 simplified : G(F!"((i1.i1.u10.p31!=1)||(i6.i0.u28.p226!=1))" & F!"((i0.u4.p23==1)||((i6.i0.u27.p211==1)&&(i6.i0.u28.p236==1)))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1273270381150849778
[2023-03-15 10:06:53] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1273270381150849778
Running compilation step : cd /tmp/ltsmin1273270381150849778;'/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 2184 ms.
Running link step : cd /tmp/ltsmin1273270381150849778;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 57 ms.
Running LTSmin : cd /tmp/ltsmin1273270381150849778;'/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' '<>(([]((LTLAPp0==true))||[]((LTLAPp1==true))))' '--buchi-type=spotba'
LTSmin run took 10335 ms.
FORMULA NoC3x3-PT-6A-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property NoC3x3-PT-6A-LTLFireability-05 finished in 95557 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((F((p0&&F(p1)))&&X(X(G(p1))))))'
Support contains 4 out of 433 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 828/828 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 425 transition count 796
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 425 transition count 796
Applied a total of 16 rules in 16 ms. Remains 425 /433 variables (removed 8) and now considering 796/828 (removed 32) transitions.
// Phase 1: matrix 796 rows 425 cols
[2023-03-15 10:07:05] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-15 10:07:06] [INFO ] Implicit Places using invariants in 588 ms returned [184]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 590 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 424/433 places, 796/828 transitions.
Applied a total of 0 rules in 7 ms. Remains 424 /424 variables (removed 0) and now considering 796/796 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 614 ms. Remains : 424/433 places, 796/828 transitions.
Stuttering acceptance computed with spot in 349 ms :[(OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-6A-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=0 dest: 6}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=p0, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 1}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=2, aps=[p0:(OR (EQ s372 0) (EQ s400 0)), p1:(OR (EQ s10 0) (EQ s33 0))], 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, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1366 steps with 3 reset in 11 ms.
FORMULA NoC3x3-PT-6A-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6A-LTLFireability-06 finished in 1006 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 433 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 828/828 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 423 transition count 787
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 423 transition count 787
Applied a total of 20 rules in 14 ms. Remains 423 /433 variables (removed 10) and now considering 787/828 (removed 41) transitions.
// Phase 1: matrix 787 rows 423 cols
[2023-03-15 10:07:06] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-15 10:07:07] [INFO ] Implicit Places using invariants in 639 ms returned [183]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 643 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 422/433 places, 787/828 transitions.
Applied a total of 0 rules in 6 ms. Remains 422 /422 variables (removed 0) and now considering 787/787 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 663 ms. Remains : 422/433 places, 787/828 transitions.
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-6A-LTLFireability-07 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 s257 1) (EQ s295 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-6A-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6A-LTLFireability-07 finished in 804 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 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 433/433 places, 828/828 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 431 transition count 827
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 422 transition count 789
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 422 transition count 789
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 1 with 48 rules applied. Total rules applied 67 place count 398 transition count 765
Applied a total of 67 rules in 39 ms. Remains 398 /433 variables (removed 35) and now considering 765/828 (removed 63) transitions.
// Phase 1: matrix 765 rows 398 cols
[2023-03-15 10:07:07] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-15 10:07:08] [INFO ] Implicit Places using invariants in 583 ms returned []
[2023-03-15 10:07:08] [INFO ] Invariant cache hit.
[2023-03-15 10:07:08] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-15 10:07:09] [INFO ] Implicit Places using invariants and state equation in 1132 ms returned []
Implicit Place search using SMT with State Equation took 1717 ms to find 0 implicit places.
[2023-03-15 10:07:09] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-15 10:07:09] [INFO ] Invariant cache hit.
[2023-03-15 10:07:10] [INFO ] Dead Transitions using invariants and state equation in 934 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 398/433 places, 765/828 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2723 ms. Remains : 398/433 places, 765/828 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-6A-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (NEQ s324 1) (NEQ s370 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 365 reset in 738 ms.
Stack based approach found an accepted trace after 49984 steps with 195 reset with depth 120 and stack size 120 in 282 ms.
FORMULA NoC3x3-PT-6A-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-6A-LTLFireability-08 finished in 3897 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((F(p0)&&X(p1)))||G(p2))))'
Support contains 6 out of 433 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 433/433 places, 828/828 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 424 transition count 792
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 424 transition count 792
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 0 with 38 rules applied. Total rules applied 56 place count 405 transition count 773
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 62 place count 402 transition count 798
Applied a total of 62 rules in 31 ms. Remains 402 /433 variables (removed 31) and now considering 798/828 (removed 30) transitions.
[2023-03-15 10:07:11] [INFO ] Flow matrix only has 797 transitions (discarded 1 similar events)
// Phase 1: matrix 797 rows 402 cols
[2023-03-15 10:07:11] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-15 10:07:12] [INFO ] Implicit Places using invariants in 546 ms returned [172]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 548 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 401/433 places, 798/828 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 397 transition count 794
Applied a total of 8 rules in 27 ms. Remains 397 /401 variables (removed 4) and now considering 794/798 (removed 4) transitions.
[2023-03-15 10:07:12] [INFO ] Flow matrix only has 793 transitions (discarded 1 similar events)
// Phase 1: matrix 793 rows 397 cols
[2023-03-15 10:07:12] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-15 10:07:12] [INFO ] Implicit Places using invariants in 574 ms returned []
[2023-03-15 10:07:12] [INFO ] Flow matrix only has 793 transitions (discarded 1 similar events)
[2023-03-15 10:07:12] [INFO ] Invariant cache hit.
[2023-03-15 10:07:13] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-15 10:07:13] [INFO ] Implicit Places using invariants and state equation in 1278 ms returned []
Implicit Place search using SMT with State Equation took 1862 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 397/433 places, 794/828 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2475 ms. Remains : 397/433 places, 794/828 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-6A-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p2 p1), acceptance={} source=0 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p2:(AND (EQ s116 1) (EQ s146 1) (OR (EQ s147 0) (EQ s216 0))), p1:(AND (EQ s163 1) (EQ s262 1)), p0:(AND (EQ s116 1) (EQ s146 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 307 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-6A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6A-LTLFireability-10 finished in 2622 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)||G(p1))))'
Support contains 3 out of 433 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 433/433 places, 828/828 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 423 transition count 787
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 423 transition count 787
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 60 place count 403 transition count 767
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 66 place count 400 transition count 792
Applied a total of 66 rules in 46 ms. Remains 400 /433 variables (removed 33) and now considering 792/828 (removed 36) transitions.
// Phase 1: matrix 792 rows 400 cols
[2023-03-15 10:07:14] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-15 10:07:14] [INFO ] Implicit Places using invariants in 618 ms returned [171]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 620 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 399/433 places, 792/828 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 395 transition count 788
Applied a total of 8 rules in 25 ms. Remains 395 /399 variables (removed 4) and now considering 788/792 (removed 4) transitions.
// Phase 1: matrix 788 rows 395 cols
[2023-03-15 10:07:14] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-15 10:07:15] [INFO ] Implicit Places using invariants in 611 ms returned []
[2023-03-15 10:07:15] [INFO ] Invariant cache hit.
[2023-03-15 10:07:15] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-15 10:07:16] [INFO ] Implicit Places using invariants and state equation in 1257 ms returned []
Implicit Place search using SMT with State Equation took 1870 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 395/433 places, 788/828 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2563 ms. Remains : 395/433 places, 788/828 transitions.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-6A-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s258 1), p1:(AND (EQ s323 1) (EQ s364 1))], nbAcceptance=2, 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 264 steps with 0 reset in 3 ms.
FORMULA NoC3x3-PT-6A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6A-LTLFireability-11 finished in 2656 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((p0||(p1 U p2)))))'
Support contains 5 out of 433 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 828/828 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 425 transition count 795
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 425 transition count 795
Applied a total of 16 rules in 14 ms. Remains 425 /433 variables (removed 8) and now considering 795/828 (removed 33) transitions.
[2023-03-15 10:07:16] [INFO ] Flow matrix only has 794 transitions (discarded 1 similar events)
// Phase 1: matrix 794 rows 425 cols
[2023-03-15 10:07:16] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-15 10:07:17] [INFO ] Implicit Places using invariants in 620 ms returned [185]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 622 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 424/433 places, 795/828 transitions.
Applied a total of 0 rules in 7 ms. Remains 424 /424 variables (removed 0) and now considering 795/795 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 643 ms. Remains : 424/433 places, 795/828 transitions.
Stuttering acceptance computed with spot in 256 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), true, (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-6A-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=4, aps=[p2:(AND (EQ s175 1) (EQ s225 1) (EQ s61 1) (EQ s87 1)), p1:(AND (EQ s175 1) (EQ s225 1)), p0:(EQ s326 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-6A-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6A-LTLFireability-15 finished in 925 ms.
All properties solved by simple procedures.
Total runtime 136653 ms.

BK_STOP 1678874838621

--------------------
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-6A"
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-6A, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r261-smll-167863536200308"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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