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.r265-smll-167863539900308.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 ltsminxred
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 r265-smll-167863539900308
=====================================================================

--------------------
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 1678935679850

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=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-6A
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-16 03:01:22] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-16 03:01:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-16 03:01:22] [INFO ] Load time of PNML (sax parser for PT used): 167 ms
[2023-03-16 03:01:22] [INFO ] Transformed 512 places.
[2023-03-16 03:01:22] [INFO ] Transformed 1117 transitions.
[2023-03-16 03:01:22] [INFO ] Found NUPN structural information;
[2023-03-16 03:01:22] [INFO ] Parsed PT model containing 512 places and 1117 transitions and 4279 arcs in 285 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 12 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 105 ms. Remains 441 /512 variables (removed 71) and now considering 828/1117 (removed 289) transitions.
[2023-03-16 03:01:22] [INFO ] Flow matrix only has 823 transitions (discarded 5 similar events)
// Phase 1: matrix 823 rows 441 cols
[2023-03-16 03:01:23] [INFO ] Computed 66 place invariants in 37 ms
[2023-03-16 03:01:23] [INFO ] Implicit Places using invariants in 755 ms returned [11, 46, 95, 133, 283, 334, 371, 423]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 798 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 12 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 916 ms. Remains : 433/512 places, 828/1117 transitions.
Support contains 41 out of 433 places after structural reductions.
[2023-03-16 03:01:24] [INFO ] Flatten gal took : 156 ms
[2023-03-16 03:01:24] [INFO ] Flatten gal took : 90 ms
[2023-03-16 03:01:24] [INFO ] Input system was already deterministic with 828 transitions.
Incomplete random walk after 10000 steps, including 26 resets, run finished after 623 ms. (steps per millisecond=16 ) properties (out of 22) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-16 03:01:25] [INFO ] Flow matrix only has 823 transitions (discarded 5 similar events)
// Phase 1: matrix 823 rows 433 cols
[2023-03-16 03:01:25] [INFO ] Computed 58 place invariants in 7 ms
[2023-03-16 03:01:25] [INFO ] [Real]Absence check using 58 positive place invariants in 18 ms returned sat
[2023-03-16 03:01:25] [INFO ] After 585ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 03:01:25] [INFO ] [Nat]Absence check using 58 positive place invariants in 24 ms returned sat
[2023-03-16 03:01:26] [INFO ] After 423ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 03:01:26] [INFO ] State equation strengthened by 21 read => feed constraints.
[2023-03-16 03:01:26] [INFO ] After 144ms SMT Verify possible using 21 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 03:01:26] [INFO ] After 249ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 98 ms.
[2023-03-16 03:01:26] [INFO ] After 955ms 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 1 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 2 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 138 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 138 ms. Remains : 378/433 places, 776/828 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 452644 steps, run timeout after 3001 ms. (steps per millisecond=150 ) properties seen :{}
Probabilistic random walk after 452644 steps, saw 300904 distinct states, run finished after 3007 ms. (steps per millisecond=150 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 03:01:29] [INFO ] Flow matrix only has 775 transitions (discarded 1 similar events)
// Phase 1: matrix 775 rows 378 cols
[2023-03-16 03:01:29] [INFO ] Computed 58 place invariants in 5 ms
[2023-03-16 03:01:30] [INFO ] [Real]Absence check using 58 positive place invariants in 21 ms returned sat
[2023-03-16 03:01:30] [INFO ] After 473ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 03:01:30] [INFO ] [Nat]Absence check using 58 positive place invariants in 23 ms returned sat
[2023-03-16 03:01:30] [INFO ] After 395ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 03:01:30] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-16 03:01:31] [INFO ] After 109ms SMT Verify possible using 41 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 03:01:31] [INFO ] After 237ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 59 ms.
[2023-03-16 03:01:31] [INFO ] After 815ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 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 29 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 29 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 22 ms. Remains 378 /378 variables (removed 0) and now considering 776/776 (removed 0) transitions.
[2023-03-16 03:01:31] [INFO ] Flow matrix only has 775 transitions (discarded 1 similar events)
[2023-03-16 03:01:31] [INFO ] Invariant cache hit.
[2023-03-16 03:01:31] [INFO ] Implicit Places using invariants in 307 ms returned [166]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 312 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 1 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-16 03:01:31] [INFO ] Flow matrix only has 771 transitions (discarded 1 similar events)
// Phase 1: matrix 771 rows 373 cols
[2023-03-16 03:01:31] [INFO ] Computed 57 place invariants in 4 ms
[2023-03-16 03:01:32] [INFO ] Implicit Places using invariants in 400 ms returned []
[2023-03-16 03:01:32] [INFO ] Flow matrix only has 771 transitions (discarded 1 similar events)
[2023-03-16 03:01:32] [INFO ] Invariant cache hit.
[2023-03-16 03:01:32] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-16 03:01:32] [INFO ] Implicit Places using invariants and state equation in 802 ms returned []
Implicit Place search using SMT with State Equation took 1204 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 1567 ms. Remains : 373/378 places, 772/776 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 477535 steps, run timeout after 3001 ms. (steps per millisecond=159 ) properties seen :{}
Probabilistic random walk after 477535 steps, saw 375367 distinct states, run finished after 3001 ms. (steps per millisecond=159 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-16 03:01:35] [INFO ] Flow matrix only has 771 transitions (discarded 1 similar events)
[2023-03-16 03:01:35] [INFO ] Invariant cache hit.
[2023-03-16 03:01:36] [INFO ] [Real]Absence check using 57 positive place invariants in 18 ms returned sat
[2023-03-16 03:01:36] [INFO ] After 430ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 03:01:36] [INFO ] [Nat]Absence check using 57 positive place invariants in 18 ms returned sat
[2023-03-16 03:01:36] [INFO ] After 406ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 03:01:36] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-16 03:01:37] [INFO ] After 127ms SMT Verify possible using 41 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-16 03:01:37] [INFO ] After 228ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-16 03:01:37] [INFO ] After 848ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 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 32 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 32 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 17 ms. Remains 373 /373 variables (removed 0) and now considering 772/772 (removed 0) transitions.
[2023-03-16 03:01:37] [INFO ] Flow matrix only has 771 transitions (discarded 1 similar events)
[2023-03-16 03:01:37] [INFO ] Invariant cache hit.
[2023-03-16 03:01:38] [INFO ] Implicit Places using invariants in 1087 ms returned []
[2023-03-16 03:01:38] [INFO ] Flow matrix only has 771 transitions (discarded 1 similar events)
[2023-03-16 03:01:38] [INFO ] Invariant cache hit.
[2023-03-16 03:01:38] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-16 03:01:39] [INFO ] Implicit Places using invariants and state equation in 753 ms returned []
Implicit Place search using SMT with State Equation took 1867 ms to find 0 implicit places.
[2023-03-16 03:01:39] [INFO ] Redundant transitions in 60 ms returned []
[2023-03-16 03:01:39] [INFO ] Flow matrix only has 771 transitions (discarded 1 similar events)
[2023-03-16 03:01:39] [INFO ] Invariant cache hit.
[2023-03-16 03:01:39] [INFO ] Dead Transitions using invariants and state equation in 573 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2540 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 52 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-16 03:01:39] [INFO ] Computed 57 place invariants in 5 ms
[2023-03-16 03:01:40] [INFO ] [Real]Absence check using 57 positive place invariants in 102 ms returned sat
[2023-03-16 03:01:40] [INFO ] After 719ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-16 03:01:40] [INFO ] [Nat]Absence check using 57 positive place invariants in 20 ms returned sat
[2023-03-16 03:01:41] [INFO ] After 359ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-16 03:01:41] [INFO ] After 458ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 70 ms.
[2023-03-16 03:01:41] [INFO ] After 629ms 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 0 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 74 ms. Remains 400 /433 variables (removed 33) and now considering 792/828 (removed 36) transitions.
// Phase 1: matrix 792 rows 400 cols
[2023-03-16 03:01:41] [INFO ] Computed 58 place invariants in 5 ms
[2023-03-16 03:01:42] [INFO ] Implicit Places using invariants in 402 ms returned []
[2023-03-16 03:01:42] [INFO ] Invariant cache hit.
[2023-03-16 03:01:42] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-16 03:01:42] [INFO ] Implicit Places using invariants and state equation in 869 ms returned []
Implicit Place search using SMT with State Equation took 1288 ms to find 0 implicit places.
[2023-03-16 03:01:43] [INFO ] Redundant transitions in 17 ms returned []
[2023-03-16 03:01:43] [INFO ] Invariant cache hit.
[2023-03-16 03:01:43] [INFO ] Dead Transitions using invariants and state equation in 553 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 1955 ms. Remains : 400/433 places, 792/828 transitions.
Stuttering acceptance computed with spot in 216 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 265 steps with 0 reset in 8 ms.
FORMULA NoC3x3-PT-6A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6A-LTLFireability-00 finished in 2266 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 11 ms. Remains 424 /433 variables (removed 9) and now considering 791/828 (removed 37) transitions.
[2023-03-16 03:01:43] [INFO ] Flow matrix only has 790 transitions (discarded 1 similar events)
// Phase 1: matrix 790 rows 424 cols
[2023-03-16 03:01:43] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-16 03:01:44] [INFO ] Implicit Places using invariants in 458 ms returned [184]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 461 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 4 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 478 ms. Remains : 423/433 places, 791/828 transitions.
Stuttering acceptance computed with spot in 209 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 236 steps with 0 reset in 7 ms.
FORMULA NoC3x3-PT-6A-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6A-LTLFireability-01 finished in 723 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 10 ms. Remains 423 /433 variables (removed 10) and now considering 787/828 (removed 41) transitions.
// Phase 1: matrix 787 rows 423 cols
[2023-03-16 03:01:44] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-16 03:01:44] [INFO ] Implicit Places using invariants in 430 ms returned [183]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 446 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 5 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 461 ms. Remains : 422/433 places, 787/828 transitions.
Stuttering acceptance computed with spot in 168 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 647 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 15 ms. Remains 425 /433 variables (removed 8) and now considering 792/828 (removed 36) transitions.
// Phase 1: matrix 792 rows 425 cols
[2023-03-16 03:01:45] [INFO ] Computed 58 place invariants in 8 ms
[2023-03-16 03:01:45] [INFO ] Implicit Places using invariants in 441 ms returned [184]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 454 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 5 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 479 ms. Remains : 424/433 places, 792/828 transitions.
Stuttering acceptance computed with spot in 125 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 1952 ms.
Product exploration explored 100000 steps with 50000 reset in 1806 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 133 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 4532 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 39 ms. Remains 401 /433 variables (removed 32) and now considering 799/828 (removed 29) transitions.
[2023-03-16 03:01:49] [INFO ] Flow matrix only has 797 transitions (discarded 2 similar events)
// Phase 1: matrix 797 rows 401 cols
[2023-03-16 03:01:49] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-16 03:01:50] [INFO ] Implicit Places using invariants in 348 ms returned [173]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 364 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 40 ms. Remains 397 /400 variables (removed 3) and now considering 796/799 (removed 3) transitions.
[2023-03-16 03:01:50] [INFO ] Flow matrix only has 794 transitions (discarded 2 similar events)
// Phase 1: matrix 794 rows 397 cols
[2023-03-16 03:01:50] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-16 03:01:50] [INFO ] Implicit Places using invariants in 305 ms returned []
[2023-03-16 03:01:50] [INFO ] Flow matrix only has 794 transitions (discarded 2 similar events)
[2023-03-16 03:01:50] [INFO ] Invariant cache hit.
[2023-03-16 03:01:50] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-16 03:01:51] [INFO ] Implicit Places using invariants and state equation in 845 ms returned []
Implicit Place search using SMT with State Equation took 1157 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 1602 ms. Remains : 397/433 places, 796/828 transitions.
Stuttering acceptance computed with spot in 50 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 306 reset in 525 ms.
Product exploration explored 100000 steps with 308 reset in 625 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 390 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 40 ms :[(AND (NOT p0) (NOT p1))]
Finished random walk after 7904 steps, including 23 resets, run visited all 4 properties in 136 ms. (steps per millisecond=58 )
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)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 472 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 38 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 37 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 14 ms. Remains 397 /397 variables (removed 0) and now considering 796/796 (removed 0) transitions.
[2023-03-16 03:01:53] [INFO ] Flow matrix only has 794 transitions (discarded 2 similar events)
[2023-03-16 03:01:53] [INFO ] Invariant cache hit.
[2023-03-16 03:01:54] [INFO ] Implicit Places using invariants in 415 ms returned []
[2023-03-16 03:01:54] [INFO ] Flow matrix only has 794 transitions (discarded 2 similar events)
[2023-03-16 03:01:54] [INFO ] Invariant cache hit.
[2023-03-16 03:01:54] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-16 03:01:54] [INFO ] Implicit Places using invariants and state equation in 865 ms returned []
Implicit Place search using SMT with State Equation took 1286 ms to find 0 implicit places.
[2023-03-16 03:01:55] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-16 03:01:55] [INFO ] Flow matrix only has 794 transitions (discarded 2 similar events)
[2023-03-16 03:01:55] [INFO ] Invariant cache hit.
[2023-03-16 03:01:55] [INFO ] Dead Transitions using invariants and state equation in 520 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1843 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 375 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 36 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 29 resets, run finished after 179 ms. (steps per millisecond=55 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-16 03:01:56] [INFO ] Flow matrix only has 794 transitions (discarded 2 similar events)
[2023-03-16 03:01:56] [INFO ] Invariant cache hit.
[2023-03-16 03:01:56] [INFO ] [Real]Absence check using 57 positive place invariants in 20 ms returned sat
[2023-03-16 03:01:56] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 03:01:56] [INFO ] [Nat]Absence check using 57 positive place invariants in 19 ms returned sat
[2023-03-16 03:01:56] [INFO ] After 424ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 03:01:56] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-16 03:01:57] [INFO ] After 174ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 03:01:57] [INFO ] After 340ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 135 ms.
[2023-03-16 03:01:57] [INFO ] After 1027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 22 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 31 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 158 ms. (steps per millisecond=63 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 224407 steps, run timeout after 3016 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 224407 steps, saw 197208 distinct states, run finished after 3016 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-16 03:02:00] [INFO ] Flow matrix only has 771 transitions (discarded 2 similar events)
// Phase 1: matrix 771 rows 374 cols
[2023-03-16 03:02:00] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-16 03:02:00] [INFO ] [Real]Absence check using 57 positive place invariants in 20 ms returned sat
[2023-03-16 03:02:00] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 03:02:00] [INFO ] [Nat]Absence check using 57 positive place invariants in 17 ms returned sat
[2023-03-16 03:02:01] [INFO ] After 403ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 03:02:01] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-16 03:02:01] [INFO ] After 213ms SMT Verify possible using 40 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-16 03:02:01] [INFO ] After 377ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 166 ms.
[2023-03-16 03:02:01] [INFO ] After 1066ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 35 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 15 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 16 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 12 ms. Remains 374 /374 variables (removed 0) and now considering 773/773 (removed 0) transitions.
[2023-03-16 03:02:01] [INFO ] Flow matrix only has 771 transitions (discarded 2 similar events)
[2023-03-16 03:02:01] [INFO ] Invariant cache hit.
[2023-03-16 03:02:02] [INFO ] Implicit Places using invariants in 391 ms returned []
[2023-03-16 03:02:02] [INFO ] Flow matrix only has 771 transitions (discarded 2 similar events)
[2023-03-16 03:02:02] [INFO ] Invariant cache hit.
[2023-03-16 03:02:02] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-16 03:02:03] [INFO ] Implicit Places using invariants and state equation in 813 ms returned []
Implicit Place search using SMT with State Equation took 1206 ms to find 0 implicit places.
[2023-03-16 03:02:03] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-16 03:02:03] [INFO ] Flow matrix only has 771 transitions (discarded 2 similar events)
[2023-03-16 03:02:03] [INFO ] Invariant cache hit.
[2023-03-16 03:02:03] [INFO ] Dead Transitions using invariants and state equation in 573 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1813 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 22 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-16 03:02:03] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-16 03:02:03] [INFO ] [Real]Absence check using 57 positive place invariants in 19 ms returned sat
[2023-03-16 03:02:03] [INFO ] After 112ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-16 03:02:03] [INFO ] [Nat]Absence check using 57 positive place invariants in 18 ms returned sat
[2023-03-16 03:02:04] [INFO ] After 431ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-16 03:02:04] [INFO ] After 604ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 103 ms.
[2023-03-16 03:02:04] [INFO ] After 820ms 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 424 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 38 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 38 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 311 reset in 457 ms.
Product exploration explored 100000 steps with 304 reset in 506 ms.
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 11 ms. Remains 397 /397 variables (removed 0) and now considering 796/796 (removed 0) transitions.
[2023-03-16 03:02:06] [INFO ] Flow matrix only has 794 transitions (discarded 2 similar events)
// Phase 1: matrix 794 rows 397 cols
[2023-03-16 03:02:06] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-16 03:02:06] [INFO ] Implicit Places using invariants in 420 ms returned []
[2023-03-16 03:02:06] [INFO ] Flow matrix only has 794 transitions (discarded 2 similar events)
[2023-03-16 03:02:06] [INFO ] Invariant cache hit.
[2023-03-16 03:02:07] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-16 03:02:07] [INFO ] Implicit Places using invariants and state equation in 940 ms returned []
Implicit Place search using SMT with State Equation took 1362 ms to find 0 implicit places.
[2023-03-16 03:02:07] [INFO ] Redundant transitions in 14 ms returned []
[2023-03-16 03:02:07] [INFO ] Flow matrix only has 794 transitions (discarded 2 similar events)
[2023-03-16 03:02:07] [INFO ] Invariant cache hit.
[2023-03-16 03:02:08] [INFO ] Dead Transitions using invariants and state equation in 500 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1897 ms. Remains : 397/397 places, 796/796 transitions.
Treatment of property NoC3x3-PT-6A-LTLFireability-05 finished in 18509 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 9 ms. Remains 425 /433 variables (removed 8) and now considering 796/828 (removed 32) transitions.
// Phase 1: matrix 796 rows 425 cols
[2023-03-16 03:02:08] [INFO ] Computed 58 place invariants in 6 ms
[2023-03-16 03:02:08] [INFO ] Implicit Places using invariants in 287 ms returned [184]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 290 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 4 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 305 ms. Remains : 424/433 places, 796/828 transitions.
Stuttering acceptance computed with spot in 260 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 580 steps with 1 reset in 3 ms.
FORMULA NoC3x3-PT-6A-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-6A-LTLFireability-06 finished in 592 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 9 ms. Remains 423 /433 variables (removed 10) and now considering 787/828 (removed 41) transitions.
// Phase 1: matrix 787 rows 423 cols
[2023-03-16 03:02:08] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-16 03:02:09] [INFO ] Implicit Places using invariants in 414 ms returned [183]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 416 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 4 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 432 ms. Remains : 422/433 places, 787/828 transitions.
Stuttering acceptance computed with spot in 86 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 535 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 28 ms. Remains 398 /433 variables (removed 35) and now considering 765/828 (removed 63) transitions.
// Phase 1: matrix 765 rows 398 cols
[2023-03-16 03:02:09] [INFO ] Computed 57 place invariants in 2 ms
[2023-03-16 03:02:09] [INFO ] Implicit Places using invariants in 376 ms returned []
[2023-03-16 03:02:09] [INFO ] Invariant cache hit.
[2023-03-16 03:02:10] [INFO ] State equation strengthened by 17 read => feed constraints.
[2023-03-16 03:02:10] [INFO ] Implicit Places using invariants and state equation in 770 ms returned []
Implicit Place search using SMT with State Equation took 1151 ms to find 0 implicit places.
[2023-03-16 03:02:10] [INFO ] Redundant transitions in 13 ms returned []
[2023-03-16 03:02:10] [INFO ] Invariant cache hit.
[2023-03-16 03:02:11] [INFO ] Dead Transitions using invariants and state equation in 494 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 1697 ms. Remains : 398/433 places, 765/828 transitions.
Stuttering acceptance computed with spot in 74 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 385 reset in 462 ms.
Stack based approach found an accepted trace after 36787 steps with 143 reset with depth 69 and stack size 69 in 165 ms.
FORMULA NoC3x3-PT-6A-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-6A-LTLFireability-08 finished in 2413 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 36 ms. Remains 402 /433 variables (removed 31) and now considering 798/828 (removed 30) transitions.
[2023-03-16 03:02:11] [INFO ] Flow matrix only has 797 transitions (discarded 1 similar events)
// Phase 1: matrix 797 rows 402 cols
[2023-03-16 03:02:11] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-16 03:02:12] [INFO ] Implicit Places using invariants in 405 ms returned [172]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 407 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 0 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 18 ms. Remains 397 /401 variables (removed 4) and now considering 794/798 (removed 4) transitions.
[2023-03-16 03:02:12] [INFO ] Flow matrix only has 793 transitions (discarded 1 similar events)
// Phase 1: matrix 793 rows 397 cols
[2023-03-16 03:02:12] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-16 03:02:12] [INFO ] Implicit Places using invariants in 383 ms returned []
[2023-03-16 03:02:12] [INFO ] Flow matrix only has 793 transitions (discarded 1 similar events)
[2023-03-16 03:02:12] [INFO ] Invariant cache hit.
[2023-03-16 03:02:12] [INFO ] State equation strengthened by 40 read => feed constraints.
[2023-03-16 03:02:13] [INFO ] Implicit Places using invariants and state equation in 829 ms returned []
Implicit Place search using SMT with State Equation took 1215 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 1678 ms. Remains : 397/433 places, 794/828 transitions.
Stuttering acceptance computed with spot in 86 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 223 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 1788 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 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 31 ms. Remains 400 /433 variables (removed 33) and now considering 792/828 (removed 36) transitions.
// Phase 1: matrix 792 rows 400 cols
[2023-03-16 03:02:13] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-16 03:02:14] [INFO ] Implicit Places using invariants in 401 ms returned [171]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 402 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 17 ms. Remains 395 /399 variables (removed 4) and now considering 788/792 (removed 4) transitions.
// Phase 1: matrix 788 rows 395 cols
[2023-03-16 03:02:14] [INFO ] Computed 57 place invariants in 3 ms
[2023-03-16 03:02:14] [INFO ] Implicit Places using invariants in 389 ms returned []
[2023-03-16 03:02:14] [INFO ] Invariant cache hit.
[2023-03-16 03:02:14] [INFO ] State equation strengthened by 41 read => feed constraints.
[2023-03-16 03:02:15] [INFO ] Implicit Places using invariants and state equation in 808 ms returned []
Implicit Place search using SMT with State Equation took 1199 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 1652 ms. Remains : 395/433 places, 788/828 transitions.
Stuttering acceptance computed with spot in 40 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 258 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 1712 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 8 ms. Remains 425 /433 variables (removed 8) and now considering 795/828 (removed 33) transitions.
[2023-03-16 03:02:15] [INFO ] Flow matrix only has 794 transitions (discarded 1 similar events)
// Phase 1: matrix 794 rows 425 cols
[2023-03-16 03:02:15] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-16 03:02:15] [INFO ] Implicit Places using invariants in 413 ms returned [185]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 428 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 4 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 442 ms. Remains : 424/433 places, 795/828 transitions.
Stuttering acceptance computed with spot in 188 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 647 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))))'
[2023-03-16 03:02:16] [INFO ] Flatten gal took : 105 ms
[2023-03-16 03:02:16] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-16 03:02:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 433 places, 828 transitions and 3121 arcs took 23 ms.
Total runtime 53971 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1004/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : NoC3x3-PT-6A-LTLFireability-05

BK_STOP 1678935738269

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name NoC3x3-PT-6A-LTLFireability-05
ltl formula formula --ltl=/tmp/1004/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 433 places, 828 transitions and 3121 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.210 real 0.040 user 0.030 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1004/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1004/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1004/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1004/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
malloc_consolidate(): invalid chunk size

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="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
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 r265-smll-167863539900308"
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 ;