Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 32K Feb 26 00:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 183K Feb 26 00:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 248K Feb 25 23:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 935K Feb 25 23:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 23K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 48K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 143K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 78K Feb 26 01:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 358K Feb 26 01:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 999K Feb 26 01:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 3.3M Feb 26 01:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.2K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 14M Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678906188009

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S10J40
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 18:49:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 18:49:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 18:49:50] [INFO ] Load time of PNML (sax parser for PT used): 566 ms
[2023-03-15 18:49:50] [INFO ] Transformed 854 places.
[2023-03-15 18:49:50] [INFO ] Transformed 12340 transitions.
[2023-03-15 18:49:50] [INFO ] Parsed PT model containing 854 places and 12340 transitions and 113999 arcs in 707 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
[2023-03-15 18:49:50] [INFO ] Reduced 780 identical enabling conditions.
[2023-03-15 18:49:50] [INFO ] Reduced 780 identical enabling conditions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
FORMULA PolyORBNT-PT-S10J40-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J40-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 122 out of 854 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 854/854 places, 2230/2230 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 844 transition count 2230
Applied a total of 10 rules in 153 ms. Remains 844 /854 variables (removed 10) and now considering 2230/2230 (removed 0) transitions.
[2023-03-15 18:49:50] [INFO ] Flow matrix only has 2221 transitions (discarded 9 similar events)
// Phase 1: matrix 2221 rows 844 cols
[2023-03-15 18:49:50] [INFO ] Computed 102 place invariants in 145 ms
[2023-03-15 18:49:53] [INFO ] Dead Transitions using invariants and state equation in 2679 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
[2023-03-15 18:49:53] [INFO ] Flow matrix only has 1606 transitions (discarded 9 similar events)
// Phase 1: matrix 1606 rows 844 cols
[2023-03-15 18:49:53] [INFO ] Computed 102 place invariants in 64 ms
[2023-03-15 18:49:54] [INFO ] Implicit Places using invariants in 983 ms returned []
[2023-03-15 18:49:54] [INFO ] Flow matrix only has 1606 transitions (discarded 9 similar events)
[2023-03-15 18:49:54] [INFO ] Invariant cache hit.
[2023-03-15 18:49:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 18:50:08] [INFO ] Implicit Places using invariants and state equation in 14426 ms returned []
Implicit Place search using SMT with State Equation took 15424 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 844/854 places, 1615/2230 transitions.
Applied a total of 0 rules in 34 ms. Remains 844 /844 variables (removed 0) and now considering 1615/1615 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18325 ms. Remains : 844/854 places, 1615/2230 transitions.
Support contains 122 out of 844 places after structural reductions.
[2023-03-15 18:50:09] [INFO ] Flatten gal took : 257 ms
[2023-03-15 18:50:09] [INFO ] Flatten gal took : 230 ms
[2023-03-15 18:50:09] [INFO ] Input system was already deterministic with 1615 transitions.
Incomplete random walk after 10000 steps, including 558 resets, run finished after 762 ms. (steps per millisecond=13 ) properties (out of 27) seen :10
Incomplete Best-First random walk after 1000 steps, including 9 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 20 ms. (steps per millisecond=50 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=16 ) properties (out of 17) seen :1
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) 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 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :5
Running SMT prover for 10 properties.
[2023-03-15 18:50:10] [INFO ] Flow matrix only has 1606 transitions (discarded 9 similar events)
[2023-03-15 18:50:10] [INFO ] Invariant cache hit.
[2023-03-15 18:50:11] [INFO ] [Real]Absence check using 81 positive place invariants in 21 ms returned sat
[2023-03-15 18:50:11] [INFO ] [Real]Absence check using 81 positive and 21 generalized place invariants in 50 ms returned sat
[2023-03-15 18:50:11] [INFO ] After 529ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:9
[2023-03-15 18:50:11] [INFO ] [Nat]Absence check using 81 positive place invariants in 18 ms returned sat
[2023-03-15 18:50:11] [INFO ] [Nat]Absence check using 81 positive and 21 generalized place invariants in 33 ms returned sat
[2023-03-15 18:50:34] [INFO ] After 22142ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2023-03-15 18:50:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 18:50:36] [INFO ] After 2445ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :7
[2023-03-15 18:50:36] [INFO ] After 2446ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :7
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-15 18:50:36] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :7
Fused 10 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 32 ms.
Support contains 55 out of 844 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 844/844 places, 1615/1615 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 844 transition count 1570
Reduce places removed 45 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 46 rules applied. Total rules applied 91 place count 799 transition count 1569
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 92 place count 798 transition count 1569
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 92 place count 798 transition count 1525
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 180 place count 754 transition count 1525
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 181 place count 753 transition count 1524
Iterating global reduction 3 with 1 rules applied. Total rules applied 182 place count 753 transition count 1524
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 3 with 4 rules applied. Total rules applied 186 place count 751 transition count 1522
Applied a total of 186 rules in 249 ms. Remains 751 /844 variables (removed 93) and now considering 1522/1615 (removed 93) transitions.
[2023-03-15 18:50:36] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2023-03-15 18:50:36] [INFO ] Computed 102 place invariants in 33 ms
[2023-03-15 18:50:37] [INFO ] Dead Transitions using invariants and state equation in 972 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1223 ms. Remains : 751/844 places, 1522/1615 transitions.
Incomplete random walk after 10000 steps, including 709 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 9) seen :8
Incomplete Best-First random walk after 10000 steps, including 92 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 18:50:38] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
[2023-03-15 18:50:38] [INFO ] Invariant cache hit.
[2023-03-15 18:50:38] [INFO ] [Real]Absence check using 81 positive place invariants in 18 ms returned sat
[2023-03-15 18:50:38] [INFO ] [Real]Absence check using 81 positive and 21 generalized place invariants in 29 ms returned sat
[2023-03-15 18:50:38] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 18:50:38] [INFO ] [Nat]Absence check using 81 positive place invariants in 31 ms returned sat
[2023-03-15 18:50:38] [INFO ] [Nat]Absence check using 81 positive and 21 generalized place invariants in 30 ms returned sat
[2023-03-15 18:50:39] [INFO ] After 891ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 18:50:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 18:50:39] [INFO ] After 120ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 18:50:39] [INFO ] Deduced a trap composed of 310 places in 359 ms of which 3 ms to minimize.
[2023-03-15 18:50:40] [INFO ] Deduced a trap composed of 307 places in 382 ms of which 1 ms to minimize.
[2023-03-15 18:50:40] [INFO ] Deduced a trap composed of 299 places in 390 ms of which 1 ms to minimize.
[2023-03-15 18:50:41] [INFO ] Deduced a trap composed of 321 places in 336 ms of which 1 ms to minimize.
[2023-03-15 18:50:41] [INFO ] Deduced a trap composed of 327 places in 360 ms of which 1 ms to minimize.
[2023-03-15 18:50:41] [INFO ] Deduced a trap composed of 294 places in 329 ms of which 0 ms to minimize.
[2023-03-15 18:50:42] [INFO ] Deduced a trap composed of 340 places in 330 ms of which 0 ms to minimize.
[2023-03-15 18:50:42] [INFO ] Deduced a trap composed of 307 places in 334 ms of which 1 ms to minimize.
[2023-03-15 18:50:43] [INFO ] Deduced a trap composed of 317 places in 329 ms of which 2 ms to minimize.
[2023-03-15 18:50:43] [INFO ] Deduced a trap composed of 322 places in 350 ms of which 1 ms to minimize.
[2023-03-15 18:50:43] [INFO ] Deduced a trap composed of 306 places in 337 ms of which 1 ms to minimize.
[2023-03-15 18:50:44] [INFO ] Deduced a trap composed of 317 places in 348 ms of which 1 ms to minimize.
[2023-03-15 18:50:44] [INFO ] Deduced a trap composed of 300 places in 328 ms of which 1 ms to minimize.
[2023-03-15 18:50:45] [INFO ] Deduced a trap composed of 330 places in 345 ms of which 1 ms to minimize.
[2023-03-15 18:50:45] [INFO ] Deduced a trap composed of 327 places in 339 ms of which 0 ms to minimize.
[2023-03-15 18:50:45] [INFO ] Deduced a trap composed of 306 places in 328 ms of which 0 ms to minimize.
[2023-03-15 18:50:46] [INFO ] Deduced a trap composed of 314 places in 336 ms of which 0 ms to minimize.
[2023-03-15 18:50:46] [INFO ] Deduced a trap composed of 322 places in 357 ms of which 1 ms to minimize.
[2023-03-15 18:50:47] [INFO ] Deduced a trap composed of 300 places in 370 ms of which 1 ms to minimize.
[2023-03-15 18:50:47] [INFO ] Deduced a trap composed of 310 places in 353 ms of which 1 ms to minimize.
[2023-03-15 18:50:48] [INFO ] Deduced a trap composed of 312 places in 349 ms of which 1 ms to minimize.
[2023-03-15 18:50:48] [INFO ] Deduced a trap composed of 316 places in 360 ms of which 1 ms to minimize.
[2023-03-15 18:50:49] [INFO ] Deduced a trap composed of 300 places in 352 ms of which 1 ms to minimize.
[2023-03-15 18:50:49] [INFO ] Deduced a trap composed of 304 places in 333 ms of which 1 ms to minimize.
[2023-03-15 18:50:49] [INFO ] Deduced a trap composed of 326 places in 324 ms of which 1 ms to minimize.
[2023-03-15 18:50:50] [INFO ] Deduced a trap composed of 300 places in 343 ms of which 0 ms to minimize.
[2023-03-15 18:50:50] [INFO ] Deduced a trap composed of 314 places in 349 ms of which 1 ms to minimize.
[2023-03-15 18:50:51] [INFO ] Deduced a trap composed of 306 places in 329 ms of which 0 ms to minimize.
[2023-03-15 18:50:51] [INFO ] Deduced a trap composed of 304 places in 355 ms of which 1 ms to minimize.
[2023-03-15 18:50:52] [INFO ] Deduced a trap composed of 302 places in 350 ms of which 0 ms to minimize.
[2023-03-15 18:50:52] [INFO ] Deduced a trap composed of 316 places in 366 ms of which 1 ms to minimize.
[2023-03-15 18:50:53] [INFO ] Deduced a trap composed of 306 places in 324 ms of which 0 ms to minimize.
[2023-03-15 18:50:53] [INFO ] Deduced a trap composed of 320 places in 350 ms of which 1 ms to minimize.
[2023-03-15 18:50:54] [INFO ] Deduced a trap composed of 304 places in 321 ms of which 1 ms to minimize.
[2023-03-15 18:50:55] [INFO ] Deduced a trap composed of 310 places in 327 ms of which 4 ms to minimize.
[2023-03-15 18:50:56] [INFO ] Deduced a trap composed of 310 places in 330 ms of which 0 ms to minimize.
[2023-03-15 18:50:56] [INFO ] Deduced a trap composed of 291 places in 324 ms of which 0 ms to minimize.
[2023-03-15 18:50:57] [INFO ] Deduced a trap composed of 308 places in 326 ms of which 0 ms to minimize.
[2023-03-15 18:50:58] [INFO ] Deduced a trap composed of 298 places in 336 ms of which 1 ms to minimize.
[2023-03-15 18:50:59] [INFO ] Deduced a trap composed of 324 places in 334 ms of which 3 ms to minimize.
[2023-03-15 18:50:59] [INFO ] Deduced a trap composed of 316 places in 372 ms of which 1 ms to minimize.
[2023-03-15 18:51:00] [INFO ] Deduced a trap composed of 304 places in 323 ms of which 1 ms to minimize.
[2023-03-15 18:51:01] [INFO ] Deduced a trap composed of 318 places in 325 ms of which 1 ms to minimize.
[2023-03-15 18:51:01] [INFO ] Deduced a trap composed of 312 places in 321 ms of which 0 ms to minimize.
[2023-03-15 18:51:02] [INFO ] Deduced a trap composed of 308 places in 338 ms of which 1 ms to minimize.
[2023-03-15 18:51:02] [INFO ] Deduced a trap composed of 308 places in 352 ms of which 1 ms to minimize.
[2023-03-15 18:51:03] [INFO ] Deduced a trap composed of 316 places in 361 ms of which 0 ms to minimize.
[2023-03-15 18:51:03] [INFO ] Trap strengthening (SAT) tested/added 47/47 trap constraints in 23831 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 18:51:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 18:51:03] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 1522/1522 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 751 transition count 1521
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 2 place count 750 transition count 1521
Applied a total of 2 rules in 75 ms. Remains 750 /751 variables (removed 1) and now considering 1521/1522 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 750/751 places, 1521/1522 transitions.
Incomplete random walk after 10000 steps, including 734 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 191177 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 191177 steps, saw 32382 distinct states, run finished after 3002 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 18:51:06] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
// Phase 1: matrix 1512 rows 750 cols
[2023-03-15 18:51:06] [INFO ] Computed 102 place invariants in 37 ms
[2023-03-15 18:51:06] [INFO ] [Real]Absence check using 80 positive place invariants in 14 ms returned sat
[2023-03-15 18:51:06] [INFO ] [Real]Absence check using 80 positive and 22 generalized place invariants in 32 ms returned sat
[2023-03-15 18:51:06] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 18:51:06] [INFO ] [Nat]Absence check using 80 positive place invariants in 15 ms returned sat
[2023-03-15 18:51:06] [INFO ] [Nat]Absence check using 80 positive and 22 generalized place invariants in 35 ms returned sat
[2023-03-15 18:51:07] [INFO ] After 876ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 18:51:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 18:51:08] [INFO ] After 1026ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 18:51:09] [INFO ] Deduced a trap composed of 319 places in 358 ms of which 1 ms to minimize.
[2023-03-15 18:51:09] [INFO ] Deduced a trap composed of 317 places in 346 ms of which 0 ms to minimize.
[2023-03-15 18:51:09] [INFO ] Deduced a trap composed of 316 places in 347 ms of which 1 ms to minimize.
[2023-03-15 18:51:10] [INFO ] Deduced a trap composed of 294 places in 320 ms of which 1 ms to minimize.
[2023-03-15 18:51:10] [INFO ] Deduced a trap composed of 294 places in 327 ms of which 0 ms to minimize.
[2023-03-15 18:51:11] [INFO ] Deduced a trap composed of 294 places in 328 ms of which 0 ms to minimize.
[2023-03-15 18:51:11] [INFO ] Deduced a trap composed of 310 places in 327 ms of which 1 ms to minimize.
[2023-03-15 18:51:11] [INFO ] Deduced a trap composed of 306 places in 358 ms of which 1 ms to minimize.
[2023-03-15 18:51:12] [INFO ] Deduced a trap composed of 300 places in 334 ms of which 3 ms to minimize.
[2023-03-15 18:51:12] [INFO ] Deduced a trap composed of 300 places in 357 ms of which 2 ms to minimize.
[2023-03-15 18:51:13] [INFO ] Deduced a trap composed of 300 places in 355 ms of which 1 ms to minimize.
[2023-03-15 18:51:13] [INFO ] Deduced a trap composed of 310 places in 353 ms of which 0 ms to minimize.
[2023-03-15 18:51:14] [INFO ] Deduced a trap composed of 302 places in 346 ms of which 1 ms to minimize.
[2023-03-15 18:51:14] [INFO ] Deduced a trap composed of 310 places in 333 ms of which 0 ms to minimize.
[2023-03-15 18:51:15] [INFO ] Deduced a trap composed of 316 places in 353 ms of which 1 ms to minimize.
[2023-03-15 18:51:15] [INFO ] Deduced a trap composed of 310 places in 343 ms of which 1 ms to minimize.
[2023-03-15 18:51:15] [INFO ] Deduced a trap composed of 306 places in 350 ms of which 1 ms to minimize.
[2023-03-15 18:51:16] [INFO ] Deduced a trap composed of 306 places in 350 ms of which 0 ms to minimize.
[2023-03-15 18:51:16] [INFO ] Deduced a trap composed of 294 places in 359 ms of which 1 ms to minimize.
[2023-03-15 18:51:17] [INFO ] Deduced a trap composed of 296 places in 365 ms of which 1 ms to minimize.
[2023-03-15 18:51:17] [INFO ] Deduced a trap composed of 320 places in 350 ms of which 1 ms to minimize.
[2023-03-15 18:51:17] [INFO ] Deduced a trap composed of 298 places in 364 ms of which 2 ms to minimize.
[2023-03-15 18:51:18] [INFO ] Deduced a trap composed of 306 places in 352 ms of which 1 ms to minimize.
[2023-03-15 18:51:19] [INFO ] Deduced a trap composed of 296 places in 353 ms of which 0 ms to minimize.
[2023-03-15 18:51:19] [INFO ] Deduced a trap composed of 308 places in 354 ms of which 0 ms to minimize.
[2023-03-15 18:51:20] [INFO ] Deduced a trap composed of 314 places in 353 ms of which 0 ms to minimize.
[2023-03-15 18:51:20] [INFO ] Deduced a trap composed of 312 places in 330 ms of which 0 ms to minimize.
[2023-03-15 18:51:21] [INFO ] Deduced a trap composed of 296 places in 342 ms of which 1 ms to minimize.
[2023-03-15 18:51:21] [INFO ] Deduced a trap composed of 304 places in 333 ms of which 0 ms to minimize.
[2023-03-15 18:51:22] [INFO ] Deduced a trap composed of 310 places in 330 ms of which 1 ms to minimize.
[2023-03-15 18:51:22] [INFO ] Deduced a trap composed of 296 places in 327 ms of which 0 ms to minimize.
[2023-03-15 18:51:22] [INFO ] Deduced a trap composed of 311 places in 330 ms of which 1 ms to minimize.
[2023-03-15 18:51:23] [INFO ] Deduced a trap composed of 307 places in 328 ms of which 1 ms to minimize.
[2023-03-15 18:51:24] [INFO ] Deduced a trap composed of 325 places in 323 ms of which 1 ms to minimize.
[2023-03-15 18:51:24] [INFO ] Deduced a trap composed of 310 places in 325 ms of which 1 ms to minimize.
[2023-03-15 18:51:24] [INFO ] Deduced a trap composed of 296 places in 357 ms of which 1 ms to minimize.
[2023-03-15 18:51:25] [INFO ] Deduced a trap composed of 314 places in 349 ms of which 1 ms to minimize.
[2023-03-15 18:51:25] [INFO ] Deduced a trap composed of 310 places in 350 ms of which 1 ms to minimize.
[2023-03-15 18:51:26] [INFO ] Deduced a trap composed of 294 places in 357 ms of which 1 ms to minimize.
[2023-03-15 18:51:26] [INFO ] Deduced a trap composed of 304 places in 328 ms of which 1 ms to minimize.
[2023-03-15 18:51:27] [INFO ] Deduced a trap composed of 308 places in 359 ms of which 1 ms to minimize.
[2023-03-15 18:51:27] [INFO ] Deduced a trap composed of 296 places in 357 ms of which 1 ms to minimize.
[2023-03-15 18:51:27] [INFO ] Deduced a trap composed of 310 places in 361 ms of which 0 ms to minimize.
[2023-03-15 18:51:28] [INFO ] Deduced a trap composed of 302 places in 354 ms of which 1 ms to minimize.
[2023-03-15 18:51:28] [INFO ] Deduced a trap composed of 302 places in 357 ms of which 1 ms to minimize.
[2023-03-15 18:51:29] [INFO ] Deduced a trap composed of 310 places in 356 ms of which 0 ms to minimize.
[2023-03-15 18:51:29] [INFO ] Deduced a trap composed of 308 places in 358 ms of which 0 ms to minimize.
[2023-03-15 18:51:30] [INFO ] Deduced a trap composed of 312 places in 358 ms of which 0 ms to minimize.
[2023-03-15 18:51:31] [INFO ] Trap strengthening (SAT) tested/added 48/48 trap constraints in 22938 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 18:51:31] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 18:51:31] [INFO ] After 25021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1521/1521 transitions.
Applied a total of 0 rules in 54 ms. Remains 750 /750 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 750/750 places, 1521/1521 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1521/1521 transitions.
Applied a total of 0 rules in 48 ms. Remains 750 /750 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2023-03-15 18:51:31] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-15 18:51:31] [INFO ] Invariant cache hit.
[2023-03-15 18:51:32] [INFO ] Implicit Places using invariants in 899 ms returned []
[2023-03-15 18:51:32] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-15 18:51:32] [INFO ] Invariant cache hit.
[2023-03-15 18:51:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 18:51:50] [INFO ] Implicit Places using invariants and state equation in 17634 ms returned []
Implicit Place search using SMT with State Equation took 18537 ms to find 0 implicit places.
[2023-03-15 18:51:50] [INFO ] Redundant transitions in 96 ms returned []
[2023-03-15 18:51:50] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-15 18:51:50] [INFO ] Invariant cache hit.
[2023-03-15 18:51:51] [INFO ] Dead Transitions using invariants and state equation in 936 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19639 ms. Remains : 750/750 places, 1521/1521 transitions.
FORMULA PolyORBNT-PT-S10J40-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(p0)&&(p1||F((X((!p3 U (p1||G(!p3))))&&p2))))))'
Support contains 14 out of 844 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1615/1615 transitions.
Applied a total of 0 rules in 21 ms. Remains 844 /844 variables (removed 0) and now considering 1615/1615 (removed 0) transitions.
[2023-03-15 18:51:51] [INFO ] Flow matrix only has 1606 transitions (discarded 9 similar events)
// Phase 1: matrix 1606 rows 844 cols
[2023-03-15 18:51:51] [INFO ] Computed 102 place invariants in 38 ms
[2023-03-15 18:51:53] [INFO ] Dead Transitions using invariants and state equation in 1532 ms found 0 transitions.
[2023-03-15 18:51:53] [INFO ] Flow matrix only has 1606 transitions (discarded 9 similar events)
[2023-03-15 18:51:53] [INFO ] Invariant cache hit.
[2023-03-15 18:51:54] [INFO ] Implicit Places using invariants in 990 ms returned []
[2023-03-15 18:51:54] [INFO ] Flow matrix only has 1606 transitions (discarded 9 similar events)
[2023-03-15 18:51:54] [INFO ] Invariant cache hit.
[2023-03-15 18:51:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 18:52:11] [INFO ] Implicit Places using invariants and state equation in 17177 ms returned []
Implicit Place search using SMT with State Equation took 18169 ms to find 0 implicit places.
[2023-03-15 18:52:11] [INFO ] Flow matrix only has 1606 transitions (discarded 9 similar events)
[2023-03-15 18:52:11] [INFO ] Invariant cache hit.
[2023-03-15 18:52:13] [INFO ] Dead Transitions using invariants and state equation in 1650 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21375 ms. Remains : 844/844 places, 1615/1615 transitions.
Stuttering acceptance computed with spot in 302 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) p3)), (NOT p0), (OR (NOT p2) (AND (NOT p1) p3)), (AND (NOT p1) p3), true]
Running random walk in product with property : PolyORBNT-PT-S10J40-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) p3), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p2 p3), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(LT s393 1), p2:(AND (OR (LT s118 1) (LT s136 1) (LT s761 1)) (OR (LT s18 1) (LT s136 1) (LT s761 1)) (OR (LT s136 1) (LT s659 1) (LT s761 1)) (OR (LT ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 4 ms.
FORMULA PolyORBNT-PT-S10J40-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J40-LTLFireability-01 finished in 21750 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U G(p1))&&X(G(p2)))))'
Support contains 2 out of 844 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1615/1615 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 843 transition count 1614
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 843 transition count 1614
Applied a total of 2 rules in 46 ms. Remains 843 /844 variables (removed 1) and now considering 1614/1615 (removed 1) transitions.
[2023-03-15 18:52:13] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
// Phase 1: matrix 1605 rows 843 cols
[2023-03-15 18:52:13] [INFO ] Computed 102 place invariants in 25 ms
[2023-03-15 18:52:14] [INFO ] Dead Transitions using invariants and state equation in 1476 ms found 0 transitions.
[2023-03-15 18:52:14] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
[2023-03-15 18:52:14] [INFO ] Invariant cache hit.
[2023-03-15 18:52:16] [INFO ] Implicit Places using invariants in 1150 ms returned []
[2023-03-15 18:52:16] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
[2023-03-15 18:52:16] [INFO ] Invariant cache hit.
[2023-03-15 18:52:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 18:52:31] [INFO ] Implicit Places using invariants and state equation in 14913 ms returned []
Implicit Place search using SMT with State Equation took 16065 ms to find 0 implicit places.
[2023-03-15 18:52:31] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
[2023-03-15 18:52:31] [INFO ] Invariant cache hit.
[2023-03-15 18:52:32] [INFO ] Dead Transitions using invariants and state equation in 1646 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 843/844 places, 1614/1615 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19234 ms. Remains : 843/844 places, 1614/1615 transitions.
Stuttering acceptance computed with spot in 255 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), true, (NOT p1), (NOT p1), (NOT p2)]
Running random walk in product with property : PolyORBNT-PT-S10J40-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}, { cond=(OR p1 p0), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=4 dest: 3}, { cond=(AND p1 p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 2}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(OR (GEQ s514 1) (GEQ s292 1)), p0:(LT s292 1), p2:(GEQ s514 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 2 ms.
FORMULA PolyORBNT-PT-S10J40-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J40-LTLFireability-02 finished in 19521 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 44 out of 844 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 844/844 places, 1615/1615 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 844 transition count 1569
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 92 place count 798 transition count 1569
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 92 place count 798 transition count 1524
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 182 place count 753 transition count 1524
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 183 place count 752 transition count 1523
Iterating global reduction 2 with 1 rules applied. Total rules applied 184 place count 752 transition count 1523
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 188 place count 750 transition count 1521
Applied a total of 188 rules in 150 ms. Remains 750 /844 variables (removed 94) and now considering 1521/1615 (removed 94) transitions.
[2023-03-15 18:52:33] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
// Phase 1: matrix 1512 rows 750 cols
[2023-03-15 18:52:33] [INFO ] Computed 102 place invariants in 28 ms
[2023-03-15 18:52:34] [INFO ] Dead Transitions using invariants and state equation in 918 ms found 0 transitions.
[2023-03-15 18:52:34] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-15 18:52:34] [INFO ] Invariant cache hit.
[2023-03-15 18:52:34] [INFO ] Implicit Places using invariants in 897 ms returned []
[2023-03-15 18:52:34] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-15 18:52:34] [INFO ] Invariant cache hit.
[2023-03-15 18:52:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 18:52:47] [INFO ] Implicit Places using invariants and state equation in 12615 ms returned []
Implicit Place search using SMT with State Equation took 13515 ms to find 0 implicit places.
[2023-03-15 18:52:47] [INFO ] Redundant transitions in 77 ms returned []
[2023-03-15 18:52:47] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-15 18:52:47] [INFO ] Invariant cache hit.
[2023-03-15 18:52:48] [INFO ] Dead Transitions using invariants and state equation in 939 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 750/844 places, 1521/1615 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15609 ms. Remains : 750/844 places, 1521/1615 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-PT-S10J40-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(GEQ s235 3), p1:(OR (AND (GEQ s64 1) (GEQ s193 1) (GEQ s335 1)) (AND (GEQ s64 1) (GEQ s241 1) (GEQ s335 1)) (AND (GEQ s64 1) (GEQ s335 1) (GEQ s513 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S10J40-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J40-LTLFireability-03 finished in 15709 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 12 out of 844 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 844/844 places, 1615/1615 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 844 transition count 1570
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 799 transition count 1570
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 90 place count 799 transition count 1526
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 178 place count 755 transition count 1526
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 179 place count 754 transition count 1525
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 754 transition count 1525
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 2 with 4 rules applied. Total rules applied 184 place count 752 transition count 1523
Applied a total of 184 rules in 123 ms. Remains 752 /844 variables (removed 92) and now considering 1523/1615 (removed 92) transitions.
[2023-03-15 18:52:48] [INFO ] Flow matrix only has 1514 transitions (discarded 9 similar events)
// Phase 1: matrix 1514 rows 752 cols
[2023-03-15 18:52:48] [INFO ] Computed 102 place invariants in 20 ms
[2023-03-15 18:52:49] [INFO ] Dead Transitions using invariants and state equation in 1103 ms found 0 transitions.
[2023-03-15 18:52:49] [INFO ] Flow matrix only has 1514 transitions (discarded 9 similar events)
[2023-03-15 18:52:49] [INFO ] Invariant cache hit.
[2023-03-15 18:52:50] [INFO ] Implicit Places using invariants in 809 ms returned []
[2023-03-15 18:52:50] [INFO ] Flow matrix only has 1514 transitions (discarded 9 similar events)
[2023-03-15 18:52:50] [INFO ] Invariant cache hit.
[2023-03-15 18:52:51] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 18:53:02] [INFO ] Implicit Places using invariants and state equation in 11990 ms returned []
Implicit Place search using SMT with State Equation took 12802 ms to find 0 implicit places.
[2023-03-15 18:53:02] [INFO ] Redundant transitions in 36 ms returned []
[2023-03-15 18:53:02] [INFO ] Flow matrix only has 1514 transitions (discarded 9 similar events)
[2023-03-15 18:53:02] [INFO ] Invariant cache hit.
[2023-03-15 18:53:03] [INFO ] Dead Transitions using invariants and state equation in 1063 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 752/844 places, 1523/1615 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15160 ms. Remains : 752/844 places, 1523/1615 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J40-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s143 7) (GEQ s155 1) (GEQ s355 1) (GEQ s364 1) (GEQ s735 1)) (AND (GEQ s143 7) (GEQ s364 1) (GEQ s573 1) (GEQ s681 2)) (AND (GEQ s143 7) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S10J40-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J40-LTLFireability-04 finished in 15221 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(!p1)||p0)))'
Support contains 13 out of 844 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1615/1615 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 843 transition count 1614
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 843 transition count 1614
Applied a total of 2 rules in 41 ms. Remains 843 /844 variables (removed 1) and now considering 1614/1615 (removed 1) transitions.
[2023-03-15 18:53:03] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
// Phase 1: matrix 1605 rows 843 cols
[2023-03-15 18:53:03] [INFO ] Computed 102 place invariants in 22 ms
[2023-03-15 18:53:05] [INFO ] Dead Transitions using invariants and state equation in 1700 ms found 0 transitions.
[2023-03-15 18:53:05] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
[2023-03-15 18:53:05] [INFO ] Invariant cache hit.
[2023-03-15 18:53:06] [INFO ] Implicit Places using invariants in 937 ms returned []
[2023-03-15 18:53:06] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
[2023-03-15 18:53:06] [INFO ] Invariant cache hit.
[2023-03-15 18:53:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 18:53:20] [INFO ] Implicit Places using invariants and state equation in 13729 ms returned []
Implicit Place search using SMT with State Equation took 14681 ms to find 0 implicit places.
[2023-03-15 18:53:20] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
[2023-03-15 18:53:20] [INFO ] Invariant cache hit.
[2023-03-15 18:53:21] [INFO ] Dead Transitions using invariants and state equation in 1549 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 843/844 places, 1614/1615 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17976 ms. Remains : 843/844 places, 1614/1615 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : PolyORBNT-PT-S10J40-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s123 1) (AND (GEQ s162 9) (GEQ s403 1) (GEQ s509 1)) (AND (GEQ s162 9) (GEQ s403 1) (GEQ s641 1)) (AND (GEQ s162 9) (GEQ s403 1) (GEQ s786 1)) ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 1733 ms.
Product exploration explored 100000 steps with 50000 reset in 1667 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 2 states, 2 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-PT-S10J40-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-PT-S10J40-LTLFireability-05 finished in 21564 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(p1)))'
Support contains 45 out of 844 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1615/1615 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 843 transition count 1614
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 843 transition count 1614
Applied a total of 2 rules in 38 ms. Remains 843 /844 variables (removed 1) and now considering 1614/1615 (removed 1) transitions.
[2023-03-15 18:53:25] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
[2023-03-15 18:53:25] [INFO ] Invariant cache hit.
[2023-03-15 18:53:27] [INFO ] Dead Transitions using invariants and state equation in 1518 ms found 0 transitions.
[2023-03-15 18:53:27] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
[2023-03-15 18:53:27] [INFO ] Invariant cache hit.
[2023-03-15 18:53:28] [INFO ] Implicit Places using invariants in 1010 ms returned []
[2023-03-15 18:53:28] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
[2023-03-15 18:53:28] [INFO ] Invariant cache hit.
[2023-03-15 18:53:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 18:53:39] [INFO ] Implicit Places using invariants and state equation in 11467 ms returned []
Implicit Place search using SMT with State Equation took 12479 ms to find 0 implicit places.
[2023-03-15 18:53:39] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
[2023-03-15 18:53:39] [INFO ] Invariant cache hit.
[2023-03-15 18:53:41] [INFO ] Dead Transitions using invariants and state equation in 1558 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 843/844 places, 1614/1615 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15597 ms. Remains : 843/844 places, 1614/1615 transitions.
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : PolyORBNT-PT-S10J40-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s223 1) (GEQ s505 1) (GEQ s776 1)) (AND (GEQ s223 1) (GEQ s381 1) (GEQ s776 1)) (AND (GEQ s223 1) (GEQ s729 1) (GEQ s776 1)) (AND (GEQ s2...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S10J40-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J40-LTLFireability-07 finished in 15772 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 11 out of 844 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 844/844 places, 1615/1615 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 844 transition count 1571
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 88 place count 800 transition count 1571
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 44 Pre rules applied. Total rules applied 88 place count 800 transition count 1527
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 2 with 88 rules applied. Total rules applied 176 place count 756 transition count 1527
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 177 place count 755 transition count 1526
Iterating global reduction 2 with 1 rules applied. Total rules applied 178 place count 755 transition count 1526
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 2 with 4 rules applied. Total rules applied 182 place count 753 transition count 1524
Applied a total of 182 rules in 120 ms. Remains 753 /844 variables (removed 91) and now considering 1524/1615 (removed 91) transitions.
[2023-03-15 18:53:41] [INFO ] Flow matrix only has 1515 transitions (discarded 9 similar events)
// Phase 1: matrix 1515 rows 753 cols
[2023-03-15 18:53:41] [INFO ] Computed 102 place invariants in 28 ms
[2023-03-15 18:53:42] [INFO ] Dead Transitions using invariants and state equation in 1033 ms found 0 transitions.
[2023-03-15 18:53:42] [INFO ] Flow matrix only has 1515 transitions (discarded 9 similar events)
[2023-03-15 18:53:42] [INFO ] Invariant cache hit.
[2023-03-15 18:53:43] [INFO ] Implicit Places using invariants in 901 ms returned []
[2023-03-15 18:53:43] [INFO ] Flow matrix only has 1515 transitions (discarded 9 similar events)
[2023-03-15 18:53:43] [INFO ] Invariant cache hit.
[2023-03-15 18:53:43] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 18:53:56] [INFO ] Implicit Places using invariants and state equation in 13177 ms returned []
Implicit Place search using SMT with State Equation took 14080 ms to find 0 implicit places.
[2023-03-15 18:53:56] [INFO ] Redundant transitions in 35 ms returned []
[2023-03-15 18:53:56] [INFO ] Flow matrix only has 1515 transitions (discarded 9 similar events)
[2023-03-15 18:53:56] [INFO ] Invariant cache hit.
[2023-03-15 18:53:57] [INFO ] Dead Transitions using invariants and state equation in 1037 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 753/844 places, 1524/1615 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16322 ms. Remains : 753/844 places, 1524/1615 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J40-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s18 1) (LT s106 1) (LT s144 6) (LT s156 1) (LT s356 1) (LT s365 1) (AND (GEQ s108 1) (GEQ s281 1) (GEQ s64 1) (GEQ s499 1) (GEQ s604 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 6788 reset in 905 ms.
Product exploration explored 100000 steps with 6761 reset in 886 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 662 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 1) seen :0
Finished Best-First random walk after 59 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=59 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 130 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Support contains 11 out of 753 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 753/753 places, 1524/1524 transitions.
Applied a total of 0 rules in 39 ms. Remains 753 /753 variables (removed 0) and now considering 1524/1524 (removed 0) transitions.
[2023-03-15 18:54:00] [INFO ] Flow matrix only has 1515 transitions (discarded 9 similar events)
[2023-03-15 18:54:00] [INFO ] Invariant cache hit.
[2023-03-15 18:54:01] [INFO ] Dead Transitions using invariants and state equation in 1069 ms found 0 transitions.
[2023-03-15 18:54:01] [INFO ] Flow matrix only has 1515 transitions (discarded 9 similar events)
[2023-03-15 18:54:01] [INFO ] Invariant cache hit.
[2023-03-15 18:54:02] [INFO ] Implicit Places using invariants in 884 ms returned []
[2023-03-15 18:54:02] [INFO ] Flow matrix only has 1515 transitions (discarded 9 similar events)
[2023-03-15 18:54:02] [INFO ] Invariant cache hit.
[2023-03-15 18:54:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 18:54:19] [INFO ] Implicit Places using invariants and state equation in 17614 ms returned []
Implicit Place search using SMT with State Equation took 18502 ms to find 0 implicit places.
[2023-03-15 18:54:19] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-15 18:54:19] [INFO ] Flow matrix only has 1515 transitions (discarded 9 similar events)
[2023-03-15 18:54:19] [INFO ] Invariant cache hit.
[2023-03-15 18:54:20] [INFO ] Dead Transitions using invariants and state equation in 1027 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20682 ms. Remains : 753/753 places, 1524/1524 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 677 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 1) seen :0
Finished Best-First random walk after 59 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=59 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6793 reset in 853 ms.
Product exploration explored 100000 steps with 6761 reset in 880 ms.
Support contains 11 out of 753 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 753/753 places, 1524/1524 transitions.
Applied a total of 0 rules in 43 ms. Remains 753 /753 variables (removed 0) and now considering 1524/1524 (removed 0) transitions.
[2023-03-15 18:54:23] [INFO ] Flow matrix only has 1515 transitions (discarded 9 similar events)
[2023-03-15 18:54:23] [INFO ] Invariant cache hit.
[2023-03-15 18:54:24] [INFO ] Dead Transitions using invariants and state equation in 1066 ms found 0 transitions.
[2023-03-15 18:54:24] [INFO ] Flow matrix only has 1515 transitions (discarded 9 similar events)
[2023-03-15 18:54:24] [INFO ] Invariant cache hit.
[2023-03-15 18:54:25] [INFO ] Implicit Places using invariants in 895 ms returned []
[2023-03-15 18:54:25] [INFO ] Flow matrix only has 1515 transitions (discarded 9 similar events)
[2023-03-15 18:54:25] [INFO ] Invariant cache hit.
[2023-03-15 18:54:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 18:54:37] [INFO ] Implicit Places using invariants and state equation in 12364 ms returned []
Implicit Place search using SMT with State Equation took 13261 ms to find 0 implicit places.
[2023-03-15 18:54:37] [INFO ] Redundant transitions in 33 ms returned []
[2023-03-15 18:54:37] [INFO ] Flow matrix only has 1515 transitions (discarded 9 similar events)
[2023-03-15 18:54:37] [INFO ] Invariant cache hit.
[2023-03-15 18:54:38] [INFO ] Dead Transitions using invariants and state equation in 1052 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15467 ms. Remains : 753/753 places, 1524/1524 transitions.
Treatment of property PolyORBNT-PT-S10J40-LTLFireability-08 finished in 57742 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U ((G(F(p1))||G(!p2)) U X(p1))))'
Support contains 6 out of 844 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1615/1615 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 843 transition count 1614
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 843 transition count 1614
Applied a total of 2 rules in 35 ms. Remains 843 /844 variables (removed 1) and now considering 1614/1615 (removed 1) transitions.
[2023-03-15 18:54:39] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
// Phase 1: matrix 1605 rows 843 cols
[2023-03-15 18:54:39] [INFO ] Computed 102 place invariants in 21 ms
[2023-03-15 18:54:40] [INFO ] Dead Transitions using invariants and state equation in 1533 ms found 0 transitions.
[2023-03-15 18:54:40] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
[2023-03-15 18:54:40] [INFO ] Invariant cache hit.
[2023-03-15 18:54:41] [INFO ] Implicit Places using invariants in 1126 ms returned []
[2023-03-15 18:54:41] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
[2023-03-15 18:54:41] [INFO ] Invariant cache hit.
[2023-03-15 18:54:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 18:54:56] [INFO ] Implicit Places using invariants and state equation in 14724 ms returned []
Implicit Place search using SMT with State Equation took 15856 ms to find 0 implicit places.
[2023-03-15 18:54:56] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
[2023-03-15 18:54:56] [INFO ] Invariant cache hit.
[2023-03-15 18:54:58] [INFO ] Dead Transitions using invariants and state equation in 1598 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 843/844 places, 1614/1615 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19025 ms. Remains : 843/844 places, 1614/1615 transitions.
Stuttering acceptance computed with spot in 344 ms :[(NOT p1), (AND p2 (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p2)]
Running random walk in product with property : PolyORBNT-PT-S10J40-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={} source=0 dest: 5}], [{ cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 6}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 7}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) p2 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p1), acceptance={} source=5 dest: 4}, { cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=true, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p1) p2), acceptance={} source=7 dest: 4}, { cond=p2, acceptance={} source=7 dest: 6}, { cond=(NOT p2), acceptance={} source=7 dest: 7}]], initial=0, aps=[p2:(AND (GEQ s99 1) (GEQ s223 1) (GEQ s776 1)), p0:(AND (GEQ s294 1) (GEQ s814 1)), p1:(GEQ s91 4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5601 reset in 764 ms.
Product exploration explored 100000 steps with 5603 reset in 784 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p2))), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT p2))), true, (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 17 factoid took 798 ms. Reduced automaton from 8 states, 22 edges and 3 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 559 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 97354 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{1=1, 2=1, 3=1}
Probabilistic random walk after 97354 steps, saw 29162 distinct states, run finished after 3001 ms. (steps per millisecond=32 ) properties seen :3
Running SMT prover for 1 properties.
[2023-03-15 18:55:04] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
[2023-03-15 18:55:04] [INFO ] Invariant cache hit.
[2023-03-15 18:55:04] [INFO ] [Real]Absence check using 81 positive place invariants in 20 ms returned sat
[2023-03-15 18:55:04] [INFO ] [Real]Absence check using 81 positive and 21 generalized place invariants in 29 ms returned sat
[2023-03-15 18:55:04] [INFO ] After 658ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 18:55:05] [INFO ] [Nat]Absence check using 81 positive place invariants in 19 ms returned sat
[2023-03-15 18:55:05] [INFO ] [Nat]Absence check using 81 positive and 21 generalized place invariants in 29 ms returned sat
[2023-03-15 18:55:30] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 843/843 places, 1614/1614 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 843 transition count 1569
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 798 transition count 1569
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 90 place count 798 transition count 1524
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 180 place count 753 transition count 1524
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 186 place count 750 transition count 1521
Applied a total of 186 rules in 141 ms. Remains 750 /843 variables (removed 93) and now considering 1521/1614 (removed 93) transitions.
[2023-03-15 18:55:30] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
// Phase 1: matrix 1512 rows 750 cols
[2023-03-15 18:55:30] [INFO ] Computed 102 place invariants in 21 ms
[2023-03-15 18:55:31] [INFO ] Dead Transitions using invariants and state equation in 1044 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1205 ms. Remains : 750/843 places, 1521/1614 transitions.
Incomplete random walk after 10000 steps, including 718 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 97 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 189335 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 189335 steps, saw 32131 distinct states, run finished after 3003 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 18:55:34] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-15 18:55:34] [INFO ] Invariant cache hit.
[2023-03-15 18:55:34] [INFO ] [Real]Absence check using 80 positive place invariants in 21 ms returned sat
[2023-03-15 18:55:34] [INFO ] [Real]Absence check using 80 positive and 22 generalized place invariants in 31 ms returned sat
[2023-03-15 18:55:34] [INFO ] After 177ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 18:55:34] [INFO ] [Nat]Absence check using 80 positive place invariants in 33 ms returned sat
[2023-03-15 18:55:34] [INFO ] [Nat]Absence check using 80 positive and 22 generalized place invariants in 33 ms returned sat
[2023-03-15 18:55:35] [INFO ] After 598ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 18:55:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 18:55:36] [INFO ] After 1417ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 18:55:37] [INFO ] Deduced a trap composed of 308 places in 392 ms of which 0 ms to minimize.
[2023-03-15 18:55:37] [INFO ] Deduced a trap composed of 292 places in 369 ms of which 1 ms to minimize.
[2023-03-15 18:55:37] [INFO ] Deduced a trap composed of 325 places in 358 ms of which 0 ms to minimize.
[2023-03-15 18:55:38] [INFO ] Deduced a trap composed of 309 places in 359 ms of which 0 ms to minimize.
[2023-03-15 18:55:38] [INFO ] Deduced a trap composed of 304 places in 351 ms of which 1 ms to minimize.
[2023-03-15 18:55:39] [INFO ] Deduced a trap composed of 320 places in 355 ms of which 1 ms to minimize.
[2023-03-15 18:55:39] [INFO ] Deduced a trap composed of 315 places in 367 ms of which 0 ms to minimize.
[2023-03-15 18:55:40] [INFO ] Deduced a trap composed of 317 places in 352 ms of which 1 ms to minimize.
[2023-03-15 18:55:40] [INFO ] Deduced a trap composed of 310 places in 336 ms of which 1 ms to minimize.
[2023-03-15 18:55:41] [INFO ] Deduced a trap composed of 302 places in 365 ms of which 1 ms to minimize.
[2023-03-15 18:55:41] [INFO ] Deduced a trap composed of 311 places in 344 ms of which 1 ms to minimize.
[2023-03-15 18:55:41] [INFO ] Deduced a trap composed of 302 places in 354 ms of which 1 ms to minimize.
[2023-03-15 18:55:42] [INFO ] Deduced a trap composed of 310 places in 356 ms of which 1 ms to minimize.
[2023-03-15 18:55:42] [INFO ] Deduced a trap composed of 294 places in 365 ms of which 1 ms to minimize.
[2023-03-15 18:55:43] [INFO ] Deduced a trap composed of 312 places in 340 ms of which 1 ms to minimize.
[2023-03-15 18:55:43] [INFO ] Deduced a trap composed of 298 places in 335 ms of which 0 ms to minimize.
[2023-03-15 18:55:44] [INFO ] Deduced a trap composed of 314 places in 361 ms of which 0 ms to minimize.
[2023-03-15 18:55:44] [INFO ] Deduced a trap composed of 294 places in 337 ms of which 1 ms to minimize.
[2023-03-15 18:55:45] [INFO ] Deduced a trap composed of 317 places in 376 ms of which 1 ms to minimize.
[2023-03-15 18:55:45] [INFO ] Deduced a trap composed of 310 places in 373 ms of which 1 ms to minimize.
[2023-03-15 18:55:46] [INFO ] Deduced a trap composed of 309 places in 380 ms of which 1 ms to minimize.
[2023-03-15 18:55:46] [INFO ] Deduced a trap composed of 304 places in 350 ms of which 0 ms to minimize.
[2023-03-15 18:55:46] [INFO ] Deduced a trap composed of 302 places in 334 ms of which 1 ms to minimize.
[2023-03-15 18:55:47] [INFO ] Deduced a trap composed of 316 places in 338 ms of which 1 ms to minimize.
[2023-03-15 18:55:47] [INFO ] Deduced a trap composed of 314 places in 337 ms of which 1 ms to minimize.
[2023-03-15 18:55:48] [INFO ] Deduced a trap composed of 324 places in 339 ms of which 0 ms to minimize.
[2023-03-15 18:55:48] [INFO ] Deduced a trap composed of 302 places in 341 ms of which 0 ms to minimize.
[2023-03-15 18:55:48] [INFO ] Deduced a trap composed of 302 places in 340 ms of which 1 ms to minimize.
[2023-03-15 18:55:49] [INFO ] Deduced a trap composed of 308 places in 336 ms of which 1 ms to minimize.
[2023-03-15 18:55:49] [INFO ] Deduced a trap composed of 312 places in 345 ms of which 0 ms to minimize.
[2023-03-15 18:55:50] [INFO ] Deduced a trap composed of 290 places in 358 ms of which 0 ms to minimize.
[2023-03-15 18:55:50] [INFO ] Deduced a trap composed of 309 places in 362 ms of which 1 ms to minimize.
[2023-03-15 18:55:51] [INFO ] Deduced a trap composed of 310 places in 356 ms of which 1 ms to minimize.
[2023-03-15 18:55:51] [INFO ] Deduced a trap composed of 307 places in 336 ms of which 0 ms to minimize.
[2023-03-15 18:55:52] [INFO ] Deduced a trap composed of 311 places in 335 ms of which 0 ms to minimize.
[2023-03-15 18:55:52] [INFO ] Deduced a trap composed of 319 places in 375 ms of which 1 ms to minimize.
[2023-03-15 18:55:53] [INFO ] Deduced a trap composed of 305 places in 366 ms of which 1 ms to minimize.
[2023-03-15 18:55:54] [INFO ] Deduced a trap composed of 313 places in 338 ms of which 0 ms to minimize.
[2023-03-15 18:55:54] [INFO ] Deduced a trap composed of 296 places in 362 ms of which 1 ms to minimize.
[2023-03-15 18:55:54] [INFO ] Deduced a trap composed of 300 places in 355 ms of which 1 ms to minimize.
[2023-03-15 18:55:55] [INFO ] Deduced a trap composed of 320 places in 359 ms of which 1 ms to minimize.
[2023-03-15 18:55:55] [INFO ] Deduced a trap composed of 304 places in 332 ms of which 1 ms to minimize.
[2023-03-15 18:55:56] [INFO ] Deduced a trap composed of 298 places in 348 ms of which 0 ms to minimize.
[2023-03-15 18:55:56] [INFO ] Deduced a trap composed of 304 places in 341 ms of which 1 ms to minimize.
[2023-03-15 18:55:56] [INFO ] Deduced a trap composed of 309 places in 341 ms of which 1 ms to minimize.
[2023-03-15 18:55:57] [INFO ] Deduced a trap composed of 306 places in 336 ms of which 1 ms to minimize.
[2023-03-15 18:55:57] [INFO ] Deduced a trap composed of 312 places in 332 ms of which 1 ms to minimize.
[2023-03-15 18:55:58] [INFO ] Deduced a trap composed of 316 places in 407 ms of which 3 ms to minimize.
[2023-03-15 18:55:59] [INFO ] Deduced a trap composed of 302 places in 364 ms of which 0 ms to minimize.
[2023-03-15 18:55:59] [INFO ] Deduced a trap composed of 302 places in 327 ms of which 0 ms to minimize.
[2023-03-15 18:55:59] [INFO ] Trap strengthening (SAT) tested/added 50/50 trap constraints in 22822 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 18:55:59] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 18:55:59] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1521/1521 transitions.
Applied a total of 0 rules in 39 ms. Remains 750 /750 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 750/750 places, 1521/1521 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1521/1521 transitions.
Applied a total of 0 rules in 34 ms. Remains 750 /750 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2023-03-15 18:55:59] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-15 18:55:59] [INFO ] Invariant cache hit.
[2023-03-15 18:56:00] [INFO ] Implicit Places using invariants in 965 ms returned []
[2023-03-15 18:56:00] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-15 18:56:00] [INFO ] Invariant cache hit.
[2023-03-15 18:56:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 18:56:11] [INFO ] Implicit Places using invariants and state equation in 10609 ms returned []
Implicit Place search using SMT with State Equation took 11592 ms to find 0 implicit places.
[2023-03-15 18:56:11] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-15 18:56:11] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-15 18:56:11] [INFO ] Invariant cache hit.
[2023-03-15 18:56:12] [INFO ] Dead Transitions using invariants and state equation in 898 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12576 ms. Remains : 750/750 places, 1521/1521 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 750 transition count 1512
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 750 transition count 1511
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 749 transition count 1511
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 749 transition count 1510
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 748 transition count 1510
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 748 transition count 1500
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 738 transition count 1500
Applied a total of 33 rules in 178 ms. Remains 738 /750 variables (removed 12) and now considering 1500/1521 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1500 rows 738 cols
[2023-03-15 18:56:12] [INFO ] Computed 102 place invariants in 20 ms
[2023-03-15 18:56:12] [INFO ] [Real]Absence check using 80 positive place invariants in 20 ms returned sat
[2023-03-15 18:56:12] [INFO ] [Real]Absence check using 80 positive and 22 generalized place invariants in 77 ms returned sat
[2023-03-15 18:56:12] [INFO ] After 288ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 18:56:12] [INFO ] [Nat]Absence check using 80 positive place invariants in 14 ms returned sat
[2023-03-15 18:56:12] [INFO ] [Nat]Absence check using 80 positive and 22 generalized place invariants in 33 ms returned sat
[2023-03-15 18:56:13] [INFO ] After 870ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 18:56:14] [INFO ] Deduced a trap composed of 299 places in 305 ms of which 1 ms to minimize.
[2023-03-15 18:56:14] [INFO ] Deduced a trap composed of 284 places in 322 ms of which 0 ms to minimize.
[2023-03-15 18:56:14] [INFO ] Deduced a trap composed of 317 places in 315 ms of which 1 ms to minimize.
[2023-03-15 18:56:15] [INFO ] Deduced a trap composed of 302 places in 326 ms of which 1 ms to minimize.
[2023-03-15 18:56:15] [INFO ] Deduced a trap composed of 286 places in 320 ms of which 1 ms to minimize.
[2023-03-15 18:56:15] [INFO ] Deduced a trap composed of 288 places in 317 ms of which 1 ms to minimize.
[2023-03-15 18:56:16] [INFO ] Deduced a trap composed of 286 places in 309 ms of which 0 ms to minimize.
[2023-03-15 18:56:16] [INFO ] Deduced a trap composed of 294 places in 314 ms of which 1 ms to minimize.
[2023-03-15 18:56:16] [INFO ] Deduced a trap composed of 290 places in 321 ms of which 1 ms to minimize.
[2023-03-15 18:56:17] [INFO ] Deduced a trap composed of 304 places in 322 ms of which 1 ms to minimize.
[2023-03-15 18:56:17] [INFO ] Deduced a trap composed of 304 places in 305 ms of which 1 ms to minimize.
[2023-03-15 18:56:18] [INFO ] Deduced a trap composed of 300 places in 313 ms of which 1 ms to minimize.
[2023-03-15 18:56:18] [INFO ] Deduced a trap composed of 298 places in 322 ms of which 1 ms to minimize.
[2023-03-15 18:56:18] [INFO ] Deduced a trap composed of 294 places in 304 ms of which 0 ms to minimize.
[2023-03-15 18:56:19] [INFO ] Deduced a trap composed of 316 places in 318 ms of which 1 ms to minimize.
[2023-03-15 18:56:19] [INFO ] Deduced a trap composed of 284 places in 320 ms of which 0 ms to minimize.
[2023-03-15 18:56:19] [INFO ] Deduced a trap composed of 308 places in 309 ms of which 0 ms to minimize.
[2023-03-15 18:56:20] [INFO ] Deduced a trap composed of 304 places in 316 ms of which 1 ms to minimize.
[2023-03-15 18:56:20] [INFO ] Deduced a trap composed of 288 places in 324 ms of which 1 ms to minimize.
[2023-03-15 18:56:20] [INFO ] Deduced a trap composed of 290 places in 333 ms of which 0 ms to minimize.
[2023-03-15 18:56:21] [INFO ] Deduced a trap composed of 310 places in 317 ms of which 1 ms to minimize.
[2023-03-15 18:56:21] [INFO ] Deduced a trap composed of 310 places in 344 ms of which 0 ms to minimize.
[2023-03-15 18:56:22] [INFO ] Deduced a trap composed of 318 places in 304 ms of which 1 ms to minimize.
[2023-03-15 18:56:22] [INFO ] Deduced a trap composed of 319 places in 314 ms of which 1 ms to minimize.
[2023-03-15 18:56:22] [INFO ] Deduced a trap composed of 298 places in 308 ms of which 1 ms to minimize.
[2023-03-15 18:56:23] [INFO ] Deduced a trap composed of 294 places in 324 ms of which 0 ms to minimize.
[2023-03-15 18:56:23] [INFO ] Deduced a trap composed of 312 places in 311 ms of which 0 ms to minimize.
[2023-03-15 18:56:23] [INFO ] Deduced a trap composed of 314 places in 329 ms of which 1 ms to minimize.
[2023-03-15 18:56:24] [INFO ] Deduced a trap composed of 292 places in 332 ms of which 1 ms to minimize.
[2023-03-15 18:56:24] [INFO ] Deduced a trap composed of 310 places in 319 ms of which 0 ms to minimize.
[2023-03-15 18:56:24] [INFO ] Deduced a trap composed of 300 places in 319 ms of which 1 ms to minimize.
[2023-03-15 18:56:25] [INFO ] Deduced a trap composed of 318 places in 316 ms of which 1 ms to minimize.
[2023-03-15 18:56:25] [INFO ] Deduced a trap composed of 298 places in 303 ms of which 0 ms to minimize.
[2023-03-15 18:56:26] [INFO ] Deduced a trap composed of 292 places in 317 ms of which 1 ms to minimize.
[2023-03-15 18:56:26] [INFO ] Deduced a trap composed of 298 places in 301 ms of which 0 ms to minimize.
[2023-03-15 18:56:26] [INFO ] Deduced a trap composed of 312 places in 312 ms of which 0 ms to minimize.
[2023-03-15 18:56:27] [INFO ] Deduced a trap composed of 314 places in 301 ms of which 0 ms to minimize.
[2023-03-15 18:56:27] [INFO ] Deduced a trap composed of 310 places in 316 ms of which 1 ms to minimize.
[2023-03-15 18:56:27] [INFO ] Deduced a trap composed of 300 places in 313 ms of which 0 ms to minimize.
[2023-03-15 18:56:28] [INFO ] Deduced a trap composed of 296 places in 323 ms of which 1 ms to minimize.
[2023-03-15 18:56:28] [INFO ] Deduced a trap composed of 302 places in 296 ms of which 0 ms to minimize.
[2023-03-15 18:56:29] [INFO ] Deduced a trap composed of 303 places in 326 ms of which 1 ms to minimize.
[2023-03-15 18:56:29] [INFO ] Deduced a trap composed of 300 places in 328 ms of which 1 ms to minimize.
[2023-03-15 18:56:30] [INFO ] Deduced a trap composed of 290 places in 309 ms of which 1 ms to minimize.
[2023-03-15 18:56:30] [INFO ] Deduced a trap composed of 306 places in 323 ms of which 1 ms to minimize.
[2023-03-15 18:56:31] [INFO ] Deduced a trap composed of 308 places in 291 ms of which 1 ms to minimize.
[2023-03-15 18:56:31] [INFO ] Deduced a trap composed of 304 places in 320 ms of which 1 ms to minimize.
[2023-03-15 18:56:32] [INFO ] Deduced a trap composed of 302 places in 323 ms of which 1 ms to minimize.
[2023-03-15 18:56:32] [INFO ] Deduced a trap composed of 314 places in 321 ms of which 1 ms to minimize.
[2023-03-15 18:56:32] [INFO ] Deduced a trap composed of 318 places in 303 ms of which 1 ms to minimize.
[2023-03-15 18:56:33] [INFO ] Deduced a trap composed of 308 places in 335 ms of which 0 ms to minimize.
[2023-03-15 18:56:33] [INFO ] Deduced a trap composed of 294 places in 350 ms of which 0 ms to minimize.
[2023-03-15 18:56:33] [INFO ] Deduced a trap composed of 302 places in 318 ms of which 0 ms to minimize.
[2023-03-15 18:56:34] [INFO ] Deduced a trap composed of 316 places in 314 ms of which 0 ms to minimize.
[2023-03-15 18:56:34] [INFO ] Deduced a trap composed of 306 places in 316 ms of which 1 ms to minimize.
[2023-03-15 18:56:35] [INFO ] Deduced a trap composed of 320 places in 320 ms of which 0 ms to minimize.
[2023-03-15 18:56:35] [INFO ] Deduced a trap composed of 302 places in 306 ms of which 0 ms to minimize.
[2023-03-15 18:56:35] [INFO ] Deduced a trap composed of 296 places in 306 ms of which 1 ms to minimize.
[2023-03-15 18:56:36] [INFO ] Deduced a trap composed of 300 places in 294 ms of which 0 ms to minimize.
[2023-03-15 18:56:36] [INFO ] Deduced a trap composed of 298 places in 338 ms of which 1 ms to minimize.
[2023-03-15 18:56:36] [INFO ] Deduced a trap composed of 318 places in 293 ms of which 1 ms to minimize.
[2023-03-15 18:56:37] [INFO ] Deduced a trap composed of 308 places in 290 ms of which 1 ms to minimize.
[2023-03-15 18:56:37] [INFO ] Deduced a trap composed of 305 places in 318 ms of which 1 ms to minimize.
[2023-03-15 18:56:38] [INFO ] Deduced a trap composed of 304 places in 323 ms of which 0 ms to minimize.
[2023-03-15 18:56:38] [INFO ] Deduced a trap composed of 308 places in 301 ms of which 1 ms to minimize.
[2023-03-15 18:56:38] [INFO ] Deduced a trap composed of 320 places in 299 ms of which 1 ms to minimize.
[2023-03-15 18:56:39] [INFO ] Deduced a trap composed of 304 places in 295 ms of which 0 ms to minimize.
[2023-03-15 18:56:39] [INFO ] Deduced a trap composed of 298 places in 290 ms of which 1 ms to minimize.
[2023-03-15 18:56:40] [INFO ] Deduced a trap composed of 312 places in 303 ms of which 1 ms to minimize.
[2023-03-15 18:56:40] [INFO ] Deduced a trap composed of 312 places in 323 ms of which 1 ms to minimize.
[2023-03-15 18:56:41] [INFO ] Deduced a trap composed of 310 places in 289 ms of which 1 ms to minimize.
[2023-03-15 18:56:42] [INFO ] Deduced a trap composed of 294 places in 297 ms of which 1 ms to minimize.
[2023-03-15 18:56:42] [INFO ] Deduced a trap composed of 292 places in 315 ms of which 1 ms to minimize.
[2023-03-15 18:56:43] [INFO ] Deduced a trap composed of 300 places in 290 ms of which 1 ms to minimize.
[2023-03-15 18:56:43] [INFO ] Deduced a trap composed of 310 places in 293 ms of which 0 ms to minimize.
[2023-03-15 18:56:43] [INFO ] Deduced a trap composed of 317 places in 292 ms of which 1 ms to minimize.
[2023-03-15 18:56:44] [INFO ] Deduced a trap composed of 298 places in 316 ms of which 0 ms to minimize.
[2023-03-15 18:56:44] [INFO ] Deduced a trap composed of 302 places in 316 ms of which 0 ms to minimize.
[2023-03-15 18:56:45] [INFO ] Deduced a trap composed of 308 places in 314 ms of which 1 ms to minimize.
[2023-03-15 18:56:45] [INFO ] Deduced a trap composed of 328 places in 335 ms of which 0 ms to minimize.
[2023-03-15 18:56:45] [INFO ] Deduced a trap composed of 316 places in 314 ms of which 1 ms to minimize.
[2023-03-15 18:56:46] [INFO ] Deduced a trap composed of 290 places in 360 ms of which 1 ms to minimize.
[2023-03-15 18:56:46] [INFO ] Deduced a trap composed of 302 places in 323 ms of which 0 ms to minimize.
[2023-03-15 18:56:46] [INFO ] Deduced a trap composed of 306 places in 316 ms of which 1 ms to minimize.
[2023-03-15 18:56:47] [INFO ] Deduced a trap composed of 296 places in 292 ms of which 0 ms to minimize.
[2023-03-15 18:56:47] [INFO ] Deduced a trap composed of 306 places in 323 ms of which 1 ms to minimize.
[2023-03-15 18:56:48] [INFO ] Deduced a trap composed of 310 places in 311 ms of which 1 ms to minimize.
[2023-03-15 18:56:48] [INFO ] Deduced a trap composed of 312 places in 293 ms of which 0 ms to minimize.
[2023-03-15 18:56:48] [INFO ] Deduced a trap composed of 298 places in 295 ms of which 1 ms to minimize.
[2023-03-15 18:56:49] [INFO ] Deduced a trap composed of 294 places in 313 ms of which 1 ms to minimize.
[2023-03-15 18:56:49] [INFO ] Deduced a trap composed of 302 places in 318 ms of which 0 ms to minimize.
[2023-03-15 18:56:49] [INFO ] Deduced a trap composed of 302 places in 293 ms of which 1 ms to minimize.
[2023-03-15 18:56:50] [INFO ] Deduced a trap composed of 300 places in 312 ms of which 0 ms to minimize.
[2023-03-15 18:56:50] [INFO ] Deduced a trap composed of 300 places in 315 ms of which 0 ms to minimize.
[2023-03-15 18:56:50] [INFO ] Deduced a trap composed of 310 places in 319 ms of which 1 ms to minimize.
[2023-03-15 18:56:51] [INFO ] Deduced a trap composed of 292 places in 317 ms of which 0 ms to minimize.
[2023-03-15 18:56:51] [INFO ] Deduced a trap composed of 316 places in 325 ms of which 0 ms to minimize.
[2023-03-15 18:56:52] [INFO ] Deduced a trap composed of 292 places in 341 ms of which 2 ms to minimize.
[2023-03-15 18:56:52] [INFO ] Deduced a trap composed of 327 places in 299 ms of which 1 ms to minimize.
[2023-03-15 18:57:01] [INFO ] Trap strengthening (SAT) tested/added 99/99 trap constraints in 47794 ms
[2023-03-15 18:57:02] [INFO ] After 50179ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 18:57:03] [INFO ] After 50343ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND (NOT p2) (NOT p0) (NOT p1)), (X (AND (NOT p1) (NOT p2) (NOT p0))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) p2))), (X (NOT p1)), (X (NOT (AND (NOT p1) p0))), (X (X (NOT p2))), true, (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F p2), (F (NOT (AND (NOT p2) (NOT p1)))), (F (AND p2 (NOT p1)))]
Knowledge based reduction with 17 factoid took 715 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 201 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 195 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p2)]
[2023-03-15 18:57:04] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
// Phase 1: matrix 1605 rows 843 cols
[2023-03-15 18:57:04] [INFO ] Computed 102 place invariants in 24 ms
[2023-03-15 18:57:05] [INFO ] [Real]Absence check using 81 positive place invariants in 45 ms returned sat
[2023-03-15 18:57:05] [INFO ] [Real]Absence check using 81 positive and 21 generalized place invariants in 61 ms returned sat
[2023-03-15 18:57:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 18:57:07] [INFO ] [Real]Absence check using state equation in 2122 ms returned sat
[2023-03-15 18:57:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 18:57:08] [INFO ] [Nat]Absence check using 81 positive place invariants in 49 ms returned sat
[2023-03-15 18:57:08] [INFO ] [Nat]Absence check using 81 positive and 21 generalized place invariants in 58 ms returned sat
[2023-03-15 18:57:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 18:57:16] [INFO ] [Nat]Absence check using state equation in 7497 ms returned sat
[2023-03-15 18:57:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 18:57:16] [INFO ] [Nat]Added 1 Read/Feed constraints in 135 ms returned sat
[2023-03-15 18:57:16] [INFO ] Deduced a trap composed of 408 places in 398 ms of which 1 ms to minimize.
[2023-03-15 18:57:17] [INFO ] Deduced a trap composed of 404 places in 385 ms of which 1 ms to minimize.
[2023-03-15 18:57:18] [INFO ] Deduced a trap composed of 388 places in 384 ms of which 1 ms to minimize.
[2023-03-15 18:57:19] [INFO ] Deduced a trap composed of 393 places in 402 ms of which 1 ms to minimize.
[2023-03-15 18:57:19] [INFO ] Deduced a trap composed of 396 places in 388 ms of which 3 ms to minimize.
[2023-03-15 18:57:20] [INFO ] Deduced a trap composed of 402 places in 389 ms of which 1 ms to minimize.
[2023-03-15 18:57:21] [INFO ] Deduced a trap composed of 398 places in 390 ms of which 1 ms to minimize.
[2023-03-15 18:57:21] [INFO ] Deduced a trap composed of 392 places in 392 ms of which 1 ms to minimize.
[2023-03-15 18:57:22] [INFO ] Deduced a trap composed of 404 places in 378 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 18:57:22] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Support contains 4 out of 843 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 843/843 places, 1614/1614 transitions.
Applied a total of 0 rules in 17 ms. Remains 843 /843 variables (removed 0) and now considering 1614/1614 (removed 0) transitions.
[2023-03-15 18:57:22] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
[2023-03-15 18:57:22] [INFO ] Invariant cache hit.
[2023-03-15 18:57:24] [INFO ] Dead Transitions using invariants and state equation in 1600 ms found 0 transitions.
[2023-03-15 18:57:24] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
[2023-03-15 18:57:24] [INFO ] Invariant cache hit.
[2023-03-15 18:57:25] [INFO ] Implicit Places using invariants in 1109 ms returned []
[2023-03-15 18:57:25] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
[2023-03-15 18:57:25] [INFO ] Invariant cache hit.
[2023-03-15 18:57:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 18:57:39] [INFO ] Implicit Places using invariants and state equation in 14152 ms returned []
Implicit Place search using SMT with State Equation took 15264 ms to find 0 implicit places.
[2023-03-15 18:57:39] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
[2023-03-15 18:57:39] [INFO ] Invariant cache hit.
[2023-03-15 18:57:41] [INFO ] Dead Transitions using invariants and state equation in 1626 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18508 ms. Remains : 843/843 places, 1614/1614 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p2))), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 457 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p2)]
Incomplete random walk after 10000 steps, including 560 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 104 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 91368 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{1=1, 2=1, 3=1}
Probabilistic random walk after 91368 steps, saw 27656 distinct states, run finished after 3001 ms. (steps per millisecond=30 ) properties seen :3
Running SMT prover for 1 properties.
[2023-03-15 18:57:45] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
[2023-03-15 18:57:45] [INFO ] Invariant cache hit.
[2023-03-15 18:57:45] [INFO ] [Real]Absence check using 81 positive place invariants in 19 ms returned sat
[2023-03-15 18:57:45] [INFO ] [Real]Absence check using 81 positive and 21 generalized place invariants in 30 ms returned sat
[2023-03-15 18:57:46] [INFO ] After 659ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 18:57:46] [INFO ] [Nat]Absence check using 81 positive place invariants in 18 ms returned sat
[2023-03-15 18:57:46] [INFO ] [Nat]Absence check using 81 positive and 21 generalized place invariants in 29 ms returned sat
[2023-03-15 18:58:11] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 843 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 843/843 places, 1614/1614 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 843 transition count 1569
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 798 transition count 1569
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 90 place count 798 transition count 1524
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 180 place count 753 transition count 1524
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 186 place count 750 transition count 1521
Applied a total of 186 rules in 82 ms. Remains 750 /843 variables (removed 93) and now considering 1521/1614 (removed 93) transitions.
[2023-03-15 18:58:11] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
// Phase 1: matrix 1512 rows 750 cols
[2023-03-15 18:58:11] [INFO ] Computed 102 place invariants in 20 ms
[2023-03-15 18:58:12] [INFO ] Dead Transitions using invariants and state equation in 1012 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1094 ms. Remains : 750/843 places, 1521/1614 transitions.
Incomplete random walk after 10000 steps, including 712 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 92 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 191304 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 191304 steps, saw 32402 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 18:58:15] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-15 18:58:15] [INFO ] Invariant cache hit.
[2023-03-15 18:58:15] [INFO ] [Real]Absence check using 80 positive place invariants in 14 ms returned sat
[2023-03-15 18:58:15] [INFO ] [Real]Absence check using 80 positive and 22 generalized place invariants in 31 ms returned sat
[2023-03-15 18:58:15] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 18:58:15] [INFO ] [Nat]Absence check using 80 positive place invariants in 14 ms returned sat
[2023-03-15 18:58:15] [INFO ] [Nat]Absence check using 80 positive and 22 generalized place invariants in 44 ms returned sat
[2023-03-15 18:58:16] [INFO ] After 609ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 18:58:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 18:58:17] [INFO ] After 1421ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 18:58:18] [INFO ] Deduced a trap composed of 308 places in 328 ms of which 1 ms to minimize.
[2023-03-15 18:58:18] [INFO ] Deduced a trap composed of 292 places in 327 ms of which 1 ms to minimize.
[2023-03-15 18:58:18] [INFO ] Deduced a trap composed of 325 places in 331 ms of which 1 ms to minimize.
[2023-03-15 18:58:19] [INFO ] Deduced a trap composed of 309 places in 330 ms of which 1 ms to minimize.
[2023-03-15 18:58:19] [INFO ] Deduced a trap composed of 304 places in 355 ms of which 1 ms to minimize.
[2023-03-15 18:58:20] [INFO ] Deduced a trap composed of 320 places in 348 ms of which 1 ms to minimize.
[2023-03-15 18:58:20] [INFO ] Deduced a trap composed of 315 places in 349 ms of which 0 ms to minimize.
[2023-03-15 18:58:20] [INFO ] Deduced a trap composed of 317 places in 346 ms of which 1 ms to minimize.
[2023-03-15 18:58:21] [INFO ] Deduced a trap composed of 310 places in 322 ms of which 1 ms to minimize.
[2023-03-15 18:58:21] [INFO ] Deduced a trap composed of 302 places in 347 ms of which 1 ms to minimize.
[2023-03-15 18:58:22] [INFO ] Deduced a trap composed of 311 places in 344 ms of which 0 ms to minimize.
[2023-03-15 18:58:22] [INFO ] Deduced a trap composed of 302 places in 346 ms of which 1 ms to minimize.
[2023-03-15 18:58:23] [INFO ] Deduced a trap composed of 310 places in 355 ms of which 0 ms to minimize.
[2023-03-15 18:58:23] [INFO ] Deduced a trap composed of 294 places in 350 ms of which 0 ms to minimize.
[2023-03-15 18:58:24] [INFO ] Deduced a trap composed of 312 places in 332 ms of which 0 ms to minimize.
[2023-03-15 18:58:24] [INFO ] Deduced a trap composed of 298 places in 326 ms of which 1 ms to minimize.
[2023-03-15 18:58:24] [INFO ] Deduced a trap composed of 314 places in 329 ms of which 0 ms to minimize.
[2023-03-15 18:58:25] [INFO ] Deduced a trap composed of 294 places in 350 ms of which 1 ms to minimize.
[2023-03-15 18:58:25] [INFO ] Deduced a trap composed of 317 places in 354 ms of which 1 ms to minimize.
[2023-03-15 18:58:26] [INFO ] Deduced a trap composed of 310 places in 340 ms of which 1 ms to minimize.
[2023-03-15 18:58:26] [INFO ] Deduced a trap composed of 309 places in 353 ms of which 1 ms to minimize.
[2023-03-15 18:58:27] [INFO ] Deduced a trap composed of 304 places in 346 ms of which 1 ms to minimize.
[2023-03-15 18:58:27] [INFO ] Deduced a trap composed of 302 places in 358 ms of which 0 ms to minimize.
[2023-03-15 18:58:27] [INFO ] Deduced a trap composed of 316 places in 328 ms of which 1 ms to minimize.
[2023-03-15 18:58:28] [INFO ] Deduced a trap composed of 314 places in 323 ms of which 0 ms to minimize.
[2023-03-15 18:58:28] [INFO ] Deduced a trap composed of 324 places in 354 ms of which 1 ms to minimize.
[2023-03-15 18:58:29] [INFO ] Deduced a trap composed of 302 places in 347 ms of which 1 ms to minimize.
[2023-03-15 18:58:29] [INFO ] Deduced a trap composed of 302 places in 359 ms of which 1 ms to minimize.
[2023-03-15 18:58:30] [INFO ] Deduced a trap composed of 308 places in 356 ms of which 1 ms to minimize.
[2023-03-15 18:58:30] [INFO ] Deduced a trap composed of 312 places in 354 ms of which 1 ms to minimize.
[2023-03-15 18:58:30] [INFO ] Deduced a trap composed of 290 places in 349 ms of which 0 ms to minimize.
[2023-03-15 18:58:31] [INFO ] Deduced a trap composed of 309 places in 331 ms of which 1 ms to minimize.
[2023-03-15 18:58:31] [INFO ] Deduced a trap composed of 310 places in 351 ms of which 0 ms to minimize.
[2023-03-15 18:58:32] [INFO ] Deduced a trap composed of 307 places in 360 ms of which 1 ms to minimize.
[2023-03-15 18:58:32] [INFO ] Deduced a trap composed of 311 places in 353 ms of which 0 ms to minimize.
[2023-03-15 18:58:33] [INFO ] Deduced a trap composed of 319 places in 337 ms of which 5 ms to minimize.
[2023-03-15 18:58:34] [INFO ] Deduced a trap composed of 305 places in 348 ms of which 1 ms to minimize.
[2023-03-15 18:58:34] [INFO ] Deduced a trap composed of 313 places in 359 ms of which 1 ms to minimize.
[2023-03-15 18:58:35] [INFO ] Deduced a trap composed of 296 places in 353 ms of which 1 ms to minimize.
[2023-03-15 18:58:35] [INFO ] Deduced a trap composed of 300 places in 354 ms of which 1 ms to minimize.
[2023-03-15 18:58:35] [INFO ] Deduced a trap composed of 320 places in 321 ms of which 1 ms to minimize.
[2023-03-15 18:58:36] [INFO ] Deduced a trap composed of 304 places in 325 ms of which 1 ms to minimize.
[2023-03-15 18:58:36] [INFO ] Deduced a trap composed of 298 places in 333 ms of which 0 ms to minimize.
[2023-03-15 18:58:37] [INFO ] Deduced a trap composed of 304 places in 323 ms of which 1 ms to minimize.
[2023-03-15 18:58:37] [INFO ] Deduced a trap composed of 309 places in 323 ms of which 1 ms to minimize.
[2023-03-15 18:58:38] [INFO ] Deduced a trap composed of 306 places in 326 ms of which 1 ms to minimize.
[2023-03-15 18:58:38] [INFO ] Deduced a trap composed of 312 places in 320 ms of which 0 ms to minimize.
[2023-03-15 18:58:38] [INFO ] Deduced a trap composed of 316 places in 331 ms of which 0 ms to minimize.
[2023-03-15 18:58:39] [INFO ] Deduced a trap composed of 302 places in 315 ms of which 1 ms to minimize.
[2023-03-15 18:58:40] [INFO ] Deduced a trap composed of 302 places in 319 ms of which 1 ms to minimize.
[2023-03-15 18:58:40] [INFO ] Deduced a trap composed of 327 places in 326 ms of which 0 ms to minimize.
[2023-03-15 18:58:40] [INFO ] Trap strengthening (SAT) tested/added 51/51 trap constraints in 22819 ms
[2023-03-15 18:58:40] [INFO ] After 24246ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 18:58:40] [INFO ] After 25012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1521/1521 transitions.
Applied a total of 0 rules in 40 ms. Remains 750 /750 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 750/750 places, 1521/1521 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 1521/1521 transitions.
Applied a total of 0 rules in 32 ms. Remains 750 /750 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2023-03-15 18:58:40] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-15 18:58:40] [INFO ] Invariant cache hit.
[2023-03-15 18:58:41] [INFO ] Implicit Places using invariants in 949 ms returned []
[2023-03-15 18:58:41] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-15 18:58:41] [INFO ] Invariant cache hit.
[2023-03-15 18:58:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 18:58:56] [INFO ] Implicit Places using invariants and state equation in 14805 ms returned []
Implicit Place search using SMT with State Equation took 15754 ms to find 0 implicit places.
[2023-03-15 18:58:56] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-15 18:58:56] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-15 18:58:56] [INFO ] Invariant cache hit.
[2023-03-15 18:58:57] [INFO ] Dead Transitions using invariants and state equation in 930 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16756 ms. Remains : 750/750 places, 1521/1521 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 750 transition count 1512
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 750 transition count 1511
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 749 transition count 1511
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 749 transition count 1510
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 748 transition count 1510
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 748 transition count 1500
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 738 transition count 1500
Applied a total of 33 rules in 139 ms. Remains 738 /750 variables (removed 12) and now considering 1500/1521 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1500 rows 738 cols
[2023-03-15 18:58:57] [INFO ] Computed 102 place invariants in 28 ms
[2023-03-15 18:58:57] [INFO ] [Real]Absence check using 80 positive place invariants in 14 ms returned sat
[2023-03-15 18:58:57] [INFO ] [Real]Absence check using 80 positive and 22 generalized place invariants in 42 ms returned sat
[2023-03-15 18:58:57] [INFO ] After 162ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 18:58:57] [INFO ] [Nat]Absence check using 80 positive place invariants in 16 ms returned sat
[2023-03-15 18:58:57] [INFO ] [Nat]Absence check using 80 positive and 22 generalized place invariants in 34 ms returned sat
[2023-03-15 18:58:58] [INFO ] After 886ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 18:58:58] [INFO ] Deduced a trap composed of 299 places in 288 ms of which 1 ms to minimize.
[2023-03-15 18:58:59] [INFO ] Deduced a trap composed of 284 places in 314 ms of which 1 ms to minimize.
[2023-03-15 18:58:59] [INFO ] Deduced a trap composed of 317 places in 317 ms of which 0 ms to minimize.
[2023-03-15 18:59:00] [INFO ] Deduced a trap composed of 302 places in 316 ms of which 0 ms to minimize.
[2023-03-15 18:59:00] [INFO ] Deduced a trap composed of 286 places in 318 ms of which 1 ms to minimize.
[2023-03-15 18:59:00] [INFO ] Deduced a trap composed of 288 places in 323 ms of which 1 ms to minimize.
[2023-03-15 18:59:01] [INFO ] Deduced a trap composed of 286 places in 321 ms of which 0 ms to minimize.
[2023-03-15 18:59:01] [INFO ] Deduced a trap composed of 294 places in 319 ms of which 1 ms to minimize.
[2023-03-15 18:59:01] [INFO ] Deduced a trap composed of 290 places in 316 ms of which 0 ms to minimize.
[2023-03-15 18:59:02] [INFO ] Deduced a trap composed of 304 places in 297 ms of which 1 ms to minimize.
[2023-03-15 18:59:02] [INFO ] Deduced a trap composed of 304 places in 305 ms of which 0 ms to minimize.
[2023-03-15 18:59:02] [INFO ] Deduced a trap composed of 300 places in 314 ms of which 0 ms to minimize.
[2023-03-15 18:59:03] [INFO ] Deduced a trap composed of 298 places in 317 ms of which 0 ms to minimize.
[2023-03-15 18:59:03] [INFO ] Deduced a trap composed of 294 places in 314 ms of which 0 ms to minimize.
[2023-03-15 18:59:04] [INFO ] Deduced a trap composed of 316 places in 317 ms of which 0 ms to minimize.
[2023-03-15 18:59:04] [INFO ] Deduced a trap composed of 284 places in 314 ms of which 1 ms to minimize.
[2023-03-15 18:59:04] [INFO ] Deduced a trap composed of 308 places in 336 ms of which 1 ms to minimize.
[2023-03-15 18:59:05] [INFO ] Deduced a trap composed of 304 places in 321 ms of which 1 ms to minimize.
[2023-03-15 18:59:05] [INFO ] Deduced a trap composed of 288 places in 315 ms of which 1 ms to minimize.
[2023-03-15 18:59:05] [INFO ] Deduced a trap composed of 290 places in 312 ms of which 0 ms to minimize.
[2023-03-15 18:59:06] [INFO ] Deduced a trap composed of 310 places in 321 ms of which 0 ms to minimize.
[2023-03-15 18:59:06] [INFO ] Deduced a trap composed of 310 places in 328 ms of which 2 ms to minimize.
[2023-03-15 18:59:07] [INFO ] Deduced a trap composed of 318 places in 318 ms of which 1 ms to minimize.
[2023-03-15 18:59:07] [INFO ] Deduced a trap composed of 319 places in 296 ms of which 1 ms to minimize.
[2023-03-15 18:59:07] [INFO ] Deduced a trap composed of 298 places in 292 ms of which 0 ms to minimize.
[2023-03-15 18:59:08] [INFO ] Deduced a trap composed of 294 places in 298 ms of which 1 ms to minimize.
[2023-03-15 18:59:08] [INFO ] Deduced a trap composed of 312 places in 299 ms of which 0 ms to minimize.
[2023-03-15 18:59:08] [INFO ] Deduced a trap composed of 314 places in 302 ms of which 0 ms to minimize.
[2023-03-15 18:59:09] [INFO ] Deduced a trap composed of 292 places in 295 ms of which 1 ms to minimize.
[2023-03-15 18:59:09] [INFO ] Deduced a trap composed of 310 places in 300 ms of which 1 ms to minimize.
[2023-03-15 18:59:09] [INFO ] Deduced a trap composed of 300 places in 323 ms of which 1 ms to minimize.
[2023-03-15 18:59:10] [INFO ] Deduced a trap composed of 318 places in 318 ms of which 1 ms to minimize.
[2023-03-15 18:59:10] [INFO ] Deduced a trap composed of 298 places in 319 ms of which 1 ms to minimize.
[2023-03-15 18:59:10] [INFO ] Deduced a trap composed of 292 places in 307 ms of which 0 ms to minimize.
[2023-03-15 18:59:11] [INFO ] Deduced a trap composed of 298 places in 301 ms of which 1 ms to minimize.
[2023-03-15 18:59:11] [INFO ] Deduced a trap composed of 312 places in 319 ms of which 0 ms to minimize.
[2023-03-15 18:59:12] [INFO ] Deduced a trap composed of 314 places in 318 ms of which 0 ms to minimize.
[2023-03-15 18:59:12] [INFO ] Deduced a trap composed of 310 places in 299 ms of which 1 ms to minimize.
[2023-03-15 18:59:12] [INFO ] Deduced a trap composed of 300 places in 319 ms of which 0 ms to minimize.
[2023-03-15 18:59:13] [INFO ] Deduced a trap composed of 296 places in 300 ms of which 0 ms to minimize.
[2023-03-15 18:59:13] [INFO ] Deduced a trap composed of 302 places in 318 ms of which 1 ms to minimize.
[2023-03-15 18:59:14] [INFO ] Deduced a trap composed of 303 places in 316 ms of which 1 ms to minimize.
[2023-03-15 18:59:14] [INFO ] Deduced a trap composed of 300 places in 296 ms of which 1 ms to minimize.
[2023-03-15 18:59:15] [INFO ] Deduced a trap composed of 290 places in 290 ms of which 0 ms to minimize.
[2023-03-15 18:59:15] [INFO ] Deduced a trap composed of 306 places in 290 ms of which 1 ms to minimize.
[2023-03-15 18:59:16] [INFO ] Deduced a trap composed of 308 places in 323 ms of which 1 ms to minimize.
[2023-03-15 18:59:16] [INFO ] Deduced a trap composed of 304 places in 312 ms of which 1 ms to minimize.
[2023-03-15 18:59:16] [INFO ] Deduced a trap composed of 302 places in 315 ms of which 1 ms to minimize.
[2023-03-15 18:59:17] [INFO ] Deduced a trap composed of 314 places in 316 ms of which 0 ms to minimize.
[2023-03-15 18:59:17] [INFO ] Deduced a trap composed of 318 places in 325 ms of which 0 ms to minimize.
[2023-03-15 18:59:17] [INFO ] Deduced a trap composed of 308 places in 314 ms of which 0 ms to minimize.
[2023-03-15 18:59:18] [INFO ] Deduced a trap composed of 294 places in 315 ms of which 0 ms to minimize.
[2023-03-15 18:59:18] [INFO ] Deduced a trap composed of 302 places in 315 ms of which 0 ms to minimize.
[2023-03-15 18:59:19] [INFO ] Deduced a trap composed of 316 places in 322 ms of which 1 ms to minimize.
[2023-03-15 18:59:19] [INFO ] Deduced a trap composed of 306 places in 319 ms of which 0 ms to minimize.
[2023-03-15 18:59:19] [INFO ] Deduced a trap composed of 320 places in 316 ms of which 1 ms to minimize.
[2023-03-15 18:59:20] [INFO ] Deduced a trap composed of 302 places in 320 ms of which 1 ms to minimize.
[2023-03-15 18:59:20] [INFO ] Deduced a trap composed of 296 places in 320 ms of which 0 ms to minimize.
[2023-03-15 18:59:21] [INFO ] Deduced a trap composed of 300 places in 316 ms of which 1 ms to minimize.
[2023-03-15 18:59:21] [INFO ] Deduced a trap composed of 298 places in 320 ms of which 1 ms to minimize.
[2023-03-15 18:59:21] [INFO ] Deduced a trap composed of 318 places in 322 ms of which 1 ms to minimize.
[2023-03-15 18:59:22] [INFO ] Deduced a trap composed of 308 places in 322 ms of which 1 ms to minimize.
[2023-03-15 18:59:22] [INFO ] Deduced a trap composed of 305 places in 315 ms of which 1 ms to minimize.
[2023-03-15 18:59:22] [INFO ] Deduced a trap composed of 304 places in 314 ms of which 1 ms to minimize.
[2023-03-15 18:59:23] [INFO ] Deduced a trap composed of 308 places in 323 ms of which 1 ms to minimize.
[2023-03-15 18:59:23] [INFO ] Deduced a trap composed of 320 places in 320 ms of which 1 ms to minimize.
[2023-03-15 18:59:24] [INFO ] Deduced a trap composed of 304 places in 316 ms of which 1 ms to minimize.
[2023-03-15 18:59:24] [INFO ] Deduced a trap composed of 298 places in 316 ms of which 1 ms to minimize.
[2023-03-15 18:59:24] [INFO ] Deduced a trap composed of 312 places in 312 ms of which 0 ms to minimize.
[2023-03-15 18:59:25] [INFO ] Deduced a trap composed of 312 places in 324 ms of which 0 ms to minimize.
[2023-03-15 18:59:26] [INFO ] Deduced a trap composed of 310 places in 316 ms of which 0 ms to minimize.
[2023-03-15 18:59:27] [INFO ] Deduced a trap composed of 294 places in 329 ms of which 0 ms to minimize.
[2023-03-15 18:59:27] [INFO ] Deduced a trap composed of 292 places in 313 ms of which 0 ms to minimize.
[2023-03-15 18:59:28] [INFO ] Deduced a trap composed of 300 places in 307 ms of which 0 ms to minimize.
[2023-03-15 18:59:28] [INFO ] Deduced a trap composed of 310 places in 308 ms of which 0 ms to minimize.
[2023-03-15 18:59:28] [INFO ] Deduced a trap composed of 317 places in 315 ms of which 0 ms to minimize.
[2023-03-15 18:59:29] [INFO ] Deduced a trap composed of 298 places in 311 ms of which 1 ms to minimize.
[2023-03-15 18:59:29] [INFO ] Deduced a trap composed of 302 places in 303 ms of which 0 ms to minimize.
[2023-03-15 18:59:29] [INFO ] Deduced a trap composed of 308 places in 289 ms of which 1 ms to minimize.
[2023-03-15 18:59:30] [INFO ] Deduced a trap composed of 328 places in 310 ms of which 1 ms to minimize.
[2023-03-15 18:59:30] [INFO ] Deduced a trap composed of 316 places in 326 ms of which 0 ms to minimize.
[2023-03-15 18:59:31] [INFO ] Deduced a trap composed of 290 places in 316 ms of which 1 ms to minimize.
[2023-03-15 18:59:31] [INFO ] Deduced a trap composed of 302 places in 324 ms of which 1 ms to minimize.
[2023-03-15 18:59:31] [INFO ] Deduced a trap composed of 306 places in 310 ms of which 1 ms to minimize.
[2023-03-15 18:59:32] [INFO ] Deduced a trap composed of 296 places in 307 ms of which 1 ms to minimize.
[2023-03-15 18:59:32] [INFO ] Deduced a trap composed of 306 places in 334 ms of which 1 ms to minimize.
[2023-03-15 18:59:32] [INFO ] Deduced a trap composed of 310 places in 309 ms of which 1 ms to minimize.
[2023-03-15 18:59:33] [INFO ] Deduced a trap composed of 312 places in 326 ms of which 1 ms to minimize.
[2023-03-15 18:59:33] [INFO ] Deduced a trap composed of 298 places in 307 ms of which 1 ms to minimize.
[2023-03-15 18:59:34] [INFO ] Deduced a trap composed of 294 places in 332 ms of which 2 ms to minimize.
[2023-03-15 18:59:34] [INFO ] Deduced a trap composed of 302 places in 316 ms of which 0 ms to minimize.
[2023-03-15 18:59:34] [INFO ] Deduced a trap composed of 302 places in 307 ms of which 1 ms to minimize.
[2023-03-15 18:59:35] [INFO ] Deduced a trap composed of 300 places in 319 ms of which 0 ms to minimize.
[2023-03-15 18:59:35] [INFO ] Deduced a trap composed of 300 places in 339 ms of which 1 ms to minimize.
[2023-03-15 18:59:35] [INFO ] Deduced a trap composed of 310 places in 311 ms of which 1 ms to minimize.
[2023-03-15 18:59:36] [INFO ] Deduced a trap composed of 292 places in 324 ms of which 0 ms to minimize.
[2023-03-15 18:59:36] [INFO ] Deduced a trap composed of 316 places in 318 ms of which 2 ms to minimize.
[2023-03-15 18:59:37] [INFO ] Deduced a trap composed of 292 places in 315 ms of which 0 ms to minimize.
[2023-03-15 18:59:37] [INFO ] Deduced a trap composed of 327 places in 309 ms of which 0 ms to minimize.
[2023-03-15 18:59:46] [INFO ] Trap strengthening (SAT) tested/added 99/99 trap constraints in 47788 ms
[2023-03-15 18:59:48] [INFO ] After 50412ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 18:59:48] [INFO ] After 50570ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT p2)), (X (AND (NOT p2) (NOT p1))), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT p2))), true, (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p2), (F (NOT (AND (NOT p2) (NOT p1)))), (F (AND p2 (NOT p1)))]
Knowledge based reduction with 10 factoid took 432 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 183 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p2)]
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p2)]
[2023-03-15 18:59:49] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
// Phase 1: matrix 1605 rows 843 cols
[2023-03-15 18:59:49] [INFO ] Computed 102 place invariants in 27 ms
[2023-03-15 18:59:50] [INFO ] [Real]Absence check using 81 positive place invariants in 46 ms returned sat
[2023-03-15 18:59:50] [INFO ] [Real]Absence check using 81 positive and 21 generalized place invariants in 63 ms returned sat
[2023-03-15 18:59:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 18:59:52] [INFO ] [Real]Absence check using state equation in 2182 ms returned sat
[2023-03-15 18:59:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 18:59:53] [INFO ] [Nat]Absence check using 81 positive place invariants in 48 ms returned sat
[2023-03-15 18:59:53] [INFO ] [Nat]Absence check using 81 positive and 21 generalized place invariants in 62 ms returned sat
[2023-03-15 18:59:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 19:00:01] [INFO ] [Nat]Absence check using state equation in 7416 ms returned sat
[2023-03-15 19:00:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 19:00:01] [INFO ] [Nat]Added 1 Read/Feed constraints in 126 ms returned sat
[2023-03-15 19:00:01] [INFO ] Deduced a trap composed of 408 places in 384 ms of which 0 ms to minimize.
[2023-03-15 19:00:02] [INFO ] Deduced a trap composed of 404 places in 391 ms of which 1 ms to minimize.
[2023-03-15 19:00:03] [INFO ] Deduced a trap composed of 388 places in 376 ms of which 1 ms to minimize.
[2023-03-15 19:00:03] [INFO ] Deduced a trap composed of 393 places in 381 ms of which 0 ms to minimize.
[2023-03-15 19:00:04] [INFO ] Deduced a trap composed of 396 places in 408 ms of which 1 ms to minimize.
[2023-03-15 19:00:05] [INFO ] Deduced a trap composed of 402 places in 384 ms of which 1 ms to minimize.
[2023-03-15 19:00:05] [INFO ] Deduced a trap composed of 398 places in 396 ms of which 1 ms to minimize.
[2023-03-15 19:00:06] [INFO ] Deduced a trap composed of 392 places in 375 ms of which 1 ms to minimize.
[2023-03-15 19:00:07] [INFO ] Deduced a trap composed of 404 places in 386 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:916)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 19:00:07] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p1)
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 157 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) p2)]
Stuttering criterion allowed to conclude after 52101 steps with 2920 reset in 378 ms.
FORMULA PolyORBNT-PT-S10J40-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J40-LTLFireability-09 finished in 329176 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p0)||((!p2 U (p3||G(!p2)))&&p1)))))'
Support contains 6 out of 844 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 844/844 places, 1615/1615 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 844 transition count 1570
Reduce places removed 45 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 46 rules applied. Total rules applied 91 place count 799 transition count 1569
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 92 place count 798 transition count 1569
Performed 44 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 44 Pre rules applied. Total rules applied 92 place count 798 transition count 1525
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 180 place count 754 transition count 1525
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 181 place count 753 transition count 1524
Iterating global reduction 3 with 1 rules applied. Total rules applied 182 place count 753 transition count 1524
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 3 with 4 rules applied. Total rules applied 186 place count 751 transition count 1522
Applied a total of 186 rules in 100 ms. Remains 751 /844 variables (removed 93) and now considering 1522/1615 (removed 93) transitions.
[2023-03-15 19:00:08] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
// Phase 1: matrix 1513 rows 751 cols
[2023-03-15 19:00:08] [INFO ] Computed 102 place invariants in 20 ms
[2023-03-15 19:00:09] [INFO ] Dead Transitions using invariants and state equation in 1000 ms found 0 transitions.
[2023-03-15 19:00:09] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
[2023-03-15 19:00:09] [INFO ] Invariant cache hit.
[2023-03-15 19:00:10] [INFO ] Implicit Places using invariants in 915 ms returned []
[2023-03-15 19:00:10] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
[2023-03-15 19:00:10] [INFO ] Invariant cache hit.
[2023-03-15 19:00:10] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 19:00:22] [INFO ] Implicit Places using invariants and state equation in 12034 ms returned []
Implicit Place search using SMT with State Equation took 12964 ms to find 0 implicit places.
[2023-03-15 19:00:22] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-15 19:00:22] [INFO ] Flow matrix only has 1513 transitions (discarded 9 similar events)
[2023-03-15 19:00:22] [INFO ] Invariant cache hit.
[2023-03-15 19:00:23] [INFO ] Dead Transitions using invariants and state equation in 909 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 751/844 places, 1522/1615 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15038 ms. Remains : 751/844 places, 1522/1615 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) p2 (NOT p3))]
Running random walk in product with property : PolyORBNT-PT-S10J40-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (AND (NOT p3) p2)), acceptance={} source=0 dest: 1}], [{ cond=(OR (AND p0 (NOT p1)) (AND p0 (NOT p3) p2)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) p2)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p1 (NOT p3) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p3) (NOT p2)), acceptance={1} source=1 dest: 2}], [{ cond=(AND p0 (NOT p3) p2), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p1:(AND (GEQ s365 1) (GEQ s408 1) (GEQ s694 1)), p3:(AND (GEQ s55 1) (GEQ s412 1) (NOT (AND (GEQ s365 1) (GEQ s408 1) (GEQ s694 1)))), p2:(AND (GEQ s365 1...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S10J40-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J40-LTLFireability-10 finished in 15187 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 844 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 844/844 places, 1615/1615 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 844 transition count 1569
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 92 place count 798 transition count 1569
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 92 place count 798 transition count 1524
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 182 place count 753 transition count 1524
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 183 place count 752 transition count 1523
Iterating global reduction 2 with 1 rules applied. Total rules applied 184 place count 752 transition count 1523
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 2 with 4 rules applied. Total rules applied 188 place count 750 transition count 1521
Applied a total of 188 rules in 94 ms. Remains 750 /844 variables (removed 94) and now considering 1521/1615 (removed 94) transitions.
[2023-03-15 19:00:23] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
// Phase 1: matrix 1512 rows 750 cols
[2023-03-15 19:00:23] [INFO ] Computed 102 place invariants in 20 ms
[2023-03-15 19:00:24] [INFO ] Dead Transitions using invariants and state equation in 1064 ms found 0 transitions.
[2023-03-15 19:00:24] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-15 19:00:24] [INFO ] Invariant cache hit.
[2023-03-15 19:00:25] [INFO ] Implicit Places using invariants in 875 ms returned []
[2023-03-15 19:00:25] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-15 19:00:25] [INFO ] Invariant cache hit.
[2023-03-15 19:00:25] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 19:00:36] [INFO ] Implicit Places using invariants and state equation in 10672 ms returned []
Implicit Place search using SMT with State Equation took 11578 ms to find 0 implicit places.
[2023-03-15 19:00:36] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-15 19:00:36] [INFO ] Flow matrix only has 1512 transitions (discarded 9 similar events)
[2023-03-15 19:00:36] [INFO ] Invariant cache hit.
[2023-03-15 19:00:37] [INFO ] Dead Transitions using invariants and state equation in 910 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 750/844 places, 1521/1615 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13715 ms. Remains : 750/844 places, 1521/1615 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J40-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s244 2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S10J40-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J40-LTLFireability-11 finished in 13770 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((false U X(X(p0)))&&(X(G(p1)) U p2))))'
Support contains 6 out of 844 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1615/1615 transitions.
Applied a total of 0 rules in 21 ms. Remains 844 /844 variables (removed 0) and now considering 1615/1615 (removed 0) transitions.
[2023-03-15 19:00:37] [INFO ] Flow matrix only has 1606 transitions (discarded 9 similar events)
// Phase 1: matrix 1606 rows 844 cols
[2023-03-15 19:00:37] [INFO ] Computed 102 place invariants in 21 ms
[2023-03-15 19:00:38] [INFO ] Dead Transitions using invariants and state equation in 1579 ms found 0 transitions.
[2023-03-15 19:00:38] [INFO ] Flow matrix only has 1606 transitions (discarded 9 similar events)
[2023-03-15 19:00:38] [INFO ] Invariant cache hit.
[2023-03-15 19:00:39] [INFO ] Implicit Places using invariants in 1019 ms returned []
[2023-03-15 19:00:39] [INFO ] Flow matrix only has 1606 transitions (discarded 9 similar events)
[2023-03-15 19:00:39] [INFO ] Invariant cache hit.
[2023-03-15 19:00:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 19:00:53] [INFO ] Implicit Places using invariants and state equation in 14174 ms returned []
Implicit Place search using SMT with State Equation took 15208 ms to find 0 implicit places.
[2023-03-15 19:00:53] [INFO ] Flow matrix only has 1606 transitions (discarded 9 similar events)
[2023-03-15 19:00:53] [INFO ] Invariant cache hit.
[2023-03-15 19:00:55] [INFO ] Dead Transitions using invariants and state equation in 1604 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18440 ms. Remains : 844/844 places, 1615/1615 transitions.
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p0) (NOT p2)), (NOT p0), (OR (NOT p1) (NOT p2)), (NOT p0), true, (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S10J40-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 5}, { cond=(AND p2 p1), acceptance={0} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}, { cond=p1, acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(AND (GEQ s18 1) (GEQ s162 9) (GEQ s403 1)), p1:(AND (GEQ s582 1) (GEQ s798 1)), p0:(GEQ s297 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][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S10J40-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J40-LTLFireability-12 finished in 18692 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0&&G(p1))) U p0)))'
Support contains 2 out of 844 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 844/844 places, 1615/1615 transitions.
Drop transitions removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 45 place count 844 transition count 1570
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 90 place count 799 transition count 1570
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 90 place count 799 transition count 1525
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 2 with 90 rules applied. Total rules applied 180 place count 754 transition count 1525
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 181 place count 753 transition count 1524
Iterating global reduction 2 with 1 rules applied. Total rules applied 182 place count 753 transition count 1524
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 184 place count 752 transition count 1523
Applied a total of 184 rules in 121 ms. Remains 752 /844 variables (removed 92) and now considering 1523/1615 (removed 92) transitions.
[2023-03-15 19:00:55] [INFO ] Flow matrix only has 1514 transitions (discarded 9 similar events)
// Phase 1: matrix 1514 rows 752 cols
[2023-03-15 19:00:55] [INFO ] Computed 102 place invariants in 20 ms
[2023-03-15 19:00:56] [INFO ] Dead Transitions using invariants and state equation in 1021 ms found 0 transitions.
[2023-03-15 19:00:56] [INFO ] Flow matrix only has 1514 transitions (discarded 9 similar events)
[2023-03-15 19:00:56] [INFO ] Invariant cache hit.
[2023-03-15 19:00:57] [INFO ] Implicit Places using invariants in 896 ms returned []
[2023-03-15 19:00:57] [INFO ] Flow matrix only has 1514 transitions (discarded 9 similar events)
[2023-03-15 19:00:57] [INFO ] Invariant cache hit.
[2023-03-15 19:00:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 19:01:10] [INFO ] Implicit Places using invariants and state equation in 13003 ms returned []
Implicit Place search using SMT with State Equation took 13920 ms to find 0 implicit places.
[2023-03-15 19:01:10] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-15 19:01:10] [INFO ] Flow matrix only has 1514 transitions (discarded 9 similar events)
[2023-03-15 19:01:10] [INFO ] Invariant cache hit.
[2023-03-15 19:01:11] [INFO ] Dead Transitions using invariants and state equation in 950 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 752/844 places, 1523/1615 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16095 ms. Remains : 752/844 places, 1523/1615 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S10J40-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s244 2), p1:(LT s109 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S10J40-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J40-LTLFireability-13 finished in 16209 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 844 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 1615/1615 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 843 transition count 1614
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 843 transition count 1614
Applied a total of 2 rules in 37 ms. Remains 843 /844 variables (removed 1) and now considering 1614/1615 (removed 1) transitions.
[2023-03-15 19:01:12] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
// Phase 1: matrix 1605 rows 843 cols
[2023-03-15 19:01:12] [INFO ] Computed 102 place invariants in 23 ms
[2023-03-15 19:01:13] [INFO ] Dead Transitions using invariants and state equation in 1486 ms found 0 transitions.
[2023-03-15 19:01:13] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
[2023-03-15 19:01:13] [INFO ] Invariant cache hit.
[2023-03-15 19:01:14] [INFO ] Implicit Places using invariants in 1116 ms returned []
[2023-03-15 19:01:14] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
[2023-03-15 19:01:14] [INFO ] Invariant cache hit.
[2023-03-15 19:01:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 19:01:28] [INFO ] Implicit Places using invariants and state equation in 14285 ms returned []
Implicit Place search using SMT with State Equation took 15416 ms to find 0 implicit places.
[2023-03-15 19:01:28] [INFO ] Flow matrix only has 1605 transitions (discarded 9 similar events)
[2023-03-15 19:01:28] [INFO ] Invariant cache hit.
[2023-03-15 19:01:30] [INFO ] Dead Transitions using invariants and state equation in 1583 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 843/844 places, 1614/1615 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18542 ms. Remains : 843/844 places, 1614/1615 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J40-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(GEQ s658 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S10J40-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J40-LTLFireability-15 finished in 18657 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-15 19:01:30] [INFO ] Flatten gal took : 97 ms
[2023-03-15 19:01:30] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-15 19:01:30] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 844 places, 1615 transitions and 9404 arcs took 14 ms.
Total runtime 701564 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT PolyORBNT-PT-S10J40
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

BK_STOP 1678906977138

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 1 (type EXCL) for 0 PolyORBNT-PT-S10J40-LTLFireability-08
lola: time limit : 3599 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S10J40-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3599 2/32 PolyORBNT-PT-S10J40-LTLFireability-08 155973 m, 31194 m/sec, 661497 t fired, .

Time elapsed: 6 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S10J40-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3599 5/32 PolyORBNT-PT-S10J40-LTLFireability-08 326395 m, 34084 m/sec, 1363569 t fired, .

Time elapsed: 11 secs. Pages in use: 5
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S10J40-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3599 7/32 PolyORBNT-PT-S10J40-LTLFireability-08 490297 m, 32780 m/sec, 2034805 t fired, .

Time elapsed: 16 secs. Pages in use: 7
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S10J40-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3599 9/32 PolyORBNT-PT-S10J40-LTLFireability-08 633539 m, 28648 m/sec, 2676234 t fired, .

Time elapsed: 21 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S10J40-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3599 10/32 PolyORBNT-PT-S10J40-LTLFireability-08 774644 m, 28221 m/sec, 3305887 t fired, .

Time elapsed: 26 secs. Pages in use: 10
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S10J40-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3599 12/32 PolyORBNT-PT-S10J40-LTLFireability-08 928812 m, 30833 m/sec, 3945714 t fired, .

Time elapsed: 31 secs. Pages in use: 12
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S10J40-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3599 14/32 PolyORBNT-PT-S10J40-LTLFireability-08 1080166 m, 30270 m/sec, 4579079 t fired, .

Time elapsed: 36 secs. Pages in use: 14
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S10J40-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3599 16/32 PolyORBNT-PT-S10J40-LTLFireability-08 1221925 m, 28351 m/sec, 5201033 t fired, .

Time elapsed: 41 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S10J40-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3599 18/32 PolyORBNT-PT-S10J40-LTLFireability-08 1382926 m, 32200 m/sec, 5856730 t fired, .

Time elapsed: 46 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S10J40-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3599 20/32 PolyORBNT-PT-S10J40-LTLFireability-08 1531667 m, 29748 m/sec, 6494727 t fired, .

Time elapsed: 51 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S10J40-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/3599 22/32 PolyORBNT-PT-S10J40-LTLFireability-08 1673563 m, 28379 m/sec, 7116571 t fired, .

Time elapsed: 56 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S10J40-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/3599 24/32 PolyORBNT-PT-S10J40-LTLFireability-08 1834597 m, 32206 m/sec, 7764902 t fired, .

Time elapsed: 61 secs. Pages in use: 24
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S10J40-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 65/3599 26/32 PolyORBNT-PT-S10J40-LTLFireability-08 1981149 m, 29310 m/sec, 8392544 t fired, .

Time elapsed: 66 secs. Pages in use: 26
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S10J40-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 70/3599 28/32 PolyORBNT-PT-S10J40-LTLFireability-08 2141775 m, 32125 m/sec, 9038206 t fired, .

Time elapsed: 71 secs. Pages in use: 28
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S10J40-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 75/3599 29/32 PolyORBNT-PT-S10J40-LTLFireability-08 2305457 m, 32736 m/sec, 9678696 t fired, .

Time elapsed: 76 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 1
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S10J40-LTLFireability-08: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 80/3599 31/32 PolyORBNT-PT-S10J40-LTLFireability-08 2467825 m, 32473 m/sec, 10323336 t fired, .

Time elapsed: 81 secs. Pages in use: 31
# running tasks: 1 of 4 Visible: 1
lola: CANCELED task # 1 (type EXCL) for PolyORBNT-PT-S10J40-LTLFireability-08 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S10J40-LTLFireability-08: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS

Time elapsed: 86 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 1
lola: Portfolio finished: no open tasks 1

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBNT-PT-S10J40-LTLFireability-08: LTL unknown AGGR


Time elapsed: 86 secs. Pages in use: 32

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="PolyORBNT-PT-S10J40"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is PolyORBNT-PT-S10J40, 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 r295-tall-167873948400772"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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