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.r297-tall-167873950900732.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is PolyORBNT-PT-S05J40, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873950900732
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.2M
-rw-r--r-- 1 mcc users 34K Feb 25 23:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 186K Feb 25 23:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 56K Feb 25 23:24 CTLFireability.txt
-rw-r--r-- 1 mcc users 251K Feb 25 23:24 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 6.6K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 18K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 43K Feb 25 23:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 217K Feb 25 23:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 168K Feb 25 23:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 755K Feb 25 23:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.8K 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 1.3M 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-S05J40-LTLFireability-00
FORMULA_NAME PolyORBNT-PT-S05J40-LTLFireability-01
FORMULA_NAME PolyORBNT-PT-S05J40-LTLFireability-02
FORMULA_NAME PolyORBNT-PT-S05J40-LTLFireability-03
FORMULA_NAME PolyORBNT-PT-S05J40-LTLFireability-04
FORMULA_NAME PolyORBNT-PT-S05J40-LTLFireability-05
FORMULA_NAME PolyORBNT-PT-S05J40-LTLFireability-06
FORMULA_NAME PolyORBNT-PT-S05J40-LTLFireability-07
FORMULA_NAME PolyORBNT-PT-S05J40-LTLFireability-08
FORMULA_NAME PolyORBNT-PT-S05J40-LTLFireability-09
FORMULA_NAME PolyORBNT-PT-S05J40-LTLFireability-10
FORMULA_NAME PolyORBNT-PT-S05J40-LTLFireability-11
FORMULA_NAME PolyORBNT-PT-S05J40-LTLFireability-12
FORMULA_NAME PolyORBNT-PT-S05J40-LTLFireability-13
FORMULA_NAME PolyORBNT-PT-S05J40-LTLFireability-14
FORMULA_NAME PolyORBNT-PT-S05J40-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679627403245

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J40
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 03:10:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-24 03:10:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 03:10:05] [INFO ] Load time of PNML (sax parser for PT used): 145 ms
[2023-03-24 03:10:05] [INFO ] Transformed 629 places.
[2023-03-24 03:10:05] [INFO ] Transformed 1590 transitions.
[2023-03-24 03:10:05] [INFO ] Parsed PT model containing 629 places and 1590 transitions and 10704 arcs in 233 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 655 transitions
Reduce redundant transitions removed 655 transitions.
FORMULA PolyORBNT-PT-S05J40-LTLFireability-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S05J40-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 481 out of 629 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 629/629 places, 935/935 transitions.
Ensure Unique test removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 624 transition count 935
Applied a total of 5 rules in 40 ms. Remains 624 /629 variables (removed 5) and now considering 935/935 (removed 0) transitions.
[2023-03-24 03:10:05] [INFO ] Flow matrix only has 931 transitions (discarded 4 similar events)
// Phase 1: matrix 931 rows 624 cols
[2023-03-24 03:10:05] [INFO ] Computed 97 place invariants in 72 ms
[2023-03-24 03:10:07] [INFO ] Dead Transitions using invariants and state equation in 1411 ms found 95 transitions.
Found 95 dead transitions using SMT.
Drop transitions removed 95 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 95 transitions.
[2023-03-24 03:10:07] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
// Phase 1: matrix 836 rows 624 cols
[2023-03-24 03:10:07] [INFO ] Computed 97 place invariants in 40 ms
[2023-03-24 03:10:07] [INFO ] Implicit Places using invariants in 727 ms returned []
[2023-03-24 03:10:07] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
[2023-03-24 03:10:07] [INFO ] Invariant cache hit.
[2023-03-24 03:10:08] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 03:10:13] [INFO ] Implicit Places using invariants and state equation in 5671 ms returned []
Implicit Place search using SMT with State Equation took 6405 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 624/629 places, 840/935 transitions.
Applied a total of 0 rules in 17 ms. Remains 624 /624 variables (removed 0) and now considering 840/840 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7909 ms. Remains : 624/629 places, 840/935 transitions.
Support contains 481 out of 624 places after structural reductions.
[2023-03-24 03:10:14] [INFO ] Flatten gal took : 179 ms
[2023-03-24 03:10:14] [INFO ] Flatten gal took : 138 ms
[2023-03-24 03:10:14] [INFO ] Input system was already deterministic with 840 transitions.
Support contains 480 out of 624 places (down from 481) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 676 resets, run finished after 457 ms. (steps per millisecond=21 ) properties (out of 25) seen :22
Incomplete Best-First random walk after 10001 steps, including 151 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 161 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 141 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-24 03:10:15] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
[2023-03-24 03:10:15] [INFO ] Invariant cache hit.
[2023-03-24 03:10:15] [INFO ] [Real]Absence check using 76 positive place invariants in 20 ms returned sat
[2023-03-24 03:10:15] [INFO ] [Real]Absence check using 76 positive and 21 generalized place invariants in 21 ms returned sat
[2023-03-24 03:10:15] [INFO ] After 249ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-24 03:10:15] [INFO ] [Nat]Absence check using 76 positive place invariants in 20 ms returned sat
[2023-03-24 03:10:15] [INFO ] [Nat]Absence check using 76 positive and 21 generalized place invariants in 30 ms returned sat
[2023-03-24 03:10:16] [INFO ] After 1185ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-24 03:10:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 03:10:17] [INFO ] After 941ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-24 03:10:18] [INFO ] Deduced a trap composed of 208 places in 308 ms of which 6 ms to minimize.
[2023-03-24 03:10:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 435 ms
[2023-03-24 03:10:19] [INFO ] Deduced a trap composed of 260 places in 454 ms of which 1 ms to minimize.
[2023-03-24 03:10:19] [INFO ] Deduced a trap composed of 263 places in 378 ms of which 2 ms to minimize.
[2023-03-24 03:10:19] [INFO ] Deduced a trap composed of 257 places in 317 ms of which 2 ms to minimize.
[2023-03-24 03:10:20] [INFO ] Deduced a trap composed of 254 places in 299 ms of which 3 ms to minimize.
[2023-03-24 03:10:20] [INFO ] Deduced a trap composed of 258 places in 247 ms of which 0 ms to minimize.
[2023-03-24 03:10:20] [INFO ] Deduced a trap composed of 270 places in 239 ms of which 1 ms to minimize.
[2023-03-24 03:10:21] [INFO ] Deduced a trap composed of 278 places in 241 ms of which 1 ms to minimize.
[2023-03-24 03:10:21] [INFO ] Deduced a trap composed of 248 places in 273 ms of which 2 ms to minimize.
[2023-03-24 03:10:21] [INFO ] Deduced a trap composed of 260 places in 220 ms of which 2 ms to minimize.
[2023-03-24 03:10:22] [INFO ] Deduced a trap composed of 263 places in 218 ms of which 1 ms to minimize.
[2023-03-24 03:10:22] [INFO ] Deduced a trap composed of 252 places in 262 ms of which 1 ms to minimize.
[2023-03-24 03:10:22] [INFO ] Deduced a trap composed of 263 places in 240 ms of which 1 ms to minimize.
[2023-03-24 03:10:23] [INFO ] Deduced a trap composed of 260 places in 234 ms of which 0 ms to minimize.
[2023-03-24 03:10:23] [INFO ] Deduced a trap composed of 251 places in 239 ms of which 0 ms to minimize.
[2023-03-24 03:10:24] [INFO ] Deduced a trap composed of 263 places in 242 ms of which 0 ms to minimize.
[2023-03-24 03:10:24] [INFO ] Deduced a trap composed of 263 places in 234 ms of which 0 ms to minimize.
[2023-03-24 03:10:24] [INFO ] Deduced a trap composed of 263 places in 224 ms of which 0 ms to minimize.
[2023-03-24 03:10:24] [INFO ] Deduced a trap composed of 256 places in 228 ms of which 1 ms to minimize.
[2023-03-24 03:10:25] [INFO ] Deduced a trap composed of 269 places in 226 ms of which 1 ms to minimize.
[2023-03-24 03:10:25] [INFO ] Deduced a trap composed of 275 places in 227 ms of which 1 ms to minimize.
[2023-03-24 03:10:25] [INFO ] Deduced a trap composed of 269 places in 243 ms of which 2 ms to minimize.
[2023-03-24 03:10:26] [INFO ] Deduced a trap composed of 248 places in 236 ms of which 0 ms to minimize.
[2023-03-24 03:10:26] [INFO ] Deduced a trap composed of 260 places in 224 ms of which 1 ms to minimize.
[2023-03-24 03:10:26] [INFO ] Deduced a trap composed of 257 places in 278 ms of which 1 ms to minimize.
[2023-03-24 03:10:27] [INFO ] Deduced a trap composed of 260 places in 233 ms of which 0 ms to minimize.
[2023-03-24 03:10:27] [INFO ] Deduced a trap composed of 254 places in 260 ms of which 1 ms to minimize.
[2023-03-24 03:10:27] [INFO ] Deduced a trap composed of 254 places in 250 ms of which 1 ms to minimize.
[2023-03-24 03:10:27] [INFO ] Deduced a trap composed of 245 places in 260 ms of which 0 ms to minimize.
[2023-03-24 03:10:28] [INFO ] Deduced a trap composed of 260 places in 235 ms of which 1 ms to minimize.
[2023-03-24 03:10:28] [INFO ] Deduced a trap composed of 260 places in 228 ms of which 0 ms to minimize.
[2023-03-24 03:10:28] [INFO ] Deduced a trap composed of 254 places in 224 ms of which 1 ms to minimize.
[2023-03-24 03:10:29] [INFO ] Deduced a trap composed of 273 places in 249 ms of which 1 ms to minimize.
[2023-03-24 03:10:29] [INFO ] Deduced a trap composed of 272 places in 241 ms of which 0 ms to minimize.
[2023-03-24 03:10:29] [INFO ] Deduced a trap composed of 261 places in 238 ms of which 2 ms to minimize.
[2023-03-24 03:10:30] [INFO ] Deduced a trap composed of 266 places in 236 ms of which 0 ms to minimize.
[2023-03-24 03:10:30] [INFO ] Deduced a trap composed of 271 places in 249 ms of which 1 ms to minimize.
[2023-03-24 03:10:30] [INFO ] Deduced a trap composed of 273 places in 249 ms of which 1 ms to minimize.
[2023-03-24 03:10:31] [INFO ] Deduced a trap composed of 261 places in 242 ms of which 0 ms to minimize.
[2023-03-24 03:10:31] [INFO ] Deduced a trap composed of 272 places in 238 ms of which 1 ms to minimize.
[2023-03-24 03:10:31] [INFO ] Deduced a trap composed of 266 places in 240 ms of which 1 ms to minimize.
[2023-03-24 03:10:32] [INFO ] Deduced a trap composed of 265 places in 247 ms of which 0 ms to minimize.
[2023-03-24 03:10:32] [INFO ] Deduced a trap composed of 265 places in 237 ms of which 0 ms to minimize.
[2023-03-24 03:10:32] [INFO ] Deduced a trap composed of 246 places in 237 ms of which 0 ms to minimize.
[2023-03-24 03:10:34] [INFO ] Deduced a trap composed of 263 places in 226 ms of which 1 ms to minimize.
[2023-03-24 03:10:35] [INFO ] Deduced a trap composed of 250 places in 229 ms of which 0 ms to minimize.
[2023-03-24 03:10:36] [INFO ] Deduced a trap composed of 274 places in 242 ms of which 1 ms to minimize.
[2023-03-24 03:10:36] [INFO ] Deduced a trap composed of 256 places in 233 ms of which 0 ms to minimize.
[2023-03-24 03:10:36] [INFO ] Deduced a trap composed of 251 places in 230 ms of which 0 ms to minimize.
[2023-03-24 03:10:36] [INFO ] Deduced a trap composed of 273 places in 242 ms of which 0 ms to minimize.
[2023-03-24 03:10:37] [INFO ] Deduced a trap composed of 257 places in 279 ms of which 2 ms to minimize.
[2023-03-24 03:10:37] [INFO ] Deduced a trap composed of 258 places in 294 ms of which 1 ms to minimize.
[2023-03-24 03:10:37] [INFO ] Deduced a trap composed of 260 places in 246 ms of which 1 ms to minimize.
[2023-03-24 03:10:38] [INFO ] Deduced a trap composed of 277 places in 274 ms of which 1 ms to minimize.
[2023-03-24 03:10:40] [INFO ] Deduced a trap composed of 252 places in 289 ms of which 1 ms to minimize.
[2023-03-24 03:10:40] [INFO ] Trap strengthening (SAT) tested/added 54/54 trap constraints in 21760 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-24 03:10:40] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 03:10:40] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 6 ms.
Support contains 6 out of 624 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 624/624 places, 840/840 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 624 transition count 795
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 579 transition count 794
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 92 place count 578 transition count 794
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 578 transition count 750
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 180 place count 534 transition count 750
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 181 place count 533 transition count 749
Iterating global reduction 3 with 1 rules applied. Total rules applied 182 place count 533 transition count 749
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 3 with 4 rules applied. Total rules applied 186 place count 531 transition count 747
Applied a total of 186 rules in 234 ms. Remains 531 /624 variables (removed 93) and now considering 747/840 (removed 93) transitions.
[2023-03-24 03:10:40] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2023-03-24 03:10:40] [INFO ] Computed 97 place invariants in 11 ms
[2023-03-24 03:10:41] [INFO ] Dead Transitions using invariants and state equation in 745 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 984 ms. Remains : 531/624 places, 747/840 transitions.
Incomplete random walk after 10000 steps, including 471 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-24 03:10:41] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
[2023-03-24 03:10:41] [INFO ] Invariant cache hit.
[2023-03-24 03:10:41] [INFO ] [Real]Absence check using 76 positive place invariants in 26 ms returned sat
[2023-03-24 03:10:41] [INFO ] [Real]Absence check using 76 positive and 21 generalized place invariants in 19 ms returned sat
[2023-03-24 03:10:41] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 03:10:41] [INFO ] [Nat]Absence check using 76 positive place invariants in 17 ms returned sat
[2023-03-24 03:10:41] [INFO ] [Nat]Absence check using 76 positive and 21 generalized place invariants in 19 ms returned sat
[2023-03-24 03:10:42] [INFO ] After 557ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 03:10:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 03:10:43] [INFO ] After 781ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 03:10:43] [INFO ] Deduced a trap composed of 180 places in 213 ms of which 1 ms to minimize.
[2023-03-24 03:10:43] [INFO ] Deduced a trap composed of 170 places in 213 ms of which 7 ms to minimize.
[2023-03-24 03:10:43] [INFO ] Deduced a trap composed of 161 places in 213 ms of which 1 ms to minimize.
[2023-03-24 03:10:44] [INFO ] Deduced a trap composed of 170 places in 208 ms of which 0 ms to minimize.
[2023-03-24 03:10:44] [INFO ] Deduced a trap composed of 171 places in 200 ms of which 1 ms to minimize.
[2023-03-24 03:10:44] [INFO ] Deduced a trap composed of 161 places in 219 ms of which 1 ms to minimize.
[2023-03-24 03:10:45] [INFO ] Deduced a trap composed of 161 places in 203 ms of which 0 ms to minimize.
[2023-03-24 03:10:45] [INFO ] Deduced a trap composed of 170 places in 210 ms of which 1 ms to minimize.
[2023-03-24 03:10:45] [INFO ] Deduced a trap composed of 170 places in 216 ms of which 1 ms to minimize.
[2023-03-24 03:10:45] [INFO ] Deduced a trap composed of 200 places in 197 ms of which 1 ms to minimize.
[2023-03-24 03:10:46] [INFO ] Deduced a trap composed of 158 places in 208 ms of which 1 ms to minimize.
[2023-03-24 03:10:46] [INFO ] Deduced a trap composed of 173 places in 205 ms of which 2 ms to minimize.
[2023-03-24 03:10:46] [INFO ] Deduced a trap composed of 182 places in 193 ms of which 1 ms to minimize.
[2023-03-24 03:10:46] [INFO ] Deduced a trap composed of 183 places in 205 ms of which 0 ms to minimize.
[2023-03-24 03:10:47] [INFO ] Deduced a trap composed of 173 places in 226 ms of which 1 ms to minimize.
[2023-03-24 03:10:47] [INFO ] Deduced a trap composed of 170 places in 213 ms of which 1 ms to minimize.
[2023-03-24 03:10:47] [INFO ] Deduced a trap composed of 161 places in 204 ms of which 0 ms to minimize.
[2023-03-24 03:10:47] [INFO ] Deduced a trap composed of 167 places in 189 ms of which 0 ms to minimize.
[2023-03-24 03:10:48] [INFO ] Deduced a trap composed of 167 places in 193 ms of which 1 ms to minimize.
[2023-03-24 03:10:48] [INFO ] Deduced a trap composed of 182 places in 226 ms of which 0 ms to minimize.
[2023-03-24 03:10:48] [INFO ] Deduced a trap composed of 183 places in 192 ms of which 1 ms to minimize.
[2023-03-24 03:10:49] [INFO ] Deduced a trap composed of 165 places in 201 ms of which 0 ms to minimize.
[2023-03-24 03:10:49] [INFO ] Deduced a trap composed of 174 places in 223 ms of which 0 ms to minimize.
[2023-03-24 03:10:49] [INFO ] Deduced a trap composed of 161 places in 227 ms of which 0 ms to minimize.
[2023-03-24 03:10:50] [INFO ] Deduced a trap composed of 167 places in 204 ms of which 0 ms to minimize.
[2023-03-24 03:10:50] [INFO ] Deduced a trap composed of 164 places in 216 ms of which 0 ms to minimize.
[2023-03-24 03:10:50] [INFO ] Deduced a trap composed of 156 places in 230 ms of which 1 ms to minimize.
[2023-03-24 03:10:51] [INFO ] Deduced a trap composed of 152 places in 226 ms of which 1 ms to minimize.
[2023-03-24 03:10:51] [INFO ] Deduced a trap composed of 167 places in 230 ms of which 0 ms to minimize.
[2023-03-24 03:10:54] [INFO ] Deduced a trap composed of 182 places in 237 ms of which 1 ms to minimize.
[2023-03-24 03:10:54] [INFO ] Deduced a trap composed of 158 places in 214 ms of which 1 ms to minimize.
[2023-03-24 03:10:57] [INFO ] Deduced a trap composed of 158 places in 207 ms of which 0 ms to minimize.
[2023-03-24 03:11:05] [INFO ] Deduced a trap composed of 176 places in 213 ms of which 1 ms to minimize.
[2023-03-24 03:11:06] [INFO ] Trap strengthening (SAT) tested/added 33/33 trap constraints in 23536 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-24 03:11:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 03:11:06] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 747/747 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 531 transition count 746
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 530 transition count 746
Applied a total of 2 rules in 56 ms. Remains 530 /531 variables (removed 1) and now considering 746/747 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 530/531 places, 746/747 transitions.
Incomplete random walk after 10000 steps, including 505 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 44 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 235417 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :{}
Probabilistic random walk after 235417 steps, saw 70113 distinct states, run finished after 3002 ms. (steps per millisecond=78 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-24 03:11:09] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2023-03-24 03:11:09] [INFO ] Computed 97 place invariants in 26 ms
[2023-03-24 03:11:10] [INFO ] [Real]Absence check using 76 positive place invariants in 19 ms returned sat
[2023-03-24 03:11:10] [INFO ] [Real]Absence check using 76 positive and 21 generalized place invariants in 21 ms returned sat
[2023-03-24 03:11:10] [INFO ] After 154ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 03:11:10] [INFO ] [Nat]Absence check using 76 positive place invariants in 16 ms returned sat
[2023-03-24 03:11:10] [INFO ] [Nat]Absence check using 76 positive and 21 generalized place invariants in 22 ms returned sat
[2023-03-24 03:11:11] [INFO ] After 928ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 03:11:11] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 03:11:11] [INFO ] After 521ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-24 03:11:11] [INFO ] Deduced a trap composed of 180 places in 188 ms of which 0 ms to minimize.
[2023-03-24 03:11:12] [INFO ] Deduced a trap composed of 171 places in 200 ms of which 1 ms to minimize.
[2023-03-24 03:11:12] [INFO ] Deduced a trap composed of 180 places in 193 ms of which 1 ms to minimize.
[2023-03-24 03:11:12] [INFO ] Deduced a trap composed of 176 places in 196 ms of which 0 ms to minimize.
[2023-03-24 03:11:12] [INFO ] Deduced a trap composed of 176 places in 208 ms of which 1 ms to minimize.
[2023-03-24 03:11:13] [INFO ] Deduced a trap composed of 174 places in 203 ms of which 0 ms to minimize.
[2023-03-24 03:11:13] [INFO ] Deduced a trap composed of 168 places in 216 ms of which 0 ms to minimize.
[2023-03-24 03:11:13] [INFO ] Deduced a trap composed of 176 places in 187 ms of which 1 ms to minimize.
[2023-03-24 03:11:13] [INFO ] Deduced a trap composed of 189 places in 181 ms of which 1 ms to minimize.
[2023-03-24 03:11:13] [INFO ] Deduced a trap composed of 161 places in 184 ms of which 1 ms to minimize.
[2023-03-24 03:11:14] [INFO ] Deduced a trap composed of 174 places in 192 ms of which 1 ms to minimize.
[2023-03-24 03:11:14] [INFO ] Deduced a trap composed of 164 places in 182 ms of which 1 ms to minimize.
[2023-03-24 03:11:14] [INFO ] Deduced a trap composed of 173 places in 180 ms of which 1 ms to minimize.
[2023-03-24 03:11:14] [INFO ] Deduced a trap composed of 170 places in 190 ms of which 1 ms to minimize.
[2023-03-24 03:11:15] [INFO ] Deduced a trap composed of 159 places in 199 ms of which 1 ms to minimize.
[2023-03-24 03:11:15] [INFO ] Deduced a trap composed of 193 places in 213 ms of which 0 ms to minimize.
[2023-03-24 03:11:15] [INFO ] Deduced a trap composed of 168 places in 245 ms of which 1 ms to minimize.
[2023-03-24 03:11:16] [INFO ] Deduced a trap composed of 173 places in 206 ms of which 0 ms to minimize.
[2023-03-24 03:11:16] [INFO ] Deduced a trap composed of 161 places in 186 ms of which 1 ms to minimize.
[2023-03-24 03:11:16] [INFO ] Deduced a trap composed of 187 places in 189 ms of which 1 ms to minimize.
[2023-03-24 03:11:16] [INFO ] Deduced a trap composed of 183 places in 189 ms of which 0 ms to minimize.
[2023-03-24 03:11:17] [INFO ] Deduced a trap composed of 164 places in 219 ms of which 0 ms to minimize.
[2023-03-24 03:11:18] [INFO ] Deduced a trap composed of 164 places in 196 ms of which 1 ms to minimize.
[2023-03-24 03:11:18] [INFO ] Deduced a trap composed of 170 places in 200 ms of which 1 ms to minimize.
[2023-03-24 03:11:20] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 0 ms to minimize.
[2023-03-24 03:11:20] [INFO ] Deduced a trap composed of 167 places in 207 ms of which 1 ms to minimize.
[2023-03-24 03:11:29] [INFO ] Trap strengthening (SAT) tested/added 26/26 trap constraints in 17914 ms
[2023-03-24 03:11:29] [INFO ] After 18468ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-24 03:11:29] [INFO ] After 19531ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 530 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 34 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 530/530 places, 746/746 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 530/530 places, 746/746 transitions.
Applied a total of 0 rules in 36 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
[2023-03-24 03:11:29] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-24 03:11:29] [INFO ] Invariant cache hit.
[2023-03-24 03:11:30] [INFO ] Implicit Places using invariants in 720 ms returned []
[2023-03-24 03:11:30] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-24 03:11:30] [INFO ] Invariant cache hit.
[2023-03-24 03:11:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 03:11:37] [INFO ] Implicit Places using invariants and state equation in 6964 ms returned []
Implicit Place search using SMT with State Equation took 7688 ms to find 0 implicit places.
[2023-03-24 03:11:37] [INFO ] Redundant transitions in 43 ms returned []
[2023-03-24 03:11:37] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-24 03:11:37] [INFO ] Invariant cache hit.
[2023-03-24 03:11:38] [INFO ] Dead Transitions using invariants and state equation in 670 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8448 ms. Remains : 530/530 places, 746/746 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 530 transition count 742
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 530 transition count 741
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 6 place count 529 transition count 741
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 529 transition count 740
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 528 transition count 740
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 528 transition count 735
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 523 transition count 735
Applied a total of 18 rules in 110 ms. Remains 523 /530 variables (removed 7) and now considering 735/746 (removed 11) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 735 rows 523 cols
[2023-03-24 03:11:38] [INFO ] Computed 97 place invariants in 10 ms
[2023-03-24 03:11:38] [INFO ] [Real]Absence check using 76 positive place invariants in 42 ms returned sat
[2023-03-24 03:11:38] [INFO ] [Real]Absence check using 76 positive and 21 generalized place invariants in 22 ms returned sat
[2023-03-24 03:11:38] [INFO ] After 260ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-24 03:11:38] [INFO ] [Nat]Absence check using 76 positive place invariants in 15 ms returned sat
[2023-03-24 03:11:38] [INFO ] [Nat]Absence check using 76 positive and 21 generalized place invariants in 22 ms returned sat
[2023-03-24 03:11:39] [INFO ] After 613ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-24 03:11:39] [INFO ] Deduced a trap composed of 158 places in 195 ms of which 0 ms to minimize.
[2023-03-24 03:11:39] [INFO ] Deduced a trap composed of 153 places in 198 ms of which 1 ms to minimize.
[2023-03-24 03:11:39] [INFO ] Deduced a trap composed of 171 places in 182 ms of which 0 ms to minimize.
[2023-03-24 03:11:40] [INFO ] Deduced a trap composed of 174 places in 200 ms of which 1 ms to minimize.
[2023-03-24 03:11:40] [INFO ] Deduced a trap composed of 156 places in 204 ms of which 1 ms to minimize.
[2023-03-24 03:11:40] [INFO ] Deduced a trap composed of 159 places in 184 ms of which 1 ms to minimize.
[2023-03-24 03:11:40] [INFO ] Deduced a trap composed of 153 places in 192 ms of which 0 ms to minimize.
[2023-03-24 03:11:41] [INFO ] Deduced a trap composed of 165 places in 187 ms of which 1 ms to minimize.
[2023-03-24 03:11:41] [INFO ] Deduced a trap composed of 173 places in 196 ms of which 1 ms to minimize.
[2023-03-24 03:11:41] [INFO ] Deduced a trap composed of 162 places in 190 ms of which 1 ms to minimize.
[2023-03-24 03:11:41] [INFO ] Deduced a trap composed of 159 places in 175 ms of which 0 ms to minimize.
[2023-03-24 03:11:41] [INFO ] Deduced a trap composed of 156 places in 194 ms of which 0 ms to minimize.
[2023-03-24 03:11:42] [INFO ] Deduced a trap composed of 171 places in 199 ms of which 0 ms to minimize.
[2023-03-24 03:11:42] [INFO ] Deduced a trap composed of 162 places in 190 ms of which 1 ms to minimize.
[2023-03-24 03:11:42] [INFO ] Deduced a trap composed of 174 places in 192 ms of which 0 ms to minimize.
[2023-03-24 03:11:42] [INFO ] Deduced a trap composed of 180 places in 189 ms of which 1 ms to minimize.
[2023-03-24 03:11:43] [INFO ] Deduced a trap composed of 153 places in 198 ms of which 1 ms to minimize.
[2023-03-24 03:11:44] [INFO ] Deduced a trap composed of 174 places in 196 ms of which 1 ms to minimize.
[2023-03-24 03:11:44] [INFO ] Deduced a trap composed of 180 places in 202 ms of which 1 ms to minimize.
[2023-03-24 03:11:44] [INFO ] Deduced a trap composed of 168 places in 204 ms of which 0 ms to minimize.
[2023-03-24 03:11:44] [INFO ] Deduced a trap composed of 180 places in 197 ms of which 1 ms to minimize.
[2023-03-24 03:11:45] [INFO ] Deduced a trap composed of 165 places in 185 ms of which 0 ms to minimize.
[2023-03-24 03:11:45] [INFO ] Deduced a trap composed of 165 places in 191 ms of which 1 ms to minimize.
[2023-03-24 03:11:45] [INFO ] Deduced a trap composed of 162 places in 190 ms of which 1 ms to minimize.
[2023-03-24 03:11:45] [INFO ] Deduced a trap composed of 162 places in 194 ms of which 0 ms to minimize.
[2023-03-24 03:11:46] [INFO ] Deduced a trap composed of 177 places in 208 ms of which 1 ms to minimize.
[2023-03-24 03:11:46] [INFO ] Deduced a trap composed of 171 places in 207 ms of which 1 ms to minimize.
[2023-03-24 03:11:46] [INFO ] Deduced a trap composed of 165 places in 197 ms of which 1 ms to minimize.
[2023-03-24 03:11:46] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 2 ms to minimize.
[2023-03-24 03:11:47] [INFO ] Deduced a trap composed of 156 places in 193 ms of which 1 ms to minimize.
[2023-03-24 03:11:47] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 0 ms to minimize.
[2023-03-24 03:11:47] [INFO ] Deduced a trap composed of 159 places in 190 ms of which 1 ms to minimize.
[2023-03-24 03:11:47] [INFO ] Deduced a trap composed of 174 places in 192 ms of which 1 ms to minimize.
[2023-03-24 03:11:48] [INFO ] Deduced a trap composed of 156 places in 201 ms of which 1 ms to minimize.
[2023-03-24 03:11:48] [INFO ] Deduced a trap composed of 177 places in 198 ms of which 1 ms to minimize.
[2023-03-24 03:11:48] [INFO ] Deduced a trap composed of 186 places in 204 ms of which 1 ms to minimize.
[2023-03-24 03:11:48] [INFO ] Deduced a trap composed of 162 places in 211 ms of which 0 ms to minimize.
[2023-03-24 03:11:49] [INFO ] Deduced a trap composed of 183 places in 202 ms of which 1 ms to minimize.
[2023-03-24 03:11:49] [INFO ] Deduced a trap composed of 162 places in 207 ms of which 0 ms to minimize.
[2023-03-24 03:11:49] [INFO ] Deduced a trap composed of 165 places in 197 ms of which 1 ms to minimize.
[2023-03-24 03:11:50] [INFO ] Deduced a trap composed of 180 places in 186 ms of which 1 ms to minimize.
[2023-03-24 03:11:50] [INFO ] Deduced a trap composed of 156 places in 199 ms of which 0 ms to minimize.
[2023-03-24 03:11:50] [INFO ] Deduced a trap composed of 198 places in 187 ms of which 0 ms to minimize.
[2023-03-24 03:11:50] [INFO ] Deduced a trap composed of 168 places in 187 ms of which 1 ms to minimize.
[2023-03-24 03:11:51] [INFO ] Deduced a trap composed of 162 places in 197 ms of which 0 ms to minimize.
[2023-03-24 03:11:51] [INFO ] Deduced a trap composed of 159 places in 204 ms of which 0 ms to minimize.
[2023-03-24 03:11:52] [INFO ] Deduced a trap composed of 186 places in 203 ms of which 1 ms to minimize.
[2023-03-24 03:11:52] [INFO ] Deduced a trap composed of 159 places in 188 ms of which 0 ms to minimize.
[2023-03-24 03:11:53] [INFO ] Deduced a trap composed of 168 places in 203 ms of which 0 ms to minimize.
[2023-03-24 03:11:53] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 1 ms to minimize.
[2023-03-24 03:11:53] [INFO ] Deduced a trap composed of 165 places in 195 ms of which 1 ms to minimize.
[2023-03-24 03:11:53] [INFO ] Deduced a trap composed of 180 places in 201 ms of which 1 ms to minimize.
[2023-03-24 03:11:54] [INFO ] Deduced a trap composed of 183 places in 197 ms of which 0 ms to minimize.
[2023-03-24 03:11:54] [INFO ] Deduced a trap composed of 159 places in 198 ms of which 0 ms to minimize.
[2023-03-24 03:11:54] [INFO ] Deduced a trap composed of 156 places in 190 ms of which 1 ms to minimize.
[2023-03-24 03:11:55] [INFO ] Deduced a trap composed of 159 places in 194 ms of which 1 ms to minimize.
[2023-03-24 03:11:55] [INFO ] Deduced a trap composed of 168 places in 192 ms of which 1 ms to minimize.
[2023-03-24 03:11:55] [INFO ] Deduced a trap composed of 171 places in 193 ms of which 1 ms to minimize.
[2023-03-24 03:11:55] [INFO ] Deduced a trap composed of 165 places in 196 ms of which 1 ms to minimize.
[2023-03-24 03:11:56] [INFO ] Deduced a trap composed of 168 places in 192 ms of which 1 ms to minimize.
[2023-03-24 03:11:56] [INFO ] Deduced a trap composed of 174 places in 190 ms of which 0 ms to minimize.
[2023-03-24 03:11:56] [INFO ] Deduced a trap composed of 144 places in 195 ms of which 1 ms to minimize.
[2023-03-24 03:11:57] [INFO ] Deduced a trap composed of 165 places in 180 ms of which 0 ms to minimize.
[2023-03-24 03:11:57] [INFO ] Deduced a trap composed of 171 places in 184 ms of which 1 ms to minimize.
[2023-03-24 03:11:57] [INFO ] Deduced a trap composed of 174 places in 187 ms of which 0 ms to minimize.
[2023-03-24 03:11:58] [INFO ] Deduced a trap composed of 171 places in 186 ms of which 0 ms to minimize.
[2023-03-24 03:11:58] [INFO ] Deduced a trap composed of 171 places in 178 ms of which 0 ms to minimize.
[2023-03-24 03:11:58] [INFO ] Deduced a trap composed of 168 places in 180 ms of which 1 ms to minimize.
[2023-03-24 03:11:58] [INFO ] Deduced a trap composed of 174 places in 180 ms of which 0 ms to minimize.
[2023-03-24 03:11:58] [INFO ] Deduced a trap composed of 156 places in 209 ms of which 1 ms to minimize.
[2023-03-24 03:11:59] [INFO ] Deduced a trap composed of 159 places in 193 ms of which 1 ms to minimize.
[2023-03-24 03:11:59] [INFO ] Deduced a trap composed of 168 places in 187 ms of which 1 ms to minimize.
[2023-03-24 03:12:00] [INFO ] Deduced a trap composed of 168 places in 179 ms of which 1 ms to minimize.
[2023-03-24 03:12:00] [INFO ] Deduced a trap composed of 174 places in 184 ms of which 0 ms to minimize.
[2023-03-24 03:12:00] [INFO ] Deduced a trap composed of 177 places in 197 ms of which 0 ms to minimize.
[2023-03-24 03:12:01] [INFO ] Deduced a trap composed of 156 places in 207 ms of which 1 ms to minimize.
[2023-03-24 03:12:01] [INFO ] Deduced a trap composed of 177 places in 198 ms of which 1 ms to minimize.
[2023-03-24 03:12:02] [INFO ] Deduced a trap composed of 180 places in 202 ms of which 1 ms to minimize.
[2023-03-24 03:12:02] [INFO ] Deduced a trap composed of 171 places in 203 ms of which 0 ms to minimize.
[2023-03-24 03:12:03] [INFO ] Deduced a trap composed of 159 places in 199 ms of which 1 ms to minimize.
[2023-03-24 03:12:03] [INFO ] Deduced a trap composed of 150 places in 206 ms of which 0 ms to minimize.
[2023-03-24 03:12:03] [INFO ] Deduced a trap composed of 165 places in 212 ms of which 0 ms to minimize.
[2023-03-24 03:12:04] [INFO ] Deduced a trap composed of 167 places in 200 ms of which 0 ms to minimize.
[2023-03-24 03:12:04] [INFO ] Deduced a trap composed of 168 places in 197 ms of which 0 ms to minimize.
[2023-03-24 03:12:04] [INFO ] Deduced a trap composed of 156 places in 200 ms of which 1 ms to minimize.
[2023-03-24 03:12:04] [INFO ] Deduced a trap composed of 165 places in 201 ms of which 0 ms to minimize.
[2023-03-24 03:12:05] [INFO ] Deduced a trap composed of 177 places in 195 ms of which 1 ms to minimize.
[2023-03-24 03:12:06] [INFO ] Deduced a trap composed of 174 places in 190 ms of which 0 ms to minimize.
[2023-03-24 03:12:06] [INFO ] Deduced a trap composed of 165 places in 196 ms of which 0 ms to minimize.
[2023-03-24 03:12:06] [INFO ] Deduced a trap composed of 177 places in 193 ms of which 0 ms to minimize.
[2023-03-24 03:12:07] [INFO ] Deduced a trap composed of 159 places in 184 ms of which 0 ms to minimize.
[2023-03-24 03:12:08] [INFO ] Deduced a trap composed of 168 places in 197 ms of which 1 ms to minimize.
[2023-03-24 03:12:08] [INFO ] Deduced a trap composed of 144 places in 185 ms of which 1 ms to minimize.
[2023-03-24 03:12:08] [INFO ] Deduced a trap composed of 153 places in 179 ms of which 0 ms to minimize.
[2023-03-24 03:12:09] [INFO ] Deduced a trap composed of 156 places in 183 ms of which 1 ms to minimize.
[2023-03-24 03:12:09] [INFO ] Deduced a trap composed of 165 places in 198 ms of which 1 ms to minimize.
[2023-03-24 03:12:09] [INFO ] Deduced a trap composed of 171 places in 179 ms of which 1 ms to minimize.
[2023-03-24 03:12:10] [INFO ] Deduced a trap composed of 161 places in 180 ms of which 0 ms to minimize.
[2023-03-24 03:12:10] [INFO ] Deduced a trap composed of 158 places in 197 ms of which 1 ms to minimize.
[2023-03-24 03:12:10] [INFO ] Deduced a trap composed of 177 places in 195 ms of which 0 ms to minimize.
[2023-03-24 03:12:10] [INFO ] Deduced a trap composed of 186 places in 196 ms of which 1 ms to minimize.
[2023-03-24 03:12:11] [INFO ] Deduced a trap composed of 179 places in 194 ms of which 0 ms to minimize.
[2023-03-24 03:12:12] [INFO ] Deduced a trap composed of 165 places in 201 ms of which 1 ms to minimize.
[2023-03-24 03:12:14] [INFO ] Deduced a trap composed of 177 places in 195 ms of which 1 ms to minimize.
[2023-03-24 03:12:16] [INFO ] Deduced a trap composed of 165 places in 187 ms of which 1 ms to minimize.
[2023-03-24 03:12:20] [INFO ] Deduced a trap composed of 159 places in 202 ms of which 0 ms to minimize.
[2023-03-24 03:12:20] [INFO ] Deduced a trap composed of 177 places in 182 ms of which 1 ms to minimize.
[2023-03-24 03:12:29] [INFO ] Trap strengthening (SAT) tested/added 107/107 trap constraints in 50573 ms
[2023-03-24 03:12:29] [INFO ] After 51338ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-24 03:12:29] [INFO ] After 51476ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
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' '!(F((X(F(p0))&&G(p1))))'
Support contains 44 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 840/840 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 623 transition count 839
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 623 transition count 839
Applied a total of 2 rules in 49 ms. Remains 623 /624 variables (removed 1) and now considering 839/840 (removed 1) transitions.
[2023-03-24 03:12:30] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2023-03-24 03:12:30] [INFO ] Computed 97 place invariants in 11 ms
[2023-03-24 03:12:31] [INFO ] Dead Transitions using invariants and state equation in 1010 ms found 0 transitions.
[2023-03-24 03:12:31] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-24 03:12:31] [INFO ] Invariant cache hit.
[2023-03-24 03:12:32] [INFO ] Implicit Places using invariants in 858 ms returned []
[2023-03-24 03:12:32] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-24 03:12:32] [INFO ] Invariant cache hit.
[2023-03-24 03:12:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 03:12:41] [INFO ] Implicit Places using invariants and state equation in 8891 ms returned []
Implicit Place search using SMT with State Equation took 9757 ms to find 0 implicit places.
[2023-03-24 03:12:41] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-24 03:12:41] [INFO ] Invariant cache hit.
[2023-03-24 03:12:42] [INFO ] Dead Transitions using invariants and state equation in 1046 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 623/624 places, 839/840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11863 ms. Remains : 623/624 places, 839/840 transitions.
Stuttering acceptance computed with spot in 327 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (OR (LT s105 1) (LT s165 1) (LT s574 1)) (OR (LT s165 1) (LT s489 1) (LT s574 1)) (OR (LT s165 1) (LT s450 1) (LT s574 1)) (OR (LT s165 1) (LT s38...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 12514 reset in 964 ms.
Product exploration explored 100000 steps with 12559 reset in 915 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 p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 233 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Finished random walk after 1756 steps, including 124 resets, run visited all 2 properties in 13 ms. (steps per millisecond=135 )
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 288 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 44 out of 623 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 623/623 places, 839/839 transitions.
Applied a total of 0 rules in 15 ms. Remains 623 /623 variables (removed 0) and now considering 839/839 (removed 0) transitions.
[2023-03-24 03:12:45] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-24 03:12:45] [INFO ] Invariant cache hit.
[2023-03-24 03:12:46] [INFO ] Dead Transitions using invariants and state equation in 1139 ms found 0 transitions.
[2023-03-24 03:12:46] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-24 03:12:46] [INFO ] Invariant cache hit.
[2023-03-24 03:12:47] [INFO ] Implicit Places using invariants in 877 ms returned []
[2023-03-24 03:12:47] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-24 03:12:47] [INFO ] Invariant cache hit.
[2023-03-24 03:12:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 03:12:57] [INFO ] Implicit Places using invariants and state equation in 9942 ms returned []
Implicit Place search using SMT with State Equation took 10827 ms to find 0 implicit places.
[2023-03-24 03:12:57] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-24 03:12:57] [INFO ] Invariant cache hit.
[2023-03-24 03:12:58] [INFO ] Dead Transitions using invariants and state equation in 1049 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13032 ms. Remains : 623/623 places, 839/839 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 p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 201 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Finished random walk after 2284 steps, including 156 resets, run visited all 2 properties in 17 ms. (steps per millisecond=134 )
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 281 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 137 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 12428 reset in 842 ms.
Product exploration explored 100000 steps with 12433 reset in 863 ms.
Applying partial POR strategy [false, true, false]
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 44 out of 623 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 623/623 places, 839/839 transitions.
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 623 transition count 839
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 43 place count 623 transition count 840
Deduced a syphon composed of 45 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 623 transition count 840
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 622 transition count 839
Deduced a syphon composed of 44 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 622 transition count 839
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 1 with 46 rules applied. Total rules applied 93 place count 622 transition count 839
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 135 place count 580 transition count 797
Deduced a syphon composed of 48 places in 0 ms
Iterating global reduction 1 with 42 rules applied. Total rules applied 177 place count 580 transition count 797
Deduced a syphon composed of 48 places in 0 ms
Applied a total of 177 rules in 142 ms. Remains 580 /623 variables (removed 43) and now considering 797/839 (removed 42) transitions.
[2023-03-24 03:13:01] [INFO ] Flow matrix only has 793 transitions (discarded 4 similar events)
// Phase 1: matrix 793 rows 580 cols
[2023-03-24 03:13:01] [INFO ] Computed 97 place invariants in 18 ms
[2023-03-24 03:13:02] [INFO ] Dead Transitions using invariants and state equation in 709 ms found 0 transitions.
[2023-03-24 03:13:02] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-24 03:13:02] [INFO ] Flow matrix only has 793 transitions (discarded 4 similar events)
[2023-03-24 03:13:02] [INFO ] Invariant cache hit.
[2023-03-24 03:13:03] [INFO ] Dead Transitions using invariants and state equation in 725 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 580/623 places, 797/839 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1598 ms. Remains : 580/623 places, 797/839 transitions.
Support contains 44 out of 623 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 623/623 places, 839/839 transitions.
Applied a total of 0 rules in 9 ms. Remains 623 /623 variables (removed 0) and now considering 839/839 (removed 0) transitions.
[2023-03-24 03:13:03] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2023-03-24 03:13:03] [INFO ] Computed 97 place invariants in 16 ms
[2023-03-24 03:13:04] [INFO ] Dead Transitions using invariants and state equation in 987 ms found 0 transitions.
[2023-03-24 03:13:04] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-24 03:13:04] [INFO ] Invariant cache hit.
[2023-03-24 03:13:04] [INFO ] Implicit Places using invariants in 746 ms returned []
[2023-03-24 03:13:04] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-24 03:13:04] [INFO ] Invariant cache hit.
[2023-03-24 03:13:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 03:13:13] [INFO ] Implicit Places using invariants and state equation in 8968 ms returned []
Implicit Place search using SMT with State Equation took 9716 ms to find 0 implicit places.
[2023-03-24 03:13:13] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-24 03:13:13] [INFO ] Invariant cache hit.
[2023-03-24 03:13:14] [INFO ] Dead Transitions using invariants and state equation in 1005 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11727 ms. Remains : 623/623 places, 839/839 transitions.
Treatment of property PolyORBNT-PT-S05J40-LTLFireability-00 finished in 44667 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((G(p0) U X(p1))))))'
Support contains 43 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 840/840 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 623 transition count 839
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 623 transition count 839
Applied a total of 2 rules in 20 ms. Remains 623 /624 variables (removed 1) and now considering 839/840 (removed 1) transitions.
[2023-03-24 03:13:15] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-24 03:13:15] [INFO ] Invariant cache hit.
[2023-03-24 03:13:16] [INFO ] Dead Transitions using invariants and state equation in 999 ms found 0 transitions.
[2023-03-24 03:13:16] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-24 03:13:16] [INFO ] Invariant cache hit.
[2023-03-24 03:13:16] [INFO ] Implicit Places using invariants in 867 ms returned []
[2023-03-24 03:13:16] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-24 03:13:16] [INFO ] Invariant cache hit.
[2023-03-24 03:13:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 03:13:27] [INFO ] Implicit Places using invariants and state equation in 11092 ms returned []
Implicit Place search using SMT with State Equation took 11963 ms to find 0 implicit places.
[2023-03-24 03:13:27] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-24 03:13:27] [INFO ] Invariant cache hit.
[2023-03-24 03:13:29] [INFO ] Dead Transitions using invariants and state equation in 1109 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 623/624 places, 839/840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14097 ms. Remains : 623/624 places, 839/840 transitions.
Stuttering acceptance computed with spot in 260 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (GEQ s192 1) (GEQ s516 1) (GEQ s258 1) (GEQ s447 1) (GEQ s518 1) (GEQ s319 1) (GEQ s254 1) (GEQ s266 1) (GEQ s12 1) (GEQ s452 1) (GEQ s263 1) (GEQ ...], 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 4 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J40-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J40-LTLFireability-01 finished in 14390 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 43 out of 624 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 624/624 places, 840/840 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 624 transition count 794
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 92 place count 578 transition count 794
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 578 transition count 749
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 533 transition count 749
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 183 place count 532 transition count 748
Iterating global reduction 2 with 1 rules applied. Total rules applied 184 place count 532 transition count 748
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 530 transition count 746
Applied a total of 188 rules in 64 ms. Remains 530 /624 variables (removed 94) and now considering 746/840 (removed 94) transitions.
[2023-03-24 03:13:29] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2023-03-24 03:13:29] [INFO ] Computed 97 place invariants in 16 ms
[2023-03-24 03:13:30] [INFO ] Dead Transitions using invariants and state equation in 739 ms found 0 transitions.
[2023-03-24 03:13:30] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-24 03:13:30] [INFO ] Invariant cache hit.
[2023-03-24 03:13:30] [INFO ] Implicit Places using invariants in 741 ms returned []
[2023-03-24 03:13:30] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-24 03:13:30] [INFO ] Invariant cache hit.
[2023-03-24 03:13:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 03:13:38] [INFO ] Implicit Places using invariants and state equation in 7542 ms returned []
Implicit Place search using SMT with State Equation took 8284 ms to find 0 implicit places.
[2023-03-24 03:13:38] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-24 03:13:38] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-24 03:13:38] [INFO ] Invariant cache hit.
[2023-03-24 03:13:39] [INFO ] Dead Transitions using invariants and state equation in 699 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 530/624 places, 746/840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9804 ms. Remains : 530/624 places, 746/840 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s252 1) (GEQ s383 1) (GEQ s486 1)) (AND (GEQ s99 1) (GEQ s252 1) (GEQ s486 1)) (AND (GEQ s88 1) (GEQ s252 1) (GEQ s486 1)) (AND (GEQ s183...], 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 35 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J40-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J40-LTLFireability-02 finished in 9869 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 624 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 624/624 places, 840/840 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 624 transition count 796
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 88 place count 580 transition count 796
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 88 place count 580 transition count 750
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 2 with 92 rules applied. Total rules applied 180 place count 534 transition count 750
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 184 place count 532 transition count 748
Applied a total of 184 rules in 50 ms. Remains 532 /624 variables (removed 92) and now considering 748/840 (removed 92) transitions.
[2023-03-24 03:13:39] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
// Phase 1: matrix 744 rows 532 cols
[2023-03-24 03:13:39] [INFO ] Computed 97 place invariants in 17 ms
[2023-03-24 03:13:40] [INFO ] Dead Transitions using invariants and state equation in 751 ms found 0 transitions.
[2023-03-24 03:13:40] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-24 03:13:40] [INFO ] Invariant cache hit.
[2023-03-24 03:13:40] [INFO ] Implicit Places using invariants in 772 ms returned []
[2023-03-24 03:13:40] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-24 03:13:40] [INFO ] Invariant cache hit.
[2023-03-24 03:13:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 03:13:48] [INFO ] Implicit Places using invariants and state equation in 7999 ms returned []
Implicit Place search using SMT with State Equation took 8773 ms to find 0 implicit places.
[2023-03-24 03:13:48] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-24 03:13:48] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-24 03:13:48] [INFO ] Invariant cache hit.
[2023-03-24 03:13:49] [INFO ] Dead Transitions using invariants and state equation in 730 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 532/624 places, 748/840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10322 ms. Remains : 532/624 places, 748/840 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLFireability-04 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:(GEQ s184 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]]
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J40-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J40-LTLFireability-04 finished in 10420 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&&(F(p1)||X((p2||X(X(G(p3)))))))))'
Support contains 331 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 840/840 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 623 transition count 839
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 623 transition count 839
Applied a total of 2 rules in 12 ms. Remains 623 /624 variables (removed 1) and now considering 839/840 (removed 1) transitions.
[2023-03-24 03:13:49] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2023-03-24 03:13:49] [INFO ] Computed 97 place invariants in 15 ms
[2023-03-24 03:13:50] [INFO ] Dead Transitions using invariants and state equation in 1130 ms found 0 transitions.
[2023-03-24 03:13:50] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-24 03:13:50] [INFO ] Invariant cache hit.
[2023-03-24 03:13:51] [INFO ] Implicit Places using invariants in 573 ms returned []
[2023-03-24 03:13:51] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-24 03:13:51] [INFO ] Invariant cache hit.
[2023-03-24 03:13:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 03:13:59] [INFO ] Implicit Places using invariants and state equation in 7637 ms returned []
Implicit Place search using SMT with State Equation took 8212 ms to find 0 implicit places.
[2023-03-24 03:13:59] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-24 03:13:59] [INFO ] Invariant cache hit.
[2023-03-24 03:14:00] [INFO ] Dead Transitions using invariants and state equation in 1089 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 623/624 places, 839/840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10445 ms. Remains : 623/624 places, 839/840 transitions.
Stuttering acceptance computed with spot in 277 ms :[true, (NOT p1), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p3)), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 3}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p1) p3), acceptance={} source=6 dest: 6}]], initial=2, aps=[p1:(LT s446 1), p0:(OR (AND (GEQ s56 1) (GEQ s128 1)) (AND (GEQ s124 1) (GEQ s507 1)) (AND (GEQ s480 1) (GEQ s619 1)) (AND (GEQ s90 1) (GEQ s181 1)) (AND ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J40-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J40-LTLFireability-05 finished in 10754 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||G(p1))))'
Support contains 43 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 840/840 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 623 transition count 839
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 623 transition count 839
Applied a total of 2 rules in 24 ms. Remains 623 /624 variables (removed 1) and now considering 839/840 (removed 1) transitions.
[2023-03-24 03:14:00] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-24 03:14:00] [INFO ] Invariant cache hit.
[2023-03-24 03:14:01] [INFO ] Dead Transitions using invariants and state equation in 1088 ms found 0 transitions.
[2023-03-24 03:14:01] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-24 03:14:01] [INFO ] Invariant cache hit.
[2023-03-24 03:14:02] [INFO ] Implicit Places using invariants in 901 ms returned []
[2023-03-24 03:14:02] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-24 03:14:02] [INFO ] Invariant cache hit.
[2023-03-24 03:14:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 03:14:10] [INFO ] Implicit Places using invariants and state equation in 8517 ms returned []
Implicit Place search using SMT with State Equation took 9418 ms to find 0 implicit places.
[2023-03-24 03:14:10] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-24 03:14:10] [INFO ] Invariant cache hit.
[2023-03-24 03:14:12] [INFO ] Dead Transitions using invariants and state equation in 1083 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 623/624 places, 839/840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11618 ms. Remains : 623/624 places, 839/840 transitions.
Stuttering acceptance computed with spot in 141 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(LT s218 1), p0:(AND (OR (LT s449 1) (LT s591 1)) (OR (LT s106 1) (LT s591 1)) (OR (LT s62 1) (LT s591 1)) (OR (LT s585 1) (LT s591 1)) (OR (LT s322 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 834 ms.
Product exploration explored 100000 steps with 50000 reset in 800 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 p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 5 factoid took 111 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-PT-S05J40-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-PT-S05J40-LTLFireability-07 finished in 13536 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 3 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 840/840 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 623 transition count 839
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 623 transition count 839
Applied a total of 2 rules in 25 ms. Remains 623 /624 variables (removed 1) and now considering 839/840 (removed 1) transitions.
[2023-03-24 03:14:13] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-24 03:14:13] [INFO ] Invariant cache hit.
[2023-03-24 03:14:15] [INFO ] Dead Transitions using invariants and state equation in 1101 ms found 0 transitions.
[2023-03-24 03:14:15] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-24 03:14:15] [INFO ] Invariant cache hit.
[2023-03-24 03:14:15] [INFO ] Implicit Places using invariants in 851 ms returned []
[2023-03-24 03:14:15] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-24 03:14:15] [INFO ] Invariant cache hit.
[2023-03-24 03:14:16] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 03:14:26] [INFO ] Implicit Places using invariants and state equation in 10995 ms returned []
Implicit Place search using SMT with State Equation took 11853 ms to find 0 implicit places.
[2023-03-24 03:14:26] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-24 03:14:26] [INFO ] Invariant cache hit.
[2023-03-24 03:14:28] [INFO ] Dead Transitions using invariants and state equation in 1068 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 623/624 places, 839/840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14059 ms. Remains : 623/624 places, 839/840 transitions.
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (LT s298 1) (LT s432 1) (LT s574 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 511 ms.
Product exploration explored 100000 steps with 33333 reset in 518 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 (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 67 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-PT-S05J40-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-PT-S05J40-LTLFireability-08 finished in 15294 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 6 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 840/840 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 623 transition count 839
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 623 transition count 839
Applied a total of 2 rules in 37 ms. Remains 623 /624 variables (removed 1) and now considering 839/840 (removed 1) transitions.
[2023-03-24 03:14:29] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-24 03:14:29] [INFO ] Invariant cache hit.
[2023-03-24 03:14:30] [INFO ] Dead Transitions using invariants and state equation in 1061 ms found 0 transitions.
[2023-03-24 03:14:30] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-24 03:14:30] [INFO ] Invariant cache hit.
[2023-03-24 03:14:31] [INFO ] Implicit Places using invariants in 918 ms returned []
[2023-03-24 03:14:31] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-24 03:14:31] [INFO ] Invariant cache hit.
[2023-03-24 03:14:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 03:14:41] [INFO ] Implicit Places using invariants and state equation in 10570 ms returned []
Implicit Place search using SMT with State Equation took 11490 ms to find 0 implicit places.
[2023-03-24 03:14:41] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-24 03:14:41] [INFO ] Invariant cache hit.
[2023-03-24 03:14:42] [INFO ] Dead Transitions using invariants and state equation in 1099 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 623/624 places, 839/840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13690 ms. Remains : 623/624 places, 839/840 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s121 6) (LT s289 1) (LT s297 1) (LT s468 1) (LT s561 1) (LT s610 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 606 ms.
Product exploration explored 100000 steps with 50000 reset in 631 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 : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 66 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-PT-S05J40-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-PT-S05J40-LTLFireability-09 finished in 15089 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&F(((!p0 U (p2||G(!p0)))||p1))))'
Support contains 5 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 840/840 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 623 transition count 839
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 623 transition count 839
Applied a total of 2 rules in 18 ms. Remains 623 /624 variables (removed 1) and now considering 839/840 (removed 1) transitions.
[2023-03-24 03:14:44] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-24 03:14:44] [INFO ] Invariant cache hit.
[2023-03-24 03:14:45] [INFO ] Dead Transitions using invariants and state equation in 1113 ms found 0 transitions.
[2023-03-24 03:14:45] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-24 03:14:45] [INFO ] Invariant cache hit.
[2023-03-24 03:14:46] [INFO ] Implicit Places using invariants in 870 ms returned []
[2023-03-24 03:14:46] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-24 03:14:46] [INFO ] Invariant cache hit.
[2023-03-24 03:14:46] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 03:14:58] [INFO ] Implicit Places using invariants and state equation in 11880 ms returned []
Implicit Place search using SMT with State Equation took 12755 ms to find 0 implicit places.
[2023-03-24 03:14:58] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-24 03:14:58] [INFO ] Invariant cache hit.
[2023-03-24 03:14:59] [INFO ] Dead Transitions using invariants and state equation in 1104 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 623/624 places, 839/840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14991 ms. Remains : 623/624 places, 839/840 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(OR p1 p2), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(OR (AND p1 p0) (AND p2 p0)), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(AND (GEQ s215 1) (GEQ s417 1)), p1:(OR (LT s46 1) (LT s77 1)), p2:(AND (NOT (AND (GEQ s417 1) (GEQ s591 10))) (NOT (AND (GEQ s215 1) (GEQ s417 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J40-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J40-LTLFireability-10 finished in 15169 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&&X(G(!p0)))) U (F(p2)&&p1)))'
Support contains 7 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 840/840 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 623 transition count 839
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 623 transition count 839
Applied a total of 2 rules in 27 ms. Remains 623 /624 variables (removed 1) and now considering 839/840 (removed 1) transitions.
[2023-03-24 03:14:59] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-24 03:14:59] [INFO ] Invariant cache hit.
[2023-03-24 03:15:00] [INFO ] Dead Transitions using invariants and state equation in 1130 ms found 0 transitions.
[2023-03-24 03:15:00] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-24 03:15:00] [INFO ] Invariant cache hit.
[2023-03-24 03:15:01] [INFO ] Implicit Places using invariants in 881 ms returned []
[2023-03-24 03:15:01] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-24 03:15:01] [INFO ] Invariant cache hit.
[2023-03-24 03:15:02] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 03:15:11] [INFO ] Implicit Places using invariants and state equation in 10037 ms returned []
Implicit Place search using SMT with State Equation took 10920 ms to find 0 implicit places.
[2023-03-24 03:15:11] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-24 03:15:11] [INFO ] Invariant cache hit.
[2023-03-24 03:15:12] [INFO ] Dead Transitions using invariants and state equation in 1124 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 623/624 places, 839/840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13202 ms. Remains : 623/624 places, 839/840 transitions.
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p1) (NOT p2)), true, (NOT p2), true, p0]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p0, acceptance={} source=4 dest: 3}, { cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s101 1) (GEQ s559 1) (GEQ s610 1)), p2:(AND (GEQ s55 1) (GEQ s59 1) (GEQ s493 1)), p0:(LT s78 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J40-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J40-LTLFireability-11 finished in 13434 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(!p0)))'
Support contains 1 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 840/840 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 623 transition count 839
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 623 transition count 839
Applied a total of 2 rules in 23 ms. Remains 623 /624 variables (removed 1) and now considering 839/840 (removed 1) transitions.
[2023-03-24 03:15:12] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-24 03:15:12] [INFO ] Invariant cache hit.
[2023-03-24 03:15:14] [INFO ] Dead Transitions using invariants and state equation in 1108 ms found 0 transitions.
[2023-03-24 03:15:14] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-24 03:15:14] [INFO ] Invariant cache hit.
[2023-03-24 03:15:14] [INFO ] Implicit Places using invariants in 896 ms returned []
[2023-03-24 03:15:14] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-24 03:15:14] [INFO ] Invariant cache hit.
[2023-03-24 03:15:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 03:15:26] [INFO ] Implicit Places using invariants and state equation in 11522 ms returned []
Implicit Place search using SMT with State Equation took 12420 ms to find 0 implicit places.
[2023-03-24 03:15:26] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-24 03:15:26] [INFO ] Invariant cache hit.
[2023-03-24 03:15:27] [INFO ] Dead Transitions using invariants and state equation in 1112 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 623/624 places, 839/840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14667 ms. Remains : 623/624 places, 839/840 transitions.
Stuttering acceptance computed with spot in 94 ms :[true, p0, p0]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 0}, { cond=(NOT p0), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LT s446 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J40-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J40-LTLFireability-12 finished in 14789 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))&&F(p1))))'
Support contains 4 out of 624 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 624/624 places, 840/840 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 624 transition count 796
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 45 rules applied. Total rules applied 89 place count 580 transition count 795
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 90 place count 579 transition count 795
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 90 place count 579 transition count 750
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 180 place count 534 transition count 750
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 3 with 2 rules applied. Total rules applied 182 place count 533 transition count 749
Applied a total of 182 rules in 51 ms. Remains 533 /624 variables (removed 91) and now considering 749/840 (removed 91) transitions.
[2023-03-24 03:15:27] [INFO ] Flow matrix only has 745 transitions (discarded 4 similar events)
// Phase 1: matrix 745 rows 533 cols
[2023-03-24 03:15:27] [INFO ] Computed 97 place invariants in 13 ms
[2023-03-24 03:15:28] [INFO ] Dead Transitions using invariants and state equation in 696 ms found 0 transitions.
[2023-03-24 03:15:28] [INFO ] Flow matrix only has 745 transitions (discarded 4 similar events)
[2023-03-24 03:15:28] [INFO ] Invariant cache hit.
[2023-03-24 03:15:29] [INFO ] Implicit Places using invariants in 786 ms returned []
[2023-03-24 03:15:29] [INFO ] Flow matrix only has 745 transitions (discarded 4 similar events)
[2023-03-24 03:15:29] [INFO ] Invariant cache hit.
[2023-03-24 03:15:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 03:15:38] [INFO ] Implicit Places using invariants and state equation in 9331 ms returned []
Implicit Place search using SMT with State Equation took 10119 ms to find 0 implicit places.
[2023-03-24 03:15:38] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-24 03:15:38] [INFO ] Flow matrix only has 745 transitions (discarded 4 similar events)
[2023-03-24 03:15:38] [INFO ] Invariant cache hit.
[2023-03-24 03:15:39] [INFO ] Dead Transitions using invariants and state equation in 720 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 533/624 places, 749/840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11620 ms. Remains : 533/624 places, 749/840 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s434 1), p1:(AND (GEQ s84 1) (GEQ s476 1) (GEQ s521 1))], nbAcceptance=1, 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 22 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J40-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J40-LTLFireability-13 finished in 11768 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||X((G(p1) U (p0&&G(p1))))))))'
Support contains 2 out of 624 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 624/624 places, 840/840 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 624 transition count 796
Reduce places removed 44 places and 0 transitions.
Iterating post reduction 1 with 44 rules applied. Total rules applied 88 place count 580 transition count 796
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 45 Pre rules applied. Total rules applied 88 place count 580 transition count 751
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 178 place count 535 transition count 751
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 179 place count 534 transition count 750
Iterating global reduction 2 with 1 rules applied. Total rules applied 180 place count 534 transition count 750
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 532 transition count 748
Applied a total of 184 rules in 55 ms. Remains 532 /624 variables (removed 92) and now considering 748/840 (removed 92) transitions.
[2023-03-24 03:15:39] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
// Phase 1: matrix 744 rows 532 cols
[2023-03-24 03:15:39] [INFO ] Computed 97 place invariants in 16 ms
[2023-03-24 03:15:40] [INFO ] Dead Transitions using invariants and state equation in 717 ms found 0 transitions.
[2023-03-24 03:15:40] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-24 03:15:40] [INFO ] Invariant cache hit.
[2023-03-24 03:15:41] [INFO ] Implicit Places using invariants in 806 ms returned []
[2023-03-24 03:15:41] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-24 03:15:41] [INFO ] Invariant cache hit.
[2023-03-24 03:15:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 03:15:49] [INFO ] Implicit Places using invariants and state equation in 8480 ms returned []
Implicit Place search using SMT with State Equation took 9288 ms to find 0 implicit places.
[2023-03-24 03:15:49] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-24 03:15:49] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-24 03:15:49] [INFO ] Invariant cache hit.
[2023-03-24 03:15:50] [INFO ] Dead Transitions using invariants and state equation in 687 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 532/624 places, 748/840 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10794 ms. Remains : 532/624 places, 748/840 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={1} source=0 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={1} source=1 dest: 0}, { cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={1} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s185 1), p1:(GEQ s53 4)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 7121 reset in 404 ms.
Product exploration explored 100000 steps with 7163 reset in 431 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 p0 (NOT p1)), (X p0), (X (NOT p1)), (X (NOT (AND p0 p1))), true, (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 8 factoid took 398 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 716 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 298 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 270 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-24 03:15:52] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-24 03:15:52] [INFO ] Invariant cache hit.
[2023-03-24 03:15:52] [INFO ] [Real]Absence check using 76 positive place invariants in 22 ms returned sat
[2023-03-24 03:15:52] [INFO ] [Real]Absence check using 76 positive and 21 generalized place invariants in 22 ms returned sat
[2023-03-24 03:15:52] [INFO ] After 640ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-24 03:15:52] [INFO ] [Nat]Absence check using 76 positive place invariants in 16 ms returned sat
[2023-03-24 03:15:52] [INFO ] [Nat]Absence check using 76 positive and 21 generalized place invariants in 22 ms returned sat
[2023-03-24 03:15:54] [INFO ] After 1528ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-24 03:15:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 03:15:54] [INFO ] After 485ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-24 03:15:55] [INFO ] Deduced a trap composed of 163 places in 217 ms of which 1 ms to minimize.
[2023-03-24 03:15:55] [INFO ] Deduced a trap composed of 181 places in 202 ms of which 1 ms to minimize.
[2023-03-24 03:15:55] [INFO ] Deduced a trap composed of 172 places in 203 ms of which 0 ms to minimize.
[2023-03-24 03:15:55] [INFO ] Deduced a trap composed of 179 places in 204 ms of which 1 ms to minimize.
[2023-03-24 03:15:56] [INFO ] Deduced a trap composed of 160 places in 202 ms of which 1 ms to minimize.
[2023-03-24 03:15:56] [INFO ] Deduced a trap composed of 176 places in 200 ms of which 0 ms to minimize.
[2023-03-24 03:15:56] [INFO ] Deduced a trap composed of 163 places in 195 ms of which 0 ms to minimize.
[2023-03-24 03:15:56] [INFO ] Deduced a trap composed of 182 places in 203 ms of which 1 ms to minimize.
[2023-03-24 03:15:57] [INFO ] Deduced a trap composed of 168 places in 202 ms of which 1 ms to minimize.
[2023-03-24 03:15:57] [INFO ] Deduced a trap composed of 170 places in 206 ms of which 1 ms to minimize.
[2023-03-24 03:15:57] [INFO ] Deduced a trap composed of 170 places in 213 ms of which 2 ms to minimize.
[2023-03-24 03:15:57] [INFO ] Deduced a trap composed of 175 places in 206 ms of which 1 ms to minimize.
[2023-03-24 03:15:58] [INFO ] Deduced a trap composed of 169 places in 209 ms of which 0 ms to minimize.
[2023-03-24 03:15:58] [INFO ] Deduced a trap composed of 179 places in 205 ms of which 0 ms to minimize.
[2023-03-24 03:15:58] [INFO ] Deduced a trap composed of 160 places in 208 ms of which 1 ms to minimize.
[2023-03-24 03:15:58] [INFO ] Deduced a trap composed of 185 places in 190 ms of which 1 ms to minimize.
[2023-03-24 03:15:59] [INFO ] Deduced a trap composed of 169 places in 187 ms of which 0 ms to minimize.
[2023-03-24 03:15:59] [INFO ] Deduced a trap composed of 160 places in 204 ms of which 1 ms to minimize.
[2023-03-24 03:15:59] [INFO ] Deduced a trap composed of 163 places in 193 ms of which 1 ms to minimize.
[2023-03-24 03:15:59] [INFO ] Deduced a trap composed of 172 places in 200 ms of which 0 ms to minimize.
[2023-03-24 03:16:00] [INFO ] Deduced a trap composed of 173 places in 194 ms of which 1 ms to minimize.
[2023-03-24 03:16:00] [INFO ] Deduced a trap composed of 173 places in 196 ms of which 0 ms to minimize.
[2023-03-24 03:16:01] [INFO ] Deduced a trap composed of 163 places in 192 ms of which 1 ms to minimize.
[2023-03-24 03:16:01] [INFO ] Deduced a trap composed of 179 places in 194 ms of which 1 ms to minimize.
[2023-03-24 03:16:01] [INFO ] Deduced a trap composed of 178 places in 184 ms of which 0 ms to minimize.
[2023-03-24 03:16:01] [INFO ] Deduced a trap composed of 178 places in 185 ms of which 0 ms to minimize.
[2023-03-24 03:16:02] [INFO ] Deduced a trap composed of 181 places in 188 ms of which 0 ms to minimize.
[2023-03-24 03:16:02] [INFO ] Deduced a trap composed of 169 places in 205 ms of which 2 ms to minimize.
[2023-03-24 03:16:02] [INFO ] Deduced a trap composed of 179 places in 208 ms of which 0 ms to minimize.
[2023-03-24 03:16:03] [INFO ] Deduced a trap composed of 179 places in 193 ms of which 1 ms to minimize.
[2023-03-24 03:16:03] [INFO ] Deduced a trap composed of 163 places in 189 ms of which 1 ms to minimize.
[2023-03-24 03:16:03] [INFO ] Deduced a trap composed of 178 places in 189 ms of which 1 ms to minimize.
[2023-03-24 03:16:03] [INFO ] Deduced a trap composed of 173 places in 192 ms of which 1 ms to minimize.
[2023-03-24 03:16:04] [INFO ] Deduced a trap composed of 163 places in 187 ms of which 1 ms to minimize.
[2023-03-24 03:16:04] [INFO ] Deduced a trap composed of 166 places in 191 ms of which 3 ms to minimize.
[2023-03-24 03:16:04] [INFO ] Deduced a trap composed of 176 places in 200 ms of which 1 ms to minimize.
[2023-03-24 03:16:04] [INFO ] Deduced a trap composed of 163 places in 188 ms of which 1 ms to minimize.
[2023-03-24 03:16:05] [INFO ] Deduced a trap composed of 162 places in 196 ms of which 1 ms to minimize.
[2023-03-24 03:16:05] [INFO ] Deduced a trap composed of 155 places in 191 ms of which 0 ms to minimize.
[2023-03-24 03:16:05] [INFO ] Deduced a trap composed of 151 places in 191 ms of which 0 ms to minimize.
[2023-03-24 03:16:05] [INFO ] Deduced a trap composed of 175 places in 192 ms of which 0 ms to minimize.
[2023-03-24 03:16:07] [INFO ] Deduced a trap composed of 169 places in 179 ms of which 1 ms to minimize.
[2023-03-24 03:16:08] [INFO ] Deduced a trap composed of 178 places in 186 ms of which 1 ms to minimize.
[2023-03-24 03:16:08] [INFO ] Deduced a trap composed of 188 places in 191 ms of which 0 ms to minimize.
[2023-03-24 03:16:11] [INFO ] Deduced a trap composed of 175 places in 195 ms of which 1 ms to minimize.
[2023-03-24 03:16:17] [INFO ] Trap strengthening (SAT) tested/added 45/45 trap constraints in 22842 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-24 03:16:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 03:16:17] [INFO ] After 25025ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 532 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 748/748 transitions.
Applied a total of 0 rules in 17 ms. Remains 532 /532 variables (removed 0) and now considering 748/748 (removed 0) transitions.
[2023-03-24 03:16:17] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-24 03:16:17] [INFO ] Invariant cache hit.
[2023-03-24 03:16:18] [INFO ] Dead Transitions using invariants and state equation in 630 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 649 ms. Remains : 532/532 places, 748/748 transitions.
Incomplete random walk after 10000 steps, including 717 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 85 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 300 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 186314 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 186314 steps, saw 56319 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-24 03:16:21] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-24 03:16:21] [INFO ] Invariant cache hit.
[2023-03-24 03:16:21] [INFO ] [Real]Absence check using 76 positive place invariants in 21 ms returned sat
[2023-03-24 03:16:21] [INFO ] [Real]Absence check using 76 positive and 21 generalized place invariants in 22 ms returned sat
[2023-03-24 03:16:21] [INFO ] After 161ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-24 03:16:21] [INFO ] [Nat]Absence check using 76 positive place invariants in 16 ms returned sat
[2023-03-24 03:16:21] [INFO ] [Nat]Absence check using 76 positive and 21 generalized place invariants in 26 ms returned sat
[2023-03-24 03:16:23] [INFO ] After 1486ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-24 03:16:23] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 03:16:23] [INFO ] After 465ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-24 03:16:24] [INFO ] Deduced a trap composed of 163 places in 215 ms of which 1 ms to minimize.
[2023-03-24 03:16:24] [INFO ] Deduced a trap composed of 181 places in 202 ms of which 0 ms to minimize.
[2023-03-24 03:16:24] [INFO ] Deduced a trap composed of 172 places in 204 ms of which 1 ms to minimize.
[2023-03-24 03:16:24] [INFO ] Deduced a trap composed of 179 places in 203 ms of which 1 ms to minimize.
[2023-03-24 03:16:25] [INFO ] Deduced a trap composed of 160 places in 202 ms of which 0 ms to minimize.
[2023-03-24 03:16:25] [INFO ] Deduced a trap composed of 176 places in 201 ms of which 0 ms to minimize.
[2023-03-24 03:16:25] [INFO ] Deduced a trap composed of 163 places in 195 ms of which 1 ms to minimize.
[2023-03-24 03:16:25] [INFO ] Deduced a trap composed of 182 places in 198 ms of which 1 ms to minimize.
[2023-03-24 03:16:26] [INFO ] Deduced a trap composed of 168 places in 199 ms of which 0 ms to minimize.
[2023-03-24 03:16:26] [INFO ] Deduced a trap composed of 170 places in 207 ms of which 1 ms to minimize.
[2023-03-24 03:16:26] [INFO ] Deduced a trap composed of 170 places in 201 ms of which 0 ms to minimize.
[2023-03-24 03:16:26] [INFO ] Deduced a trap composed of 175 places in 204 ms of which 1 ms to minimize.
[2023-03-24 03:16:27] [INFO ] Deduced a trap composed of 169 places in 203 ms of which 1 ms to minimize.
[2023-03-24 03:16:27] [INFO ] Deduced a trap composed of 179 places in 210 ms of which 0 ms to minimize.
[2023-03-24 03:16:27] [INFO ] Deduced a trap composed of 160 places in 198 ms of which 0 ms to minimize.
[2023-03-24 03:16:27] [INFO ] Deduced a trap composed of 185 places in 209 ms of which 0 ms to minimize.
[2023-03-24 03:16:28] [INFO ] Deduced a trap composed of 169 places in 205 ms of which 1 ms to minimize.
[2023-03-24 03:16:28] [INFO ] Deduced a trap composed of 160 places in 199 ms of which 0 ms to minimize.
[2023-03-24 03:16:28] [INFO ] Deduced a trap composed of 163 places in 210 ms of which 0 ms to minimize.
[2023-03-24 03:16:28] [INFO ] Deduced a trap composed of 172 places in 202 ms of which 0 ms to minimize.
[2023-03-24 03:16:29] [INFO ] Deduced a trap composed of 173 places in 201 ms of which 0 ms to minimize.
[2023-03-24 03:16:29] [INFO ] Deduced a trap composed of 173 places in 201 ms of which 1 ms to minimize.
[2023-03-24 03:16:30] [INFO ] Deduced a trap composed of 163 places in 211 ms of which 0 ms to minimize.
[2023-03-24 03:16:30] [INFO ] Deduced a trap composed of 179 places in 195 ms of which 0 ms to minimize.
[2023-03-24 03:16:30] [INFO ] Deduced a trap composed of 178 places in 198 ms of which 0 ms to minimize.
[2023-03-24 03:16:31] [INFO ] Deduced a trap composed of 178 places in 200 ms of which 0 ms to minimize.
[2023-03-24 03:16:31] [INFO ] Deduced a trap composed of 181 places in 196 ms of which 0 ms to minimize.
[2023-03-24 03:16:31] [INFO ] Deduced a trap composed of 169 places in 191 ms of which 1 ms to minimize.
[2023-03-24 03:16:31] [INFO ] Deduced a trap composed of 179 places in 200 ms of which 1 ms to minimize.
[2023-03-24 03:16:32] [INFO ] Deduced a trap composed of 179 places in 194 ms of which 0 ms to minimize.
[2023-03-24 03:16:32] [INFO ] Deduced a trap composed of 163 places in 197 ms of which 0 ms to minimize.
[2023-03-24 03:16:32] [INFO ] Deduced a trap composed of 178 places in 196 ms of which 0 ms to minimize.
[2023-03-24 03:16:32] [INFO ] Deduced a trap composed of 173 places in 208 ms of which 1 ms to minimize.
[2023-03-24 03:16:33] [INFO ] Deduced a trap composed of 163 places in 200 ms of which 1 ms to minimize.
[2023-03-24 03:16:33] [INFO ] Deduced a trap composed of 166 places in 210 ms of which 0 ms to minimize.
[2023-03-24 03:16:33] [INFO ] Deduced a trap composed of 176 places in 199 ms of which 1 ms to minimize.
[2023-03-24 03:16:34] [INFO ] Deduced a trap composed of 163 places in 209 ms of which 1 ms to minimize.
[2023-03-24 03:16:34] [INFO ] Deduced a trap composed of 162 places in 211 ms of which 0 ms to minimize.
[2023-03-24 03:16:34] [INFO ] Deduced a trap composed of 155 places in 200 ms of which 1 ms to minimize.
[2023-03-24 03:16:34] [INFO ] Deduced a trap composed of 151 places in 208 ms of which 1 ms to minimize.
[2023-03-24 03:16:35] [INFO ] Deduced a trap composed of 175 places in 203 ms of which 0 ms to minimize.
[2023-03-24 03:16:36] [INFO ] Deduced a trap composed of 169 places in 208 ms of which 0 ms to minimize.
[2023-03-24 03:16:37] [INFO ] Deduced a trap composed of 178 places in 201 ms of which 0 ms to minimize.
[2023-03-24 03:16:37] [INFO ] Deduced a trap composed of 188 places in 200 ms of which 1 ms to minimize.
[2023-03-24 03:16:40] [INFO ] Deduced a trap composed of 175 places in 204 ms of which 1 ms to minimize.
[2023-03-24 03:16:46] [INFO ] Trap strengthening (SAT) tested/added 45/45 trap constraints in 22894 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.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-24 03:16:46] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-24 03:16:46] [INFO ] After 25012ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 532 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 748/748 transitions.
Applied a total of 0 rules in 18 ms. Remains 532 /532 variables (removed 0) and now considering 748/748 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 532/532 places, 748/748 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 748/748 transitions.
Applied a total of 0 rules in 17 ms. Remains 532 /532 variables (removed 0) and now considering 748/748 (removed 0) transitions.
[2023-03-24 03:16:46] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-24 03:16:46] [INFO ] Invariant cache hit.
[2023-03-24 03:16:47] [INFO ] Implicit Places using invariants in 937 ms returned []
[2023-03-24 03:16:47] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-24 03:16:47] [INFO ] Invariant cache hit.
[2023-03-24 03:16:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 03:16:57] [INFO ] Implicit Places using invariants and state equation in 9399 ms returned []
Implicit Place search using SMT with State Equation took 10337 ms to find 0 implicit places.
[2023-03-24 03:16:57] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-24 03:16:57] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-24 03:16:57] [INFO ] Invariant cache hit.
[2023-03-24 03:16:57] [INFO ] Dead Transitions using invariants and state equation in 718 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11092 ms. Remains : 532/532 places, 748/748 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 532 transition count 744
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 4 place count 532 transition count 743
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 6 place count 531 transition count 743
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 531 transition count 742
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 530 transition count 742
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 13 place count 530 transition count 737
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 18 place count 525 transition count 737
Applied a total of 18 rules in 58 ms. Remains 525 /532 variables (removed 7) and now considering 737/748 (removed 11) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 737 rows 525 cols
[2023-03-24 03:16:57] [INFO ] Computed 97 place invariants in 15 ms
[2023-03-24 03:16:58] [INFO ] [Real]Absence check using 76 positive place invariants in 17 ms returned sat
[2023-03-24 03:16:58] [INFO ] [Real]Absence check using 76 positive and 21 generalized place invariants in 24 ms returned sat
[2023-03-24 03:16:58] [INFO ] After 469ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-24 03:16:58] [INFO ] [Nat]Absence check using 76 positive place invariants in 15 ms returned sat
[2023-03-24 03:16:58] [INFO ] [Nat]Absence check using 76 positive and 21 generalized place invariants in 23 ms returned sat
[2023-03-24 03:16:59] [INFO ] After 681ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-24 03:16:59] [INFO ] Deduced a trap composed of 173 places in 190 ms of which 0 ms to minimize.
[2023-03-24 03:16:59] [INFO ] Deduced a trap composed of 158 places in 192 ms of which 1 ms to minimize.
[2023-03-24 03:16:59] [INFO ] Deduced a trap composed of 164 places in 193 ms of which 1 ms to minimize.
[2023-03-24 03:17:00] [INFO ] Deduced a trap composed of 161 places in 193 ms of which 1 ms to minimize.
[2023-03-24 03:17:00] [INFO ] Deduced a trap composed of 176 places in 193 ms of which 0 ms to minimize.
[2023-03-24 03:17:00] [INFO ] Deduced a trap composed of 158 places in 190 ms of which 1 ms to minimize.
[2023-03-24 03:17:00] [INFO ] Deduced a trap composed of 170 places in 191 ms of which 1 ms to minimize.
[2023-03-24 03:17:01] [INFO ] Deduced a trap composed of 173 places in 190 ms of which 1 ms to minimize.
[2023-03-24 03:17:01] [INFO ] Deduced a trap composed of 155 places in 189 ms of which 1 ms to minimize.
[2023-03-24 03:17:01] [INFO ] Deduced a trap composed of 161 places in 193 ms of which 0 ms to minimize.
[2023-03-24 03:17:01] [INFO ] Deduced a trap composed of 164 places in 189 ms of which 0 ms to minimize.
[2023-03-24 03:17:02] [INFO ] Deduced a trap composed of 161 places in 194 ms of which 1 ms to minimize.
[2023-03-24 03:17:02] [INFO ] Deduced a trap composed of 173 places in 192 ms of which 1 ms to minimize.
[2023-03-24 03:17:02] [INFO ] Deduced a trap composed of 173 places in 193 ms of which 0 ms to minimize.
[2023-03-24 03:17:03] [INFO ] Deduced a trap composed of 173 places in 203 ms of which 1 ms to minimize.
[2023-03-24 03:17:03] [INFO ] Deduced a trap composed of 170 places in 202 ms of which 1 ms to minimize.
[2023-03-24 03:17:03] [INFO ] Deduced a trap composed of 149 places in 203 ms of which 0 ms to minimize.
[2023-03-24 03:17:03] [INFO ] Deduced a trap composed of 167 places in 205 ms of which 1 ms to minimize.
[2023-03-24 03:17:04] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 1 ms to minimize.
[2023-03-24 03:17:04] [INFO ] Deduced a trap composed of 167 places in 207 ms of which 1 ms to minimize.
[2023-03-24 03:17:04] [INFO ] Deduced a trap composed of 176 places in 210 ms of which 0 ms to minimize.
[2023-03-24 03:17:04] [INFO ] Deduced a trap composed of 176 places in 205 ms of which 0 ms to minimize.
[2023-03-24 03:17:05] [INFO ] Deduced a trap composed of 176 places in 203 ms of which 0 ms to minimize.
[2023-03-24 03:17:05] [INFO ] Deduced a trap composed of 179 places in 205 ms of which 0 ms to minimize.
[2023-03-24 03:17:05] [INFO ] Deduced a trap composed of 176 places in 203 ms of which 0 ms to minimize.
[2023-03-24 03:17:05] [INFO ] Deduced a trap composed of 176 places in 200 ms of which 1 ms to minimize.
[2023-03-24 03:17:06] [INFO ] Deduced a trap composed of 173 places in 205 ms of which 1 ms to minimize.
[2023-03-24 03:17:06] [INFO ] Deduced a trap composed of 158 places in 184 ms of which 0 ms to minimize.
[2023-03-24 03:17:06] [INFO ] Deduced a trap composed of 152 places in 205 ms of which 0 ms to minimize.
[2023-03-24 03:17:06] [INFO ] Deduced a trap composed of 170 places in 206 ms of which 0 ms to minimize.
[2023-03-24 03:17:07] [INFO ] Deduced a trap composed of 158 places in 198 ms of which 0 ms to minimize.
[2023-03-24 03:17:07] [INFO ] Deduced a trap composed of 170 places in 207 ms of which 1 ms to minimize.
[2023-03-24 03:17:07] [INFO ] Deduced a trap composed of 176 places in 202 ms of which 1 ms to minimize.
[2023-03-24 03:17:08] [INFO ] Deduced a trap composed of 167 places in 200 ms of which 1 ms to minimize.
[2023-03-24 03:17:08] [INFO ] Deduced a trap composed of 182 places in 208 ms of which 0 ms to minimize.
[2023-03-24 03:17:09] [INFO ] Deduced a trap composed of 158 places in 208 ms of which 0 ms to minimize.
[2023-03-24 03:17:09] [INFO ] Deduced a trap composed of 161 places in 196 ms of which 1 ms to minimize.
[2023-03-24 03:17:12] [INFO ] Deduced a trap composed of 182 places in 206 ms of which 1 ms to minimize.
[2023-03-24 03:17:12] [INFO ] Deduced a trap composed of 172 places in 204 ms of which 0 ms to minimize.
[2023-03-24 03:17:13] [INFO ] Deduced a trap composed of 174 places in 200 ms of which 1 ms to minimize.
[2023-03-24 03:17:13] [INFO ] Deduced a trap composed of 176 places in 185 ms of which 1 ms to minimize.
[2023-03-24 03:17:13] [INFO ] Deduced a trap composed of 177 places in 191 ms of which 0 ms to minimize.
[2023-03-24 03:17:13] [INFO ] Deduced a trap composed of 169 places in 197 ms of which 1 ms to minimize.
[2023-03-24 03:17:14] [INFO ] Deduced a trap composed of 182 places in 202 ms of which 1 ms to minimize.
[2023-03-24 03:17:14] [INFO ] Deduced a trap composed of 170 places in 200 ms of which 0 ms to minimize.
[2023-03-24 03:17:14] [INFO ] Deduced a trap composed of 156 places in 202 ms of which 0 ms to minimize.
[2023-03-24 03:17:15] [INFO ] Deduced a trap composed of 153 places in 203 ms of which 0 ms to minimize.
[2023-03-24 03:17:16] [INFO ] Deduced a trap composed of 154 places in 189 ms of which 0 ms to minimize.
[2023-03-24 03:17:16] [INFO ] Deduced a trap composed of 192 places in 194 ms of which 1 ms to minimize.
[2023-03-24 03:17:16] [INFO ] Deduced a trap composed of 183 places in 205 ms of which 0 ms to minimize.
[2023-03-24 03:17:16] [INFO ] Deduced a trap composed of 164 places in 202 ms of which 1 ms to minimize.
[2023-03-24 03:17:17] [INFO ] Deduced a trap composed of 170 places in 194 ms of which 0 ms to minimize.
[2023-03-24 03:17:17] [INFO ] Deduced a trap composed of 158 places in 203 ms of which 1 ms to minimize.
[2023-03-24 03:17:18] [INFO ] Deduced a trap composed of 170 places in 208 ms of which 0 ms to minimize.
[2023-03-24 03:17:18] [INFO ] Deduced a trap composed of 164 places in 201 ms of which 1 ms to minimize.
[2023-03-24 03:17:18] [INFO ] Deduced a trap composed of 150 places in 191 ms of which 0 ms to minimize.
[2023-03-24 03:17:18] [INFO ] Deduced a trap composed of 179 places in 190 ms of which 1 ms to minimize.
[2023-03-24 03:17:19] [INFO ] Deduced a trap composed of 179 places in 192 ms of which 0 ms to minimize.
[2023-03-24 03:17:19] [INFO ] Deduced a trap composed of 158 places in 191 ms of which 1 ms to minimize.
[2023-03-24 03:17:19] [INFO ] Deduced a trap composed of 167 places in 194 ms of which 0 ms to minimize.
[2023-03-24 03:17:20] [INFO ] Deduced a trap composed of 176 places in 193 ms of which 0 ms to minimize.
[2023-03-24 03:17:20] [INFO ] Deduced a trap composed of 170 places in 196 ms of which 0 ms to minimize.
[2023-03-24 03:17:20] [INFO ] Deduced a trap composed of 158 places in 190 ms of which 1 ms to minimize.
[2023-03-24 03:17:20] [INFO ] Deduced a trap composed of 161 places in 192 ms of which 0 ms to minimize.
[2023-03-24 03:17:21] [INFO ] Deduced a trap composed of 170 places in 189 ms of which 1 ms to minimize.
[2023-03-24 03:17:21] [INFO ] Deduced a trap composed of 158 places in 191 ms of which 0 ms to minimize.
[2023-03-24 03:17:21] [INFO ] Deduced a trap composed of 164 places in 188 ms of which 0 ms to minimize.
[2023-03-24 03:17:21] [INFO ] Deduced a trap composed of 152 places in 188 ms of which 0 ms to minimize.
[2023-03-24 03:17:21] [INFO ] Deduced a trap composed of 164 places in 189 ms of which 1 ms to minimize.
[2023-03-24 03:17:22] [INFO ] Deduced a trap composed of 152 places in 186 ms of which 1 ms to minimize.
[2023-03-24 03:17:22] [INFO ] Deduced a trap composed of 170 places in 193 ms of which 1 ms to minimize.
[2023-03-24 03:17:24] [INFO ] Deduced a trap composed of 164 places in 206 ms of which 2 ms to minimize.
[2023-03-24 03:17:24] [INFO ] Deduced a trap composed of 173 places in 197 ms of which 0 ms to minimize.
[2023-03-24 03:17:24] [INFO ] Deduced a trap composed of 181 places in 188 ms of which 1 ms to minimize.
[2023-03-24 03:17:24] [INFO ] Deduced a trap composed of 170 places in 202 ms of which 1 ms to minimize.
[2023-03-24 03:17:27] [INFO ] Deduced a trap composed of 173 places in 197 ms of which 1 ms to minimize.
[2023-03-24 03:17:27] [INFO ] Deduced a trap composed of 165 places in 195 ms of which 1 ms to minimize.
[2023-03-24 03:17:28] [INFO ] Deduced a trap composed of 190 places in 199 ms of which 0 ms to minimize.
[2023-03-24 03:17:29] [INFO ] Deduced a trap composed of 158 places in 198 ms of which 1 ms to minimize.
[2023-03-24 03:17:30] [INFO ] Deduced a trap composed of 176 places in 202 ms of which 0 ms to minimize.
[2023-03-24 03:17:30] [INFO ] Deduced a trap composed of 170 places in 209 ms of which 1 ms to minimize.
[2023-03-24 03:17:39] [INFO ] Trap strengthening (SAT) tested/added 81/81 trap constraints in 40064 ms
[2023-03-24 03:17:40] [INFO ] Deduced a trap composed of 167 places in 208 ms of which 1 ms to minimize.
[2023-03-24 03:17:40] [INFO ] Deduced a trap composed of 149 places in 195 ms of which 0 ms to minimize.
[2023-03-24 03:17:40] [INFO ] Deduced a trap composed of 164 places in 191 ms of which 1 ms to minimize.
[2023-03-24 03:17:49] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 9815 ms
[2023-03-24 03:17:49] [INFO ] After 51026ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-24 03:17:49] [INFO ] After 51179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (NOT p1)), (X (NOT (AND p0 p1))), true, (X (X (NOT p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (G (NOT (AND (NOT p0) p1)))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 450 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Support contains 1 out of 532 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 532/532 places, 748/748 transitions.
Applied a total of 0 rules in 21 ms. Remains 532 /532 variables (removed 0) and now considering 748/748 (removed 0) transitions.
[2023-03-24 03:17:50] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
// Phase 1: matrix 744 rows 532 cols
[2023-03-24 03:17:50] [INFO ] Computed 97 place invariants in 14 ms
[2023-03-24 03:17:50] [INFO ] Dead Transitions using invariants and state equation in 770 ms found 0 transitions.
[2023-03-24 03:17:50] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-24 03:17:50] [INFO ] Invariant cache hit.
[2023-03-24 03:17:51] [INFO ] Implicit Places using invariants in 805 ms returned []
[2023-03-24 03:17:51] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-24 03:17:51] [INFO ] Invariant cache hit.
[2023-03-24 03:17:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 03:18:00] [INFO ] Implicit Places using invariants and state equation in 8484 ms returned []
Implicit Place search using SMT with State Equation took 9290 ms to find 0 implicit places.
[2023-03-24 03:18:00] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-24 03:18:00] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-24 03:18:00] [INFO ] Invariant cache hit.
[2023-03-24 03:18:00] [INFO ] Dead Transitions using invariants and state equation in 683 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10783 ms. Remains : 532/532 places, 748/748 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)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 124 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 142 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7102 reset in 423 ms.
Product exploration explored 100000 steps with 7216 reset in 436 ms.
Support contains 1 out of 532 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 532/532 places, 748/748 transitions.
Applied a total of 0 rules in 14 ms. Remains 532 /532 variables (removed 0) and now considering 748/748 (removed 0) transitions.
[2023-03-24 03:18:02] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-24 03:18:02] [INFO ] Invariant cache hit.
[2023-03-24 03:18:03] [INFO ] Dead Transitions using invariants and state equation in 724 ms found 0 transitions.
[2023-03-24 03:18:03] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-24 03:18:03] [INFO ] Invariant cache hit.
[2023-03-24 03:18:03] [INFO ] Implicit Places using invariants in 813 ms returned []
[2023-03-24 03:18:03] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-24 03:18:03] [INFO ] Invariant cache hit.
[2023-03-24 03:18:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 03:18:14] [INFO ] Implicit Places using invariants and state equation in 10175 ms returned []
Implicit Place search using SMT with State Equation took 10992 ms to find 0 implicit places.
[2023-03-24 03:18:14] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-24 03:18:14] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-24 03:18:14] [INFO ] Invariant cache hit.
[2023-03-24 03:18:14] [INFO ] Dead Transitions using invariants and state equation in 715 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12474 ms. Remains : 532/532 places, 748/748 transitions.
Treatment of property PolyORBNT-PT-S05J40-LTLFireability-14 finished in 155400 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U X(p1)))'
Support contains 7 out of 624 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 624/624 places, 840/840 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 623 transition count 839
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 623 transition count 839
Applied a total of 2 rules in 21 ms. Remains 623 /624 variables (removed 1) and now considering 839/840 (removed 1) transitions.
[2023-03-24 03:18:14] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2023-03-24 03:18:14] [INFO ] Computed 97 place invariants in 18 ms
[2023-03-24 03:18:16] [INFO ] Dead Transitions using invariants and state equation in 1105 ms found 0 transitions.
[2023-03-24 03:18:16] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-24 03:18:16] [INFO ] Invariant cache hit.
[2023-03-24 03:18:16] [INFO ] Implicit Places using invariants in 866 ms returned []
[2023-03-24 03:18:16] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-24 03:18:16] [INFO ] Invariant cache hit.
[2023-03-24 03:18:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 03:18:27] [INFO ] Implicit Places using invariants and state equation in 10920 ms returned []
Implicit Place search using SMT with State Equation took 11788 ms to find 0 implicit places.
[2023-03-24 03:18:27] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-24 03:18:27] [INFO ] Invariant cache hit.
[2023-03-24 03:18:28] [INFO ] Dead Transitions using invariants and state equation in 1090 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 623/624 places, 839/840 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14007 ms. Remains : 623/624 places, 839/840 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (AND (GEQ s131 1) (GEQ s180 1)) (AND (GEQ s46 1) (GEQ s205 1)) (AND (GEQ s298 1) (GEQ s372 1) (GEQ s574 1))), p1:(AND (GEQ s298 1) (GEQ s372 1) (GE...], 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 12 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S05J40-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J40-LTLFireability-15 finished in 14192 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(F(p0))&&G(p1))))'
Found a Shortening insensitive property : PolyORBNT-PT-S05J40-LTLFireability-00
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 44 out of 624 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 624/624 places, 840/840 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 624 transition count 796
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 45 rules applied. Total rules applied 89 place count 580 transition count 795
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 90 place count 579 transition count 795
Performed 45 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 45 Pre rules applied. Total rules applied 90 place count 579 transition count 750
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 180 place count 534 transition count 750
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 3 with 4 rules applied. Total rules applied 184 place count 532 transition count 748
Applied a total of 184 rules in 45 ms. Remains 532 /624 variables (removed 92) and now considering 748/840 (removed 92) transitions.
[2023-03-24 03:18:29] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
// Phase 1: matrix 744 rows 532 cols
[2023-03-24 03:18:29] [INFO ] Computed 97 place invariants in 16 ms
[2023-03-24 03:18:30] [INFO ] Dead Transitions using invariants and state equation in 719 ms found 0 transitions.
[2023-03-24 03:18:30] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-24 03:18:30] [INFO ] Invariant cache hit.
[2023-03-24 03:18:30] [INFO ] Implicit Places using invariants in 679 ms returned []
[2023-03-24 03:18:30] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-24 03:18:30] [INFO ] Invariant cache hit.
[2023-03-24 03:18:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 03:18:39] [INFO ] Implicit Places using invariants and state equation in 8505 ms returned []
Implicit Place search using SMT with State Equation took 9185 ms to find 0 implicit places.
[2023-03-24 03:18:39] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-24 03:18:39] [INFO ] Invariant cache hit.
[2023-03-24 03:18:39] [INFO ] Dead Transitions using invariants and state equation in 704 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 532/624 places, 748/840 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 10655 ms. Remains : 532/624 places, 748/840 transitions.
Running random walk in product with property : PolyORBNT-PT-S05J40-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (OR (LT s86 1) (LT s137 1) (LT s488 1)) (OR (LT s137 1) (LT s415 1) (LT s488 1)) (OR (LT s137 1) (LT s381 1) (LT s488 1)) (OR (LT s137 1) (LT s323...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 11501 reset in 1125 ms.
Product exploration explored 100000 steps with 11338 reset in 1160 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 p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 219 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Finished random walk after 84 steps, including 4 resets, run visited all 2 properties in 5 ms. (steps per millisecond=16 )
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 258 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 44 out of 532 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 532/532 places, 748/748 transitions.
Applied a total of 0 rules in 9 ms. Remains 532 /532 variables (removed 0) and now considering 748/748 (removed 0) transitions.
[2023-03-24 03:18:43] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-24 03:18:43] [INFO ] Invariant cache hit.
[2023-03-24 03:18:43] [INFO ] Dead Transitions using invariants and state equation in 726 ms found 0 transitions.
[2023-03-24 03:18:43] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-24 03:18:43] [INFO ] Invariant cache hit.
[2023-03-24 03:18:44] [INFO ] Implicit Places using invariants in 724 ms returned []
[2023-03-24 03:18:44] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-24 03:18:44] [INFO ] Invariant cache hit.
[2023-03-24 03:18:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 03:18:54] [INFO ] Implicit Places using invariants and state equation in 9651 ms returned []
Implicit Place search using SMT with State Equation took 10377 ms to find 0 implicit places.
[2023-03-24 03:18:54] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-24 03:18:54] [INFO ] Invariant cache hit.
[2023-03-24 03:18:54] [INFO ] Dead Transitions using invariants and state equation in 722 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11836 ms. Remains : 532/532 places, 748/748 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 p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 214 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Finished random walk after 31 steps, including 1 resets, run visited all 2 properties in 4 ms. (steps per millisecond=7 )
Knowledge obtained : [(AND p1 p0), (X p0), (X p1), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 215 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 115 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 11447 reset in 1131 ms.
Product exploration explored 100000 steps with 11386 reset in 1160 ms.
Applying partial POR strategy [false, true, false]
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Support contains 44 out of 532 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 532/532 places, 748/748 transitions.
Applied a total of 0 rules in 20 ms. Remains 532 /532 variables (removed 0) and now considering 748/748 (removed 0) transitions.
[2023-03-24 03:18:58] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-24 03:18:58] [INFO ] Invariant cache hit.
[2023-03-24 03:18:59] [INFO ] Dead Transitions using invariants and state equation in 715 ms found 0 transitions.
[2023-03-24 03:18:59] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-24 03:18:59] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-24 03:18:59] [INFO ] Invariant cache hit.
[2023-03-24 03:18:59] [INFO ] Dead Transitions using invariants and state equation in 716 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1468 ms. Remains : 532/532 places, 748/748 transitions.
Support contains 44 out of 532 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 532/532 places, 748/748 transitions.
Applied a total of 0 rules in 6 ms. Remains 532 /532 variables (removed 0) and now considering 748/748 (removed 0) transitions.
[2023-03-24 03:18:59] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-24 03:18:59] [INFO ] Invariant cache hit.
[2023-03-24 03:19:00] [INFO ] Dead Transitions using invariants and state equation in 694 ms found 0 transitions.
[2023-03-24 03:19:00] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-24 03:19:00] [INFO ] Invariant cache hit.
[2023-03-24 03:19:01] [INFO ] Implicit Places using invariants in 721 ms returned []
[2023-03-24 03:19:01] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-24 03:19:01] [INFO ] Invariant cache hit.
[2023-03-24 03:19:01] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-24 03:19:08] [INFO ] Implicit Places using invariants and state equation in 7567 ms returned []
Implicit Place search using SMT with State Equation took 8288 ms to find 0 implicit places.
[2023-03-24 03:19:08] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-24 03:19:08] [INFO ] Invariant cache hit.
[2023-03-24 03:19:09] [INFO ] Dead Transitions using invariants and state equation in 709 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9698 ms. Remains : 532/532 places, 748/748 transitions.
Treatment of property PolyORBNT-PT-S05J40-LTLFireability-00 finished in 40491 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||X((G(p1) U (p0&&G(p1))))))))'
[2023-03-24 03:19:09] [INFO ] Flatten gal took : 99 ms
[2023-03-24 03:19:09] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-24 03:19:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 624 places, 840 transitions and 3994 arcs took 8 ms.
Total runtime 544664 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2867/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/2867/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : PolyORBNT-PT-S05J40-LTLFireability-00
Could not compute solution for formula : PolyORBNT-PT-S05J40-LTLFireability-14

BK_STOP 1679627951381

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

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

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
*** segmentation fault ***

Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name PolyORBNT-PT-S05J40-LTLFireability-14
ltl formula formula --ltl=/tmp/2867/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 624 places, 840 transitions and 3994 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.100 real 0.040 user 0.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2867/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2867/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2867/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2867/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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