Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 6.6K Jun 7 17:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Jun 7 17:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 7 17:08 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Jun 7 17:08 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Jun 6 15:33 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Jun 6 15:33 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 6 15:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 6 15:33 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 6 12:11 NewModel
-rw-r--r-- 1 mcc users 9.9K Jun 7 17:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Jun 7 17:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Jun 7 17:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 116K Jun 7 17:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 6 15:33 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 6 15:33 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 equiv_col
-rw-r--r-- 1 mcc users 4 Jun 6 12:11 instance
-rw-r--r-- 1 mcc users 6 Jun 6 12:11 iscolored
-rw-r--r-- 1 mcc users 3.7M Jun 6 12:11 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 Szymanski-PT-b02-LTLFireability-00
FORMULA_NAME Szymanski-PT-b02-LTLFireability-01
FORMULA_NAME Szymanski-PT-b02-LTLFireability-02
FORMULA_NAME Szymanski-PT-b02-LTLFireability-03
FORMULA_NAME Szymanski-PT-b02-LTLFireability-04
FORMULA_NAME Szymanski-PT-b02-LTLFireability-05
FORMULA_NAME Szymanski-PT-b02-LTLFireability-06
FORMULA_NAME Szymanski-PT-b02-LTLFireability-07
FORMULA_NAME Szymanski-PT-b02-LTLFireability-08
FORMULA_NAME Szymanski-PT-b02-LTLFireability-09
FORMULA_NAME Szymanski-PT-b02-LTLFireability-10
FORMULA_NAME Szymanski-PT-b02-LTLFireability-11
FORMULA_NAME Szymanski-PT-b02-LTLFireability-12
FORMULA_NAME Szymanski-PT-b02-LTLFireability-13
FORMULA_NAME Szymanski-PT-b02-LTLFireability-14
FORMULA_NAME Szymanski-PT-b02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1654973495564

Running Version 202205111006
[2022-06-11 18:51:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-06-11 18:51:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-06-11 18:51:37] [INFO ] Load time of PNML (sax parser for PT used): 348 ms
[2022-06-11 18:51:37] [INFO ] Transformed 568 places.
[2022-06-11 18:51:37] [INFO ] Transformed 8320 transitions.
[2022-06-11 18:51:37] [INFO ] Parsed PT model containing 568 places and 8320 transitions in 494 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 1 formulas.
Deduced a syphon composed of 260 places in 20 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b02-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 56 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 306 transition count 8064
Applied a total of 2 rules in 140 ms. Remains 306 /308 variables (removed 2) and now considering 8064/8064 (removed 0) transitions.
[2022-06-11 18:51:37] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 18:51:37] [INFO ] Computed 1 place invariants in 50 ms
[2022-06-11 18:51:38] [INFO ] Implicit Places using invariants in 528 ms returned []
[2022-06-11 18:51:38] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 18:51:38] [INFO ] Computed 1 place invariants in 26 ms
[2022-06-11 18:51:38] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 18:51:42] [INFO ] Implicit Places using invariants and state equation in 4146 ms returned []
Implicit Place search using SMT with State Equation took 4702 ms to find 0 implicit places.
[2022-06-11 18:51:42] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 18:51:42] [INFO ] Computed 1 place invariants in 20 ms
[2022-06-11 18:51:44] [INFO ] Dead Transitions using invariants and state equation in 2153 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 306/308 places, 8064/8064 transitions.
Finished structural reductions, in 1 iterations. Remains : 306/308 places, 8064/8064 transitions.
Support contains 56 out of 306 places after structural reductions.
[2022-06-11 18:51:45] [INFO ] Flatten gal took : 478 ms
[2022-06-11 18:51:45] [INFO ] Flatten gal took : 319 ms
[2022-06-11 18:51:46] [INFO ] Input system was already deterministic with 8064 transitions.
Support contains 55 out of 306 places (down from 56) after GAL structural reductions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 649 ms. (steps per millisecond=15 ) properties (out of 31) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 30) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 29) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 28) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 27) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 26) seen :0
Running SMT prover for 26 properties.
[2022-06-11 18:51:47] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 18:51:47] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 18:51:47] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 18:52:06] [INFO ] After 18855ms SMT Verify possible using state equation in real domain returned unsat :1 sat :4 real:21
[2022-06-11 18:52:06] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 18:52:12] [INFO ] After 5763ms SMT Verify possible using 147 Read/Feed constraints in real domain returned unsat :1 sat :2 real:22
[2022-06-11 18:52:12] [INFO ] After 5765ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :2 real:22
Attempting to minimize the solution found.
Minimization took 3 ms.
[2022-06-11 18:52:12] [INFO ] After 25023ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :2 real:22
[2022-06-11 18:52:12] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 18:52:37] [INFO ] After 24669ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :24
[2022-06-11 18:52:37] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-11 18:52:37] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2 real:22
Fused 26 Parikh solutions to 20 different solutions.
Parikh walk visited 0 properties in 175 ms.
Support contains 46 out of 306 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Applied a total of 0 rules in 449 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 8064/8064 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 312 ms. (steps per millisecond=32 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 25) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Interrupted probabilistic random walk after 106722 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{10=1}
Probabilistic random walk after 106722 steps, saw 38628 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :1
Running SMT prover for 23 properties.
[2022-06-11 18:52:41] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 18:52:41] [INFO ] Computed 1 place invariants in 37 ms
[2022-06-11 18:52:42] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 18:52:59] [INFO ] After 17027ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:22
[2022-06-11 18:52:59] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 18:53:01] [INFO ] After 1846ms SMT Verify possible using 147 Read/Feed constraints in real domain returned unsat :0 sat :0 real:23
[2022-06-11 18:53:01] [INFO ] After 19189ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:23
[2022-06-11 18:53:01] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 18:53:22] [INFO ] After 21476ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :23
[2022-06-11 18:53:26] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2022-06-11 18:53:26] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:23
Parikh walk visited 0 properties in 218 ms.
Support contains 43 out of 306 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Applied a total of 0 rules in 231 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 8064/8064 transitions.
Successfully simplified 1 atomic propositions for a total of 15 simplifications.
Computed a total of 12 stabilizing places and 2432 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(p0)))'
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 103 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2022-06-11 18:53:26] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 18:53:26] [INFO ] Computed 1 place invariants in 15 ms
[2022-06-11 18:53:27] [INFO ] Implicit Places using invariants in 451 ms returned []
[2022-06-11 18:53:27] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 18:53:27] [INFO ] Computed 1 place invariants in 24 ms
[2022-06-11 18:53:27] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 18:53:33] [INFO ] Implicit Places using invariants and state equation in 6701 ms returned []
Implicit Place search using SMT with State Equation took 7160 ms to find 0 implicit places.
[2022-06-11 18:53:34] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 18:53:34] [INFO ] Computed 1 place invariants in 15 ms
[2022-06-11 18:53:35] [INFO ] Dead Transitions using invariants and state equation in 1900 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 162 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b02-LTLFireability-00 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 (GEQ s13 1) (GEQ s300 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 3 ms.
FORMULA Szymanski-PT-b02-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b02-LTLFireability-00 finished in 9407 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(p0))))'
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 425 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2022-06-11 18:53:36] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 18:53:36] [INFO ] Computed 1 place invariants in 14 ms
[2022-06-11 18:53:36] [INFO ] Implicit Places using invariants in 431 ms returned []
[2022-06-11 18:53:36] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 18:53:36] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-11 18:53:37] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 18:53:43] [INFO ] Implicit Places using invariants and state equation in 6811 ms returned []
Implicit Place search using SMT with State Equation took 7245 ms to find 0 implicit places.
[2022-06-11 18:53:44] [INFO ] Redundant transitions in 982 ms returned []
[2022-06-11 18:53:44] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 18:53:44] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-11 18:53:46] [INFO ] Dead Transitions using invariants and state equation in 1876 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b02-LTLFireability-01 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 (LT s90 1) (LT s275 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 0 reset in 601 ms.
Product exploration explored 100000 steps with 0 reset in 434 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 51 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 160943 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 160943 steps, saw 54357 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-11 18:53:51] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 18:53:51] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 18:53:51] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 18:53:52] [INFO ] After 1486ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 18:53:52] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 18:53:54] [INFO ] After 1538ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 18:53:54] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 18:54:03] [INFO ] After 9069ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2022-06-11 18:54:03] [INFO ] After 10663ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 17 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 305 transition count 7809
Applied a total of 127 rules in 206 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7936 (removed 127) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7809/7936 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 167379 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 167379 steps, saw 55781 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-11 18:54:06] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2022-06-11 18:54:06] [INFO ] Computed 2 place invariants in 19 ms
[2022-06-11 18:54:06] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-11 18:54:07] [INFO ] After 1114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 18:54:07] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-11 18:54:08] [INFO ] After 1088ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 18:54:08] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 18:54:17] [INFO ] After 9070ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2022-06-11 18:54:17] [INFO ] After 10228ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 204 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7809/7809 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 189 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
[2022-06-11 18:54:18] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2022-06-11 18:54:18] [INFO ] Computed 2 place invariants in 15 ms
[2022-06-11 18:54:18] [INFO ] Implicit Places using invariants in 445 ms returned []
[2022-06-11 18:54:18] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2022-06-11 18:54:18] [INFO ] Computed 2 place invariants in 13 ms
[2022-06-11 18:54:19] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 18:54:24] [INFO ] Implicit Places using invariants and state equation in 6208 ms returned []
Implicit Place search using SMT with State Equation took 6656 ms to find 0 implicit places.
[2022-06-11 18:54:25] [INFO ] Redundant transitions in 662 ms returned []
[2022-06-11 18:54:25] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2022-06-11 18:54:25] [INFO ] Computed 2 place invariants in 16 ms
[2022-06-11 18:54:27] [INFO ] Dead Transitions using invariants and state equation in 2057 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7809/7809 transitions.
Graph (trivial) has 5008 edges and 305 vertex of which 37 / 305 are part of one of the 2 SCC in 3 ms
Free SCC test removed 35 places
Drop transitions removed 4008 transitions
Ensure Unique test removed 1436 transitions
Reduce isomorphic transitions removed 5444 transitions.
Drop transitions removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 0 with 416 rules applied. Total rules applied 417 place count 270 transition count 1949
Applied a total of 417 rules in 193 ms. Remains 270 /305 variables (removed 35) and now considering 1949/7809 (removed 5860) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1949 rows 270 cols
[2022-06-11 18:54:27] [INFO ] Computed 2 place invariants in 8 ms
[2022-06-11 18:54:27] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-11 18:54:28] [INFO ] After 582ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 18:54:28] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-11 18:54:29] [INFO ] After 516ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 18:54:29] [INFO ] State equation strengthened by 504 read => feed constraints.
[2022-06-11 18:54:29] [INFO ] After 352ms SMT Verify possible using 504 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 18:54:30] [INFO ] After 1365ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2022-06-11 18:54:30] [INFO ] After 1997ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-11 18:54:30] [INFO ] Flatten gal took : 74 ms
[2022-06-11 18:54:30] [INFO ] Flatten gal took : 66 ms
[2022-06-11 18:54:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16893777691317394313.gal : 86 ms
[2022-06-11 18:54:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6646351923286319999.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms13686329729466669854;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16893777691317394313.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6646351923286319999.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality6646351923286319999.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 41
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :41 after 486
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :486 after 949
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :949 after 1019
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1019 after 1120
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1120 after 1748
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1748 after 2004
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2004 after 2346
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2346 after 2902
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2902 after 4879
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 4097 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,12534,6.61809,153144,2,4444,17,151976,6,0,3031,151393,0
Total reachable state count : 12534

Verifying 1 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,10,6.6278,153144,2,297,17,151976,7,0,3036,151393,0
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 193 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2022-06-11 18:54:37] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 18:54:37] [INFO ] Computed 1 place invariants in 22 ms
[2022-06-11 18:54:38] [INFO ] Implicit Places using invariants in 421 ms returned []
[2022-06-11 18:54:38] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 18:54:38] [INFO ] Computed 1 place invariants in 14 ms
[2022-06-11 18:54:38] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 18:54:45] [INFO ] Implicit Places using invariants and state equation in 6971 ms returned []
Implicit Place search using SMT with State Equation took 7397 ms to find 0 implicit places.
[2022-06-11 18:54:46] [INFO ] Redundant transitions in 883 ms returned []
[2022-06-11 18:54:46] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 18:54:46] [INFO ] Computed 1 place invariants in 20 ms
[2022-06-11 18:54:48] [INFO ] Dead Transitions using invariants and state equation in 2065 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 163926 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :{}
Probabilistic random walk after 163926 steps, saw 55070 distinct states, run finished after 3001 ms. (steps per millisecond=54 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-11 18:54:51] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 18:54:51] [INFO ] Computed 1 place invariants in 21 ms
[2022-06-11 18:54:51] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 18:54:53] [INFO ] After 1586ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 18:54:53] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 18:54:54] [INFO ] After 1626ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 18:54:54] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 18:55:03] [INFO ] After 9070ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2022-06-11 18:55:03] [INFO ] After 10764ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 15 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 305 transition count 7809
Applied a total of 127 rules in 231 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7936 (removed 127) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7809/7936 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 167370 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 167370 steps, saw 55781 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-11 18:55:07] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2022-06-11 18:55:07] [INFO ] Computed 2 place invariants in 21 ms
[2022-06-11 18:55:07] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-11 18:55:08] [INFO ] After 1166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 18:55:08] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-11 18:55:09] [INFO ] After 1067ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 18:55:09] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 18:55:18] [INFO ] After 9095ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2022-06-11 18:55:18] [INFO ] After 10229ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 13 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 187 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7809/7809 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 199 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
[2022-06-11 18:55:18] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2022-06-11 18:55:18] [INFO ] Computed 2 place invariants in 17 ms
[2022-06-11 18:55:19] [INFO ] Implicit Places using invariants in 435 ms returned []
[2022-06-11 18:55:19] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2022-06-11 18:55:19] [INFO ] Computed 2 place invariants in 17 ms
[2022-06-11 18:55:19] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 18:55:27] [INFO ] Implicit Places using invariants and state equation in 8532 ms returned []
Implicit Place search using SMT with State Equation took 8967 ms to find 0 implicit places.
[2022-06-11 18:55:28] [INFO ] Redundant transitions in 625 ms returned []
[2022-06-11 18:55:28] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2022-06-11 18:55:28] [INFO ] Computed 2 place invariants in 18 ms
[2022-06-11 18:55:30] [INFO ] Dead Transitions using invariants and state equation in 1829 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7809/7809 transitions.
Graph (trivial) has 5008 edges and 305 vertex of which 37 / 305 are part of one of the 2 SCC in 1 ms
Free SCC test removed 35 places
Drop transitions removed 4008 transitions
Ensure Unique test removed 1436 transitions
Reduce isomorphic transitions removed 5444 transitions.
Drop transitions removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 0 with 416 rules applied. Total rules applied 417 place count 270 transition count 1949
Applied a total of 417 rules in 132 ms. Remains 270 /305 variables (removed 35) and now considering 1949/7809 (removed 5860) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1949 rows 270 cols
[2022-06-11 18:55:30] [INFO ] Computed 2 place invariants in 12 ms
[2022-06-11 18:55:30] [INFO ] [Real]Absence check using 0 positive and 2 generalized place invariants in 2 ms returned sat
[2022-06-11 18:55:31] [INFO ] After 567ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 18:55:31] [INFO ] [Nat]Absence check using 0 positive and 2 generalized place invariants in 3 ms returned sat
[2022-06-11 18:55:31] [INFO ] After 522ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 18:55:31] [INFO ] State equation strengthened by 504 read => feed constraints.
[2022-06-11 18:55:32] [INFO ] After 354ms SMT Verify possible using 504 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 18:55:33] [INFO ] After 1383ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2022-06-11 18:55:33] [INFO ] After 2007ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-11 18:55:33] [INFO ] Flatten gal took : 65 ms
[2022-06-11 18:55:33] [INFO ] Flatten gal took : 64 ms
[2022-06-11 18:55:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7720552549444991657.gal : 8 ms
[2022-06-11 18:55:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3667813534941095715.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms4416319882002198021;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality7720552549444991657.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3667813534941095715.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality3667813534941095715.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 41
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :41 after 486
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :486 after 949
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :949 after 1019
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1019 after 1120
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1120 after 1748
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1748 after 2004
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2004 after 2346
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2346 after 2902
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2902 after 4879
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 4097 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,12534,5.7226,153144,2,4444,17,151976,6,0,3031,151393,0
Total reachable state count : 12534

Verifying 1 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,10,5.7317,153144,2,297,17,151976,7,0,3036,151393,0
ITS tools runner thread asked to quit. Dying gracefully.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 52 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 407 ms.
Product exploration explored 100000 steps with 0 reset in 425 ms.
Built C files in :
/tmp/ltsmin11940455550134683622
[2022-06-11 18:55:40] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2022-06-11 18:55:40] [INFO ] Built C files in 89ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11940455550134683622
Running compilation step : cd /tmp/ltsmin11940455550134683622;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11940455550134683622;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11940455550134683622;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 190 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2022-06-11 18:55:43] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 18:55:43] [INFO ] Computed 1 place invariants in 23 ms
[2022-06-11 18:55:43] [INFO ] Implicit Places using invariants in 437 ms returned []
[2022-06-11 18:55:43] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 18:55:43] [INFO ] Computed 1 place invariants in 17 ms
[2022-06-11 18:55:44] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 18:55:51] [INFO ] Implicit Places using invariants and state equation in 7093 ms returned []
Implicit Place search using SMT with State Equation took 7532 ms to find 0 implicit places.
[2022-06-11 18:55:51] [INFO ] Redundant transitions in 651 ms returned []
[2022-06-11 18:55:51] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 18:55:51] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-11 18:55:53] [INFO ] Dead Transitions using invariants and state equation in 1837 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7936/7936 transitions.
Built C files in :
/tmp/ltsmin253691448704982940
[2022-06-11 18:55:53] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2022-06-11 18:55:53] [INFO ] Built C files in 96ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin253691448704982940
Running compilation step : cd /tmp/ltsmin253691448704982940;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin253691448704982940;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin253691448704982940;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-11 18:55:57] [INFO ] Flatten gal took : 253 ms
[2022-06-11 18:55:57] [INFO ] Flatten gal took : 230 ms
[2022-06-11 18:55:57] [INFO ] Time to serialize gal into /tmp/LTL17809751529290131512.gal : 28 ms
[2022-06-11 18:55:57] [INFO ] Time to serialize properties into /tmp/LTL12333793888426551614.ltl : 56 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17809751529290131512.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12333793888426551614.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1780975...268
Read 1 LTL properties
Checking formula 0 : !((F(G(F("((p90<1)||(l19<1))")))))
Formula 0 simplified : !FGF"((p90<1)||(l19<1))"
Detected timeout of ITS tools.
[2022-06-11 18:56:12] [INFO ] Flatten gal took : 218 ms
[2022-06-11 18:56:12] [INFO ] Applying decomposition
[2022-06-11 18:56:13] [INFO ] Flatten gal took : 222 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16205859258412529766.txt' '-o' '/tmp/graph16205859258412529766.bin' '-w' '/tmp/graph16205859258412529766.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16205859258412529766.bin' '-l' '-1' '-v' '-w' '/tmp/graph16205859258412529766.weights' '-q' '0' '-e' '0.001'
[2022-06-11 18:56:13] [INFO ] Decomposing Gal with order
[2022-06-11 18:56:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 18:56:14] [INFO ] Removed a total of 18365 redundant transitions.
[2022-06-11 18:56:14] [INFO ] Flatten gal took : 763 ms
[2022-06-11 18:56:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 1068 labels/synchronizations in 321 ms.
[2022-06-11 18:56:14] [INFO ] Time to serialize gal into /tmp/LTL12025044332931859478.gal : 27 ms
[2022-06-11 18:56:14] [INFO ] Time to serialize properties into /tmp/LTL15433935133090753129.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12025044332931859478.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15433935133090753129.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1202504...247
Read 1 LTL properties
Checking formula 0 : !((F(G(F("((i8.i0.u29.p90<1)||(i3.u52.l19<1))")))))
Formula 0 simplified : !FGF"((i8.i0.u29.p90<1)||(i3.u52.l19<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin429454225458123742
[2022-06-11 18:56:30] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin429454225458123742
Running compilation step : cd /tmp/ltsmin429454225458123742;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin429454225458123742;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin429454225458123742;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property Szymanski-PT-b02-LTLFireability-01 finished in 176963 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(X(G(p1)))))'
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 56 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2022-06-11 18:56:33] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 18:56:33] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-11 18:56:33] [INFO ] Implicit Places using invariants in 460 ms returned []
[2022-06-11 18:56:33] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 18:56:33] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 18:56:34] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 18:56:40] [INFO ] Implicit Places using invariants and state equation in 7045 ms returned []
Implicit Place search using SMT with State Equation took 7507 ms to find 0 implicit places.
[2022-06-11 18:56:40] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 18:56:40] [INFO ] Computed 1 place invariants in 21 ms
[2022-06-11 18:56:42] [INFO ] Dead Transitions using invariants and state equation in 1855 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 159 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b02-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (GEQ s94 1) (GEQ s287 1)), p1:(OR (LT s12 1) (LT s282 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]]
Product exploration explored 100000 steps with 0 reset in 495 ms.
Product exploration explored 100000 steps with 0 reset in 469 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 486 ms. Reduced automaton from 5 states, 11 edges and 2 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 156919 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 156919 steps, saw 53440 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-11 18:56:47] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 18:56:47] [INFO ] Computed 1 place invariants in 17 ms
[2022-06-11 18:56:47] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 18:56:49] [INFO ] After 1829ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 18:56:49] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 5 ms returned sat
[2022-06-11 18:56:50] [INFO ] After 1766ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 18:56:50] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 18:57:00] [INFO ] After 9070ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2022-06-11 18:57:00] [INFO ] After 10940ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 305 transition count 7810
Applied a total of 126 rules in 199 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7936 (removed 126) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7810/7936 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 167792 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 167792 steps, saw 55848 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-11 18:57:03] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2022-06-11 18:57:03] [INFO ] Computed 1 place invariants in 17 ms
[2022-06-11 18:57:03] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 18:57:04] [INFO ] After 1644ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 18:57:05] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 18:57:06] [INFO ] After 1586ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 18:57:06] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 18:57:10] [INFO ] After 3714ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 18:57:12] [INFO ] Deduced a trap composed of 72 places in 414 ms of which 2 ms to minimize.
[2022-06-11 18:57:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1110 ms
[2022-06-11 18:57:13] [INFO ] After 6549ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2368 ms.
[2022-06-11 18:57:15] [INFO ] After 10567ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 220 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7810/7810 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 182 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
[2022-06-11 18:57:15] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2022-06-11 18:57:15] [INFO ] Computed 1 place invariants in 11 ms
[2022-06-11 18:57:16] [INFO ] Implicit Places using invariants in 415 ms returned []
[2022-06-11 18:57:16] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2022-06-11 18:57:16] [INFO ] Computed 1 place invariants in 14 ms
[2022-06-11 18:57:16] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 18:57:24] [INFO ] Implicit Places using invariants and state equation in 8462 ms returned []
Implicit Place search using SMT with State Equation took 8879 ms to find 0 implicit places.
[2022-06-11 18:57:25] [INFO ] Redundant transitions in 668 ms returned []
[2022-06-11 18:57:25] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2022-06-11 18:57:25] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 18:57:27] [INFO ] Dead Transitions using invariants and state equation in 1855 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7810/7810 transitions.
Graph (trivial) has 4944 edges and 305 vertex of which 36 / 305 are part of one of the 2 SCC in 1 ms
Free SCC test removed 34 places
Drop transitions removed 3816 transitions
Ensure Unique test removed 1626 transitions
Reduce isomorphic transitions removed 5442 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 271 transition count 2367
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 270 transition count 2366
Drop transitions removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 2 with 416 rules applied. Total rules applied 420 place count 270 transition count 1950
Applied a total of 420 rules in 131 ms. Remains 270 /305 variables (removed 35) and now considering 1950/7810 (removed 5860) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1950 rows 270 cols
[2022-06-11 18:57:27] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 18:57:27] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 18:57:28] [INFO ] After 640ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 18:57:28] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 18:57:28] [INFO ] After 583ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 18:57:28] [INFO ] State equation strengthened by 504 read => feed constraints.
[2022-06-11 18:57:30] [INFO ] After 1398ms SMT Verify possible using 504 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 18:57:30] [INFO ] After 1555ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 744 ms.
[2022-06-11 18:57:31] [INFO ] After 2940ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-11 18:57:31] [INFO ] Flatten gal took : 61 ms
[2022-06-11 18:57:31] [INFO ] Flatten gal took : 55 ms
[2022-06-11 18:57:31] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10865049848115657514.gal : 10 ms
[2022-06-11 18:57:31] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17142212765089832684.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms2922314919704515692;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality10865049848115657514.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17142212765089832684.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...321
Loading property file /tmp/ReachabilityCardinality17142212765089832684.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 21
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :21 after 226
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :226 after 949
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :949 after 1019
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1019 after 1120
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1120 after 1748
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1748 after 2004
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2004 after 2346
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2346 after 2902
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2902 after 4879
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 4097 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,12603,6.0363,149188,2,4636,17,152461,6,0,3032,150993,0
Total reachable state count : 12603

Verifying 1 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,1,6.0396,149188,2,271,17,152461,7,0,3036,150993,0
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 454 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p1), (NOT p1)]
Support contains 2 out of 305 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 33 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2022-06-11 18:57:37] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 18:57:37] [INFO ] Computed 1 place invariants in 20 ms
[2022-06-11 18:57:38] [INFO ] Implicit Places using invariants in 425 ms returned []
[2022-06-11 18:57:38] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 18:57:38] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 18:57:38] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 18:57:45] [INFO ] Implicit Places using invariants and state equation in 6858 ms returned []
Implicit Place search using SMT with State Equation took 7295 ms to find 0 implicit places.
[2022-06-11 18:57:45] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 18:57:45] [INFO ] Computed 1 place invariants in 16 ms
[2022-06-11 18:57:47] [INFO ] Dead Transitions using invariants and state equation in 1837 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 158 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 160311 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 160311 steps, saw 54178 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-11 18:57:50] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 18:57:50] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-11 18:57:50] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 18:57:52] [INFO ] After 1797ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 18:57:52] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 18:57:54] [INFO ] After 1719ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 18:57:54] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 18:58:02] [INFO ] After 8870ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 18:58:11] [INFO ] After 17880ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-06-11 18:58:11] [INFO ] After 19664ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 8 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 305 transition count 7810
Applied a total of 126 rules in 193 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7936 (removed 126) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7810/7936 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) 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 167062 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 167062 steps, saw 55709 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-11 18:58:15] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2022-06-11 18:58:15] [INFO ] Computed 1 place invariants in 11 ms
[2022-06-11 18:58:15] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 18:58:16] [INFO ] After 1699ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 18:58:16] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 18:58:18] [INFO ] After 1662ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 18:58:18] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 18:58:22] [INFO ] After 3916ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 18:58:24] [INFO ] Deduced a trap composed of 72 places in 382 ms of which 1 ms to minimize.
[2022-06-11 18:58:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1101 ms
[2022-06-11 18:58:25] [INFO ] After 6778ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2420 ms.
[2022-06-11 18:58:27] [INFO ] After 10921ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 196 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7810/7810 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 190 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
[2022-06-11 18:58:28] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2022-06-11 18:58:28] [INFO ] Computed 1 place invariants in 15 ms
[2022-06-11 18:58:28] [INFO ] Implicit Places using invariants in 416 ms returned []
[2022-06-11 18:58:28] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2022-06-11 18:58:28] [INFO ] Computed 1 place invariants in 16 ms
[2022-06-11 18:58:29] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 18:58:37] [INFO ] Implicit Places using invariants and state equation in 8368 ms returned []
Implicit Place search using SMT with State Equation took 8785 ms to find 0 implicit places.
[2022-06-11 18:58:37] [INFO ] Redundant transitions in 687 ms returned []
[2022-06-11 18:58:37] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2022-06-11 18:58:37] [INFO ] Computed 1 place invariants in 16 ms
[2022-06-11 18:58:39] [INFO ] Dead Transitions using invariants and state equation in 1885 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7810/7810 transitions.
Graph (trivial) has 4944 edges and 305 vertex of which 36 / 305 are part of one of the 2 SCC in 0 ms
Free SCC test removed 34 places
Drop transitions removed 3816 transitions
Ensure Unique test removed 1626 transitions
Reduce isomorphic transitions removed 5442 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 271 transition count 2367
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 270 transition count 2366
Drop transitions removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 2 with 416 rules applied. Total rules applied 420 place count 270 transition count 1950
Applied a total of 420 rules in 124 ms. Remains 270 /305 variables (removed 35) and now considering 1950/7810 (removed 5860) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1950 rows 270 cols
[2022-06-11 18:58:39] [INFO ] Computed 1 place invariants in 14 ms
[2022-06-11 18:58:39] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 18:58:40] [INFO ] After 656ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 18:58:40] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 18:58:41] [INFO ] After 594ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 18:58:41] [INFO ] State equation strengthened by 504 read => feed constraints.
[2022-06-11 18:58:42] [INFO ] After 1483ms SMT Verify possible using 504 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 18:58:42] [INFO ] After 1644ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 794 ms.
[2022-06-11 18:58:43] [INFO ] After 3088ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-11 18:58:43] [INFO ] Flatten gal took : 59 ms
[2022-06-11 18:58:43] [INFO ] Flatten gal took : 59 ms
[2022-06-11 18:58:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5876575291904877682.gal : 6 ms
[2022-06-11 18:58:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality17016997081582123228.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms3965033008505658413;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5876575291904877682.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality17016997081582123228.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality17016997081582123228.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 21
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :21 after 226
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :226 after 949
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :949 after 1019
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1019 after 1120
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1120 after 1748
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1748 after 2004
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2004 after 2346
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2346 after 2902
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2902 after 4879
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 4097 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,12603,6.44028,148928,2,4636,17,152461,6,0,3032,150993,0
Total reachable state count : 12603

Verifying 1 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,1,6.44366,148928,2,271,17,152461,7,0,3036,150993,0
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 154 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 79 ms :[true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 415 ms.
Product exploration explored 100000 steps with 0 reset in 419 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 151 ms :[true, (NOT p1), (NOT p1)]
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 229 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2022-06-11 18:58:52] [INFO ] Redundant transitions in 697 ms returned []
[2022-06-11 18:58:52] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 18:58:52] [INFO ] Computed 1 place invariants in 21 ms
[2022-06-11 18:58:54] [INFO ] Dead Transitions using invariants and state equation in 1906 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7936/7936 transitions.
Product exploration explored 100000 steps with 0 reset in 473 ms.
Product exploration explored 100000 steps with 0 reset in 419 ms.
Built C files in :
/tmp/ltsmin16333051324622357583
[2022-06-11 18:58:55] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16333051324622357583
Running compilation step : cd /tmp/ltsmin16333051324622357583;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16333051324622357583;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16333051324622357583;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 32 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2022-06-11 18:58:58] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 18:58:58] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 18:58:59] [INFO ] Implicit Places using invariants in 552 ms returned []
[2022-06-11 18:58:59] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 18:58:59] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 18:58:59] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 18:59:05] [INFO ] Implicit Places using invariants and state equation in 6777 ms returned []
Implicit Place search using SMT with State Equation took 7334 ms to find 0 implicit places.
[2022-06-11 18:59:05] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 18:59:05] [INFO ] Computed 1 place invariants in 15 ms
[2022-06-11 18:59:07] [INFO ] Dead Transitions using invariants and state equation in 1970 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7936/7936 transitions.
Built C files in :
/tmp/ltsmin1451130779575842244
[2022-06-11 18:59:07] [INFO ] Built C files in 62ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1451130779575842244
Running compilation step : cd /tmp/ltsmin1451130779575842244;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1451130779575842244;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1451130779575842244;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-11 18:59:11] [INFO ] Flatten gal took : 258 ms
[2022-06-11 18:59:11] [INFO ] Flatten gal took : 235 ms
[2022-06-11 18:59:11] [INFO ] Time to serialize gal into /tmp/LTL4060295654857378992.gal : 18 ms
[2022-06-11 18:59:11] [INFO ] Time to serialize properties into /tmp/LTL5567756321981177410.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4060295654857378992.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5567756321981177410.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4060295...266
Read 1 LTL properties
Checking formula 0 : !(((G("((p94>=1)&&(l33>=1))"))||(G(X(G("((p12<1)||(l26<1))"))))))
Formula 0 simplified : !(G"((p94>=1)&&(l33>=1))" | GXG"((p12<1)||(l26<1))")
Detected timeout of ITS tools.
[2022-06-11 18:59:26] [INFO ] Flatten gal took : 212 ms
[2022-06-11 18:59:26] [INFO ] Applying decomposition
[2022-06-11 18:59:27] [INFO ] Flatten gal took : 220 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7161878881097049549.txt' '-o' '/tmp/graph7161878881097049549.bin' '-w' '/tmp/graph7161878881097049549.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7161878881097049549.bin' '-l' '-1' '-v' '-w' '/tmp/graph7161878881097049549.weights' '-q' '0' '-e' '0.001'
[2022-06-11 18:59:27] [INFO ] Decomposing Gal with order
[2022-06-11 18:59:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 18:59:28] [INFO ] Removed a total of 17871 redundant transitions.
[2022-06-11 18:59:28] [INFO ] Flatten gal took : 401 ms
[2022-06-11 18:59:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 986 labels/synchronizations in 149 ms.
[2022-06-11 18:59:28] [INFO ] Time to serialize gal into /tmp/LTL9144767390831098787.gal : 21 ms
[2022-06-11 18:59:28] [INFO ] Time to serialize properties into /tmp/LTL1556114655097230566.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9144767390831098787.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1556114655097230566.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL9144767...245
Read 1 LTL properties
Checking formula 0 : !(((G("((i4.u31.p94>=1)&&(i8.u55.l33>=1))"))||(G(X(G("((i5.u4.p12<1)||(i1.u53.l26<1))"))))))
Formula 0 simplified : !(G"((i4.u31.p94>=1)&&(i8.u55.l33>=1))" | GXG"((i5.u4.p12<1)||(i1.u53.l26<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6037406896600084232
[2022-06-11 18:59:43] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6037406896600084232
Running compilation step : cd /tmp/ltsmin6037406896600084232;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6037406896600084232;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6037406896600084232;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property Szymanski-PT-b02-LTLFireability-02 finished in 193453 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)||p1)))'
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 52 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2022-06-11 18:59:46] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 18:59:46] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 18:59:46] [INFO ] Implicit Places using invariants in 412 ms returned []
[2022-06-11 18:59:46] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 18:59:47] [INFO ] Computed 1 place invariants in 81 ms
[2022-06-11 18:59:47] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 18:59:54] [INFO ] Implicit Places using invariants and state equation in 7093 ms returned []
Implicit Place search using SMT with State Equation took 7528 ms to find 0 implicit places.
[2022-06-11 18:59:54] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 18:59:54] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 18:59:56] [INFO ] Dead Transitions using invariants and state equation in 2139 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b02-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=(AND p1 p0), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s24 1) (GEQ s284 1)), p0:(AND (GEQ s46 1) (GEQ s302 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, 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 Szymanski-PT-b02-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b02-LTLFireability-03 finished in 9848 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((false U (G(X(p0)) U p0)))'
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 58 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2022-06-11 18:59:56] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 18:59:56] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-11 18:59:56] [INFO ] Implicit Places using invariants in 496 ms returned []
[2022-06-11 18:59:56] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 18:59:56] [INFO ] Computed 1 place invariants in 17 ms
[2022-06-11 18:59:57] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:00:03] [INFO ] Implicit Places using invariants and state equation in 6442 ms returned []
Implicit Place search using SMT with State Equation took 6958 ms to find 0 implicit places.
[2022-06-11 19:00:03] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:00:03] [INFO ] Computed 1 place invariants in 14 ms
[2022-06-11 19:00:05] [INFO ] Dead Transitions using invariants and state equation in 2300 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 72 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b02-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), 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 (GEQ s118 1) (GEQ s258 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Szymanski-PT-b02-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b02-LTLFireability-04 finished in 9417 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(X(!p0) U p1)))'
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Applied a total of 0 rules in 32 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
[2022-06-11 19:00:05] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:00:05] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 19:00:06] [INFO ] Implicit Places using invariants in 411 ms returned []
[2022-06-11 19:00:06] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:00:06] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-11 19:00:06] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:00:11] [INFO ] Implicit Places using invariants and state equation in 5264 ms returned []
Implicit Place search using SMT with State Equation took 5699 ms to find 0 implicit places.
[2022-06-11 19:00:11] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:00:11] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 19:00:13] [INFO ] Dead Transitions using invariants and state equation in 2331 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 8064/8064 transitions.
Stuttering acceptance computed with spot in 242 ms :[true, p1, p1, (AND p1 (NOT p0))]
Running random walk in product with property : Szymanski-PT-b02-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (GEQ s10 1) (GEQ s286 1)), p0:(AND (GEQ s60 1) (GEQ s279 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 459 ms.
Product exploration explored 100000 steps with 0 reset in 466 ms.
Computed a total of 12 stabilizing places and 2432 stable transitions
Computed a total of 12 stabilizing places and 2432 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 150 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 83 ms :[true, (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 132760 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 132760 steps, saw 46696 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 2 properties.
[2022-06-11 19:00:18] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:00:18] [INFO ] Computed 1 place invariants in 20 ms
[2022-06-11 19:00:18] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 19:00:20] [INFO ] After 2416ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 19:00:20] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 19:00:24] [INFO ] After 3679ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 19:00:24] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:00:36] [INFO ] After 11618ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 19:00:45] [INFO ] After 20631ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-06-11 19:00:45] [INFO ] After 24389ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 46 ms.
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Drop transitions removed 125 transitions
Reduce isomorphic transitions removed 125 transitions.
Iterating post reduction 0 with 125 rules applied. Total rules applied 125 place count 306 transition count 7939
Applied a total of 125 rules in 190 ms. Remains 306 /306 variables (removed 0) and now considering 7939/8064 (removed 125) transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 7939/8064 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 139167 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 139167 steps, saw 48440 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 2 properties.
[2022-06-11 19:00:48] [INFO ] Flow matrix only has 2608 transitions (discarded 5331 similar events)
// Phase 1: matrix 2608 rows 306 cols
[2022-06-11 19:00:48] [INFO ] Computed 1 place invariants in 22 ms
[2022-06-11 19:00:48] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:00:50] [INFO ] After 2173ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 19:00:50] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:00:55] [INFO ] After 4702ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 19:00:55] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:01:01] [INFO ] After 6155ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-11 19:01:15] [INFO ] After 20242ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-06-11 19:01:15] [INFO ] After 25009ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 32 ms.
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 306/306 places, 7939/7939 transitions.
Applied a total of 0 rules in 186 ms. Remains 306 /306 variables (removed 0) and now considering 7939/7939 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 7939/7939 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 306/306 places, 7939/7939 transitions.
Applied a total of 0 rules in 205 ms. Remains 306 /306 variables (removed 0) and now considering 7939/7939 (removed 0) transitions.
[2022-06-11 19:01:16] [INFO ] Flow matrix only has 2608 transitions (discarded 5331 similar events)
// Phase 1: matrix 2608 rows 306 cols
[2022-06-11 19:01:16] [INFO ] Computed 1 place invariants in 14 ms
[2022-06-11 19:01:16] [INFO ] Implicit Places using invariants in 421 ms returned []
[2022-06-11 19:01:16] [INFO ] Flow matrix only has 2608 transitions (discarded 5331 similar events)
// Phase 1: matrix 2608 rows 306 cols
[2022-06-11 19:01:16] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 19:01:17] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:01:25] [INFO ] Implicit Places using invariants and state equation in 8659 ms returned []
Implicit Place search using SMT with State Equation took 9086 ms to find 0 implicit places.
[2022-06-11 19:01:26] [INFO ] Redundant transitions in 680 ms returned []
[2022-06-11 19:01:26] [INFO ] Flow matrix only has 2608 transitions (discarded 5331 similar events)
// Phase 1: matrix 2608 rows 306 cols
[2022-06-11 19:01:26] [INFO ] Computed 1 place invariants in 17 ms
[2022-06-11 19:01:28] [INFO ] Dead Transitions using invariants and state equation in 1887 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 7939/7939 transitions.
Graph (trivial) has 5168 edges and 306 vertex of which 28 / 306 are part of one of the 5 SCC in 1 ms
Free SCC test removed 23 places
Drop transitions removed 3104 transitions
Ensure Unique test removed 2454 transitions
Reduce isomorphic transitions removed 5558 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 283 transition count 2380
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 282 transition count 2380
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 282 transition count 2378
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 280 transition count 2378
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 278 transition count 2376
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 278 transition count 2375
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 278 transition count 2374
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 277 transition count 2374
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 277 transition count 2373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 276 transition count 2373
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 276 transition count 2373
Applied a total of 17 rules in 226 ms. Remains 276 /306 variables (removed 30) and now considering 2373/7939 (removed 5566) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2373 rows 276 cols
[2022-06-11 19:01:28] [INFO ] Computed 1 place invariants in 16 ms
[2022-06-11 19:01:28] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:01:29] [INFO ] After 1466ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 19:01:29] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:01:31] [INFO ] After 2007ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 19:01:31] [INFO ] State equation strengthened by 224 read => feed constraints.
[2022-06-11 19:01:34] [INFO ] After 2629ms SMT Verify possible using 224 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-11 19:01:36] [INFO ] After 4635ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2233 ms.
[2022-06-11 19:01:38] [INFO ] After 8951ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), true, (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 168 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 109 ms :[true, (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 89 ms :[true, (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Applied a total of 0 rules in 31 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
[2022-06-11 19:01:39] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:01:39] [INFO ] Computed 1 place invariants in 21 ms
[2022-06-11 19:01:39] [INFO ] Implicit Places using invariants in 423 ms returned []
[2022-06-11 19:01:39] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:01:39] [INFO ] Computed 1 place invariants in 23 ms
[2022-06-11 19:01:39] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:01:45] [INFO ] Implicit Places using invariants and state equation in 5577 ms returned []
Implicit Place search using SMT with State Equation took 6004 ms to find 0 implicit places.
[2022-06-11 19:01:45] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:01:45] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 19:01:46] [INFO ] Dead Transitions using invariants and state equation in 1874 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 8064/8064 transitions.
Computed a total of 12 stabilizing places and 2432 stable transitions
Computed a total of 12 stabilizing places and 2432 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 180 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 107 ms :[true, (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) 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 :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
Interrupted probabilistic random walk after 133565 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 133565 steps, saw 46869 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 2 properties.
[2022-06-11 19:01:50] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:01:50] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-11 19:01:50] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 19:01:52] [INFO ] After 2325ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 19:01:52] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 19:01:56] [INFO ] After 3617ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 19:01:56] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:02:08] [INFO ] After 11667ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 19:02:17] [INFO ] After 20680ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-06-11 19:02:17] [INFO ] After 24382ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 47 ms.
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Drop transitions removed 125 transitions
Reduce isomorphic transitions removed 125 transitions.
Iterating post reduction 0 with 125 rules applied. Total rules applied 125 place count 306 transition count 7939
Applied a total of 125 rules in 192 ms. Remains 306 /306 variables (removed 0) and now considering 7939/8064 (removed 125) transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 7939/8064 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 138312 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 138312 steps, saw 48246 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 2 properties.
[2022-06-11 19:02:20] [INFO ] Flow matrix only has 2608 transitions (discarded 5331 similar events)
// Phase 1: matrix 2608 rows 306 cols
[2022-06-11 19:02:20] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 19:02:20] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:02:22] [INFO ] After 2166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 19:02:22] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:02:27] [INFO ] After 4601ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 19:02:27] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:02:33] [INFO ] After 6004ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-11 19:02:47] [INFO ] After 20344ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-06-11 19:02:47] [INFO ] After 25012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 27 ms.
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 306/306 places, 7939/7939 transitions.
Applied a total of 0 rules in 186 ms. Remains 306 /306 variables (removed 0) and now considering 7939/7939 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 7939/7939 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 306/306 places, 7939/7939 transitions.
Applied a total of 0 rules in 198 ms. Remains 306 /306 variables (removed 0) and now considering 7939/7939 (removed 0) transitions.
[2022-06-11 19:02:48] [INFO ] Flow matrix only has 2608 transitions (discarded 5331 similar events)
// Phase 1: matrix 2608 rows 306 cols
[2022-06-11 19:02:48] [INFO ] Computed 1 place invariants in 15 ms
[2022-06-11 19:02:48] [INFO ] Implicit Places using invariants in 439 ms returned []
[2022-06-11 19:02:48] [INFO ] Flow matrix only has 2608 transitions (discarded 5331 similar events)
// Phase 1: matrix 2608 rows 306 cols
[2022-06-11 19:02:48] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 19:02:49] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:02:58] [INFO ] Implicit Places using invariants and state equation in 10179 ms returned []
Implicit Place search using SMT with State Equation took 10620 ms to find 0 implicit places.
[2022-06-11 19:02:59] [INFO ] Redundant transitions in 646 ms returned []
[2022-06-11 19:02:59] [INFO ] Flow matrix only has 2608 transitions (discarded 5331 similar events)
// Phase 1: matrix 2608 rows 306 cols
[2022-06-11 19:02:59] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-11 19:03:01] [INFO ] Dead Transitions using invariants and state equation in 1889 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 7939/7939 transitions.
Graph (trivial) has 5168 edges and 306 vertex of which 28 / 306 are part of one of the 5 SCC in 1 ms
Free SCC test removed 23 places
Drop transitions removed 3104 transitions
Ensure Unique test removed 2454 transitions
Reduce isomorphic transitions removed 5558 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 283 transition count 2380
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 282 transition count 2380
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 3 place count 282 transition count 2378
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 7 place count 280 transition count 2378
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 11 place count 278 transition count 2376
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 278 transition count 2375
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 12 place count 278 transition count 2374
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 277 transition count 2374
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 277 transition count 2373
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16 place count 276 transition count 2373
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 17 place count 276 transition count 2373
Applied a total of 17 rules in 212 ms. Remains 276 /306 variables (removed 30) and now considering 2373/7939 (removed 5566) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 2373 rows 276 cols
[2022-06-11 19:03:01] [INFO ] Computed 1 place invariants in 14 ms
[2022-06-11 19:03:01] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:03:03] [INFO ] After 1451ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-06-11 19:03:03] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:03:05] [INFO ] After 2010ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-06-11 19:03:05] [INFO ] State equation strengthened by 224 read => feed constraints.
[2022-06-11 19:03:07] [INFO ] After 2691ms SMT Verify possible using 224 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2022-06-11 19:03:09] [INFO ] After 4687ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2303 ms.
[2022-06-11 19:03:12] [INFO ] After 9059ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 4 states, 5 edges and 2 AP to 4 states, 5 edges and 2 AP.
Stuttering acceptance computed with spot in 110 ms :[true, (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 105 ms :[true, (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 114 ms :[true, (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 0 reset in 488 ms.
Product exploration explored 100000 steps with 0 reset in 482 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 116 ms :[true, (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Applied a total of 0 rules in 192 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
[2022-06-11 19:03:14] [INFO ] Redundant transitions in 696 ms returned []
[2022-06-11 19:03:14] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:03:14] [INFO ] Computed 1 place invariants in 20 ms
[2022-06-11 19:03:16] [INFO ] Dead Transitions using invariants and state equation in 1890 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 8064/8064 transitions.
Product exploration explored 100000 steps with 0 reset in 427 ms.
Product exploration explored 100000 steps with 1 reset in 422 ms.
Built C files in :
/tmp/ltsmin8614617660021348250
[2022-06-11 19:03:17] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8614617660021348250
Running compilation step : cd /tmp/ltsmin8614617660021348250;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8614617660021348250;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin8614617660021348250;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Applied a total of 0 rules in 30 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
[2022-06-11 19:03:20] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:03:20] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-11 19:03:20] [INFO ] Implicit Places using invariants in 428 ms returned []
[2022-06-11 19:03:20] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:03:20] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-11 19:03:21] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:03:27] [INFO ] Implicit Places using invariants and state equation in 6665 ms returned []
Implicit Place search using SMT with State Equation took 7103 ms to find 0 implicit places.
[2022-06-11 19:03:27] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:03:27] [INFO ] Computed 1 place invariants in 17 ms
[2022-06-11 19:03:29] [INFO ] Dead Transitions using invariants and state equation in 2148 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 8064/8064 transitions.
Built C files in :
/tmp/ltsmin2397852818194496548
[2022-06-11 19:03:29] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2397852818194496548
Running compilation step : cd /tmp/ltsmin2397852818194496548;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2397852818194496548;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2397852818194496548;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-11 19:03:33] [INFO ] Flatten gal took : 262 ms
[2022-06-11 19:03:33] [INFO ] Flatten gal took : 355 ms
[2022-06-11 19:03:33] [INFO ] Time to serialize gal into /tmp/LTL5342759975674132315.gal : 26 ms
[2022-06-11 19:03:33] [INFO ] Time to serialize properties into /tmp/LTL4184034608606458069.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5342759975674132315.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4184034608606458069.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL5342759...266
Read 1 LTL properties
Checking formula 0 : !((X(!((X(!("((p60>=1)&&(l23>=1))")))U("((p10>=1)&&(l32>=1))")))))
Formula 0 simplified : !X!(X!"((p60>=1)&&(l23>=1))" U "((p10>=1)&&(l32>=1))")
Detected timeout of ITS tools.
[2022-06-11 19:03:48] [INFO ] Flatten gal took : 208 ms
[2022-06-11 19:03:48] [INFO ] Applying decomposition
[2022-06-11 19:03:49] [INFO ] Flatten gal took : 220 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph15407853683026141027.txt' '-o' '/tmp/graph15407853683026141027.bin' '-w' '/tmp/graph15407853683026141027.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph15407853683026141027.bin' '-l' '-1' '-v' '-w' '/tmp/graph15407853683026141027.weights' '-q' '0' '-e' '0.001'
[2022-06-11 19:03:49] [INFO ] Decomposing Gal with order
[2022-06-11 19:03:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 19:03:50] [INFO ] Removed a total of 18396 redundant transitions.
[2022-06-11 19:03:50] [INFO ] Flatten gal took : 455 ms
[2022-06-11 19:03:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 981 labels/synchronizations in 133 ms.
[2022-06-11 19:03:50] [INFO ] Time to serialize gal into /tmp/LTL17571863932407779433.gal : 17 ms
[2022-06-11 19:03:50] [INFO ] Time to serialize properties into /tmp/LTL1343844101673925388.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17571863932407779433.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1343844101673925388.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1757186...246
Read 1 LTL properties
Checking formula 0 : !((X(!((X(!("((i5.u21.p60>=1)&&(i3.u53.l23>=1))")))U("((i1.u55.p10>=1)&&(i5.u56.l32>=1))")))))
Formula 0 simplified : !X!(X!"((i5.u21.p60>=1)&&(i3.u53.l23>=1))" U "((i1.u55.p10>=1)&&(i5.u56.l32>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1321599223948651115
[2022-06-11 19:04:05] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1321599223948651115
Running compilation step : cd /tmp/ltsmin1321599223948651115;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1321599223948651115;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1321599223948651115;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property Szymanski-PT-b02-LTLFireability-05 finished in 242733 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p0))||p1))))'
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 55 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2022-06-11 19:04:08] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:04:08] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-11 19:04:09] [INFO ] Implicit Places using invariants in 436 ms returned []
[2022-06-11 19:04:09] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:04:09] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-11 19:04:09] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:04:15] [INFO ] Implicit Places using invariants and state equation in 6423 ms returned []
Implicit Place search using SMT with State Equation took 6869 ms to find 0 implicit places.
[2022-06-11 19:04:15] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:04:15] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 19:04:17] [INFO ] Dead Transitions using invariants and state equation in 2220 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b02-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s47 1) (GEQ s288 1)), p0:(OR (LT s53 1) (LT s301 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 547 ms.
Product exploration explored 100000 steps with 0 reset in 459 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 145 ms. Reduced automaton from 5 states, 7 edges and 2 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Finished probabilistic random walk after 17698 steps, run visited all 1 properties in 345 ms. (steps per millisecond=51 )
Probabilistic random walk after 17698 steps, saw 7048 distinct states, run finished after 345 ms. (steps per millisecond=51 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 305 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 215 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2022-06-11 19:04:19] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:04:19] [INFO ] Computed 1 place invariants in 16 ms
[2022-06-11 19:04:20] [INFO ] Implicit Places using invariants in 440 ms returned []
[2022-06-11 19:04:20] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:04:20] [INFO ] Computed 1 place invariants in 17 ms
[2022-06-11 19:04:20] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:04:26] [INFO ] Implicit Places using invariants and state equation in 6515 ms returned []
Implicit Place search using SMT with State Equation took 6972 ms to find 0 implicit places.
[2022-06-11 19:04:27] [INFO ] Redundant transitions in 647 ms returned []
[2022-06-11 19:04:27] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:04:27] [INFO ] Computed 1 place invariants in 16 ms
[2022-06-11 19:04:29] [INFO ] Dead Transitions using invariants and state equation in 2227 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 93 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 57 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
Finished Best-First random walk after 248 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=124 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 2 states, 3 edges and 1 AP to 2 states, 3 edges and 1 AP.
Stuttering acceptance computed with spot in 56 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 467 ms.
Product exploration explored 100000 steps with 0 reset in 466 ms.
Built C files in :
/tmp/ltsmin4412493909420555746
[2022-06-11 19:04:31] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2022-06-11 19:04:31] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4412493909420555746
Running compilation step : cd /tmp/ltsmin4412493909420555746;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4412493909420555746;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4412493909420555746;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 296 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2022-06-11 19:04:34] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:04:34] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 19:04:37] [INFO ] Implicit Places using invariants in 2933 ms returned []
[2022-06-11 19:04:37] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:04:37] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 19:04:38] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:04:44] [INFO ] Implicit Places using invariants and state equation in 7297 ms returned []
Implicit Place search using SMT with State Equation took 10242 ms to find 0 implicit places.
[2022-06-11 19:04:45] [INFO ] Redundant transitions in 685 ms returned []
[2022-06-11 19:04:45] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:04:45] [INFO ] Computed 1 place invariants in 21 ms
[2022-06-11 19:04:47] [INFO ] Dead Transitions using invariants and state equation in 2153 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7936/7936 transitions.
Built C files in :
/tmp/ltsmin2507458757927372455
[2022-06-11 19:04:47] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2022-06-11 19:04:47] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2507458757927372455
Running compilation step : cd /tmp/ltsmin2507458757927372455;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2507458757927372455;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2507458757927372455;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-11 19:04:51] [INFO ] Flatten gal took : 210 ms
[2022-06-11 19:04:51] [INFO ] Flatten gal took : 220 ms
[2022-06-11 19:04:51] [INFO ] Time to serialize gal into /tmp/LTL1014877123171938929.gal : 29 ms
[2022-06-11 19:04:51] [INFO ] Time to serialize properties into /tmp/LTL11283415577819211216.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1014877123171938929.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11283415577819211216.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1014877...267
Read 1 LTL properties
Checking formula 0 : !((X(X((G(F("((p53<1)||(l47<1))")))||("((p47>=1)&&(l34>=1))")))))
Formula 0 simplified : !XX("((p47>=1)&&(l34>=1))" | GF"((p53<1)||(l47<1))")
Detected timeout of ITS tools.
[2022-06-11 19:05:06] [INFO ] Flatten gal took : 211 ms
[2022-06-11 19:05:06] [INFO ] Applying decomposition
[2022-06-11 19:05:07] [INFO ] Flatten gal took : 217 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph14237700771137646865.txt' '-o' '/tmp/graph14237700771137646865.bin' '-w' '/tmp/graph14237700771137646865.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph14237700771137646865.bin' '-l' '-1' '-v' '-w' '/tmp/graph14237700771137646865.weights' '-q' '0' '-e' '0.001'
[2022-06-11 19:05:07] [INFO ] Decomposing Gal with order
[2022-06-11 19:05:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 19:05:07] [INFO ] Removed a total of 18365 redundant transitions.
[2022-06-11 19:05:07] [INFO ] Flatten gal took : 370 ms
[2022-06-11 19:05:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 1050 labels/synchronizations in 155 ms.
[2022-06-11 19:05:08] [INFO ] Time to serialize gal into /tmp/LTL1401163785831186156.gal : 16 ms
[2022-06-11 19:05:08] [INFO ] Time to serialize properties into /tmp/LTL7205352368792767030.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1401163785831186156.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7205352368792767030.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1401163...245
Read 1 LTL properties
Checking formula 0 : !((X(X((G(F("((i5.u50.p53<1)||(i10.u63.l47<1))")))||("((i10.u16.p47>=1)&&(i7.u57.l34>=1))")))))
Formula 0 simplified : !XX("((i10.u16.p47>=1)&&(i7.u57.l34>=1))" | GF"((i5.u50.p53<1)||(i10.u63.l47<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9559095910077237696
[2022-06-11 19:05:23] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9559095910077237696
Running compilation step : cd /tmp/ltsmin9559095910077237696;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9559095910077237696;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9559095910077237696;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property Szymanski-PT-b02-LTLFireability-06 finished in 77808 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(G((G(X((F(p2)&&p1)))&&p0)))))'
Support contains 6 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 219 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2022-06-11 19:05:26] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:05:26] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-11 19:05:26] [INFO ] Implicit Places using invariants in 451 ms returned []
[2022-06-11 19:05:27] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:05:27] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 19:05:27] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:05:33] [INFO ] Implicit Places using invariants and state equation in 6410 ms returned []
Implicit Place search using SMT with State Equation took 6890 ms to find 0 implicit places.
[2022-06-11 19:05:34] [INFO ] Redundant transitions in 676 ms returned []
[2022-06-11 19:05:34] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:05:34] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 19:05:36] [INFO ] Dead Transitions using invariants and state equation in 2074 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 83 ms :[(OR (NOT p1) (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : Szymanski-PT-b02-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s90 1) (GEQ s276 1)), p0:(AND (GEQ s68 1) (GEQ s281 1)), p2:(AND (GEQ s126 1) (GEQ s258 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 62 steps with 0 reset in 1 ms.
FORMULA Szymanski-PT-b02-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b02-LTLFireability-08 finished in 9980 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p0)||p1))&&G(X(p2))))'
Support contains 10 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Applied a total of 0 rules in 28 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
[2022-06-11 19:05:36] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:05:36] [INFO ] Computed 1 place invariants in 21 ms
[2022-06-11 19:05:36] [INFO ] Implicit Places using invariants in 415 ms returned []
[2022-06-11 19:05:36] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:05:36] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-11 19:05:37] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:05:42] [INFO ] Implicit Places using invariants and state equation in 5293 ms returned []
Implicit Place search using SMT with State Equation took 5726 ms to find 0 implicit places.
[2022-06-11 19:05:42] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:05:42] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 19:05:44] [INFO ] Dead Transitions using invariants and state equation in 2186 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 8064/8064 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p2), (OR (NOT p2) (NOT p0)), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), true]
Running random walk in product with property : Szymanski-PT-b02-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 4}], [{ cond=(AND p0 p2), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) p2), acceptance={0} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 4}], [{ cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=2 dest: 1}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(OR (LT s96 1) (LT s286 1)), p0:(OR (LT s122 1) (LT s292 1)), p1:(AND (OR (LT s19 1) (LT s287 1)) (OR (LT s113 1) (LT s257 1)) (GEQ s6 1) (GEQ s280 1))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 1 reset in 508 ms.
Product exploration explored 100000 steps with 1 reset in 493 ms.
Computed a total of 12 stabilizing places and 2432 stable transitions
Computed a total of 12 stabilizing places and 2432 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (OR (AND p1 p2) (AND p0 p2))), (X p2), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X p2)), (X (X (AND p0 p2))), true, (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 341 ms. Reduced automaton from 5 states, 10 edges and 3 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 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 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 158146 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 158146 steps, saw 54068 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-11 19:05:48] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:05:48] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-11 19:05:49] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:05:51] [INFO ] After 2546ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 19:05:51] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 19:05:53] [INFO ] After 1616ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 19:05:53] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:05:54] [INFO ] After 1605ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 19:05:55] [INFO ] After 2592ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 484 ms.
[2022-06-11 19:05:56] [INFO ] After 4802ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Drop transitions removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 306 transition count 7936
Applied a total of 128 rules in 189 ms. Remains 306 /306 variables (removed 0) and now considering 7936/8064 (removed 128) transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 7936/8064 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 166829 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 166829 steps, saw 55601 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-11 19:05:59] [INFO ] Flow matrix only has 2605 transitions (discarded 5331 similar events)
// Phase 1: matrix 2605 rows 306 cols
[2022-06-11 19:05:59] [INFO ] Computed 3 place invariants in 17 ms
[2022-06-11 19:05:59] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-11 19:06:00] [INFO ] After 1224ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 19:06:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-11 19:06:01] [INFO ] After 814ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 19:06:01] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:06:04] [INFO ] After 2676ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 19:06:05] [INFO ] After 3639ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 260 ms.
[2022-06-11 19:06:05] [INFO ] After 4775ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 46 ms.
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 306/306 places, 7936/7936 transitions.
Applied a total of 0 rules in 182 ms. Remains 306 /306 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 7936/7936 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 306/306 places, 7936/7936 transitions.
Applied a total of 0 rules in 181 ms. Remains 306 /306 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2022-06-11 19:06:06] [INFO ] Flow matrix only has 2605 transitions (discarded 5331 similar events)
// Phase 1: matrix 2605 rows 306 cols
[2022-06-11 19:06:06] [INFO ] Computed 3 place invariants in 17 ms
[2022-06-11 19:06:06] [INFO ] Implicit Places using invariants in 509 ms returned []
[2022-06-11 19:06:06] [INFO ] Flow matrix only has 2605 transitions (discarded 5331 similar events)
// Phase 1: matrix 2605 rows 306 cols
[2022-06-11 19:06:06] [INFO ] Computed 3 place invariants in 16 ms
[2022-06-11 19:06:06] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:06:15] [INFO ] Implicit Places using invariants and state equation in 9191 ms returned []
Implicit Place search using SMT with State Equation took 9702 ms to find 0 implicit places.
[2022-06-11 19:06:16] [INFO ] Redundant transitions in 688 ms returned []
[2022-06-11 19:06:16] [INFO ] Flow matrix only has 2605 transitions (discarded 5331 similar events)
// Phase 1: matrix 2605 rows 306 cols
[2022-06-11 19:06:16] [INFO ] Computed 3 place invariants in 18 ms
[2022-06-11 19:06:18] [INFO ] Dead Transitions using invariants and state equation in 2155 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 7936/7936 transitions.
Graph (trivial) has 5264 edges and 306 vertex of which 38 / 306 are part of one of the 2 SCC in 1 ms
Free SCC test removed 36 places
Drop transitions removed 4264 transitions
Ensure Unique test removed 1309 transitions
Reduce isomorphic transitions removed 5573 transitions.
Drop transitions removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 0 with 416 rules applied. Total rules applied 417 place count 270 transition count 1947
Applied a total of 417 rules in 114 ms. Remains 270 /306 variables (removed 36) and now considering 1947/7936 (removed 5989) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1947 rows 270 cols
[2022-06-11 19:06:18] [INFO ] Computed 3 place invariants in 14 ms
[2022-06-11 19:06:18] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-11 19:06:19] [INFO ] After 657ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 19:06:19] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-11 19:06:19] [INFO ] After 459ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 19:06:19] [INFO ] State equation strengthened by 504 read => feed constraints.
[2022-06-11 19:06:20] [INFO ] After 475ms SMT Verify possible using 504 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 19:06:22] [INFO ] After 2462ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 692 ms.
[2022-06-11 19:06:23] [INFO ] After 3669ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-11 19:06:23] [INFO ] Flatten gal took : 61 ms
[2022-06-11 19:06:23] [INFO ] Flatten gal took : 55 ms
[2022-06-11 19:06:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2252195043486573429.gal : 5 ms
[2022-06-11 19:06:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10310076055430363821.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms10768571428344164205;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2252195043486573429.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10310076055430363821.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality10310076055430363821.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 18
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :18 after 46
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :46 after 273
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :273 after 399
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :399 after 553
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :553 after 1027
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1027 after 1205
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1205 after 1441
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1441 after 1828
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1828 after 2402
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2402 after 10383
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,17666,5.59491,142504,2,3721,17,172934,7,0,3026,257225,0
Total reachable state count : 17666

Verifying 1 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,9,5.59818,142504,2,303,17,172934,7,0,3029,257225,0
Knowledge obtained : [(AND p2 p0 (NOT p1)), (X (OR (AND p1 p2) (AND p0 p2))), (X p2), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (X p2)), (X (X (AND p0 p2))), true, (X (X (NOT (AND (NOT p0) p2))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 255 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 58 ms :[true, (NOT p2), (NOT p2)]
Support contains 2 out of 306 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Applied a total of 0 rules in 33 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
[2022-06-11 19:06:29] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:06:29] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 19:06:29] [INFO ] Implicit Places using invariants in 411 ms returned []
[2022-06-11 19:06:29] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:06:29] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-11 19:06:30] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:06:35] [INFO ] Implicit Places using invariants and state equation in 5481 ms returned []
Implicit Place search using SMT with State Equation took 5894 ms to find 0 implicit places.
[2022-06-11 19:06:35] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:06:35] [INFO ] Computed 1 place invariants in 48 ms
[2022-06-11 19:06:37] [INFO ] Dead Transitions using invariants and state equation in 1982 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 8064/8064 transitions.
Computed a total of 12 stabilizing places and 2432 stable transitions
Computed a total of 12 stabilizing places and 2432 stable transitions
Knowledge obtained : [p2, (X p2), true, (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 150 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 3 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 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 159178 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 159178 steps, saw 54330 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-11 19:06:40] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:06:40] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-11 19:06:40] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:06:42] [INFO ] After 2383ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 19:06:42] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:06:44] [INFO ] After 1632ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 19:06:44] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:06:46] [INFO ] After 1628ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 19:06:47] [INFO ] After 2624ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 508 ms.
[2022-06-11 19:06:47] [INFO ] After 4824ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 14 ms.
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Drop transitions removed 128 transitions
Reduce isomorphic transitions removed 128 transitions.
Iterating post reduction 0 with 128 rules applied. Total rules applied 128 place count 306 transition count 7936
Applied a total of 128 rules in 204 ms. Remains 306 /306 variables (removed 0) and now considering 7936/8064 (removed 128) transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 7936/8064 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 166991 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 166991 steps, saw 55638 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-11 19:06:50] [INFO ] Flow matrix only has 2605 transitions (discarded 5331 similar events)
// Phase 1: matrix 2605 rows 306 cols
[2022-06-11 19:06:50] [INFO ] Computed 3 place invariants in 21 ms
[2022-06-11 19:06:51] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-11 19:06:52] [INFO ] After 1238ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 19:06:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-11 19:06:53] [INFO ] After 808ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 19:06:53] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:06:55] [INFO ] After 2725ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 19:06:56] [INFO ] After 3695ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 261 ms.
[2022-06-11 19:06:57] [INFO ] After 4830ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 24 ms.
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 306/306 places, 7936/7936 transitions.
Applied a total of 0 rules in 185 ms. Remains 306 /306 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 7936/7936 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 306/306 places, 7936/7936 transitions.
Applied a total of 0 rules in 220 ms. Remains 306 /306 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2022-06-11 19:06:57] [INFO ] Flow matrix only has 2605 transitions (discarded 5331 similar events)
// Phase 1: matrix 2605 rows 306 cols
[2022-06-11 19:06:57] [INFO ] Computed 3 place invariants in 16 ms
[2022-06-11 19:06:57] [INFO ] Implicit Places using invariants in 500 ms returned []
[2022-06-11 19:06:57] [INFO ] Flow matrix only has 2605 transitions (discarded 5331 similar events)
// Phase 1: matrix 2605 rows 306 cols
[2022-06-11 19:06:57] [INFO ] Computed 3 place invariants in 15 ms
[2022-06-11 19:06:58] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:07:06] [INFO ] Implicit Places using invariants and state equation in 8922 ms returned []
Implicit Place search using SMT with State Equation took 9422 ms to find 0 implicit places.
[2022-06-11 19:07:07] [INFO ] Redundant transitions in 680 ms returned []
[2022-06-11 19:07:07] [INFO ] Flow matrix only has 2605 transitions (discarded 5331 similar events)
// Phase 1: matrix 2605 rows 306 cols
[2022-06-11 19:07:07] [INFO ] Computed 3 place invariants in 18 ms
[2022-06-11 19:07:09] [INFO ] Dead Transitions using invariants and state equation in 2168 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 7936/7936 transitions.
Graph (trivial) has 5264 edges and 306 vertex of which 38 / 306 are part of one of the 2 SCC in 0 ms
Free SCC test removed 36 places
Drop transitions removed 4264 transitions
Ensure Unique test removed 1309 transitions
Reduce isomorphic transitions removed 5573 transitions.
Drop transitions removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 0 with 416 rules applied. Total rules applied 417 place count 270 transition count 1947
Applied a total of 417 rules in 113 ms. Remains 270 /306 variables (removed 36) and now considering 1947/7936 (removed 5989) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1947 rows 270 cols
[2022-06-11 19:07:09] [INFO ] Computed 3 place invariants in 16 ms
[2022-06-11 19:07:09] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-06-11 19:07:10] [INFO ] After 664ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 19:07:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-06-11 19:07:11] [INFO ] After 461ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 19:07:11] [INFO ] State equation strengthened by 504 read => feed constraints.
[2022-06-11 19:07:11] [INFO ] After 481ms SMT Verify possible using 504 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 19:07:13] [INFO ] After 2489ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 742 ms.
[2022-06-11 19:07:14] [INFO ] After 3751ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-11 19:07:14] [INFO ] Flatten gal took : 55 ms
[2022-06-11 19:07:14] [INFO ] Flatten gal took : 54 ms
[2022-06-11 19:07:14] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17458572271999971580.gal : 4 ms
[2022-06-11 19:07:14] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality8092518251093454564.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms14705365004631107511;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality17458572271999971580.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality8092518251093454564.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality8092518251093454564.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :6 after 18
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :18 after 46
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :46 after 273
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :273 after 399
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :399 after 553
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :553 after 1027
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1027 after 1205
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1205 after 1441
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :1441 after 1828
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :1828 after 2402
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :2402 after 10383
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,17666,5.69304,142308,2,3721,17,172934,7,0,3026,257225,0
Total reachable state count : 17666

Verifying 1 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,9,5.69541,142308,2,303,17,172934,7,0,3029,257225,0
ITS tools runner thread asked to quit. Dying gracefully.
Knowledge obtained : [p2, (X p2), true, (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 155 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 64 ms :[true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 459 ms.
Product exploration explored 100000 steps with 0 reset in 416 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p2), (NOT p2)]
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Applied a total of 0 rules in 188 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
[2022-06-11 19:07:22] [INFO ] Redundant transitions in 694 ms returned []
[2022-06-11 19:07:22] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:07:22] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 19:07:24] [INFO ] Dead Transitions using invariants and state equation in 1889 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 8064/8064 transitions.
Product exploration explored 100000 steps with 0 reset in 483 ms.
Product exploration explored 100000 steps with 0 reset in 422 ms.
Built C files in :
/tmp/ltsmin17805970704353610457
[2022-06-11 19:07:25] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17805970704353610457
Running compilation step : cd /tmp/ltsmin17805970704353610457;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17805970704353610457;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17805970704353610457;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Applied a total of 0 rules in 35 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
[2022-06-11 19:07:28] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:07:28] [INFO ] Computed 1 place invariants in 17 ms
[2022-06-11 19:07:28] [INFO ] Implicit Places using invariants in 435 ms returned []
[2022-06-11 19:07:28] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:07:28] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-11 19:07:29] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:07:34] [INFO ] Implicit Places using invariants and state equation in 5647 ms returned []
Implicit Place search using SMT with State Equation took 6092 ms to find 0 implicit places.
[2022-06-11 19:07:34] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2022-06-11 19:07:34] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-11 19:07:36] [INFO ] Dead Transitions using invariants and state equation in 2202 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 306/306 places, 8064/8064 transitions.
Built C files in :
/tmp/ltsmin1911374962569564157
[2022-06-11 19:07:36] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1911374962569564157
Running compilation step : cd /tmp/ltsmin1911374962569564157;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1911374962569564157;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1911374962569564157;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-11 19:07:40] [INFO ] Flatten gal took : 215 ms
[2022-06-11 19:07:40] [INFO ] Flatten gal took : 220 ms
[2022-06-11 19:07:40] [INFO ] Time to serialize gal into /tmp/LTL1196174506945039578.gal : 42 ms
[2022-06-11 19:07:40] [INFO ] Time to serialize properties into /tmp/LTL10384992095045994659.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1196174506945039578.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10384992095045994659.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1196174...267
Read 1 LTL properties
Checking formula 0 : !(((X((F("((p122<1)||(l38<1))"))||("((((p19<1)||(l33<1))&&((p113<1)||(l1<1)))&&((s6>=1)&&(l24>=1)))")))&&(G(X("((p96<1)||(l32<1))"))))...156
Formula 0 simplified : !(X("((((p19<1)||(l33<1))&&((p113<1)||(l1<1)))&&((s6>=1)&&(l24>=1)))" | F"((p122<1)||(l38<1))") & GX"((p96<1)||(l32<1))")
Detected timeout of ITS tools.
[2022-06-11 19:07:55] [INFO ] Flatten gal took : 322 ms
[2022-06-11 19:07:55] [INFO ] Applying decomposition
[2022-06-11 19:07:55] [INFO ] Flatten gal took : 212 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph18278708053047125555.txt' '-o' '/tmp/graph18278708053047125555.bin' '-w' '/tmp/graph18278708053047125555.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph18278708053047125555.bin' '-l' '-1' '-v' '-w' '/tmp/graph18278708053047125555.weights' '-q' '0' '-e' '0.001'
[2022-06-11 19:07:56] [INFO ] Decomposing Gal with order
[2022-06-11 19:07:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 19:07:57] [INFO ] Removed a total of 18093 redundant transitions.
[2022-06-11 19:07:57] [INFO ] Flatten gal took : 474 ms
[2022-06-11 19:07:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 976 labels/synchronizations in 117 ms.
[2022-06-11 19:07:57] [INFO ] Time to serialize gal into /tmp/LTL17044138852121741258.gal : 15 ms
[2022-06-11 19:07:57] [INFO ] Time to serialize properties into /tmp/LTL12439637114553642572.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17044138852121741258.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12439637114553642572.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1704413...247
Read 1 LTL properties
Checking formula 0 : !(((X((F("((i8.u41.p122<1)||(i8.u57.l38<1))"))||("((((i5.u6.p19<1)||(i7.u55.l33<1))&&((i5.u39.p113<1)||(i1.u44.l1<1)))&&((i1.u1.s6>=1)...224
Formula 0 simplified : !(X("((((i5.u6.p19<1)||(i7.u55.l33<1))&&((i5.u39.p113<1)||(i1.u44.l1<1)))&&((i1.u1.s6>=1)&&(i4.u52.l24>=1)))" | F"((i8.u41.p122<1)||...212
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin391211964145552935
[2022-06-11 19:08:12] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin391211964145552935
Running compilation step : cd /tmp/ltsmin391211964145552935;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin391211964145552935;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin391211964145552935;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property Szymanski-PT-b02-LTLFireability-09 finished in 159234 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U X(X(!p1)))))'
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 56 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2022-06-11 19:08:15] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:08:15] [INFO ] Computed 1 place invariants in 17 ms
[2022-06-11 19:08:16] [INFO ] Implicit Places using invariants in 417 ms returned []
[2022-06-11 19:08:16] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:08:16] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-11 19:08:16] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:08:22] [INFO ] Implicit Places using invariants and state equation in 6941 ms returned []
Implicit Place search using SMT with State Equation took 7387 ms to find 0 implicit places.
[2022-06-11 19:08:22] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:08:23] [INFO ] Computed 1 place invariants in 16 ms
[2022-06-11 19:08:25] [INFO ] Dead Transitions using invariants and state equation in 2222 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 236 ms :[p1, p1, p1, p1, p1, true, p1, (NOT p0)]
Running random walk in product with property : Szymanski-PT-b02-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 6}], [{ cond=p1, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=6 dest: 5}, { cond=(AND p0 p1), acceptance={0} source=6 dest: 6}, { cond=(AND p0 p1), acceptance={0} source=6 dest: 7}], [{ cond=(NOT p0), acceptance={} source=7 dest: 5}, { cond=p0, acceptance={} source=7 dest: 7}]], initial=0, aps=[p0:(AND (GEQ s124 1) (GEQ s283 1)), p1:(AND (GEQ s36 1) (GEQ s284 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 976 ms.
Product exploration explored 100000 steps with 25000 reset in 987 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 162 ms. Reduced automaton from 8 states, 13 edges and 2 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 137 ms :[p1, p1, p1, p1, true]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 159256 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 159256 steps, saw 53910 distinct states, run finished after 3001 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-11 19:08:30] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:08:30] [INFO ] Computed 1 place invariants in 20 ms
[2022-06-11 19:08:30] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 19:08:32] [INFO ] After 1740ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 19:08:32] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 19:08:34] [INFO ] After 1978ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 19:08:34] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:08:43] [INFO ] After 9069ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2022-06-11 19:08:43] [INFO ] After 11114ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 13 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 305 transition count 7809
Applied a total of 127 rules in 269 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7936 (removed 127) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7809/7936 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 163702 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :{}
Probabilistic random walk after 163702 steps, saw 54828 distinct states, run finished after 3001 ms. (steps per millisecond=54 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-11 19:08:47] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2022-06-11 19:08:47] [INFO ] Computed 2 place invariants in 17 ms
[2022-06-11 19:08:47] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-11 19:08:47] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:08:48] [INFO ] After 1244ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 19:08:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-11 19:08:48] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:08:49] [INFO ] After 1137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 19:08:49] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:08:58] [INFO ] After 9085ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2022-06-11 19:08:58] [INFO ] After 10284ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 16 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 182 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7809/7809 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 181 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
[2022-06-11 19:08:59] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2022-06-11 19:08:59] [INFO ] Computed 2 place invariants in 10 ms
[2022-06-11 19:08:59] [INFO ] Implicit Places using invariants in 434 ms returned []
[2022-06-11 19:08:59] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2022-06-11 19:08:59] [INFO ] Computed 2 place invariants in 14 ms
[2022-06-11 19:08:59] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:09:06] [INFO ] Implicit Places using invariants and state equation in 7512 ms returned []
Implicit Place search using SMT with State Equation took 7947 ms to find 0 implicit places.
[2022-06-11 19:09:07] [INFO ] Redundant transitions in 675 ms returned []
[2022-06-11 19:09:07] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2022-06-11 19:09:07] [INFO ] Computed 2 place invariants in 18 ms
[2022-06-11 19:09:09] [INFO ] Dead Transitions using invariants and state equation in 1888 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7809/7809 transitions.
Graph (trivial) has 5064 edges and 305 vertex of which 28 / 305 are part of one of the 5 SCC in 1 ms
Free SCC test removed 23 places
Drop transitions removed 3104 transitions
Ensure Unique test removed 2327 transitions
Reduce isomorphic transitions removed 5431 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 282 transition count 2375
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 7 place count 279 transition count 2375
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 11 place count 277 transition count 2373
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 277 transition count 2372
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 12 place count 277 transition count 2371
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 276 transition count 2371
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 276 transition count 2370
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 275 transition count 2370
Applied a total of 16 rules in 166 ms. Remains 275 /305 variables (removed 30) and now considering 2370/7809 (removed 5439) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2370 rows 275 cols
[2022-06-11 19:09:09] [INFO ] Computed 2 place invariants in 17 ms
[2022-06-11 19:09:09] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-11 19:09:09] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:09:09] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 19:09:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-11 19:09:09] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 19:09:10] [INFO ] After 683ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 19:09:10] [INFO ] State equation strengthened by 224 read => feed constraints.
[2022-06-11 19:09:10] [INFO ] After 454ms SMT Verify possible using 224 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 19:09:11] [INFO ] After 572ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 156 ms.
[2022-06-11 19:09:11] [INFO ] After 1464ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 161 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 125 ms :[p1, p1, p1, p1, true]
Stuttering acceptance computed with spot in 224 ms :[p1, p1, p1, p1, true]
Support contains 2 out of 305 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 31 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2022-06-11 19:09:11] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:09:11] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-11 19:09:12] [INFO ] Implicit Places using invariants in 417 ms returned []
[2022-06-11 19:09:12] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:09:12] [INFO ] Computed 1 place invariants in 17 ms
[2022-06-11 19:09:12] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:09:19] [INFO ] Implicit Places using invariants and state equation in 7342 ms returned []
Implicit Place search using SMT with State Equation took 7760 ms to find 0 implicit places.
[2022-06-11 19:09:19] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:09:19] [INFO ] Computed 1 place invariants in 14 ms
[2022-06-11 19:09:21] [INFO ] Dead Transitions using invariants and state equation in 1921 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(NOT p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 130 ms :[p1, p1, p1, p1, true]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 160467 steps, run timeout after 3005 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 160467 steps, saw 54238 distinct states, run finished after 3005 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-11 19:09:24] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:09:24] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-11 19:09:24] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:09:26] [INFO ] After 1545ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 19:09:26] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:09:28] [INFO ] After 1914ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 19:09:28] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:09:37] [INFO ] After 9071ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2022-06-11 19:09:37] [INFO ] After 11041ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 14 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 127 transitions
Reduce isomorphic transitions removed 127 transitions.
Iterating post reduction 0 with 127 rules applied. Total rules applied 127 place count 305 transition count 7809
Applied a total of 127 rules in 199 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7936 (removed 127) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7809/7936 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 170219 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 170219 steps, saw 56358 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-11 19:09:40] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2022-06-11 19:09:40] [INFO ] Computed 2 place invariants in 18 ms
[2022-06-11 19:09:40] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-11 19:09:40] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:09:41] [INFO ] After 1227ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 19:09:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2022-06-11 19:09:41] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2022-06-11 19:09:43] [INFO ] After 1106ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 19:09:43] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:09:52] [INFO ] After 9076ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2022-06-11 19:09:52] [INFO ] After 10241ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 15 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 181 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7809/7809 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7809/7809 transitions.
Applied a total of 0 rules in 180 ms. Remains 305 /305 variables (removed 0) and now considering 7809/7809 (removed 0) transitions.
[2022-06-11 19:09:52] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2022-06-11 19:09:52] [INFO ] Computed 2 place invariants in 20 ms
[2022-06-11 19:09:52] [INFO ] Implicit Places using invariants in 439 ms returned []
[2022-06-11 19:09:52] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2022-06-11 19:09:52] [INFO ] Computed 2 place invariants in 15 ms
[2022-06-11 19:09:53] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:09:59] [INFO ] Implicit Places using invariants and state equation in 6893 ms returned []
Implicit Place search using SMT with State Equation took 7337 ms to find 0 implicit places.
[2022-06-11 19:10:00] [INFO ] Redundant transitions in 680 ms returned []
[2022-06-11 19:10:00] [INFO ] Flow matrix only has 2605 transitions (discarded 5204 similar events)
// Phase 1: matrix 2605 rows 305 cols
[2022-06-11 19:10:00] [INFO ] Computed 2 place invariants in 16 ms
[2022-06-11 19:10:02] [INFO ] Dead Transitions using invariants and state equation in 1837 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7809/7809 transitions.
Graph (trivial) has 5064 edges and 305 vertex of which 28 / 305 are part of one of the 5 SCC in 0 ms
Free SCC test removed 23 places
Drop transitions removed 3104 transitions
Ensure Unique test removed 2327 transitions
Reduce isomorphic transitions removed 5431 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 1 place count 282 transition count 2375
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 7 place count 279 transition count 2375
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 11 place count 277 transition count 2373
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 277 transition count 2372
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 12 place count 277 transition count 2371
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 276 transition count 2371
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 276 transition count 2370
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 16 place count 275 transition count 2370
Applied a total of 16 rules in 154 ms. Remains 275 /305 variables (removed 30) and now considering 2370/7809 (removed 5439) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 2370 rows 275 cols
[2022-06-11 19:10:02] [INFO ] Computed 2 place invariants in 19 ms
[2022-06-11 19:10:02] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-11 19:10:02] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:10:02] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 19:10:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2022-06-11 19:10:02] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:10:03] [INFO ] After 685ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 19:10:03] [INFO ] State equation strengthened by 224 read => feed constraints.
[2022-06-11 19:10:03] [INFO ] After 451ms SMT Verify possible using 224 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 19:10:03] [INFO ] After 560ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 156 ms.
[2022-06-11 19:10:04] [INFO ] After 1458ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 60 ms. Reduced automaton from 5 states, 5 edges and 1 AP to 5 states, 5 edges and 1 AP.
Stuttering acceptance computed with spot in 131 ms :[p1, p1, p1, p1, true]
Stuttering acceptance computed with spot in 138 ms :[p1, p1, p1, p1, true]
Stuttering acceptance computed with spot in 122 ms :[p1, p1, p1, p1, true]
Product exploration explored 100000 steps with 25000 reset in 665 ms.
Product exploration explored 100000 steps with 25000 reset in 664 ms.
Applying partial POR strategy [true, false, false, false, true]
Stuttering acceptance computed with spot in 122 ms :[p1, p1, p1, p1, true]
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 186 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2022-06-11 19:10:06] [INFO ] Redundant transitions in 653 ms returned []
[2022-06-11 19:10:06] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:10:06] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-11 19:10:08] [INFO ] Dead Transitions using invariants and state equation in 1872 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7936/7936 transitions.
Product exploration explored 100000 steps with 25000 reset in 3271 ms.
Product exploration explored 100000 steps with 25000 reset in 3313 ms.
Built C files in :
/tmp/ltsmin14228254633055006214
[2022-06-11 19:10:15] [INFO ] Built C files in 39ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14228254633055006214
Running compilation step : cd /tmp/ltsmin14228254633055006214;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14228254633055006214;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14228254633055006214;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 30 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2022-06-11 19:10:18] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:10:18] [INFO ] Computed 1 place invariants in 21 ms
[2022-06-11 19:10:18] [INFO ] Implicit Places using invariants in 427 ms returned []
[2022-06-11 19:10:18] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:10:18] [INFO ] Computed 1 place invariants in 14 ms
[2022-06-11 19:10:19] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:10:25] [INFO ] Implicit Places using invariants and state equation in 6480 ms returned []
Implicit Place search using SMT with State Equation took 6909 ms to find 0 implicit places.
[2022-06-11 19:10:25] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:10:25] [INFO ] Computed 1 place invariants in 20 ms
[2022-06-11 19:10:27] [INFO ] Dead Transitions using invariants and state equation in 2228 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7936/7936 transitions.
Built C files in :
/tmp/ltsmin3443837719929099647
[2022-06-11 19:10:27] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3443837719929099647
Running compilation step : cd /tmp/ltsmin3443837719929099647;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3443837719929099647;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3443837719929099647;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-11 19:10:30] [INFO ] Flatten gal took : 211 ms
[2022-06-11 19:10:31] [INFO ] Flatten gal took : 215 ms
[2022-06-11 19:10:31] [INFO ] Time to serialize gal into /tmp/LTL14431723827321251805.gal : 17 ms
[2022-06-11 19:10:31] [INFO ] Time to serialize properties into /tmp/LTL2944663234965202294.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14431723827321251805.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2944663234965202294.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1443172...267
Read 1 LTL properties
Checking formula 0 : !((X((G("((p124>=1)&&(l27>=1))"))U(X(X(!("((p36>=1)&&(l28>=1))")))))))
Formula 0 simplified : !X(G"((p124>=1)&&(l27>=1))" U XX!"((p36>=1)&&(l28>=1))")
Detected timeout of ITS tools.
[2022-06-11 19:10:46] [INFO ] Flatten gal took : 241 ms
[2022-06-11 19:10:46] [INFO ] Applying decomposition
[2022-06-11 19:10:46] [INFO ] Flatten gal took : 208 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph16144178753244560518.txt' '-o' '/tmp/graph16144178753244560518.bin' '-w' '/tmp/graph16144178753244560518.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph16144178753244560518.bin' '-l' '-1' '-v' '-w' '/tmp/graph16144178753244560518.weights' '-q' '0' '-e' '0.001'
[2022-06-11 19:10:47] [INFO ] Decomposing Gal with order
[2022-06-11 19:10:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 19:10:47] [INFO ] Removed a total of 18142 redundant transitions.
[2022-06-11 19:10:47] [INFO ] Flatten gal took : 399 ms
[2022-06-11 19:10:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 1197 labels/synchronizations in 144 ms.
[2022-06-11 19:10:47] [INFO ] Time to serialize gal into /tmp/LTL665801556012222544.gal : 16 ms
[2022-06-11 19:10:47] [INFO ] Time to serialize properties into /tmp/LTL4817192086104178265.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL665801556012222544.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4817192086104178265.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL6658015...244
Read 1 LTL properties
Checking formula 0 : !((X((G("((i2.u42.p124>=1)&&(i5.u54.l27>=1))"))U(X(X(!("((i1.i1.u13.p36>=1)&&(i5.u54.l28>=1))")))))))
Formula 0 simplified : !X(G"((i2.u42.p124>=1)&&(i5.u54.l27>=1))" U XX!"((i1.i1.u13.p36>=1)&&(i5.u54.l28>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2593474233095106594
[2022-06-11 19:11:03] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2593474233095106594
Running compilation step : cd /tmp/ltsmin2593474233095106594;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2593474233095106594;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2593474233095106594;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property Szymanski-PT-b02-LTLFireability-10 finished in 170543 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(X(X(p0)))) U (X(!p2)&&p1)))'
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 49 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2022-06-11 19:11:06] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:11:06] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 19:11:06] [INFO ] Implicit Places using invariants in 420 ms returned []
[2022-06-11 19:11:06] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:11:06] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 19:11:07] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:11:13] [INFO ] Implicit Places using invariants and state equation in 7396 ms returned []
Implicit Place search using SMT with State Equation took 7825 ms to find 0 implicit places.
[2022-06-11 19:11:13] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:11:13] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 19:11:16] [INFO ] Dead Transitions using invariants and state equation in 2153 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 187 ms :[p2, (NOT p0), (OR (NOT p1) p2), (OR (NOT p1) (NOT p0) p2), (OR (NOT p0) p2)]
Running random walk in product with property : Szymanski-PT-b02-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}, { cond=(AND p1 p2), acceptance={} source=0 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}, { cond=p1, acceptance={0} source=3 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 1}, { cond=(AND (NOT p1) p2), acceptance={0} source=4 dest: 3}, { cond=(AND p1 p2), acceptance={0} source=4 dest: 4}]], initial=2, aps=[p1:(AND (GEQ s69 1) (GEQ s272 1)), p2:(AND (GEQ s9 1) (GEQ s301 1)), p0:(OR (AND (GEQ s9 1) (GEQ s301 1)) (AND (GEQ s69 1) (GEQ s272 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 499 ms.
Stack based approach found an accepted trace after 29 steps with 0 reset with depth 30 and stack size 30 in 1 ms.
FORMULA Szymanski-PT-b02-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Szymanski-PT-b02-LTLFireability-11 finished in 10740 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 218 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2022-06-11 19:11:17] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:11:17] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-11 19:11:17] [INFO ] Implicit Places using invariants in 407 ms returned []
[2022-06-11 19:11:17] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:11:17] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 19:11:17] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:11:24] [INFO ] Implicit Places using invariants and state equation in 7519 ms returned []
Implicit Place search using SMT with State Equation took 7927 ms to find 0 implicit places.
[2022-06-11 19:11:25] [INFO ] Redundant transitions in 688 ms returned []
[2022-06-11 19:11:25] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:11:25] [INFO ] Computed 1 place invariants in 14 ms
[2022-06-11 19:11:27] [INFO ] Dead Transitions using invariants and state equation in 2123 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : Szymanski-PT-b02-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s152 1) (GEQ s266 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 524 ms.
Stack based approach found an accepted trace after 67 steps with 0 reset with depth 68 and stack size 68 in 1 ms.
FORMULA Szymanski-PT-b02-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Szymanski-PT-b02-LTLFireability-12 finished in 11552 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(p0))&&F(p1)))'
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 54 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2022-06-11 19:11:28] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:11:28] [INFO ] Computed 1 place invariants in 21 ms
[2022-06-11 19:11:28] [INFO ] Implicit Places using invariants in 419 ms returned []
[2022-06-11 19:11:28] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:11:28] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 19:11:29] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:11:35] [INFO ] Implicit Places using invariants and state equation in 6716 ms returned []
Implicit Place search using SMT with State Equation took 7149 ms to find 0 implicit places.
[2022-06-11 19:11:35] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:11:35] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-11 19:11:37] [INFO ] Dead Transitions using invariants and state equation in 1931 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 70 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b02-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(OR (LT s123 1) (LT s282 1)), p0:(OR (LT s18 1) (LT s259 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 802 ms.
Product exploration explored 100000 steps with 50000 reset in 772 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 5 factoid took 94 ms. Reduced automaton from 3 states, 4 edges and 2 AP to 1 states, 0 edges and 0 AP.
FORMULA Szymanski-PT-b02-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Szymanski-PT-b02-LTLFireability-13 finished in 10917 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 252 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2022-06-11 19:11:39] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:11:39] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-11 19:11:39] [INFO ] Implicit Places using invariants in 423 ms returned []
[2022-06-11 19:11:39] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:11:39] [INFO ] Computed 1 place invariants in 14 ms
[2022-06-11 19:11:40] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:11:46] [INFO ] Implicit Places using invariants and state equation in 6792 ms returned []
Implicit Place search using SMT with State Equation took 7216 ms to find 0 implicit places.
[2022-06-11 19:11:47] [INFO ] Redundant transitions in 685 ms returned []
[2022-06-11 19:11:47] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:11:47] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 19:11:49] [INFO ] Dead Transitions using invariants and state equation in 2066 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Szymanski-PT-b02-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s55 1) (LT s292 1)), p1:(AND (GEQ s47 1) (GEQ s273 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 458 ms.
Stack based approach found an accepted trace after 30 steps with 0 reset with depth 31 and stack size 31 in 1 ms.
FORMULA Szymanski-PT-b02-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Szymanski-PT-b02-LTLFireability-14 finished in 10827 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(!F(G(F(p0)))) U X((!(p0 U p1)||!p2))))'
Support contains 6 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 54 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2022-06-11 19:11:50] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:11:50] [INFO ] Computed 1 place invariants in 21 ms
[2022-06-11 19:11:50] [INFO ] Implicit Places using invariants in 450 ms returned []
[2022-06-11 19:11:50] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:11:50] [INFO ] Computed 1 place invariants in 21 ms
[2022-06-11 19:11:51] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:11:58] [INFO ] Implicit Places using invariants and state equation in 7560 ms returned []
Implicit Place search using SMT with State Equation took 8015 ms to find 0 implicit places.
[2022-06-11 19:11:58] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:11:58] [INFO ] Computed 1 place invariants in 24 ms
[2022-06-11 19:12:00] [INFO ] Dead Transitions using invariants and state equation in 2069 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 162 ms :[(AND p1 p2), (AND p1 p2), p0, (AND p0 p1)]
Running random walk in product with property : Szymanski-PT-b02-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p2 p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p2 p1), acceptance={0} source=1 dest: 1}, { cond=(AND p2 p1), acceptance={} source=1 dest: 2}, { cond=(AND p2 p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (GEQ s37 1) (GEQ s278 1)), p0:(AND (GEQ s57 1) (GEQ s262 1)), p1:(AND (GEQ s52 1) (GEQ s259 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 715 ms.
Product exploration explored 100000 steps with 50000 reset in 709 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (NOT (AND p2 p0 (NOT p1)))), (X (NOT (AND p2 p1))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p2 p0 (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p2) (NOT p0) (NOT p1))
Knowledge based reduction with 8 factoid took 244 ms. Reduced automaton from 4 states, 9 edges and 3 AP to 1 states, 0 edges and 0 AP.
FORMULA Szymanski-PT-b02-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Szymanski-PT-b02-LTLFireability-15 finished in 12029 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(F(p0))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(X(G(p1)))))'
Found a SL insensitive property : Szymanski-PT-b02-LTLFireability-02
Stuttering acceptance computed with spot in 153 ms :[true, (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 81 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2022-06-11 19:12:02] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:12:02] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-11 19:12:02] [INFO ] Implicit Places using invariants in 455 ms returned []
[2022-06-11 19:12:02] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:12:03] [INFO ] Computed 1 place invariants in 16 ms
[2022-06-11 19:12:03] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:12:09] [INFO ] Implicit Places using invariants and state equation in 6729 ms returned []
Implicit Place search using SMT with State Equation took 7185 ms to find 0 implicit places.
[2022-06-11 19:12:09] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:12:09] [INFO ] Computed 1 place invariants in 22 ms
[2022-06-11 19:12:11] [INFO ] Dead Transitions using invariants and state equation in 1897 ms found 0 transitions.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/306 places, 7936/8064 transitions.
Running random walk in product with property : Szymanski-PT-b02-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (GEQ s94 1) (GEQ s287 1)), p1:(OR (LT s12 1) (LT s282 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, sl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 400 ms.
Product exploration explored 100000 steps with 0 reset in 409 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 490 ms. Reduced automaton from 5 states, 11 edges and 2 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 153391 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 153391 steps, saw 52304 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-11 19:12:16] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:12:16] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-11 19:12:16] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:12:17] [INFO ] After 1869ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 19:12:18] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:12:19] [INFO ] After 1794ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 19:12:19] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:12:28] [INFO ] After 8939ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 19:12:37] [INFO ] After 17953ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-06-11 19:12:37] [INFO ] After 19816ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 305 transition count 7810
Applied a total of 126 rules in 192 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7936 (removed 126) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7810/7936 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 169337 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :{}
Probabilistic random walk after 169337 steps, saw 56203 distinct states, run finished after 3001 ms. (steps per millisecond=56 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-11 19:12:41] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2022-06-11 19:12:41] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 19:12:41] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:12:42] [INFO ] After 1679ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 19:12:42] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:12:44] [INFO ] After 1618ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 19:12:44] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:12:48] [INFO ] After 3802ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 19:12:50] [INFO ] Deduced a trap composed of 72 places in 381 ms of which 0 ms to minimize.
[2022-06-11 19:12:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1076 ms
[2022-06-11 19:12:51] [INFO ] After 6618ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2398 ms.
[2022-06-11 19:12:53] [INFO ] After 10702ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 182 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7810/7810 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 184 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
[2022-06-11 19:12:53] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2022-06-11 19:12:53] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-11 19:12:54] [INFO ] Implicit Places using invariants in 430 ms returned []
[2022-06-11 19:12:54] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2022-06-11 19:12:54] [INFO ] Computed 1 place invariants in 14 ms
[2022-06-11 19:12:54] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:13:01] [INFO ] Implicit Places using invariants and state equation in 7534 ms returned []
Implicit Place search using SMT with State Equation took 7966 ms to find 0 implicit places.
[2022-06-11 19:13:02] [INFO ] Redundant transitions in 623 ms returned []
[2022-06-11 19:13:02] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2022-06-11 19:13:02] [INFO ] Computed 1 place invariants in 18 ms
[2022-06-11 19:13:04] [INFO ] Dead Transitions using invariants and state equation in 1849 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7810/7810 transitions.
Graph (trivial) has 4944 edges and 305 vertex of which 36 / 305 are part of one of the 2 SCC in 0 ms
Free SCC test removed 34 places
Drop transitions removed 3816 transitions
Ensure Unique test removed 1626 transitions
Reduce isomorphic transitions removed 5442 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 271 transition count 2367
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 270 transition count 2366
Drop transitions removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 2 with 416 rules applied. Total rules applied 420 place count 270 transition count 1950
Applied a total of 420 rules in 123 ms. Remains 270 /305 variables (removed 35) and now considering 1950/7810 (removed 5860) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1950 rows 270 cols
[2022-06-11 19:13:04] [INFO ] Computed 1 place invariants in 8 ms
[2022-06-11 19:13:04] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:13:05] [INFO ] After 655ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 19:13:05] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:13:05] [INFO ] After 593ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 19:13:05] [INFO ] State equation strengthened by 504 read => feed constraints.
[2022-06-11 19:13:07] [INFO ] After 1414ms SMT Verify possible using 504 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 19:13:07] [INFO ] After 1571ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 720 ms.
[2022-06-11 19:13:08] [INFO ] After 2939ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-11 19:13:08] [INFO ] Flatten gal took : 55 ms
[2022-06-11 19:13:08] [INFO ] Flatten gal took : 54 ms
[2022-06-11 19:13:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8132843691614087595.gal : 4 ms
[2022-06-11 19:13:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6376581771766817305.prop : 1 ms
Invoking ITS tools like this :cd /tmp/redAtoms6570942642637105657;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8132843691614087595.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6376581771766817305.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...319
Loading property file /tmp/ReachabilityCardinality6376581771766817305.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 21
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :21 after 226
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :226 after 949
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :949 after 1019
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1019 after 1120
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1120 after 1748
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1748 after 2004
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2004 after 2346
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2346 after 2902
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2902 after 4879
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 4097 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,12603,5.64418,149196,2,4636,17,152461,6,0,3032,150993,0
Total reachable state count : 12603

Verifying 1 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,1,5.64744,149196,2,271,17,152461,7,0,3036,150993,0
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X (AND (NOT p0) p1))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 484 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 70 ms :[true, (NOT p1), (NOT p1)]
Support contains 2 out of 305 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 31 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2022-06-11 19:13:14] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:13:14] [INFO ] Computed 1 place invariants in 20 ms
[2022-06-11 19:13:14] [INFO ] Implicit Places using invariants in 414 ms returned []
[2022-06-11 19:13:14] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:13:14] [INFO ] Computed 1 place invariants in 16 ms
[2022-06-11 19:13:15] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:13:21] [INFO ] Implicit Places using invariants and state equation in 7086 ms returned []
Implicit Place search using SMT with State Equation took 7500 ms to find 0 implicit places.
[2022-06-11 19:13:21] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:13:21] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 19:13:23] [INFO ] Dead Transitions using invariants and state equation in 1841 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 126 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 73 ms :[true, (NOT p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 165394 steps, run timeout after 3001 ms. (steps per millisecond=55 ) properties seen :{}
Probabilistic random walk after 165394 steps, saw 55427 distinct states, run finished after 3001 ms. (steps per millisecond=55 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-11 19:13:27] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:13:27] [INFO ] Computed 1 place invariants in 12 ms
[2022-06-11 19:13:27] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 5 ms returned sat
[2022-06-11 19:13:28] [INFO ] After 1781ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 19:13:28] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:13:30] [INFO ] After 1706ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 19:13:30] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:13:39] [INFO ] After 8939ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 19:13:48] [INFO ] After 17954ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2022-06-11 19:13:48] [INFO ] After 19726ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 305 transition count 7810
Applied a total of 126 rules in 191 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7936 (removed 126) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7810/7936 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 162707 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :{}
Probabilistic random walk after 162707 steps, saw 54631 distinct states, run finished after 3001 ms. (steps per millisecond=54 ) properties seen :0
Running SMT prover for 1 properties.
[2022-06-11 19:13:51] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2022-06-11 19:13:51] [INFO ] Computed 1 place invariants in 17 ms
[2022-06-11 19:13:51] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2022-06-11 19:13:53] [INFO ] After 1690ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 19:13:53] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:13:55] [INFO ] After 1651ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 19:13:55] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:13:59] [INFO ] After 3853ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 19:14:01] [INFO ] Deduced a trap composed of 72 places in 371 ms of which 0 ms to minimize.
[2022-06-11 19:14:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 1059 ms
[2022-06-11 19:14:01] [INFO ] After 6642ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2286 ms.
[2022-06-11 19:14:04] [INFO ] After 10637ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 188 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7810/7810 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 212 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
[2022-06-11 19:14:04] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2022-06-11 19:14:04] [INFO ] Computed 1 place invariants in 15 ms
[2022-06-11 19:14:05] [INFO ] Implicit Places using invariants in 410 ms returned []
[2022-06-11 19:14:05] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2022-06-11 19:14:05] [INFO ] Computed 1 place invariants in 16 ms
[2022-06-11 19:14:05] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:14:14] [INFO ] Implicit Places using invariants and state equation in 9301 ms returned []
Implicit Place search using SMT with State Equation took 9713 ms to find 0 implicit places.
[2022-06-11 19:14:15] [INFO ] Redundant transitions in 666 ms returned []
[2022-06-11 19:14:15] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2022-06-11 19:14:15] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-11 19:14:16] [INFO ] Dead Transitions using invariants and state equation in 1900 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7810/7810 transitions.
Graph (trivial) has 4944 edges and 305 vertex of which 36 / 305 are part of one of the 2 SCC in 1 ms
Free SCC test removed 34 places
Drop transitions removed 3816 transitions
Ensure Unique test removed 1626 transitions
Reduce isomorphic transitions removed 5442 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 271 transition count 2367
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 270 transition count 2366
Drop transitions removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 2 with 416 rules applied. Total rules applied 420 place count 270 transition count 1950
Applied a total of 420 rules in 121 ms. Remains 270 /305 variables (removed 35) and now considering 1950/7810 (removed 5860) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1950 rows 270 cols
[2022-06-11 19:14:17] [INFO ] Computed 1 place invariants in 13 ms
[2022-06-11 19:14:17] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:14:17] [INFO ] After 643ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2022-06-11 19:14:17] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2022-06-11 19:14:18] [INFO ] After 579ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2022-06-11 19:14:18] [INFO ] State equation strengthened by 504 read => feed constraints.
[2022-06-11 19:14:19] [INFO ] After 1414ms SMT Verify possible using 504 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2022-06-11 19:14:19] [INFO ] After 1574ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 726 ms.
[2022-06-11 19:14:20] [INFO ] After 2938ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2022-06-11 19:14:20] [INFO ] Flatten gal took : 54 ms
[2022-06-11 19:14:20] [INFO ] Flatten gal took : 54 ms
[2022-06-11 19:14:20] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality11600372503586286158.gal : 4 ms
[2022-06-11 19:14:20] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5941436482055820446.prop : 0 ms
Invoking ITS tools like this :cd /tmp/redAtoms12373315487959015712;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality11600372503586286158.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5941436482055820446.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...320
Loading property file /tmp/ReachabilityCardinality5941436482055820446.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :9 after 21
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :21 after 226
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :226 after 949
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :949 after 1019
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :1019 after 1120
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1120 after 1748
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1748 after 2004
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2004 after 2346
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :2346 after 2902
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :2902 after 4879
Reachability property apf0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 4097 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,12603,5.54515,149124,2,4636,17,152461,6,0,3032,150993,0
Total reachable state count : 12603

Verifying 1 reachability properties.
Reachability property apf0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
apf0,1,5.54898,149124,2,271,17,152461,7,0,3036,150993,0
Knowledge obtained : [p1, (X p1), true, (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 119 ms. Reduced automaton from 3 states, 4 edges and 1 AP to 3 states, 4 edges and 1 AP.
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 406 ms.
Product exploration explored 100000 steps with 0 reset in 463 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 93 ms :[true, (NOT p1), (NOT p1)]
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 185 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2022-06-11 19:14:28] [INFO ] Redundant transitions in 651 ms returned []
[2022-06-11 19:14:28] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:14:28] [INFO ] Computed 1 place invariants in 19 ms
[2022-06-11 19:14:30] [INFO ] Dead Transitions using invariants and state equation in 1877 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7936/7936 transitions.
Product exploration explored 100000 steps with 0 reset in 419 ms.
Product exploration explored 100000 steps with 0 reset in 419 ms.
Built C files in :
/tmp/ltsmin14817280823171519165
[2022-06-11 19:14:31] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14817280823171519165
Running compilation step : cd /tmp/ltsmin14817280823171519165;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14817280823171519165;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14817280823171519165;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 29 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2022-06-11 19:14:34] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:14:34] [INFO ] Computed 1 place invariants in 21 ms
[2022-06-11 19:14:34] [INFO ] Implicit Places using invariants in 421 ms returned []
[2022-06-11 19:14:34] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:14:34] [INFO ] Computed 1 place invariants in 16 ms
[2022-06-11 19:14:35] [INFO ] State equation strengthened by 147 read => feed constraints.
[2022-06-11 19:14:41] [INFO ] Implicit Places using invariants and state equation in 6756 ms returned []
Implicit Place search using SMT with State Equation took 7190 ms to find 0 implicit places.
[2022-06-11 19:14:41] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2022-06-11 19:14:41] [INFO ] Computed 1 place invariants in 30 ms
[2022-06-11 19:14:43] [INFO ] Dead Transitions using invariants and state equation in 1916 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 305/305 places, 7936/7936 transitions.
Built C files in :
/tmp/ltsmin3503324502153999476
[2022-06-11 19:14:43] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3503324502153999476
Running compilation step : cd /tmp/ltsmin3503324502153999476;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3503324502153999476;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin3503324502153999476;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-06-11 19:14:46] [INFO ] Flatten gal took : 209 ms
[2022-06-11 19:14:47] [INFO ] Flatten gal took : 229 ms
[2022-06-11 19:14:47] [INFO ] Time to serialize gal into /tmp/LTL4890410240964836893.gal : 20 ms
[2022-06-11 19:14:47] [INFO ] Time to serialize properties into /tmp/LTL7412485268206638586.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4890410240964836893.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7412485268206638586.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL4890410...266
Read 1 LTL properties
Checking formula 0 : !(((G("((p94>=1)&&(l33>=1))"))||(G(X(G("((p12<1)||(l26<1))"))))))
Formula 0 simplified : !(G"((p94>=1)&&(l33>=1))" | GXG"((p12<1)||(l26<1))")
Detected timeout of ITS tools.
[2022-06-11 19:15:02] [INFO ] Flatten gal took : 275 ms
[2022-06-11 19:15:02] [INFO ] Applying decomposition
[2022-06-11 19:15:02] [INFO ] Flatten gal took : 208 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph3088930763678528723.txt' '-o' '/tmp/graph3088930763678528723.bin' '-w' '/tmp/graph3088930763678528723.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph3088930763678528723.bin' '-l' '-1' '-v' '-w' '/tmp/graph3088930763678528723.weights' '-q' '0' '-e' '0.001'
[2022-06-11 19:15:03] [INFO ] Decomposing Gal with order
[2022-06-11 19:15:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 19:15:03] [INFO ] Removed a total of 18062 redundant transitions.
[2022-06-11 19:15:03] [INFO ] Flatten gal took : 370 ms
[2022-06-11 19:15:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 962 labels/synchronizations in 139 ms.
[2022-06-11 19:15:03] [INFO ] Time to serialize gal into /tmp/LTL7456129669557607522.gal : 15 ms
[2022-06-11 19:15:03] [INFO ] Time to serialize properties into /tmp/LTL9153491736540927575.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7456129669557607522.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9153491736540927575.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL7456129...245
Read 1 LTL properties
Checking formula 0 : !(((G("((i2.u31.p94>=1)&&(i1.i1.u56.l33>=1))"))||(G(X(G("((i3.u5.p12<1)||(i8.u55.l26<1))"))))))
Formula 0 simplified : !(G"((i2.u31.p94>=1)&&(i1.i1.u56.l33>=1))" | GXG"((i3.u5.p12<1)||(i8.u55.l26<1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4785872847476777123
[2022-06-11 19:15:18] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4785872847476777123
Running compilation step : cd /tmp/ltsmin4785872847476777123;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4785872847476777123;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4785872847476777123;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property Szymanski-PT-b02-LTLFireability-02 finished in 199657 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(!(X(!p0) U p1)))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(F(p0))||p1))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X((F(p0)||p1))&&G(X(p2))))'
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U X(X(!p1)))))'
[2022-06-11 19:15:22] [INFO ] Flatten gal took : 211 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8494100363543438940
[2022-06-11 19:15:22] [INFO ] Too many transitions (8064) to apply POR reductions. Disabling POR matrices.
[2022-06-11 19:15:22] [INFO ] Built C files in 119ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8494100363543438940
Running compilation step : cd /tmp/ltsmin8494100363543438940;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '120' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-06-11 19:15:22] [INFO ] Applying decomposition
[2022-06-11 19:15:22] [INFO ] Flatten gal took : 221 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph11751055646871754292.txt' '-o' '/tmp/graph11751055646871754292.bin' '-w' '/tmp/graph11751055646871754292.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph11751055646871754292.bin' '-l' '-1' '-v' '-w' '/tmp/graph11751055646871754292.weights' '-q' '0' '-e' '0.001'
[2022-06-11 19:15:23] [INFO ] Decomposing Gal with order
[2022-06-11 19:15:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-06-11 19:15:23] [INFO ] Removed a total of 18619 redundant transitions.
[2022-06-11 19:15:23] [INFO ] Flatten gal took : 373 ms
[2022-06-11 19:15:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 1156 labels/synchronizations in 169 ms.
[2022-06-11 19:15:24] [INFO ] Time to serialize gal into /tmp/LTLFireability5070412663379441335.gal : 21 ms
[2022-06-11 19:15:24] [INFO ] Time to serialize properties into /tmp/LTLFireability16941984591138428574.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5070412663379441335.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16941984591138428574.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 6 LTL properties
Checking formula 0 : !((F(G(F("((i1.i0.u29.p90<1)||(i5.u52.l19<1))")))))
Formula 0 simplified : !FGF"((i1.i0.u29.p90<1)||(i5.u52.l19<1))"
Compilation finished in 32582 ms.
Running link step : cd /tmp/ltsmin8494100363543438940;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 78 ms.
Running LTSmin : cd /tmp/ltsmin8494100363543438940;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([](<>((LTLAPp0==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t5, t7, t15, t18, t22, t24, t25, t29, t31, t33, t36, t38, t42, t44, t54, t57, t59, t60, t75, ...19167
Computing Next relation with stutter on 7125 deadlock states
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin8494100363543438940;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([](<>((LTLAPp0==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8494100363543438940;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([]((LTLAPp1==true))||[](X([]((LTLAPp2==true)))))' '--buchi-type=spotba'
LTSmin run took 26112 ms.
FORMULA Szymanski-PT-b02-LTLFireability-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin8494100363543438940;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(!(X(!(LTLAPp3==true)) U (LTLAPp4==true)))' '--buchi-type=spotba'
LTSmin run took 1681 ms.
FORMULA Szymanski-PT-b02-LTLFireability-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin8494100363543438940;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X(([](<>((LTLAPp5==true)))||(LTLAPp6==true))))' '--buchi-type=spotba'
LTSmin run took 5627 ms.
FORMULA Szymanski-PT-b02-LTLFireability-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin8494100363543438940;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(X((<>((LTLAPp7==true))||(LTLAPp8==true)))&&[](X((LTLAPp9==true))))' '--buchi-type=spotba'
LTSmin run took 736 ms.
FORMULA Szymanski-PT-b02-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin8494100363543438940;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(([]((LTLAPp10==true)) U X(X(!(LTLAPp11==true)))))' '--buchi-type=spotba'
LTSmin run took 372 ms.
FORMULA Szymanski-PT-b02-LTLFireability-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 4800 s
Running LTSmin : cd /tmp/ltsmin8494100363543438940;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([](<>((LTLAPp0==true))))' '--buchi-type=spotba'
25 unique states visited
25 strongly connected components in search stack
26 transitions explored
25 items max in DFS search stack
48181 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,482.488,3106656,1,0,2.43916e+06,2.31695e+06,26001,7.3229e+06,1481,3.03938e+07,7711059
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Szymanski-PT-b02-LTLFireability-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !(((G("((i2.i0.u31.p94>=1)&&(i2.i1.u57.l33>=1))"))||(G(X(G("((i0.u4.p12<1)||(i0.u55.l26<1))"))))))
Formula 1 simplified : !(G"((i2.i0.u31.p94>=1)&&(i2.i1.u57.l33>=1))" | GXG"((i0.u4.p12<1)||(i0.u55.l26<1))")
Computing Next relation with stutter on 7125 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
10730 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,589.785,3934640,1,0,3.08236e+06,2.51108e+06,24470,9.58435e+06,1444,3.27592e+07,2062364
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
Checking formula 2 : !((X(!((X(!("((i2.i0.u21.p60>=1)&&(i6.u54.l23>=1))")))U("((i1.i1.u56.p10>=1)&&(i2.i1.u57.l32>=1))")))))
Formula 2 simplified : !X!(X!"((i2.i0.u21.p60>=1)&&(i6.u54.l23>=1))" U "((i1.i1.u56.p10>=1)&&(i2.i1.u57.l32>=1))")
Computing Next relation with stutter on 7125 deadlock states
5 unique states visited
5 strongly connected components in search stack
5 transitions explored
5 items max in DFS search stack
6682 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,656.611,3934896,1,0,3.08236e+06,2.51108e+06,32340,9.58435e+06,1894,3.27592e+07,10174803
an accepting run exists (use option '-e' to print it)
Formula 2 is FALSE accepting run found.
Checking formula 3 : !((X(X((G(F("((i5.u50.p53<1)||(i8.u63.l47<1))")))||("((i8.u16.p47>=1)&&(i2.i1.u57.l34>=1))")))))
Formula 3 simplified : !XX("((i8.u16.p47>=1)&&(i2.i1.u57.l34>=1))" | GF"((i5.u50.p53<1)||(i8.u63.l47<1))")
Computing Next relation with stutter on 7125 deadlock states
6 unique states visited
6 strongly connected components in search stack
6 transitions explored
6 items max in DFS search stack
10465 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,761.254,3989664,1,0,3.84723e+06,2.51108e+06,32818,1.02153e+07,1907,3.27592e+07,17598881
an accepting run exists (use option '-e' to print it)
Formula 3 is FALSE accepting run found.
Checking formula 4 : !(((X((F("((i1.i0.u40.p122<1)||(i7.u59.l38<1))"))||("((((i7.u6.p19<1)||(i2.i1.u57.l33<1))&&((i7.u39.p113<1)||(i3.i0.u44.l1<1)))&&((i3....242
Formula 4 simplified : !(X("((((i7.u6.p19<1)||(i2.i1.u57.l33<1))&&((i7.u39.p113<1)||(i3.i0.u44.l1<1)))&&((i3.i1.u1.s6>=1)&&(i6.u54.l24>=1)))" | F"((i1.i0.u...230
Computing Next relation with stutter on 7125 deadlock states
Detected timeout of ITS tools.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 3103034 ms.

BK_STOP 1654976599874

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

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

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Szymanski-PT-b02"
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-4028"
echo " Executing tool itstools"
echo " Input is Szymanski-PT-b02, 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 r312-tall-165472283101036"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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