Execution Chart

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

Trace from the execution

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

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

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBNT-PT-S05J40
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 16:22:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 16:22:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 16:22:29] [INFO ] Load time of PNML (sax parser for PT used): 139 ms
[2023-03-15 16:22:29] [INFO ] Transformed 629 places.
[2023-03-15 16:22:29] [INFO ] Transformed 1590 transitions.
[2023-03-15 16:22:29] [INFO ] Parsed PT model containing 629 places and 1590 transitions and 10704 arcs in 330 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 15 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 45 ms. Remains 624 /629 variables (removed 5) and now considering 935/935 (removed 0) transitions.
[2023-03-15 16:22:30] [INFO ] Flow matrix only has 931 transitions (discarded 4 similar events)
// Phase 1: matrix 931 rows 624 cols
[2023-03-15 16:22:30] [INFO ] Computed 97 place invariants in 63 ms
[2023-03-15 16:22:31] [INFO ] Dead Transitions using invariants and state equation in 1159 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-15 16:22:31] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
// Phase 1: matrix 836 rows 624 cols
[2023-03-15 16:22:31] [INFO ] Computed 97 place invariants in 33 ms
[2023-03-15 16:22:31] [INFO ] Implicit Places using invariants in 401 ms returned []
[2023-03-15 16:22:31] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
[2023-03-15 16:22:31] [INFO ] Invariant cache hit.
[2023-03-15 16:22:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 16:22:36] [INFO ] Implicit Places using invariants and state equation in 4840 ms returned []
Implicit Place search using SMT with State Equation took 5251 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 11 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 6512 ms. Remains : 624/629 places, 840/935 transitions.
Support contains 481 out of 624 places after structural reductions.
[2023-03-15 16:22:36] [INFO ] Flatten gal took : 99 ms
[2023-03-15 16:22:37] [INFO ] Flatten gal took : 67 ms
[2023-03-15 16:22:37] [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 678 resets, run finished after 355 ms. (steps per millisecond=28 ) properties (out of 25) seen :23
Incomplete Best-First random walk after 10001 steps, including 131 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 125 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-15 16:22:37] [INFO ] Flow matrix only has 836 transitions (discarded 4 similar events)
[2023-03-15 16:22:37] [INFO ] Invariant cache hit.
[2023-03-15 16:22:37] [INFO ] [Real]Absence check using 76 positive place invariants in 20 ms returned sat
[2023-03-15 16:22:37] [INFO ] [Real]Absence check using 76 positive and 21 generalized place invariants in 22 ms returned sat
[2023-03-15 16:22:37] [INFO ] After 196ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 16:22:37] [INFO ] [Nat]Absence check using 76 positive place invariants in 18 ms returned sat
[2023-03-15 16:22:37] [INFO ] [Nat]Absence check using 76 positive and 21 generalized place invariants in 20 ms returned sat
[2023-03-15 16:22:39] [INFO ] After 1096ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 16:22:39] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 16:22:39] [INFO ] After 504ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 16:22:39] [INFO ] Deduced a trap composed of 208 places in 235 ms of which 5 ms to minimize.
[2023-03-15 16:22:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 329 ms
[2023-03-15 16:22:40] [INFO ] Deduced a trap composed of 259 places in 232 ms of which 1 ms to minimize.
[2023-03-15 16:22:40] [INFO ] Deduced a trap composed of 252 places in 211 ms of which 1 ms to minimize.
[2023-03-15 16:22:40] [INFO ] Deduced a trap composed of 256 places in 229 ms of which 13 ms to minimize.
[2023-03-15 16:22:41] [INFO ] Deduced a trap composed of 262 places in 246 ms of which 1 ms to minimize.
[2023-03-15 16:22:41] [INFO ] Deduced a trap composed of 269 places in 202 ms of which 0 ms to minimize.
[2023-03-15 16:22:41] [INFO ] Deduced a trap composed of 265 places in 219 ms of which 1 ms to minimize.
[2023-03-15 16:22:42] [INFO ] Deduced a trap composed of 271 places in 306 ms of which 1 ms to minimize.
[2023-03-15 16:22:42] [INFO ] Deduced a trap composed of 269 places in 199 ms of which 0 ms to minimize.
[2023-03-15 16:22:42] [INFO ] Deduced a trap composed of 269 places in 204 ms of which 1 ms to minimize.
[2023-03-15 16:22:42] [INFO ] Deduced a trap composed of 266 places in 200 ms of which 1 ms to minimize.
[2023-03-15 16:22:43] [INFO ] Deduced a trap composed of 260 places in 185 ms of which 0 ms to minimize.
[2023-03-15 16:22:43] [INFO ] Deduced a trap composed of 259 places in 183 ms of which 1 ms to minimize.
[2023-03-15 16:22:43] [INFO ] Deduced a trap composed of 280 places in 192 ms of which 0 ms to minimize.
[2023-03-15 16:22:43] [INFO ] Deduced a trap composed of 262 places in 190 ms of which 1 ms to minimize.
[2023-03-15 16:22:44] [INFO ] Deduced a trap composed of 266 places in 191 ms of which 0 ms to minimize.
[2023-03-15 16:22:44] [INFO ] Deduced a trap composed of 264 places in 201 ms of which 1 ms to minimize.
[2023-03-15 16:22:44] [INFO ] Deduced a trap composed of 264 places in 190 ms of which 0 ms to minimize.
[2023-03-15 16:22:44] [INFO ] Deduced a trap composed of 266 places in 203 ms of which 3 ms to minimize.
[2023-03-15 16:22:45] [INFO ] Deduced a trap composed of 250 places in 194 ms of which 0 ms to minimize.
[2023-03-15 16:22:45] [INFO ] Deduced a trap composed of 259 places in 198 ms of which 1 ms to minimize.
[2023-03-15 16:22:45] [INFO ] Deduced a trap composed of 250 places in 200 ms of which 1 ms to minimize.
[2023-03-15 16:22:46] [INFO ] Deduced a trap composed of 275 places in 197 ms of which 1 ms to minimize.
[2023-03-15 16:22:46] [INFO ] Deduced a trap composed of 269 places in 189 ms of which 0 ms to minimize.
[2023-03-15 16:22:46] [INFO ] Deduced a trap composed of 260 places in 188 ms of which 1 ms to minimize.
[2023-03-15 16:22:46] [INFO ] Deduced a trap composed of 255 places in 182 ms of which 1 ms to minimize.
[2023-03-15 16:22:47] [INFO ] Deduced a trap composed of 257 places in 186 ms of which 1 ms to minimize.
[2023-03-15 16:22:47] [INFO ] Deduced a trap composed of 257 places in 180 ms of which 1 ms to minimize.
[2023-03-15 16:22:47] [INFO ] Deduced a trap composed of 256 places in 185 ms of which 0 ms to minimize.
[2023-03-15 16:22:47] [INFO ] Deduced a trap composed of 267 places in 181 ms of which 0 ms to minimize.
[2023-03-15 16:22:47] [INFO ] Deduced a trap composed of 262 places in 198 ms of which 1 ms to minimize.
[2023-03-15 16:22:48] [INFO ] Deduced a trap composed of 244 places in 199 ms of which 1 ms to minimize.
[2023-03-15 16:22:48] [INFO ] Deduced a trap composed of 270 places in 194 ms of which 0 ms to minimize.
[2023-03-15 16:22:50] [INFO ] Deduced a trap composed of 281 places in 201 ms of which 1 ms to minimize.
[2023-03-15 16:22:54] [INFO ] Deduced a trap composed of 255 places in 234 ms of which 1 ms to minimize.
[2023-03-15 16:22:54] [INFO ] Deduced a trap composed of 263 places in 216 ms of which 0 ms to minimize.
[2023-03-15 16:22:54] [INFO ] Deduced a trap composed of 251 places in 198 ms of which 1 ms to minimize.
[2023-03-15 16:22:54] [INFO ] Deduced a trap composed of 260 places in 198 ms of which 1 ms to minimize.
[2023-03-15 16:22:55] [INFO ] Deduced a trap composed of 255 places in 198 ms of which 2 ms to minimize.
[2023-03-15 16:22:55] [INFO ] Deduced a trap composed of 260 places in 185 ms of which 1 ms to minimize.
[2023-03-15 16:22:57] [INFO ] Deduced a trap composed of 267 places in 198 ms of which 1 ms to minimize.
[2023-03-15 16:22:57] [INFO ] Deduced a trap composed of 275 places in 194 ms of which 1 ms to minimize.
[2023-03-15 16:22:57] [INFO ] Deduced a trap composed of 263 places in 196 ms of which 0 ms to minimize.
[2023-03-15 16:22:57] [INFO ] Deduced a trap composed of 244 places in 197 ms of which 0 ms to minimize.
[2023-03-15 16:22:58] [INFO ] Deduced a trap composed of 266 places in 197 ms of which 1 ms to minimize.
[2023-03-15 16:22:58] [INFO ] Deduced a trap composed of 268 places in 195 ms of which 1 ms to minimize.
[2023-03-15 16:22:58] [INFO ] Deduced a trap composed of 265 places in 192 ms of which 0 ms to minimize.
[2023-03-15 16:22:59] [INFO ] Deduced a trap composed of 251 places in 195 ms of which 1 ms to minimize.
[2023-03-15 16:22:59] [INFO ] Deduced a trap composed of 266 places in 195 ms of which 0 ms to minimize.
[2023-03-15 16:22:59] [INFO ] Deduced a trap composed of 263 places in 190 ms of which 0 ms to minimize.
[2023-03-15 16:22:59] [INFO ] Deduced a trap composed of 259 places in 198 ms of which 1 ms to minimize.
[2023-03-15 16:23:00] [INFO ] Deduced a trap composed of 266 places in 193 ms of which 1 ms to minimize.
[2023-03-15 16:23:02] [INFO ] Trap strengthening (SAT) tested/added 51/51 trap constraints in 22684 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 16:23:02] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 16:23:02] [INFO ] After 25021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 5 ms.
Support contains 3 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 1 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 146 ms. Remains 531 /624 variables (removed 93) and now considering 747/840 (removed 93) transitions.
[2023-03-15 16:23:03] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
// Phase 1: matrix 743 rows 531 cols
[2023-03-15 16:23:03] [INFO ] Computed 97 place invariants in 13 ms
[2023-03-15 16:23:03] [INFO ] Dead Transitions using invariants and state equation in 589 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 743 ms. Remains : 531/624 places, 747/840 transitions.
Incomplete random walk after 10000 steps, including 460 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 45 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 16:23:03] [INFO ] Flow matrix only has 743 transitions (discarded 4 similar events)
[2023-03-15 16:23:03] [INFO ] Invariant cache hit.
[2023-03-15 16:23:03] [INFO ] [Real]Absence check using 76 positive place invariants in 13 ms returned sat
[2023-03-15 16:23:03] [INFO ] [Real]Absence check using 76 positive and 21 generalized place invariants in 17 ms returned sat
[2023-03-15 16:23:03] [INFO ] After 144ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 16:23:03] [INFO ] [Nat]Absence check using 76 positive place invariants in 12 ms returned sat
[2023-03-15 16:23:03] [INFO ] [Nat]Absence check using 76 positive and 21 generalized place invariants in 17 ms returned sat
[2023-03-15 16:23:04] [INFO ] After 528ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 16:23:04] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 16:23:05] [INFO ] After 738ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 16:23:05] [INFO ] Deduced a trap composed of 180 places in 184 ms of which 1 ms to minimize.
[2023-03-15 16:23:05] [INFO ] Deduced a trap composed of 170 places in 155 ms of which 1 ms to minimize.
[2023-03-15 16:23:05] [INFO ] Deduced a trap composed of 161 places in 185 ms of which 1 ms to minimize.
[2023-03-15 16:23:06] [INFO ] Deduced a trap composed of 170 places in 180 ms of which 0 ms to minimize.
[2023-03-15 16:23:06] [INFO ] Deduced a trap composed of 171 places in 168 ms of which 5 ms to minimize.
[2023-03-15 16:23:06] [INFO ] Deduced a trap composed of 161 places in 204 ms of which 1 ms to minimize.
[2023-03-15 16:23:06] [INFO ] Deduced a trap composed of 161 places in 169 ms of which 1 ms to minimize.
[2023-03-15 16:23:07] [INFO ] Deduced a trap composed of 170 places in 190 ms of which 1 ms to minimize.
[2023-03-15 16:23:07] [INFO ] Deduced a trap composed of 170 places in 181 ms of which 1 ms to minimize.
[2023-03-15 16:23:07] [INFO ] Deduced a trap composed of 200 places in 192 ms of which 1 ms to minimize.
[2023-03-15 16:23:07] [INFO ] Deduced a trap composed of 158 places in 189 ms of which 0 ms to minimize.
[2023-03-15 16:23:08] [INFO ] Deduced a trap composed of 173 places in 208 ms of which 5 ms to minimize.
[2023-03-15 16:23:08] [INFO ] Deduced a trap composed of 182 places in 183 ms of which 4 ms to minimize.
[2023-03-15 16:23:08] [INFO ] Deduced a trap composed of 183 places in 211 ms of which 1 ms to minimize.
[2023-03-15 16:23:08] [INFO ] Deduced a trap composed of 173 places in 172 ms of which 2 ms to minimize.
[2023-03-15 16:23:09] [INFO ] Deduced a trap composed of 170 places in 159 ms of which 5 ms to minimize.
[2023-03-15 16:23:09] [INFO ] Deduced a trap composed of 161 places in 174 ms of which 2 ms to minimize.
[2023-03-15 16:23:09] [INFO ] Deduced a trap composed of 167 places in 161 ms of which 0 ms to minimize.
[2023-03-15 16:23:09] [INFO ] Deduced a trap composed of 167 places in 162 ms of which 1 ms to minimize.
[2023-03-15 16:23:09] [INFO ] Deduced a trap composed of 182 places in 196 ms of which 1 ms to minimize.
[2023-03-15 16:23:10] [INFO ] Deduced a trap composed of 183 places in 183 ms of which 1 ms to minimize.
[2023-03-15 16:23:10] [INFO ] Deduced a trap composed of 165 places in 171 ms of which 1 ms to minimize.
[2023-03-15 16:23:10] [INFO ] Deduced a trap composed of 174 places in 170 ms of which 0 ms to minimize.
[2023-03-15 16:23:11] [INFO ] Deduced a trap composed of 161 places in 148 ms of which 1 ms to minimize.
[2023-03-15 16:23:11] [INFO ] Deduced a trap composed of 167 places in 165 ms of which 0 ms to minimize.
[2023-03-15 16:23:11] [INFO ] Deduced a trap composed of 164 places in 170 ms of which 0 ms to minimize.
[2023-03-15 16:23:11] [INFO ] Deduced a trap composed of 156 places in 169 ms of which 1 ms to minimize.
[2023-03-15 16:23:12] [INFO ] Deduced a trap composed of 152 places in 178 ms of which 0 ms to minimize.
[2023-03-15 16:23:12] [INFO ] Deduced a trap composed of 167 places in 172 ms of which 1 ms to minimize.
[2023-03-15 16:23:15] [INFO ] Deduced a trap composed of 182 places in 167 ms of which 0 ms to minimize.
[2023-03-15 16:23:15] [INFO ] Deduced a trap composed of 158 places in 201 ms of which 0 ms to minimize.
[2023-03-15 16:23:18] [INFO ] Deduced a trap composed of 158 places in 162 ms of which 0 ms to minimize.
[2023-03-15 16:23:25] [INFO ] Deduced a trap composed of 176 places in 163 ms of which 0 ms to minimize.
[2023-03-15 16:23:28] [INFO ] Trap strengthening (SAT) tested/added 33/33 trap constraints in 23655 ms
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 16:23:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 16:23:28] [INFO ] After 25047ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 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 45 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 45 ms. Remains : 530/531 places, 746/747 transitions.
Incomplete random walk after 10000 steps, including 512 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 46 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 245127 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 245127 steps, saw 73097 distinct states, run finished after 3002 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 16:23:32] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2023-03-15 16:23:32] [INFO ] Computed 97 place invariants in 33 ms
[2023-03-15 16:23:32] [INFO ] [Real]Absence check using 76 positive place invariants in 16 ms returned sat
[2023-03-15 16:23:32] [INFO ] [Real]Absence check using 76 positive and 21 generalized place invariants in 18 ms returned sat
[2023-03-15 16:23:32] [INFO ] After 187ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 16:23:32] [INFO ] [Nat]Absence check using 76 positive place invariants in 185 ms returned sat
[2023-03-15 16:23:32] [INFO ] [Nat]Absence check using 76 positive and 21 generalized place invariants in 18 ms returned sat
[2023-03-15 16:23:33] [INFO ] After 861ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 16:23:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 16:23:33] [INFO ] After 494ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 16:23:34] [INFO ] Deduced a trap composed of 180 places in 151 ms of which 1 ms to minimize.
[2023-03-15 16:23:34] [INFO ] Deduced a trap composed of 171 places in 172 ms of which 1 ms to minimize.
[2023-03-15 16:23:34] [INFO ] Deduced a trap composed of 180 places in 176 ms of which 1 ms to minimize.
[2023-03-15 16:23:34] [INFO ] Deduced a trap composed of 176 places in 177 ms of which 1 ms to minimize.
[2023-03-15 16:23:34] [INFO ] Deduced a trap composed of 176 places in 182 ms of which 1 ms to minimize.
[2023-03-15 16:23:35] [INFO ] Deduced a trap composed of 174 places in 194 ms of which 0 ms to minimize.
[2023-03-15 16:23:35] [INFO ] Deduced a trap composed of 168 places in 173 ms of which 1 ms to minimize.
[2023-03-15 16:23:35] [INFO ] Deduced a trap composed of 176 places in 178 ms of which 1 ms to minimize.
[2023-03-15 16:23:35] [INFO ] Deduced a trap composed of 189 places in 179 ms of which 1 ms to minimize.
[2023-03-15 16:23:35] [INFO ] Deduced a trap composed of 161 places in 168 ms of which 0 ms to minimize.
[2023-03-15 16:23:36] [INFO ] Deduced a trap composed of 174 places in 169 ms of which 0 ms to minimize.
[2023-03-15 16:23:36] [INFO ] Deduced a trap composed of 164 places in 180 ms of which 0 ms to minimize.
[2023-03-15 16:23:36] [INFO ] Deduced a trap composed of 173 places in 177 ms of which 0 ms to minimize.
[2023-03-15 16:23:36] [INFO ] Deduced a trap composed of 170 places in 177 ms of which 1 ms to minimize.
[2023-03-15 16:23:37] [INFO ] Deduced a trap composed of 159 places in 177 ms of which 0 ms to minimize.
[2023-03-15 16:23:37] [INFO ] Deduced a trap composed of 193 places in 177 ms of which 1 ms to minimize.
[2023-03-15 16:23:37] [INFO ] Deduced a trap composed of 168 places in 193 ms of which 0 ms to minimize.
[2023-03-15 16:23:37] [INFO ] Deduced a trap composed of 173 places in 206 ms of which 0 ms to minimize.
[2023-03-15 16:23:38] [INFO ] Deduced a trap composed of 161 places in 197 ms of which 0 ms to minimize.
[2023-03-15 16:23:38] [INFO ] Deduced a trap composed of 187 places in 185 ms of which 1 ms to minimize.
[2023-03-15 16:23:38] [INFO ] Deduced a trap composed of 183 places in 164 ms of which 1 ms to minimize.
[2023-03-15 16:23:39] [INFO ] Deduced a trap composed of 164 places in 183 ms of which 1 ms to minimize.
[2023-03-15 16:23:39] [INFO ] Deduced a trap composed of 164 places in 167 ms of which 0 ms to minimize.
[2023-03-15 16:23:40] [INFO ] Deduced a trap composed of 170 places in 174 ms of which 0 ms to minimize.
[2023-03-15 16:23:41] [INFO ] Deduced a trap composed of 162 places in 153 ms of which 1 ms to minimize.
[2023-03-15 16:23:42] [INFO ] Deduced a trap composed of 167 places in 176 ms of which 1 ms to minimize.
[2023-03-15 16:23:51] [INFO ] Trap strengthening (SAT) tested/added 26/26 trap constraints in 17108 ms
[2023-03-15 16:23:51] [INFO ] After 17669ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 16:23:51] [INFO ] After 18806ms 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 41 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 41 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 22 ms. Remains 530 /530 variables (removed 0) and now considering 746/746 (removed 0) transitions.
[2023-03-15 16:23:51] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-15 16:23:51] [INFO ] Invariant cache hit.
[2023-03-15 16:23:51] [INFO ] Implicit Places using invariants in 724 ms returned []
[2023-03-15 16:23:51] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-15 16:23:51] [INFO ] Invariant cache hit.
[2023-03-15 16:23:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 16:23:58] [INFO ] Implicit Places using invariants and state equation in 6789 ms returned []
Implicit Place search using SMT with State Equation took 7525 ms to find 0 implicit places.
[2023-03-15 16:23:58] [INFO ] Redundant transitions in 45 ms returned []
[2023-03-15 16:23:58] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-15 16:23:58] [INFO ] Invariant cache hit.
[2023-03-15 16:23:59] [INFO ] Dead Transitions using invariants and state equation in 556 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8174 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 153 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-15 16:23:59] [INFO ] Computed 97 place invariants in 9 ms
[2023-03-15 16:23:59] [INFO ] [Real]Absence check using 76 positive place invariants in 247 ms returned sat
[2023-03-15 16:23:59] [INFO ] [Real]Absence check using 76 positive and 21 generalized place invariants in 18 ms returned sat
[2023-03-15 16:23:59] [INFO ] After 440ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 16:24:00] [INFO ] [Nat]Absence check using 76 positive place invariants in 12 ms returned sat
[2023-03-15 16:24:00] [INFO ] [Nat]Absence check using 76 positive and 21 generalized place invariants in 19 ms returned sat
[2023-03-15 16:24:00] [INFO ] After 536ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 16:24:00] [INFO ] Deduced a trap composed of 158 places in 178 ms of which 0 ms to minimize.
[2023-03-15 16:24:01] [INFO ] Deduced a trap composed of 153 places in 183 ms of which 0 ms to minimize.
[2023-03-15 16:24:01] [INFO ] Deduced a trap composed of 171 places in 148 ms of which 1 ms to minimize.
[2023-03-15 16:24:01] [INFO ] Deduced a trap composed of 174 places in 196 ms of which 0 ms to minimize.
[2023-03-15 16:24:01] [INFO ] Deduced a trap composed of 156 places in 171 ms of which 0 ms to minimize.
[2023-03-15 16:24:01] [INFO ] Deduced a trap composed of 159 places in 171 ms of which 0 ms to minimize.
[2023-03-15 16:24:02] [INFO ] Deduced a trap composed of 153 places in 177 ms of which 1 ms to minimize.
[2023-03-15 16:24:02] [INFO ] Deduced a trap composed of 165 places in 164 ms of which 1 ms to minimize.
[2023-03-15 16:24:02] [INFO ] Deduced a trap composed of 173 places in 172 ms of which 1 ms to minimize.
[2023-03-15 16:24:02] [INFO ] Deduced a trap composed of 162 places in 178 ms of which 0 ms to minimize.
[2023-03-15 16:24:02] [INFO ] Deduced a trap composed of 159 places in 176 ms of which 0 ms to minimize.
[2023-03-15 16:24:03] [INFO ] Deduced a trap composed of 156 places in 242 ms of which 3 ms to minimize.
[2023-03-15 16:24:03] [INFO ] Deduced a trap composed of 171 places in 168 ms of which 1 ms to minimize.
[2023-03-15 16:24:03] [INFO ] Deduced a trap composed of 162 places in 168 ms of which 0 ms to minimize.
[2023-03-15 16:24:03] [INFO ] Deduced a trap composed of 174 places in 167 ms of which 1 ms to minimize.
[2023-03-15 16:24:03] [INFO ] Deduced a trap composed of 180 places in 158 ms of which 1 ms to minimize.
[2023-03-15 16:24:04] [INFO ] Deduced a trap composed of 153 places in 189 ms of which 1 ms to minimize.
[2023-03-15 16:24:05] [INFO ] Deduced a trap composed of 174 places in 168 ms of which 1 ms to minimize.
[2023-03-15 16:24:05] [INFO ] Deduced a trap composed of 180 places in 174 ms of which 1 ms to minimize.
[2023-03-15 16:24:05] [INFO ] Deduced a trap composed of 168 places in 167 ms of which 1 ms to minimize.
[2023-03-15 16:24:05] [INFO ] Deduced a trap composed of 180 places in 176 ms of which 0 ms to minimize.
[2023-03-15 16:24:05] [INFO ] Deduced a trap composed of 165 places in 170 ms of which 0 ms to minimize.
[2023-03-15 16:24:06] [INFO ] Deduced a trap composed of 165 places in 179 ms of which 0 ms to minimize.
[2023-03-15 16:24:06] [INFO ] Deduced a trap composed of 162 places in 166 ms of which 0 ms to minimize.
[2023-03-15 16:24:06] [INFO ] Deduced a trap composed of 162 places in 177 ms of which 0 ms to minimize.
[2023-03-15 16:24:06] [INFO ] Deduced a trap composed of 177 places in 177 ms of which 1 ms to minimize.
[2023-03-15 16:24:07] [INFO ] Deduced a trap composed of 171 places in 228 ms of which 1 ms to minimize.
[2023-03-15 16:24:07] [INFO ] Deduced a trap composed of 165 places in 169 ms of which 0 ms to minimize.
[2023-03-15 16:24:07] [INFO ] Deduced a trap composed of 162 places in 175 ms of which 1 ms to minimize.
[2023-03-15 16:24:07] [INFO ] Deduced a trap composed of 156 places in 178 ms of which 0 ms to minimize.
[2023-03-15 16:24:08] [INFO ] Deduced a trap composed of 162 places in 170 ms of which 0 ms to minimize.
[2023-03-15 16:24:08] [INFO ] Deduced a trap composed of 159 places in 175 ms of which 2 ms to minimize.
[2023-03-15 16:24:08] [INFO ] Deduced a trap composed of 174 places in 181 ms of which 0 ms to minimize.
[2023-03-15 16:24:08] [INFO ] Deduced a trap composed of 156 places in 185 ms of which 1 ms to minimize.
[2023-03-15 16:24:08] [INFO ] Deduced a trap composed of 177 places in 177 ms of which 1 ms to minimize.
[2023-03-15 16:24:09] [INFO ] Deduced a trap composed of 186 places in 175 ms of which 0 ms to minimize.
[2023-03-15 16:24:09] [INFO ] Deduced a trap composed of 162 places in 182 ms of which 1 ms to minimize.
[2023-03-15 16:24:09] [INFO ] Deduced a trap composed of 183 places in 173 ms of which 0 ms to minimize.
[2023-03-15 16:24:09] [INFO ] Deduced a trap composed of 162 places in 173 ms of which 1 ms to minimize.
[2023-03-15 16:24:09] [INFO ] Deduced a trap composed of 165 places in 180 ms of which 1 ms to minimize.
[2023-03-15 16:24:10] [INFO ] Deduced a trap composed of 180 places in 142 ms of which 1 ms to minimize.
[2023-03-15 16:24:10] [INFO ] Deduced a trap composed of 156 places in 187 ms of which 1 ms to minimize.
[2023-03-15 16:24:10] [INFO ] Deduced a trap composed of 198 places in 183 ms of which 0 ms to minimize.
[2023-03-15 16:24:11] [INFO ] Deduced a trap composed of 168 places in 187 ms of which 0 ms to minimize.
[2023-03-15 16:24:11] [INFO ] Deduced a trap composed of 162 places in 200 ms of which 1 ms to minimize.
[2023-03-15 16:24:12] [INFO ] Deduced a trap composed of 159 places in 157 ms of which 1 ms to minimize.
[2023-03-15 16:24:12] [INFO ] Deduced a trap composed of 186 places in 181 ms of which 1 ms to minimize.
[2023-03-15 16:24:13] [INFO ] Deduced a trap composed of 159 places in 167 ms of which 0 ms to minimize.
[2023-03-15 16:24:13] [INFO ] Deduced a trap composed of 168 places in 177 ms of which 1 ms to minimize.
[2023-03-15 16:24:13] [INFO ] Deduced a trap composed of 162 places in 162 ms of which 1 ms to minimize.
[2023-03-15 16:24:13] [INFO ] Deduced a trap composed of 165 places in 174 ms of which 0 ms to minimize.
[2023-03-15 16:24:13] [INFO ] Deduced a trap composed of 180 places in 172 ms of which 0 ms to minimize.
[2023-03-15 16:24:14] [INFO ] Deduced a trap composed of 183 places in 175 ms of which 1 ms to minimize.
[2023-03-15 16:24:14] [INFO ] Deduced a trap composed of 159 places in 181 ms of which 0 ms to minimize.
[2023-03-15 16:24:14] [INFO ] Deduced a trap composed of 156 places in 191 ms of which 1 ms to minimize.
[2023-03-15 16:24:15] [INFO ] Deduced a trap composed of 159 places in 182 ms of which 0 ms to minimize.
[2023-03-15 16:24:15] [INFO ] Deduced a trap composed of 168 places in 171 ms of which 1 ms to minimize.
[2023-03-15 16:24:15] [INFO ] Deduced a trap composed of 171 places in 168 ms of which 0 ms to minimize.
[2023-03-15 16:24:15] [INFO ] Deduced a trap composed of 165 places in 174 ms of which 0 ms to minimize.
[2023-03-15 16:24:16] [INFO ] Deduced a trap composed of 168 places in 174 ms of which 0 ms to minimize.
[2023-03-15 16:24:16] [INFO ] Deduced a trap composed of 174 places in 160 ms of which 0 ms to minimize.
[2023-03-15 16:24:16] [INFO ] Deduced a trap composed of 144 places in 162 ms of which 0 ms to minimize.
[2023-03-15 16:24:16] [INFO ] Deduced a trap composed of 165 places in 189 ms of which 0 ms to minimize.
[2023-03-15 16:24:17] [INFO ] Deduced a trap composed of 171 places in 169 ms of which 1 ms to minimize.
[2023-03-15 16:24:17] [INFO ] Deduced a trap composed of 174 places in 173 ms of which 1 ms to minimize.
[2023-03-15 16:24:17] [INFO ] Deduced a trap composed of 171 places in 170 ms of which 0 ms to minimize.
[2023-03-15 16:24:17] [INFO ] Deduced a trap composed of 171 places in 171 ms of which 0 ms to minimize.
[2023-03-15 16:24:18] [INFO ] Deduced a trap composed of 168 places in 169 ms of which 0 ms to minimize.
[2023-03-15 16:24:18] [INFO ] Deduced a trap composed of 174 places in 172 ms of which 1 ms to minimize.
[2023-03-15 16:24:18] [INFO ] Deduced a trap composed of 156 places in 172 ms of which 0 ms to minimize.
[2023-03-15 16:24:18] [INFO ] Deduced a trap composed of 159 places in 169 ms of which 1 ms to minimize.
[2023-03-15 16:24:18] [INFO ] Deduced a trap composed of 168 places in 176 ms of which 1 ms to minimize.
[2023-03-15 16:24:19] [INFO ] Deduced a trap composed of 168 places in 157 ms of which 0 ms to minimize.
[2023-03-15 16:24:19] [INFO ] Deduced a trap composed of 174 places in 167 ms of which 0 ms to minimize.
[2023-03-15 16:24:20] [INFO ] Deduced a trap composed of 177 places in 180 ms of which 1 ms to minimize.
[2023-03-15 16:24:20] [INFO ] Deduced a trap composed of 156 places in 168 ms of which 0 ms to minimize.
[2023-03-15 16:24:20] [INFO ] Deduced a trap composed of 177 places in 179 ms of which 1 ms to minimize.
[2023-03-15 16:24:21] [INFO ] Deduced a trap composed of 180 places in 158 ms of which 0 ms to minimize.
[2023-03-15 16:24:22] [INFO ] Deduced a trap composed of 171 places in 199 ms of which 0 ms to minimize.
[2023-03-15 16:24:22] [INFO ] Deduced a trap composed of 159 places in 177 ms of which 1 ms to minimize.
[2023-03-15 16:24:22] [INFO ] Deduced a trap composed of 150 places in 167 ms of which 1 ms to minimize.
[2023-03-15 16:24:22] [INFO ] Deduced a trap composed of 165 places in 172 ms of which 0 ms to minimize.
[2023-03-15 16:24:23] [INFO ] Deduced a trap composed of 167 places in 169 ms of which 1 ms to minimize.
[2023-03-15 16:24:23] [INFO ] Deduced a trap composed of 168 places in 207 ms of which 0 ms to minimize.
[2023-03-15 16:24:23] [INFO ] Deduced a trap composed of 156 places in 191 ms of which 1 ms to minimize.
[2023-03-15 16:24:23] [INFO ] Deduced a trap composed of 165 places in 159 ms of which 0 ms to minimize.
[2023-03-15 16:24:24] [INFO ] Deduced a trap composed of 177 places in 173 ms of which 1 ms to minimize.
[2023-03-15 16:24:25] [INFO ] Deduced a trap composed of 174 places in 166 ms of which 0 ms to minimize.
[2023-03-15 16:24:25] [INFO ] Deduced a trap composed of 165 places in 180 ms of which 0 ms to minimize.
[2023-03-15 16:24:25] [INFO ] Deduced a trap composed of 177 places in 165 ms of which 1 ms to minimize.
[2023-03-15 16:24:26] [INFO ] Deduced a trap composed of 159 places in 184 ms of which 0 ms to minimize.
[2023-03-15 16:24:26] [INFO ] Deduced a trap composed of 168 places in 233 ms of which 0 ms to minimize.
[2023-03-15 16:24:27] [INFO ] Deduced a trap composed of 144 places in 153 ms of which 0 ms to minimize.
[2023-03-15 16:24:27] [INFO ] Deduced a trap composed of 153 places in 185 ms of which 0 ms to minimize.
[2023-03-15 16:24:27] [INFO ] Deduced a trap composed of 156 places in 152 ms of which 0 ms to minimize.
[2023-03-15 16:24:27] [INFO ] Deduced a trap composed of 165 places in 176 ms of which 1 ms to minimize.
[2023-03-15 16:24:28] [INFO ] Deduced a trap composed of 171 places in 178 ms of which 1 ms to minimize.
[2023-03-15 16:24:28] [INFO ] Deduced a trap composed of 161 places in 151 ms of which 1 ms to minimize.
[2023-03-15 16:24:28] [INFO ] Deduced a trap composed of 158 places in 169 ms of which 0 ms to minimize.
[2023-03-15 16:24:29] [INFO ] Deduced a trap composed of 177 places in 181 ms of which 0 ms to minimize.
[2023-03-15 16:24:29] [INFO ] Deduced a trap composed of 186 places in 175 ms of which 0 ms to minimize.
[2023-03-15 16:24:29] [INFO ] Deduced a trap composed of 179 places in 166 ms of which 0 ms to minimize.
[2023-03-15 16:24:31] [INFO ] Deduced a trap composed of 165 places in 152 ms of which 1 ms to minimize.
[2023-03-15 16:24:32] [INFO ] Deduced a trap composed of 177 places in 169 ms of which 1 ms to minimize.
[2023-03-15 16:24:34] [INFO ] Deduced a trap composed of 165 places in 162 ms of which 1 ms to minimize.
[2023-03-15 16:24:38] [INFO ] Deduced a trap composed of 159 places in 166 ms of which 0 ms to minimize.
[2023-03-15 16:24:38] [INFO ] Deduced a trap composed of 177 places in 168 ms of which 0 ms to minimize.
[2023-03-15 16:24:47] [INFO ] Trap strengthening (SAT) tested/added 107/107 trap constraints in 46959 ms
[2023-03-15 16:24:47] [INFO ] After 47581ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 16:24:47] [INFO ] After 47702ms 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 40 ms. Remains 623 /624 variables (removed 1) and now considering 839/840 (removed 1) transitions.
[2023-03-15 16:24:48] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2023-03-15 16:24:48] [INFO ] Computed 97 place invariants in 15 ms
[2023-03-15 16:24:48] [INFO ] Dead Transitions using invariants and state equation in 890 ms found 0 transitions.
[2023-03-15 16:24:48] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-15 16:24:48] [INFO ] Invariant cache hit.
[2023-03-15 16:24:49] [INFO ] Implicit Places using invariants in 728 ms returned []
[2023-03-15 16:24:49] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-15 16:24:49] [INFO ] Invariant cache hit.
[2023-03-15 16:24:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 16:24:59] [INFO ] Implicit Places using invariants and state equation in 9673 ms returned []
Implicit Place search using SMT with State Equation took 10404 ms to find 0 implicit places.
[2023-03-15 16:24:59] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-15 16:24:59] [INFO ] Invariant cache hit.
[2023-03-15 16:25:00] [INFO ] Dead Transitions using invariants and state equation in 947 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 12292 ms. Remains : 623/624 places, 839/840 transitions.
Stuttering acceptance computed with spot in 271 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 12449 reset in 827 ms.
Product exploration explored 100000 steps with 12587 reset in 767 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 174 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 132 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Finished random walk after 396 steps, including 25 resets, run visited all 2 properties in 5 ms. (steps per millisecond=79 )
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 236 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 97 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 105 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-15 16:25:03] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-15 16:25:03] [INFO ] Invariant cache hit.
[2023-03-15 16:25:03] [INFO ] Dead Transitions using invariants and state equation in 944 ms found 0 transitions.
[2023-03-15 16:25:03] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-15 16:25:03] [INFO ] Invariant cache hit.
[2023-03-15 16:25:04] [INFO ] Implicit Places using invariants in 728 ms returned []
[2023-03-15 16:25:04] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-15 16:25:04] [INFO ] Invariant cache hit.
[2023-03-15 16:25:05] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 16:25:13] [INFO ] Implicit Places using invariants and state equation in 9067 ms returned []
Implicit Place search using SMT with State Equation took 9798 ms to find 0 implicit places.
[2023-03-15 16:25:13] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-15 16:25:13] [INFO ] Invariant cache hit.
[2023-03-15 16:25:14] [INFO ] Dead Transitions using invariants and state equation in 951 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11713 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 207 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 109 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Finished random walk after 3054 steps, including 215 resets, run visited all 2 properties in 16 ms. (steps per millisecond=190 )
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 353 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 112 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 95 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 12644 reset in 754 ms.
Product exploration explored 100000 steps with 12566 reset in 778 ms.
Applying partial POR strategy [false, true, false]
Stuttering acceptance computed with spot in 111 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 143 ms. Remains 580 /623 variables (removed 43) and now considering 797/839 (removed 42) transitions.
[2023-03-15 16:25:17] [INFO ] Flow matrix only has 793 transitions (discarded 4 similar events)
// Phase 1: matrix 793 rows 580 cols
[2023-03-15 16:25:17] [INFO ] Computed 97 place invariants in 18 ms
[2023-03-15 16:25:18] [INFO ] Dead Transitions using invariants and state equation in 582 ms found 0 transitions.
[2023-03-15 16:25:18] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-15 16:25:18] [INFO ] Flow matrix only has 793 transitions (discarded 4 similar events)
[2023-03-15 16:25:18] [INFO ] Invariant cache hit.
[2023-03-15 16:25:18] [INFO ] Dead Transitions using invariants and state equation in 576 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 1331 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 26 ms. Remains 623 /623 variables (removed 0) and now considering 839/839 (removed 0) transitions.
[2023-03-15 16:25:18] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2023-03-15 16:25:18] [INFO ] Computed 97 place invariants in 20 ms
[2023-03-15 16:25:19] [INFO ] Dead Transitions using invariants and state equation in 935 ms found 0 transitions.
[2023-03-15 16:25:19] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-15 16:25:19] [INFO ] Invariant cache hit.
[2023-03-15 16:25:20] [INFO ] Implicit Places using invariants in 708 ms returned []
[2023-03-15 16:25:20] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-15 16:25:20] [INFO ] Invariant cache hit.
[2023-03-15 16:25:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 16:25:30] [INFO ] Implicit Places using invariants and state equation in 9820 ms returned []
Implicit Place search using SMT with State Equation took 10555 ms to find 0 implicit places.
[2023-03-15 16:25:30] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-15 16:25:30] [INFO ] Invariant cache hit.
[2023-03-15 16:25:31] [INFO ] Dead Transitions using invariants and state equation in 903 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12445 ms. Remains : 623/623 places, 839/839 transitions.
Treatment of property PolyORBNT-PT-S05J40-LTLFireability-00 finished in 43501 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 21 ms. Remains 623 /624 variables (removed 1) and now considering 839/840 (removed 1) transitions.
[2023-03-15 16:25:31] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-15 16:25:31] [INFO ] Invariant cache hit.
[2023-03-15 16:25:32] [INFO ] Dead Transitions using invariants and state equation in 1161 ms found 0 transitions.
[2023-03-15 16:25:32] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-15 16:25:32] [INFO ] Invariant cache hit.
[2023-03-15 16:25:33] [INFO ] Implicit Places using invariants in 710 ms returned []
[2023-03-15 16:25:33] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-15 16:25:33] [INFO ] Invariant cache hit.
[2023-03-15 16:25:33] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 16:25:44] [INFO ] Implicit Places using invariants and state equation in 10707 ms returned []
Implicit Place search using SMT with State Equation took 11452 ms to find 0 implicit places.
[2023-03-15 16:25:44] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-15 16:25:44] [INFO ] Invariant cache hit.
[2023-03-15 16:25:45] [INFO ] Dead Transitions using invariants and state equation in 886 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 13531 ms. Remains : 623/624 places, 839/840 transitions.
Stuttering acceptance computed with spot in 209 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 6 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J40-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J40-LTLFireability-01 finished in 13807 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 67 ms. Remains 530 /624 variables (removed 94) and now considering 746/840 (removed 94) transitions.
[2023-03-15 16:25:45] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
// Phase 1: matrix 742 rows 530 cols
[2023-03-15 16:25:45] [INFO ] Computed 97 place invariants in 9 ms
[2023-03-15 16:25:46] [INFO ] Dead Transitions using invariants and state equation in 677 ms found 0 transitions.
[2023-03-15 16:25:46] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-15 16:25:46] [INFO ] Invariant cache hit.
[2023-03-15 16:25:46] [INFO ] Implicit Places using invariants in 623 ms returned []
[2023-03-15 16:25:46] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-15 16:25:46] [INFO ] Invariant cache hit.
[2023-03-15 16:25:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 16:25:52] [INFO ] Implicit Places using invariants and state equation in 5847 ms returned []
Implicit Place search using SMT with State Equation took 6500 ms to find 0 implicit places.
[2023-03-15 16:25:52] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-15 16:25:52] [INFO ] Flow matrix only has 742 transitions (discarded 4 similar events)
[2023-03-15 16:25:52] [INFO ] Invariant cache hit.
[2023-03-15 16:25:53] [INFO ] Dead Transitions using invariants and state equation in 580 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 7866 ms. Remains : 530/624 places, 746/840 transitions.
Stuttering acceptance computed with spot in 38 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 7925 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 1 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 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 50 ms. Remains 532 /624 variables (removed 92) and now considering 748/840 (removed 92) transitions.
[2023-03-15 16:25:53] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
// Phase 1: matrix 744 rows 532 cols
[2023-03-15 16:25:53] [INFO ] Computed 97 place invariants in 9 ms
[2023-03-15 16:25:54] [INFO ] Dead Transitions using invariants and state equation in 722 ms found 0 transitions.
[2023-03-15 16:25:54] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-15 16:25:54] [INFO ] Invariant cache hit.
[2023-03-15 16:25:54] [INFO ] Implicit Places using invariants in 660 ms returned []
[2023-03-15 16:25:54] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-15 16:25:54] [INFO ] Invariant cache hit.
[2023-03-15 16:25:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 16:26:01] [INFO ] Implicit Places using invariants and state equation in 6504 ms returned []
Implicit Place search using SMT with State Equation took 7194 ms to find 0 implicit places.
[2023-03-15 16:26:01] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-15 16:26:01] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-15 16:26:01] [INFO ] Invariant cache hit.
[2023-03-15 16:26:01] [INFO ] Dead Transitions using invariants and state equation in 561 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 8559 ms. Remains : 532/624 places, 748/840 transitions.
Stuttering acceptance computed with spot in 69 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 23 steps with 1 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J40-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J40-LTLFireability-04 finished in 8642 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 16 ms. Remains 623 /624 variables (removed 1) and now considering 839/840 (removed 1) transitions.
[2023-03-15 16:26:01] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2023-03-15 16:26:01] [INFO ] Computed 97 place invariants in 10 ms
[2023-03-15 16:26:02] [INFO ] Dead Transitions using invariants and state equation in 948 ms found 0 transitions.
[2023-03-15 16:26:02] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-15 16:26:02] [INFO ] Invariant cache hit.
[2023-03-15 16:26:03] [INFO ] Implicit Places using invariants in 491 ms returned []
[2023-03-15 16:26:03] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-15 16:26:03] [INFO ] Invariant cache hit.
[2023-03-15 16:26:03] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 16:26:09] [INFO ] Implicit Places using invariants and state equation in 5894 ms returned []
Implicit Place search using SMT with State Equation took 6436 ms to find 0 implicit places.
[2023-03-15 16:26:09] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-15 16:26:09] [INFO ] Invariant cache hit.
[2023-03-15 16:26:10] [INFO ] Dead Transitions using invariants and state equation in 904 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 8344 ms. Remains : 623/624 places, 839/840 transitions.
Stuttering acceptance computed with spot in 252 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 8621 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 32 ms. Remains 623 /624 variables (removed 1) and now considering 839/840 (removed 1) transitions.
[2023-03-15 16:26:10] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-15 16:26:10] [INFO ] Invariant cache hit.
[2023-03-15 16:26:11] [INFO ] Dead Transitions using invariants and state equation in 910 ms found 0 transitions.
[2023-03-15 16:26:11] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-15 16:26:11] [INFO ] Invariant cache hit.
[2023-03-15 16:26:12] [INFO ] Implicit Places using invariants in 740 ms returned []
[2023-03-15 16:26:12] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-15 16:26:12] [INFO ] Invariant cache hit.
[2023-03-15 16:26:12] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 16:26:23] [INFO ] Implicit Places using invariants and state equation in 10961 ms returned []
Implicit Place search using SMT with State Equation took 11721 ms to find 0 implicit places.
[2023-03-15 16:26:23] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-15 16:26:23] [INFO ] Invariant cache hit.
[2023-03-15 16:26:24] [INFO ] Dead Transitions using invariants and state equation in 923 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 13628 ms. Remains : 623/624 places, 839/840 transitions.
Stuttering acceptance computed with spot in 100 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 699 ms.
Product exploration explored 100000 steps with 50000 reset in 728 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 90 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 15266 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 35 ms. Remains 623 /624 variables (removed 1) and now considering 839/840 (removed 1) transitions.
[2023-03-15 16:26:25] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-15 16:26:25] [INFO ] Invariant cache hit.
[2023-03-15 16:26:26] [INFO ] Dead Transitions using invariants and state equation in 948 ms found 0 transitions.
[2023-03-15 16:26:26] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-15 16:26:26] [INFO ] Invariant cache hit.
[2023-03-15 16:26:27] [INFO ] Implicit Places using invariants in 724 ms returned []
[2023-03-15 16:26:27] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-15 16:26:27] [INFO ] Invariant cache hit.
[2023-03-15 16:26:28] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 16:26:38] [INFO ] Implicit Places using invariants and state equation in 10799 ms returned []
Implicit Place search using SMT with State Equation took 11568 ms to find 0 implicit places.
[2023-03-15 16:26:38] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-15 16:26:38] [INFO ] Invariant cache hit.
[2023-03-15 16:26:39] [INFO ] Dead Transitions using invariants and state equation in 915 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 13493 ms. Remains : 623/624 places, 839/840 transitions.
Stuttering acceptance computed with spot in 84 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 440 ms.
Product exploration explored 100000 steps with 33333 reset in 469 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 60 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 14567 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 30 ms. Remains 623 /624 variables (removed 1) and now considering 839/840 (removed 1) transitions.
[2023-03-15 16:26:40] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-15 16:26:40] [INFO ] Invariant cache hit.
[2023-03-15 16:26:41] [INFO ] Dead Transitions using invariants and state equation in 993 ms found 0 transitions.
[2023-03-15 16:26:41] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-15 16:26:41] [INFO ] Invariant cache hit.
[2023-03-15 16:26:42] [INFO ] Implicit Places using invariants in 767 ms returned []
[2023-03-15 16:26:42] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-15 16:26:42] [INFO ] Invariant cache hit.
[2023-03-15 16:26:42] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 16:26:50] [INFO ] Implicit Places using invariants and state equation in 8471 ms returned []
Implicit Place search using SMT with State Equation took 9267 ms to find 0 implicit places.
[2023-03-15 16:26:50] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-15 16:26:50] [INFO ] Invariant cache hit.
[2023-03-15 16:26:51] [INFO ] Dead Transitions using invariants and state equation in 892 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 11212 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 559 ms.
Product exploration explored 100000 steps with 50000 reset in 612 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 55 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 12529 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 46 ms. Remains 623 /624 variables (removed 1) and now considering 839/840 (removed 1) transitions.
[2023-03-15 16:26:52] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-15 16:26:52] [INFO ] Invariant cache hit.
[2023-03-15 16:26:53] [INFO ] Dead Transitions using invariants and state equation in 943 ms found 0 transitions.
[2023-03-15 16:26:53] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-15 16:26:53] [INFO ] Invariant cache hit.
[2023-03-15 16:26:54] [INFO ] Implicit Places using invariants in 760 ms returned []
[2023-03-15 16:26:54] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-15 16:26:54] [INFO ] Invariant cache hit.
[2023-03-15 16:26:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 16:27:04] [INFO ] Implicit Places using invariants and state equation in 9862 ms returned []
Implicit Place search using SMT with State Equation took 10644 ms to find 0 implicit places.
[2023-03-15 16:27:04] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-15 16:27:04] [INFO ] Invariant cache hit.
[2023-03-15 16:27:05] [INFO ] Dead Transitions using invariants and state equation in 894 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 12575 ms. Remains : 623/624 places, 839/840 transitions.
Stuttering acceptance computed with spot in 114 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 0 ms.
FORMULA PolyORBNT-PT-S05J40-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J40-LTLFireability-10 finished in 12705 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 24 ms. Remains 623 /624 variables (removed 1) and now considering 839/840 (removed 1) transitions.
[2023-03-15 16:27:05] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-15 16:27:05] [INFO ] Invariant cache hit.
[2023-03-15 16:27:06] [INFO ] Dead Transitions using invariants and state equation in 1038 ms found 0 transitions.
[2023-03-15 16:27:06] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-15 16:27:06] [INFO ] Invariant cache hit.
[2023-03-15 16:27:07] [INFO ] Implicit Places using invariants in 727 ms returned []
[2023-03-15 16:27:07] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-15 16:27:07] [INFO ] Invariant cache hit.
[2023-03-15 16:27:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 16:27:17] [INFO ] Implicit Places using invariants and state equation in 10187 ms returned []
Implicit Place search using SMT with State Equation took 10936 ms to find 0 implicit places.
[2023-03-15 16:27:17] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-15 16:27:17] [INFO ] Invariant cache hit.
[2023-03-15 16:27:18] [INFO ] Dead Transitions using invariants and state equation in 917 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 12949 ms. Remains : 623/624 places, 839/840 transitions.
Stuttering acceptance computed with spot in 152 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 3 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 13121 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 25 ms. Remains 623 /624 variables (removed 1) and now considering 839/840 (removed 1) transitions.
[2023-03-15 16:27:18] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-15 16:27:18] [INFO ] Invariant cache hit.
[2023-03-15 16:27:19] [INFO ] Dead Transitions using invariants and state equation in 860 ms found 0 transitions.
[2023-03-15 16:27:19] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-15 16:27:19] [INFO ] Invariant cache hit.
[2023-03-15 16:27:20] [INFO ] Implicit Places using invariants in 744 ms returned []
[2023-03-15 16:27:20] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-15 16:27:20] [INFO ] Invariant cache hit.
[2023-03-15 16:27:20] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 16:27:31] [INFO ] Implicit Places using invariants and state equation in 10760 ms returned []
Implicit Place search using SMT with State Equation took 11525 ms to find 0 implicit places.
[2023-03-15 16:27:31] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-15 16:27:31] [INFO ] Invariant cache hit.
[2023-03-15 16:27:32] [INFO ] Dead Transitions using invariants and state equation in 937 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 13364 ms. Remains : 623/624 places, 839/840 transitions.
Stuttering acceptance computed with spot in 71 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 13449 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 57 ms. Remains 533 /624 variables (removed 91) and now considering 749/840 (removed 91) transitions.
[2023-03-15 16:27:32] [INFO ] Flow matrix only has 745 transitions (discarded 4 similar events)
// Phase 1: matrix 745 rows 533 cols
[2023-03-15 16:27:32] [INFO ] Computed 97 place invariants in 10 ms
[2023-03-15 16:27:32] [INFO ] Dead Transitions using invariants and state equation in 767 ms found 0 transitions.
[2023-03-15 16:27:32] [INFO ] Flow matrix only has 745 transitions (discarded 4 similar events)
[2023-03-15 16:27:32] [INFO ] Invariant cache hit.
[2023-03-15 16:27:33] [INFO ] Implicit Places using invariants in 658 ms returned []
[2023-03-15 16:27:33] [INFO ] Flow matrix only has 745 transitions (discarded 4 similar events)
[2023-03-15 16:27:33] [INFO ] Invariant cache hit.
[2023-03-15 16:27:34] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 16:27:42] [INFO ] Implicit Places using invariants and state equation in 9079 ms returned []
Implicit Place search using SMT with State Equation took 9758 ms to find 0 implicit places.
[2023-03-15 16:27:42] [INFO ] Redundant transitions in 10 ms returned []
[2023-03-15 16:27:42] [INFO ] Flow matrix only has 745 transitions (discarded 4 similar events)
[2023-03-15 16:27:42] [INFO ] Invariant cache hit.
[2023-03-15 16:27:43] [INFO ] Dead Transitions using invariants and state equation in 576 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 11202 ms. Remains : 533/624 places, 749/840 transitions.
Stuttering acceptance computed with spot in 92 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 29 steps with 3 reset in 0 ms.
FORMULA PolyORBNT-PT-S05J40-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S05J40-LTLFireability-13 finished in 11309 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 1 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 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 56 ms. Remains 532 /624 variables (removed 92) and now considering 748/840 (removed 92) transitions.
[2023-03-15 16:27:43] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
// Phase 1: matrix 744 rows 532 cols
[2023-03-15 16:27:43] [INFO ] Computed 97 place invariants in 9 ms
[2023-03-15 16:27:44] [INFO ] Dead Transitions using invariants and state equation in 617 ms found 0 transitions.
[2023-03-15 16:27:44] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-15 16:27:44] [INFO ] Invariant cache hit.
[2023-03-15 16:27:44] [INFO ] Implicit Places using invariants in 669 ms returned []
[2023-03-15 16:27:44] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-15 16:27:44] [INFO ] Invariant cache hit.
[2023-03-15 16:27:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 16:27:53] [INFO ] Implicit Places using invariants and state equation in 8987 ms returned []
Implicit Place search using SMT with State Equation took 9658 ms to find 0 implicit places.
[2023-03-15 16:27:53] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-15 16:27:53] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-15 16:27:53] [INFO ] Invariant cache hit.
[2023-03-15 16:27:54] [INFO ] Dead Transitions using invariants and state equation in 566 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 10951 ms. Remains : 532/624 places, 748/840 transitions.
Stuttering acceptance computed with spot in 89 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 7203 reset in 352 ms.
Product exploration explored 100000 steps with 7072 reset in 375 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 430 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 158 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 698 resets, run finished after 204 ms. (steps per millisecond=49 ) properties (out of 5) seen :2
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 298 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 270 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2023-03-15 16:27:56] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-15 16:27:56] [INFO ] Invariant cache hit.
[2023-03-15 16:27:56] [INFO ] [Real]Absence check using 76 positive place invariants in 22 ms returned sat
[2023-03-15 16:27:56] [INFO ] [Real]Absence check using 76 positive and 21 generalized place invariants in 28 ms returned sat
[2023-03-15 16:27:56] [INFO ] After 635ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:2
[2023-03-15 16:27:56] [INFO ] [Nat]Absence check using 76 positive place invariants in 14 ms returned sat
[2023-03-15 16:27:56] [INFO ] [Nat]Absence check using 76 positive and 21 generalized place invariants in 21 ms returned sat
[2023-03-15 16:27:58] [INFO ] After 1481ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2023-03-15 16:27:58] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 16:27:58] [INFO ] After 437ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :1 sat :2
[2023-03-15 16:27:59] [INFO ] Deduced a trap composed of 163 places in 181 ms of which 0 ms to minimize.
[2023-03-15 16:27:59] [INFO ] Deduced a trap composed of 181 places in 176 ms of which 1 ms to minimize.
[2023-03-15 16:27:59] [INFO ] Deduced a trap composed of 172 places in 179 ms of which 1 ms to minimize.
[2023-03-15 16:27:59] [INFO ] Deduced a trap composed of 179 places in 199 ms of which 1 ms to minimize.
[2023-03-15 16:27:59] [INFO ] Deduced a trap composed of 160 places in 174 ms of which 0 ms to minimize.
[2023-03-15 16:28:00] [INFO ] Deduced a trap composed of 176 places in 175 ms of which 1 ms to minimize.
[2023-03-15 16:28:00] [INFO ] Deduced a trap composed of 163 places in 179 ms of which 1 ms to minimize.
[2023-03-15 16:28:00] [INFO ] Deduced a trap composed of 182 places in 156 ms of which 1 ms to minimize.
[2023-03-15 16:28:00] [INFO ] Deduced a trap composed of 168 places in 179 ms of which 0 ms to minimize.
[2023-03-15 16:28:01] [INFO ] Deduced a trap composed of 170 places in 165 ms of which 1 ms to minimize.
[2023-03-15 16:28:01] [INFO ] Deduced a trap composed of 170 places in 175 ms of which 0 ms to minimize.
[2023-03-15 16:28:01] [INFO ] Deduced a trap composed of 175 places in 214 ms of which 1 ms to minimize.
[2023-03-15 16:28:01] [INFO ] Deduced a trap composed of 169 places in 174 ms of which 0 ms to minimize.
[2023-03-15 16:28:01] [INFO ] Deduced a trap composed of 179 places in 181 ms of which 2 ms to minimize.
[2023-03-15 16:28:02] [INFO ] Deduced a trap composed of 160 places in 173 ms of which 0 ms to minimize.
[2023-03-15 16:28:02] [INFO ] Deduced a trap composed of 185 places in 187 ms of which 1 ms to minimize.
[2023-03-15 16:28:02] [INFO ] Deduced a trap composed of 169 places in 170 ms of which 1 ms to minimize.
[2023-03-15 16:28:02] [INFO ] Deduced a trap composed of 160 places in 169 ms of which 1 ms to minimize.
[2023-03-15 16:28:03] [INFO ] Deduced a trap composed of 163 places in 177 ms of which 1 ms to minimize.
[2023-03-15 16:28:03] [INFO ] Deduced a trap composed of 172 places in 166 ms of which 1 ms to minimize.
[2023-03-15 16:28:03] [INFO ] Deduced a trap composed of 173 places in 174 ms of which 0 ms to minimize.
[2023-03-15 16:28:04] [INFO ] Deduced a trap composed of 173 places in 155 ms of which 0 ms to minimize.
[2023-03-15 16:28:04] [INFO ] Deduced a trap composed of 163 places in 158 ms of which 0 ms to minimize.
[2023-03-15 16:28:04] [INFO ] Deduced a trap composed of 179 places in 163 ms of which 0 ms to minimize.
[2023-03-15 16:28:04] [INFO ] Deduced a trap composed of 178 places in 199 ms of which 1 ms to minimize.
[2023-03-15 16:28:05] [INFO ] Deduced a trap composed of 178 places in 179 ms of which 1 ms to minimize.
[2023-03-15 16:28:05] [INFO ] Deduced a trap composed of 181 places in 161 ms of which 1 ms to minimize.
[2023-03-15 16:28:05] [INFO ] Deduced a trap composed of 169 places in 206 ms of which 0 ms to minimize.
[2023-03-15 16:28:05] [INFO ] Deduced a trap composed of 179 places in 176 ms of which 1 ms to minimize.
[2023-03-15 16:28:06] [INFO ] Deduced a trap composed of 179 places in 177 ms of which 0 ms to minimize.
[2023-03-15 16:28:06] [INFO ] Deduced a trap composed of 163 places in 180 ms of which 2 ms to minimize.
[2023-03-15 16:28:06] [INFO ] Deduced a trap composed of 178 places in 179 ms of which 0 ms to minimize.
[2023-03-15 16:28:06] [INFO ] Deduced a trap composed of 173 places in 160 ms of which 0 ms to minimize.
[2023-03-15 16:28:07] [INFO ] Deduced a trap composed of 163 places in 176 ms of which 1 ms to minimize.
[2023-03-15 16:28:07] [INFO ] Deduced a trap composed of 166 places in 169 ms of which 1 ms to minimize.
[2023-03-15 16:28:07] [INFO ] Deduced a trap composed of 176 places in 178 ms of which 1 ms to minimize.
[2023-03-15 16:28:07] [INFO ] Deduced a trap composed of 163 places in 156 ms of which 1 ms to minimize.
[2023-03-15 16:28:08] [INFO ] Deduced a trap composed of 162 places in 195 ms of which 3 ms to minimize.
[2023-03-15 16:28:08] [INFO ] Deduced a trap composed of 155 places in 171 ms of which 0 ms to minimize.
[2023-03-15 16:28:08] [INFO ] Deduced a trap composed of 151 places in 180 ms of which 1 ms to minimize.
[2023-03-15 16:28:08] [INFO ] Deduced a trap composed of 175 places in 157 ms of which 0 ms to minimize.
[2023-03-15 16:28:09] [INFO ] Deduced a trap composed of 169 places in 156 ms of which 1 ms to minimize.
[2023-03-15 16:28:10] [INFO ] Deduced a trap composed of 178 places in 176 ms of which 0 ms to minimize.
[2023-03-15 16:28:11] [INFO ] Deduced a trap composed of 188 places in 170 ms of which 1 ms to minimize.
[2023-03-15 16:28:13] [INFO ] Deduced a trap composed of 175 places in 169 ms of which 0 ms to minimize.
[2023-03-15 16:28:21] [INFO ] Trap strengthening (SAT) tested/added 45/45 trap constraints in 22952 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-15 16:28:21] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 16:28:21] [INFO ] After 25019ms 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 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 19 ms. Remains 532 /532 variables (removed 0) and now considering 748/748 (removed 0) transitions.
[2023-03-15 16:28:21] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-15 16:28:21] [INFO ] Invariant cache hit.
[2023-03-15 16:28:22] [INFO ] Dead Transitions using invariants and state equation in 588 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 607 ms. Remains : 532/532 places, 748/748 transitions.
Incomplete random walk after 10000 steps, including 714 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 301 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 197754 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 197754 steps, saw 59362 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-15 16:28:25] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-15 16:28:25] [INFO ] Invariant cache hit.
[2023-03-15 16:28:25] [INFO ] [Real]Absence check using 76 positive place invariants in 12 ms returned sat
[2023-03-15 16:28:25] [INFO ] [Real]Absence check using 76 positive and 21 generalized place invariants in 19 ms returned sat
[2023-03-15 16:28:25] [INFO ] After 142ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 16:28:25] [INFO ] [Nat]Absence check using 76 positive place invariants in 13 ms returned sat
[2023-03-15 16:28:25] [INFO ] [Nat]Absence check using 76 positive and 21 generalized place invariants in 20 ms returned sat
[2023-03-15 16:28:27] [INFO ] After 1372ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 16:28:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 16:28:27] [INFO ] After 443ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-15 16:28:27] [INFO ] Deduced a trap composed of 163 places in 177 ms of which 0 ms to minimize.
[2023-03-15 16:28:28] [INFO ] Deduced a trap composed of 181 places in 182 ms of which 1 ms to minimize.
[2023-03-15 16:28:28] [INFO ] Deduced a trap composed of 172 places in 175 ms of which 0 ms to minimize.
[2023-03-15 16:28:28] [INFO ] Deduced a trap composed of 179 places in 179 ms of which 1 ms to minimize.
[2023-03-15 16:28:28] [INFO ] Deduced a trap composed of 160 places in 185 ms of which 1 ms to minimize.
[2023-03-15 16:28:29] [INFO ] Deduced a trap composed of 176 places in 171 ms of which 1 ms to minimize.
[2023-03-15 16:28:29] [INFO ] Deduced a trap composed of 163 places in 176 ms of which 0 ms to minimize.
[2023-03-15 16:28:29] [INFO ] Deduced a trap composed of 182 places in 176 ms of which 1 ms to minimize.
[2023-03-15 16:28:29] [INFO ] Deduced a trap composed of 168 places in 167 ms of which 1 ms to minimize.
[2023-03-15 16:28:29] [INFO ] Deduced a trap composed of 170 places in 170 ms of which 0 ms to minimize.
[2023-03-15 16:28:30] [INFO ] Deduced a trap composed of 170 places in 183 ms of which 0 ms to minimize.
[2023-03-15 16:28:30] [INFO ] Deduced a trap composed of 175 places in 184 ms of which 1 ms to minimize.
[2023-03-15 16:28:30] [INFO ] Deduced a trap composed of 169 places in 184 ms of which 1 ms to minimize.
[2023-03-15 16:28:30] [INFO ] Deduced a trap composed of 179 places in 174 ms of which 1 ms to minimize.
[2023-03-15 16:28:31] [INFO ] Deduced a trap composed of 160 places in 175 ms of which 1 ms to minimize.
[2023-03-15 16:28:31] [INFO ] Deduced a trap composed of 185 places in 171 ms of which 0 ms to minimize.
[2023-03-15 16:28:31] [INFO ] Deduced a trap composed of 169 places in 183 ms of which 0 ms to minimize.
[2023-03-15 16:28:31] [INFO ] Deduced a trap composed of 160 places in 162 ms of which 0 ms to minimize.
[2023-03-15 16:28:31] [INFO ] Deduced a trap composed of 163 places in 181 ms of which 1 ms to minimize.
[2023-03-15 16:28:32] [INFO ] Deduced a trap composed of 172 places in 211 ms of which 0 ms to minimize.
[2023-03-15 16:28:32] [INFO ] Deduced a trap composed of 173 places in 172 ms of which 1 ms to minimize.
[2023-03-15 16:28:32] [INFO ] Deduced a trap composed of 173 places in 166 ms of which 0 ms to minimize.
[2023-03-15 16:28:33] [INFO ] Deduced a trap composed of 163 places in 163 ms of which 1 ms to minimize.
[2023-03-15 16:28:33] [INFO ] Deduced a trap composed of 179 places in 179 ms of which 0 ms to minimize.
[2023-03-15 16:28:33] [INFO ] Deduced a trap composed of 178 places in 178 ms of which 0 ms to minimize.
[2023-03-15 16:28:34] [INFO ] Deduced a trap composed of 178 places in 169 ms of which 0 ms to minimize.
[2023-03-15 16:28:34] [INFO ] Deduced a trap composed of 181 places in 176 ms of which 0 ms to minimize.
[2023-03-15 16:28:34] [INFO ] Deduced a trap composed of 169 places in 169 ms of which 1 ms to minimize.
[2023-03-15 16:28:34] [INFO ] Deduced a trap composed of 179 places in 177 ms of which 0 ms to minimize.
[2023-03-15 16:28:34] [INFO ] Deduced a trap composed of 179 places in 207 ms of which 1 ms to minimize.
[2023-03-15 16:28:35] [INFO ] Deduced a trap composed of 163 places in 175 ms of which 0 ms to minimize.
[2023-03-15 16:28:35] [INFO ] Deduced a trap composed of 178 places in 171 ms of which 0 ms to minimize.
[2023-03-15 16:28:35] [INFO ] Deduced a trap composed of 173 places in 171 ms of which 1 ms to minimize.
[2023-03-15 16:28:35] [INFO ] Deduced a trap composed of 163 places in 212 ms of which 1 ms to minimize.
[2023-03-15 16:28:36] [INFO ] Deduced a trap composed of 166 places in 151 ms of which 0 ms to minimize.
[2023-03-15 16:28:36] [INFO ] Deduced a trap composed of 176 places in 156 ms of which 1 ms to minimize.
[2023-03-15 16:28:36] [INFO ] Deduced a trap composed of 163 places in 174 ms of which 1 ms to minimize.
[2023-03-15 16:28:36] [INFO ] Deduced a trap composed of 162 places in 161 ms of which 1 ms to minimize.
[2023-03-15 16:28:37] [INFO ] Deduced a trap composed of 155 places in 197 ms of which 1 ms to minimize.
[2023-03-15 16:28:37] [INFO ] Deduced a trap composed of 151 places in 223 ms of which 0 ms to minimize.
[2023-03-15 16:28:37] [INFO ] Deduced a trap composed of 175 places in 202 ms of which 0 ms to minimize.
[2023-03-15 16:28:38] [INFO ] Deduced a trap composed of 169 places in 163 ms of which 1 ms to minimize.
[2023-03-15 16:28:39] [INFO ] Deduced a trap composed of 178 places in 175 ms of which 0 ms to minimize.
[2023-03-15 16:28:40] [INFO ] Deduced a trap composed of 188 places in 181 ms of which 0 ms to minimize.
[2023-03-15 16:28:42] [INFO ] Deduced a trap composed of 175 places in 190 ms of which 0 ms to minimize.
[2023-03-15 16:28:50] [INFO ] Trap strengthening (SAT) tested/added 45/45 trap constraints in 23073 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-15 16:28:50] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 16:28:50] [INFO ] After 25024ms 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 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 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 15 ms. Remains 532 /532 variables (removed 0) and now considering 748/748 (removed 0) transitions.
[2023-03-15 16:28:50] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-15 16:28:50] [INFO ] Invariant cache hit.
[2023-03-15 16:28:51] [INFO ] Implicit Places using invariants in 683 ms returned []
[2023-03-15 16:28:51] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-15 16:28:51] [INFO ] Invariant cache hit.
[2023-03-15 16:28:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 16:29:01] [INFO ] Implicit Places using invariants and state equation in 9922 ms returned []
Implicit Place search using SMT with State Equation took 10630 ms to find 0 implicit places.
[2023-03-15 16:29:01] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-15 16:29:01] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-15 16:29:01] [INFO ] Invariant cache hit.
[2023-03-15 16:29:02] [INFO ] Dead Transitions using invariants and state equation in 568 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11261 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 1 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 64 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-15 16:29:02] [INFO ] Computed 97 place invariants in 9 ms
[2023-03-15 16:29:02] [INFO ] [Real]Absence check using 76 positive place invariants in 86 ms returned sat
[2023-03-15 16:29:02] [INFO ] [Real]Absence check using 76 positive and 21 generalized place invariants in 20 ms returned sat
[2023-03-15 16:29:02] [INFO ] After 619ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-15 16:29:02] [INFO ] [Nat]Absence check using 76 positive place invariants in 12 ms returned sat
[2023-03-15 16:29:02] [INFO ] [Nat]Absence check using 76 positive and 21 generalized place invariants in 19 ms returned sat
[2023-03-15 16:29:03] [INFO ] After 577ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-15 16:29:03] [INFO ] Deduced a trap composed of 173 places in 192 ms of which 1 ms to minimize.
[2023-03-15 16:29:03] [INFO ] Deduced a trap composed of 158 places in 179 ms of which 1 ms to minimize.
[2023-03-15 16:29:04] [INFO ] Deduced a trap composed of 164 places in 179 ms of which 0 ms to minimize.
[2023-03-15 16:29:04] [INFO ] Deduced a trap composed of 161 places in 171 ms of which 0 ms to minimize.
[2023-03-15 16:29:04] [INFO ] Deduced a trap composed of 176 places in 162 ms of which 0 ms to minimize.
[2023-03-15 16:29:04] [INFO ] Deduced a trap composed of 158 places in 181 ms of which 1 ms to minimize.
[2023-03-15 16:29:04] [INFO ] Deduced a trap composed of 170 places in 175 ms of which 0 ms to minimize.
[2023-03-15 16:29:05] [INFO ] Deduced a trap composed of 173 places in 194 ms of which 0 ms to minimize.
[2023-03-15 16:29:05] [INFO ] Deduced a trap composed of 155 places in 188 ms of which 0 ms to minimize.
[2023-03-15 16:29:05] [INFO ] Deduced a trap composed of 161 places in 195 ms of which 0 ms to minimize.
[2023-03-15 16:29:05] [INFO ] Deduced a trap composed of 164 places in 178 ms of which 1 ms to minimize.
[2023-03-15 16:29:06] [INFO ] Deduced a trap composed of 161 places in 201 ms of which 0 ms to minimize.
[2023-03-15 16:29:06] [INFO ] Deduced a trap composed of 173 places in 165 ms of which 1 ms to minimize.
[2023-03-15 16:29:06] [INFO ] Deduced a trap composed of 173 places in 182 ms of which 1 ms to minimize.
[2023-03-15 16:29:06] [INFO ] Deduced a trap composed of 173 places in 210 ms of which 0 ms to minimize.
[2023-03-15 16:29:07] [INFO ] Deduced a trap composed of 170 places in 175 ms of which 1 ms to minimize.
[2023-03-15 16:29:07] [INFO ] Deduced a trap composed of 149 places in 178 ms of which 0 ms to minimize.
[2023-03-15 16:29:07] [INFO ] Deduced a trap composed of 167 places in 174 ms of which 0 ms to minimize.
[2023-03-15 16:29:07] [INFO ] Deduced a trap composed of 164 places in 174 ms of which 1 ms to minimize.
[2023-03-15 16:29:08] [INFO ] Deduced a trap composed of 167 places in 179 ms of which 0 ms to minimize.
[2023-03-15 16:29:08] [INFO ] Deduced a trap composed of 176 places in 179 ms of which 0 ms to minimize.
[2023-03-15 16:29:08] [INFO ] Deduced a trap composed of 176 places in 162 ms of which 1 ms to minimize.
[2023-03-15 16:29:08] [INFO ] Deduced a trap composed of 176 places in 191 ms of which 1 ms to minimize.
[2023-03-15 16:29:08] [INFO ] Deduced a trap composed of 179 places in 174 ms of which 0 ms to minimize.
[2023-03-15 16:29:09] [INFO ] Deduced a trap composed of 176 places in 153 ms of which 0 ms to minimize.
[2023-03-15 16:29:09] [INFO ] Deduced a trap composed of 176 places in 161 ms of which 0 ms to minimize.
[2023-03-15 16:29:09] [INFO ] Deduced a trap composed of 173 places in 161 ms of which 1 ms to minimize.
[2023-03-15 16:29:09] [INFO ] Deduced a trap composed of 158 places in 194 ms of which 0 ms to minimize.
[2023-03-15 16:29:10] [INFO ] Deduced a trap composed of 152 places in 170 ms of which 1 ms to minimize.
[2023-03-15 16:29:10] [INFO ] Deduced a trap composed of 170 places in 181 ms of which 1 ms to minimize.
[2023-03-15 16:29:10] [INFO ] Deduced a trap composed of 158 places in 184 ms of which 0 ms to minimize.
[2023-03-15 16:29:10] [INFO ] Deduced a trap composed of 170 places in 220 ms of which 1 ms to minimize.
[2023-03-15 16:29:10] [INFO ] Deduced a trap composed of 176 places in 183 ms of which 1 ms to minimize.
[2023-03-15 16:29:11] [INFO ] Deduced a trap composed of 167 places in 167 ms of which 1 ms to minimize.
[2023-03-15 16:29:11] [INFO ] Deduced a trap composed of 182 places in 188 ms of which 1 ms to minimize.
[2023-03-15 16:29:12] [INFO ] Deduced a trap composed of 158 places in 195 ms of which 1 ms to minimize.
[2023-03-15 16:29:12] [INFO ] Deduced a trap composed of 161 places in 197 ms of which 0 ms to minimize.
[2023-03-15 16:29:14] [INFO ] Deduced a trap composed of 182 places in 216 ms of which 1 ms to minimize.
[2023-03-15 16:29:15] [INFO ] Deduced a trap composed of 172 places in 185 ms of which 0 ms to minimize.
[2023-03-15 16:29:15] [INFO ] Deduced a trap composed of 174 places in 165 ms of which 0 ms to minimize.
[2023-03-15 16:29:15] [INFO ] Deduced a trap composed of 176 places in 178 ms of which 0 ms to minimize.
[2023-03-15 16:29:16] [INFO ] Deduced a trap composed of 177 places in 177 ms of which 0 ms to minimize.
[2023-03-15 16:29:16] [INFO ] Deduced a trap composed of 169 places in 151 ms of which 0 ms to minimize.
[2023-03-15 16:29:16] [INFO ] Deduced a trap composed of 182 places in 162 ms of which 1 ms to minimize.
[2023-03-15 16:29:17] [INFO ] Deduced a trap composed of 170 places in 156 ms of which 1 ms to minimize.
[2023-03-15 16:29:17] [INFO ] Deduced a trap composed of 156 places in 187 ms of which 1 ms to minimize.
[2023-03-15 16:29:17] [INFO ] Deduced a trap composed of 153 places in 211 ms of which 1 ms to minimize.
[2023-03-15 16:29:18] [INFO ] Deduced a trap composed of 154 places in 151 ms of which 0 ms to minimize.
[2023-03-15 16:29:18] [INFO ] Deduced a trap composed of 192 places in 189 ms of which 1 ms to minimize.
[2023-03-15 16:29:19] [INFO ] Deduced a trap composed of 183 places in 161 ms of which 1 ms to minimize.
[2023-03-15 16:29:19] [INFO ] Deduced a trap composed of 164 places in 171 ms of which 0 ms to minimize.
[2023-03-15 16:29:19] [INFO ] Deduced a trap composed of 170 places in 156 ms of which 1 ms to minimize.
[2023-03-15 16:29:20] [INFO ] Deduced a trap composed of 158 places in 191 ms of which 0 ms to minimize.
[2023-03-15 16:29:20] [INFO ] Deduced a trap composed of 170 places in 163 ms of which 0 ms to minimize.
[2023-03-15 16:29:20] [INFO ] Deduced a trap composed of 164 places in 211 ms of which 0 ms to minimize.
[2023-03-15 16:29:20] [INFO ] Deduced a trap composed of 150 places in 177 ms of which 1 ms to minimize.
[2023-03-15 16:29:20] [INFO ] Deduced a trap composed of 179 places in 174 ms of which 1 ms to minimize.
[2023-03-15 16:29:21] [INFO ] Deduced a trap composed of 179 places in 168 ms of which 1 ms to minimize.
[2023-03-15 16:29:21] [INFO ] Deduced a trap composed of 158 places in 187 ms of which 0 ms to minimize.
[2023-03-15 16:29:21] [INFO ] Deduced a trap composed of 167 places in 172 ms of which 1 ms to minimize.
[2023-03-15 16:29:22] [INFO ] Deduced a trap composed of 176 places in 177 ms of which 1 ms to minimize.
[2023-03-15 16:29:22] [INFO ] Deduced a trap composed of 170 places in 222 ms of which 1 ms to minimize.
[2023-03-15 16:29:22] [INFO ] Deduced a trap composed of 158 places in 167 ms of which 1 ms to minimize.
[2023-03-15 16:29:22] [INFO ] Deduced a trap composed of 161 places in 186 ms of which 0 ms to minimize.
[2023-03-15 16:29:23] [INFO ] Deduced a trap composed of 170 places in 161 ms of which 0 ms to minimize.
[2023-03-15 16:29:23] [INFO ] Deduced a trap composed of 158 places in 167 ms of which 0 ms to minimize.
[2023-03-15 16:29:23] [INFO ] Deduced a trap composed of 164 places in 177 ms of which 0 ms to minimize.
[2023-03-15 16:29:23] [INFO ] Deduced a trap composed of 152 places in 160 ms of which 10 ms to minimize.
[2023-03-15 16:29:23] [INFO ] Deduced a trap composed of 164 places in 180 ms of which 0 ms to minimize.
[2023-03-15 16:29:24] [INFO ] Deduced a trap composed of 152 places in 179 ms of which 0 ms to minimize.
[2023-03-15 16:29:24] [INFO ] Deduced a trap composed of 170 places in 189 ms of which 0 ms to minimize.
[2023-03-15 16:29:25] [INFO ] Deduced a trap composed of 164 places in 166 ms of which 1 ms to minimize.
[2023-03-15 16:29:26] [INFO ] Deduced a trap composed of 173 places in 172 ms of which 1 ms to minimize.
[2023-03-15 16:29:26] [INFO ] Deduced a trap composed of 181 places in 173 ms of which 0 ms to minimize.
[2023-03-15 16:29:26] [INFO ] Deduced a trap composed of 170 places in 172 ms of which 1 ms to minimize.
[2023-03-15 16:29:28] [INFO ] Deduced a trap composed of 173 places in 157 ms of which 1 ms to minimize.
[2023-03-15 16:29:29] [INFO ] Deduced a trap composed of 165 places in 150 ms of which 0 ms to minimize.
[2023-03-15 16:29:29] [INFO ] Deduced a trap composed of 190 places in 182 ms of which 1 ms to minimize.
[2023-03-15 16:29:30] [INFO ] Deduced a trap composed of 158 places in 161 ms of which 0 ms to minimize.
[2023-03-15 16:29:31] [INFO ] Deduced a trap composed of 176 places in 156 ms of which 1 ms to minimize.
[2023-03-15 16:29:31] [INFO ] Deduced a trap composed of 170 places in 170 ms of which 0 ms to minimize.
[2023-03-15 16:29:40] [INFO ] Trap strengthening (SAT) tested/added 81/81 trap constraints in 37000 ms
[2023-03-15 16:29:41] [INFO ] Deduced a trap composed of 197 places in 152 ms of which 0 ms to minimize.
[2023-03-15 16:29:41] [INFO ] Deduced a trap composed of 164 places in 178 ms of which 1 ms to minimize.
[2023-03-15 16:29:41] [INFO ] Deduced a trap composed of 173 places in 189 ms of which 1 ms to minimize.
[2023-03-15 16:29:41] [INFO ] Deduced a trap composed of 173 places in 164 ms of which 1 ms to minimize.
[2023-03-15 16:29:42] [INFO ] Deduced a trap composed of 167 places in 161 ms of which 1 ms to minimize.
[2023-03-15 16:29:43] [INFO ] Deduced a trap composed of 170 places in 206 ms of which 0 ms to minimize.
[2023-03-15 16:29:44] [INFO ] Deduced a trap composed of 170 places in 171 ms of which 1 ms to minimize.
[2023-03-15 16:29:53] [INFO ] Trap strengthening (SAT) tested/added 7/7 trap constraints in 12363 ms
[2023-03-15 16:29:53] [INFO ] After 50455ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 16:29:53] [INFO ] After 50577ms 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 426 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 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 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 15 ms. Remains 532 /532 variables (removed 0) and now considering 748/748 (removed 0) transitions.
[2023-03-15 16:29:53] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
// Phase 1: matrix 744 rows 532 cols
[2023-03-15 16:29:53] [INFO ] Computed 97 place invariants in 8 ms
[2023-03-15 16:29:54] [INFO ] Dead Transitions using invariants and state equation in 863 ms found 0 transitions.
[2023-03-15 16:29:54] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-15 16:29:54] [INFO ] Invariant cache hit.
[2023-03-15 16:29:55] [INFO ] Implicit Places using invariants in 661 ms returned []
[2023-03-15 16:29:55] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-15 16:29:55] [INFO ] Invariant cache hit.
[2023-03-15 16:29:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 16:30:03] [INFO ] Implicit Places using invariants and state equation in 7660 ms returned []
Implicit Place search using SMT with State Equation took 8331 ms to find 0 implicit places.
[2023-03-15 16:30:03] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-15 16:30:03] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-15 16:30:03] [INFO ] Invariant cache hit.
[2023-03-15 16:30:03] [INFO ] Dead Transitions using invariants and state equation in 566 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9829 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 117 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 35 ms :[(NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
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 128 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 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Product exploration explored 100000 steps with 7178 reset in 368 ms.
Product exploration explored 100000 steps with 7251 reset in 370 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 16 ms. Remains 532 /532 variables (removed 0) and now considering 748/748 (removed 0) transitions.
[2023-03-15 16:30:04] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-15 16:30:04] [INFO ] Invariant cache hit.
[2023-03-15 16:30:05] [INFO ] Dead Transitions using invariants and state equation in 586 ms found 0 transitions.
[2023-03-15 16:30:05] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-15 16:30:05] [INFO ] Invariant cache hit.
[2023-03-15 16:30:06] [INFO ] Implicit Places using invariants in 663 ms returned []
[2023-03-15 16:30:06] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-15 16:30:06] [INFO ] Invariant cache hit.
[2023-03-15 16:30:06] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 16:30:14] [INFO ] Implicit Places using invariants and state equation in 8603 ms returned []
Implicit Place search using SMT with State Equation took 9292 ms to find 0 implicit places.
[2023-03-15 16:30:14] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-15 16:30:14] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-15 16:30:14] [INFO ] Invariant cache hit.
[2023-03-15 16:30:15] [INFO ] Dead Transitions using invariants and state equation in 708 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10631 ms. Remains : 532/532 places, 748/748 transitions.
Treatment of property PolyORBNT-PT-S05J40-LTLFireability-14 finished in 152122 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-15 16:30:15] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
// Phase 1: matrix 835 rows 623 cols
[2023-03-15 16:30:15] [INFO ] Computed 97 place invariants in 16 ms
[2023-03-15 16:30:16] [INFO ] Dead Transitions using invariants and state equation in 922 ms found 0 transitions.
[2023-03-15 16:30:16] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-15 16:30:16] [INFO ] Invariant cache hit.
[2023-03-15 16:30:17] [INFO ] Implicit Places using invariants in 694 ms returned []
[2023-03-15 16:30:17] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-15 16:30:17] [INFO ] Invariant cache hit.
[2023-03-15 16:30:17] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 16:30:26] [INFO ] Implicit Places using invariants and state equation in 9325 ms returned []
Implicit Place search using SMT with State Equation took 10050 ms to find 0 implicit places.
[2023-03-15 16:30:26] [INFO ] Flow matrix only has 835 transitions (discarded 4 similar events)
[2023-03-15 16:30:26] [INFO ] Invariant cache hit.
[2023-03-15 16:30:27] [INFO ] Dead Transitions using invariants and state equation in 893 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 11922 ms. Remains : 623/624 places, 839/840 transitions.
Stuttering acceptance computed with spot in 126 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 12063 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 100 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 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 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 59 ms. Remains 532 /624 variables (removed 92) and now considering 748/840 (removed 92) transitions.
[2023-03-15 16:30:27] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
// Phase 1: matrix 744 rows 532 cols
[2023-03-15 16:30:27] [INFO ] Computed 97 place invariants in 8 ms
[2023-03-15 16:30:28] [INFO ] Dead Transitions using invariants and state equation in 564 ms found 0 transitions.
[2023-03-15 16:30:28] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-15 16:30:28] [INFO ] Invariant cache hit.
[2023-03-15 16:30:29] [INFO ] Implicit Places using invariants in 635 ms returned []
[2023-03-15 16:30:29] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-15 16:30:29] [INFO ] Invariant cache hit.
[2023-03-15 16:30:29] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 16:30:36] [INFO ] Implicit Places using invariants and state equation in 7586 ms returned []
Implicit Place search using SMT with State Equation took 8244 ms to find 0 implicit places.
[2023-03-15 16:30:36] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-15 16:30:36] [INFO ] Invariant cache hit.
[2023-03-15 16:30:37] [INFO ] Dead Transitions using invariants and state equation in 575 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 9469 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 11450 reset in 1003 ms.
Product exploration explored 100000 steps with 11422 reset in 1025 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 242 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 99 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Finished random walk after 32 steps, including 2 resets, run visited all 2 properties in 1 ms. (steps per millisecond=32 )
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 202 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 120 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 98 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 10 ms. Remains 532 /532 variables (removed 0) and now considering 748/748 (removed 0) transitions.
[2023-03-15 16:30:40] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-15 16:30:40] [INFO ] Invariant cache hit.
[2023-03-15 16:30:40] [INFO ] Dead Transitions using invariants and state equation in 582 ms found 0 transitions.
[2023-03-15 16:30:40] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-15 16:30:40] [INFO ] Invariant cache hit.
[2023-03-15 16:30:41] [INFO ] Implicit Places using invariants in 611 ms returned []
[2023-03-15 16:30:41] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-15 16:30:41] [INFO ] Invariant cache hit.
[2023-03-15 16:30:41] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 16:30:49] [INFO ] Implicit Places using invariants and state equation in 7724 ms returned []
Implicit Place search using SMT with State Equation took 8338 ms to find 0 implicit places.
[2023-03-15 16:30:49] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-15 16:30:49] [INFO ] Invariant cache hit.
[2023-03-15 16:30:49] [INFO ] Dead Transitions using invariants and state equation in 577 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9550 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 199 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 90 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Finished random walk after 22 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=11 )
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 205 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 95 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 83 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 87 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 11358 reset in 1006 ms.
Product exploration explored 100000 steps with 11123 reset in 1034 ms.
Applying partial POR strategy [false, true, false]
Stuttering acceptance computed with spot in 96 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 15 ms. Remains 532 /532 variables (removed 0) and now considering 748/748 (removed 0) transitions.
[2023-03-15 16:30:52] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-15 16:30:52] [INFO ] Invariant cache hit.
[2023-03-15 16:30:53] [INFO ] Dead Transitions using invariants and state equation in 695 ms found 0 transitions.
[2023-03-15 16:30:53] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-15 16:30:53] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-15 16:30:53] [INFO ] Invariant cache hit.
[2023-03-15 16:30:54] [INFO ] Dead Transitions using invariants and state equation in 622 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1358 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 7 ms. Remains 532 /532 variables (removed 0) and now considering 748/748 (removed 0) transitions.
[2023-03-15 16:30:54] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-15 16:30:54] [INFO ] Invariant cache hit.
[2023-03-15 16:30:54] [INFO ] Dead Transitions using invariants and state equation in 613 ms found 0 transitions.
[2023-03-15 16:30:54] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-15 16:30:54] [INFO ] Invariant cache hit.
[2023-03-15 16:30:55] [INFO ] Implicit Places using invariants in 602 ms returned []
[2023-03-15 16:30:55] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-15 16:30:55] [INFO ] Invariant cache hit.
[2023-03-15 16:30:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 16:31:01] [INFO ] Implicit Places using invariants and state equation in 6624 ms returned []
Implicit Place search using SMT with State Equation took 7242 ms to find 0 implicit places.
[2023-03-15 16:31:01] [INFO ] Flow matrix only has 744 transitions (discarded 4 similar events)
[2023-03-15 16:31:01] [INFO ] Invariant cache hit.
[2023-03-15 16:31:02] [INFO ] Dead Transitions using invariants and state equation in 565 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8453 ms. Remains : 532/532 places, 748/748 transitions.
Treatment of property PolyORBNT-PT-S05J40-LTLFireability-00 finished in 34880 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-15 16:31:02] [INFO ] Flatten gal took : 65 ms
[2023-03-15 16:31:02] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-15 16:31:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 624 places, 840 transitions and 3994 arcs took 28 ms.
Total runtime 513110 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT PolyORBNT-PT-S05J40
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLFireability

BK_STOP 1678897934177

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

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1799 5/32 PolyORBNT-PT-S05J40-LTLFireability-00 409284 m, 81856 m/sec, 1105741 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/1799 10/32 PolyORBNT-PT-S05J40-LTLFireability-00 818323 m, 81807 m/sec, 2225539 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/1799 15/32 PolyORBNT-PT-S05J40-LTLFireability-00 1188094 m, 73954 m/sec, 3300445 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/1799 18/32 PolyORBNT-PT-S05J40-LTLFireability-00 1524471 m, 67275 m/sec, 4367077 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/1799 23/32 PolyORBNT-PT-S05J40-LTLFireability-00 1909228 m, 76951 m/sec, 5479502 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/1799 27/32 PolyORBNT-PT-S05J40-LTLFireability-00 2303380 m, 78830 m/sec, 6563097 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/1799 31/32 PolyORBNT-PT-S05J40-LTLFireability-00 2669468 m, 73217 m/sec, 7622650 t fired, .

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

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

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

Time elapsed: 41 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 4 (type EXCL) for 3 PolyORBNT-PT-S05J40-LTLFireability-14
lola: time limit : 3559 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/3559 7/32 PolyORBNT-PT-S05J40-LTLFireability-14 486905 m, 97381 m/sec, 1277916 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/3559 12/32 PolyORBNT-PT-S05J40-LTLFireability-14 925662 m, 87751 m/sec, 2521519 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/3559 17/32 PolyORBNT-PT-S05J40-LTLFireability-14 1316883 m, 78244 m/sec, 3683257 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/3559 23/32 PolyORBNT-PT-S05J40-LTLFireability-14 1787604 m, 94144 m/sec, 4923552 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/3559 28/32 PolyORBNT-PT-S05J40-LTLFireability-14 2211407 m, 84760 m/sec, 6126136 t fired, .

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

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

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
PolyORBNT-PT-S05J40-LTLFireability-00: LTL unknown AGGR
PolyORBNT-PT-S05J40-LTLFireability-14: LTL unknown AGGR


Time elapsed: 71 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBNT-PT-S05J40"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is PolyORBNT-PT-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 r295-tall-167873948300732"
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 ;