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-167873948300764.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-S10J30, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r295-tall-167873948300764
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 20M
-rw-r--r-- 1 mcc users 20K Feb 26 00:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 26 00:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 973K Feb 26 00:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 3.4M Feb 26 00:35 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 14K Feb 25 16:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 98K Feb 25 16:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 306K Feb 25 16:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 50K Feb 26 01:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 245K Feb 26 01:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 343K Feb 26 01:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 1.4M Feb 26 01:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:36 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.2K Feb 25 16:36 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 14M Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678904262165

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-S10J30
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 18:17:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 18:17:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 18:17:44] [INFO ] Load time of PNML (sax parser for PT used): 587 ms
[2023-03-15 18:17:44] [INFO ] Transformed 664 places.
[2023-03-15 18:17:44] [INFO ] Transformed 12050 transitions.
[2023-03-15 18:17:44] [INFO ] Parsed PT model containing 664 places and 12050 transitions and 112559 arcs in 726 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
[2023-03-15 18:17:44] [INFO ] Reduced 45 identical enabling conditions.
[2023-03-15 18:17:44] [INFO ] Reduced 45 identical enabling conditions.
[2023-03-15 18:17:44] [INFO ] Reduced 780 identical enabling conditions.
[2023-03-15 18:17:44] [INFO ] Reduced 780 identical enabling conditions.
[2023-03-15 18:17:44] [INFO ] Reduced 780 identical enabling conditions.
Ensure Unique test removed 10110 transitions
Reduce redundant transitions removed 10110 transitions.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 500 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1940/1940 transitions.
Applied a total of 0 rules in 81 ms. Remains 664 /664 variables (removed 0) and now considering 1940/1940 (removed 0) transitions.
[2023-03-15 18:17:44] [INFO ] Flow matrix only has 1931 transitions (discarded 9 similar events)
// Phase 1: matrix 1931 rows 664 cols
[2023-03-15 18:17:44] [INFO ] Computed 92 place invariants in 126 ms
[2023-03-15 18:17:46] [INFO ] Dead Transitions using invariants and state equation in 1680 ms found 615 transitions.
Found 615 dead transitions using SMT.
Drop transitions removed 615 transitions
Dead transitions reduction (with SMT) triggered by suspicious arc values removed 615 transitions.
[2023-03-15 18:17:46] [INFO ] Flow matrix only has 1316 transitions (discarded 9 similar events)
// Phase 1: matrix 1316 rows 664 cols
[2023-03-15 18:17:46] [INFO ] Computed 92 place invariants in 56 ms
[2023-03-15 18:17:46] [INFO ] Implicit Places using invariants in 235 ms returned []
[2023-03-15 18:17:46] [INFO ] Flow matrix only has 1316 transitions (discarded 9 similar events)
[2023-03-15 18:17:46] [INFO ] Invariant cache hit.
[2023-03-15 18:17:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 18:17:47] [INFO ] Implicit Places using invariants and state equation in 1110 ms returned []
Implicit Place search using SMT with State Equation took 1348 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 664/664 places, 1325/1940 transitions.
Applied a total of 0 rules in 26 ms. Remains 664 /664 variables (removed 0) and now considering 1325/1325 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3171 ms. Remains : 664/664 places, 1325/1940 transitions.
Support contains 500 out of 664 places after structural reductions.
[2023-03-15 18:17:48] [INFO ] Flatten gal took : 227 ms
[2023-03-15 18:17:48] [INFO ] Flatten gal took : 126 ms
[2023-03-15 18:17:48] [INFO ] Input system was already deterministic with 1325 transitions.
Support contains 497 out of 664 places (down from 500) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 560 resets, run finished after 867 ms. (steps per millisecond=11 ) properties (out of 29) seen :5
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 49 ms. (steps per millisecond=20 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 24) seen :13
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 1001 steps, including 3 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 1001 steps, including 10 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 7) seen :2
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-15 18:17:49] [INFO ] Flow matrix only has 1316 transitions (discarded 9 similar events)
[2023-03-15 18:17:49] [INFO ] Invariant cache hit.
[2023-03-15 18:17:50] [INFO ] [Real]Absence check using 62 positive place invariants in 22 ms returned sat
[2023-03-15 18:17:50] [INFO ] [Real]Absence check using 62 positive and 30 generalized place invariants in 34 ms returned sat
[2023-03-15 18:17:51] [INFO ] After 1943ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:2
[2023-03-15 18:17:52] [INFO ] [Nat]Absence check using 62 positive place invariants in 13 ms returned sat
[2023-03-15 18:17:52] [INFO ] [Nat]Absence check using 62 positive and 30 generalized place invariants in 31 ms returned sat
[2023-03-15 18:17:53] [INFO ] After 1892ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :2
[2023-03-15 18:17:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 18:17:54] [INFO ] After 260ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :3 sat :2
[2023-03-15 18:17:54] [INFO ] Deduced a trap composed of 313 places in 326 ms of which 4 ms to minimize.
[2023-03-15 18:17:55] [INFO ] Deduced a trap composed of 305 places in 332 ms of which 1 ms to minimize.
[2023-03-15 18:17:55] [INFO ] Deduced a trap composed of 318 places in 316 ms of which 1 ms to minimize.
[2023-03-15 18:17:55] [INFO ] Deduced a trap composed of 319 places in 345 ms of which 2 ms to minimize.
[2023-03-15 18:17:56] [INFO ] Deduced a trap composed of 299 places in 326 ms of which 2 ms to minimize.
[2023-03-15 18:17:56] [INFO ] Deduced a trap composed of 313 places in 312 ms of which 1 ms to minimize.
[2023-03-15 18:17:56] [INFO ] Deduced a trap composed of 301 places in 312 ms of which 1 ms to minimize.
[2023-03-15 18:17:57] [INFO ] Deduced a trap composed of 307 places in 317 ms of which 1 ms to minimize.
[2023-03-15 18:17:57] [INFO ] Deduced a trap composed of 317 places in 319 ms of which 0 ms to minimize.
[2023-03-15 18:17:58] [INFO ] Deduced a trap composed of 308 places in 319 ms of which 0 ms to minimize.
[2023-03-15 18:17:58] [INFO ] Deduced a trap composed of 311 places in 322 ms of which 0 ms to minimize.
[2023-03-15 18:17:58] [INFO ] Deduced a trap composed of 315 places in 312 ms of which 2 ms to minimize.
[2023-03-15 18:17:59] [INFO ] Deduced a trap composed of 311 places in 306 ms of which 1 ms to minimize.
[2023-03-15 18:17:59] [INFO ] Deduced a trap composed of 307 places in 299 ms of which 0 ms to minimize.
[2023-03-15 18:17:59] [INFO ] Deduced a trap composed of 311 places in 295 ms of which 1 ms to minimize.
[2023-03-15 18:18:00] [INFO ] Deduced a trap composed of 299 places in 303 ms of which 1 ms to minimize.
[2023-03-15 18:18:00] [INFO ] Deduced a trap composed of 307 places in 297 ms of which 0 ms to minimize.
[2023-03-15 18:18:01] [INFO ] Deduced a trap composed of 309 places in 317 ms of which 1 ms to minimize.
[2023-03-15 18:18:01] [INFO ] Deduced a trap composed of 309 places in 329 ms of which 0 ms to minimize.
[2023-03-15 18:18:01] [INFO ] Deduced a trap composed of 315 places in 299 ms of which 1 ms to minimize.
[2023-03-15 18:18:02] [INFO ] Deduced a trap composed of 311 places in 285 ms of which 0 ms to minimize.
[2023-03-15 18:18:02] [INFO ] Deduced a trap composed of 307 places in 300 ms of which 3 ms to minimize.
[2023-03-15 18:18:02] [INFO ] Deduced a trap composed of 309 places in 301 ms of which 0 ms to minimize.
[2023-03-15 18:18:03] [INFO ] Deduced a trap composed of 309 places in 296 ms of which 1 ms to minimize.
[2023-03-15 18:18:03] [INFO ] Deduced a trap composed of 297 places in 297 ms of which 0 ms to minimize.
[2023-03-15 18:18:03] [INFO ] Deduced a trap composed of 304 places in 293 ms of which 0 ms to minimize.
[2023-03-15 18:18:04] [INFO ] Deduced a trap composed of 305 places in 301 ms of which 1 ms to minimize.
[2023-03-15 18:18:04] [INFO ] Deduced a trap composed of 299 places in 299 ms of which 0 ms to minimize.
[2023-03-15 18:18:04] [INFO ] Deduced a trap composed of 310 places in 308 ms of which 1 ms to minimize.
[2023-03-15 18:18:05] [INFO ] Deduced a trap composed of 309 places in 317 ms of which 1 ms to minimize.
[2023-03-15 18:18:05] [INFO ] Deduced a trap composed of 301 places in 314 ms of which 0 ms to minimize.
[2023-03-15 18:18:06] [INFO ] Deduced a trap composed of 305 places in 296 ms of which 1 ms to minimize.
[2023-03-15 18:18:06] [INFO ] Deduced a trap composed of 311 places in 309 ms of which 0 ms to minimize.
[2023-03-15 18:18:07] [INFO ] Deduced a trap composed of 307 places in 316 ms of which 1 ms to minimize.
[2023-03-15 18:18:07] [INFO ] Deduced a trap composed of 305 places in 322 ms of which 6 ms to minimize.
[2023-03-15 18:18:08] [INFO ] Deduced a trap composed of 307 places in 329 ms of which 1 ms to minimize.
[2023-03-15 18:18:08] [INFO ] Deduced a trap composed of 301 places in 321 ms of which 2 ms to minimize.
[2023-03-15 18:18:11] [INFO ] Deduced a trap composed of 309 places in 304 ms of which 1 ms to minimize.
[2023-03-15 18:18:11] [INFO ] Deduced a trap composed of 313 places in 314 ms of which 0 ms to minimize.
[2023-03-15 18:18:11] [INFO ] Deduced a trap composed of 299 places in 313 ms of which 1 ms to minimize.
[2023-03-15 18:18:12] [INFO ] Deduced a trap composed of 307 places in 321 ms of which 1 ms to minimize.
[2023-03-15 18:18:12] [INFO ] Deduced a trap composed of 309 places in 316 ms of which 0 ms to minimize.
[2023-03-15 18:18:12] [INFO ] Deduced a trap composed of 299 places in 320 ms of which 0 ms to minimize.
[2023-03-15 18:18:13] [INFO ] Deduced a trap composed of 307 places in 317 ms of which 0 ms to minimize.
[2023-03-15 18:18:13] [INFO ] Deduced a trap composed of 317 places in 316 ms of which 1 ms to minimize.
[2023-03-15 18:18:14] [INFO ] Deduced a trap composed of 313 places in 307 ms of which 0 ms to minimize.
[2023-03-15 18:18:14] [INFO ] Deduced a trap composed of 309 places in 317 ms of which 0 ms to minimize.
[2023-03-15 18:18:14] [INFO ] Deduced a trap composed of 307 places in 314 ms of which 0 ms to minimize.
[2023-03-15 18:18:15] [INFO ] Deduced a trap composed of 309 places in 298 ms of which 0 ms to minimize.
[2023-03-15 18:18:15] [INFO ] Deduced a trap composed of 309 places in 295 ms of which 1 ms to minimize.
[2023-03-15 18:18:16] [INFO ] Deduced a trap composed of 311 places in 323 ms of which 2 ms to minimize.
[2023-03-15 18:18:16] [INFO ] Deduced a trap composed of 315 places in 320 ms of which 1 ms to minimize.
[2023-03-15 18:18:16] [INFO ] Deduced a trap composed of 311 places in 316 ms of which 1 ms to minimize.
[2023-03-15 18:18:17] [INFO ] Deduced a trap composed of 320 places in 308 ms of which 1 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 18:18:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 18:18:17] [INFO ] After 25197ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :0 real:2
Fused 5 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 11 ms.
Support contains 4 out of 664 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 46 rules applied. Total rules applied 46 place count 654 transition count 1289
Reduce places removed 36 places and 0 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 82 place count 618 transition count 1289
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 82 place count 618 transition count 1254
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 152 place count 583 transition count 1254
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 153 place count 582 transition count 1253
Iterating global reduction 2 with 1 rules applied. Total rules applied 154 place count 582 transition count 1253
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 158 place count 580 transition count 1251
Applied a total of 158 rules in 216 ms. Remains 580 /664 variables (removed 84) and now considering 1251/1325 (removed 74) transitions.
[2023-03-15 18:18:17] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
// Phase 1: matrix 1242 rows 580 cols
[2023-03-15 18:18:17] [INFO ] Computed 82 place invariants in 18 ms
[2023-03-15 18:18:17] [INFO ] Dead Transitions using invariants and state equation in 618 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 836 ms. Remains : 580/664 places, 1251/1325 transitions.
Incomplete random walk after 10000 steps, including 738 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 61 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 18:18:18] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-15 18:18:18] [INFO ] Invariant cache hit.
[2023-03-15 18:18:18] [INFO ] [Real]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-15 18:18:18] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 22 ms returned sat
[2023-03-15 18:18:18] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 18:18:18] [INFO ] [Nat]Absence check using 63 positive place invariants in 11 ms returned sat
[2023-03-15 18:18:18] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 22 ms returned sat
[2023-03-15 18:18:19] [INFO ] After 931ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 18:18:19] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 18:18:19] [INFO ] After 121ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 18:18:19] [INFO ] Deduced a trap composed of 228 places in 293 ms of which 0 ms to minimize.
[2023-03-15 18:18:20] [INFO ] Deduced a trap composed of 232 places in 299 ms of which 0 ms to minimize.
[2023-03-15 18:18:20] [INFO ] Deduced a trap composed of 241 places in 300 ms of which 2 ms to minimize.
[2023-03-15 18:18:20] [INFO ] Deduced a trap composed of 240 places in 295 ms of which 0 ms to minimize.
[2023-03-15 18:18:21] [INFO ] Deduced a trap composed of 238 places in 300 ms of which 1 ms to minimize.
[2023-03-15 18:18:21] [INFO ] Deduced a trap composed of 232 places in 294 ms of which 1 ms to minimize.
[2023-03-15 18:18:21] [INFO ] Deduced a trap composed of 232 places in 294 ms of which 1 ms to minimize.
[2023-03-15 18:18:22] [INFO ] Deduced a trap composed of 229 places in 289 ms of which 1 ms to minimize.
[2023-03-15 18:18:22] [INFO ] Deduced a trap composed of 228 places in 303 ms of which 0 ms to minimize.
[2023-03-15 18:18:22] [INFO ] Deduced a trap composed of 233 places in 276 ms of which 1 ms to minimize.
[2023-03-15 18:18:23] [INFO ] Deduced a trap composed of 236 places in 268 ms of which 1 ms to minimize.
[2023-03-15 18:18:23] [INFO ] Deduced a trap composed of 230 places in 268 ms of which 0 ms to minimize.
[2023-03-15 18:18:23] [INFO ] Deduced a trap composed of 237 places in 290 ms of which 2 ms to minimize.
[2023-03-15 18:18:24] [INFO ] Deduced a trap composed of 231 places in 296 ms of which 1 ms to minimize.
[2023-03-15 18:18:24] [INFO ] Deduced a trap composed of 241 places in 268 ms of which 1 ms to minimize.
[2023-03-15 18:18:25] [INFO ] Deduced a trap composed of 241 places in 273 ms of which 1 ms to minimize.
[2023-03-15 18:18:25] [INFO ] Deduced a trap composed of 233 places in 287 ms of which 1 ms to minimize.
[2023-03-15 18:18:25] [INFO ] Deduced a trap composed of 244 places in 294 ms of which 1 ms to minimize.
[2023-03-15 18:18:26] [INFO ] Deduced a trap composed of 239 places in 300 ms of which 1 ms to minimize.
[2023-03-15 18:18:26] [INFO ] Deduced a trap composed of 230 places in 269 ms of which 1 ms to minimize.
[2023-03-15 18:18:27] [INFO ] Deduced a trap composed of 232 places in 288 ms of which 0 ms to minimize.
[2023-03-15 18:18:27] [INFO ] Deduced a trap composed of 224 places in 301 ms of which 1 ms to minimize.
[2023-03-15 18:18:27] [INFO ] Deduced a trap composed of 218 places in 281 ms of which 1 ms to minimize.
[2023-03-15 18:18:28] [INFO ] Deduced a trap composed of 222 places in 282 ms of which 0 ms to minimize.
[2023-03-15 18:18:28] [INFO ] Deduced a trap composed of 230 places in 292 ms of which 0 ms to minimize.
[2023-03-15 18:18:28] [INFO ] Deduced a trap composed of 230 places in 286 ms of which 0 ms to minimize.
[2023-03-15 18:18:29] [INFO ] Deduced a trap composed of 222 places in 301 ms of which 1 ms to minimize.
[2023-03-15 18:18:29] [INFO ] Deduced a trap composed of 226 places in 274 ms of which 1 ms to minimize.
[2023-03-15 18:18:29] [INFO ] Deduced a trap composed of 241 places in 287 ms of which 1 ms to minimize.
[2023-03-15 18:18:30] [INFO ] Deduced a trap composed of 230 places in 290 ms of which 1 ms to minimize.
[2023-03-15 18:18:30] [INFO ] Deduced a trap composed of 224 places in 298 ms of which 0 ms to minimize.
[2023-03-15 18:18:31] [INFO ] Deduced a trap composed of 239 places in 284 ms of which 0 ms to minimize.
[2023-03-15 18:18:31] [INFO ] Deduced a trap composed of 226 places in 284 ms of which 1 ms to minimize.
[2023-03-15 18:18:32] [INFO ] Deduced a trap composed of 224 places in 253 ms of which 0 ms to minimize.
[2023-03-15 18:18:32] [INFO ] Deduced a trap composed of 239 places in 274 ms of which 1 ms to minimize.
[2023-03-15 18:18:33] [INFO ] Deduced a trap composed of 228 places in 290 ms of which 1 ms to minimize.
[2023-03-15 18:18:33] [INFO ] Deduced a trap composed of 237 places in 286 ms of which 0 ms to minimize.
[2023-03-15 18:18:34] [INFO ] Deduced a trap composed of 239 places in 293 ms of which 1 ms to minimize.
[2023-03-15 18:18:34] [INFO ] Deduced a trap composed of 232 places in 290 ms of which 0 ms to minimize.
[2023-03-15 18:18:34] [INFO ] Deduced a trap composed of 245 places in 300 ms of which 1 ms to minimize.
[2023-03-15 18:18:35] [INFO ] Deduced a trap composed of 228 places in 272 ms of which 1 ms to minimize.
[2023-03-15 18:18:35] [INFO ] Deduced a trap composed of 228 places in 277 ms of which 0 ms to minimize.
[2023-03-15 18:18:35] [INFO ] Deduced a trap composed of 222 places in 259 ms of which 1 ms to minimize.
[2023-03-15 18:18:36] [INFO ] Deduced a trap composed of 224 places in 255 ms of which 0 ms to minimize.
[2023-03-15 18:18:36] [INFO ] Deduced a trap composed of 241 places in 299 ms of which 0 ms to minimize.
[2023-03-15 18:18:37] [INFO ] Deduced a trap composed of 228 places in 291 ms of which 1 ms to minimize.
[2023-03-15 18:18:37] [INFO ] Deduced a trap composed of 226 places in 287 ms of which 1 ms to minimize.
[2023-03-15 18:18:37] [INFO ] Deduced a trap composed of 232 places in 289 ms of which 1 ms to minimize.
[2023-03-15 18:18:38] [INFO ] Deduced a trap composed of 240 places in 294 ms of which 1 ms to minimize.
[2023-03-15 18:18:38] [INFO ] Deduced a trap composed of 230 places in 285 ms of which 0 ms to minimize.
[2023-03-15 18:18:39] [INFO ] Deduced a trap composed of 230 places in 287 ms of which 1 ms to minimize.
[2023-03-15 18:18:41] [INFO ] Deduced a trap composed of 232 places in 284 ms of which 1 ms to minimize.
[2023-03-15 18:18:41] [INFO ] Deduced a trap composed of 232 places in 270 ms of which 0 ms to minimize.
[2023-03-15 18:18:42] [INFO ] Deduced a trap composed of 237 places in 265 ms of which 1 ms to minimize.
[2023-03-15 18:18:42] [INFO ] Deduced a trap composed of 236 places in 261 ms of which 1 ms to minimize.
[2023-03-15 18:18:42] [INFO ] Deduced a trap composed of 234 places in 280 ms of which 0 ms to minimize.
[2023-03-15 18:18:43] [INFO ] Deduced a trap composed of 244 places in 278 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 18:18:43] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 18:18:43] [INFO ] After 25075ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 51 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 51 ms. Remains : 580/580 places, 1251/1251 transitions.
Incomplete random walk after 10000 steps, including 732 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 289879 steps, run timeout after 3001 ms. (steps per millisecond=96 ) properties seen :{}
Probabilistic random walk after 289879 steps, saw 47507 distinct states, run finished after 3004 ms. (steps per millisecond=96 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 18:18:46] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-15 18:18:46] [INFO ] Invariant cache hit.
[2023-03-15 18:18:46] [INFO ] [Real]Absence check using 63 positive place invariants in 21 ms returned sat
[2023-03-15 18:18:46] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 40 ms returned sat
[2023-03-15 18:18:46] [INFO ] After 178ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 18:18:46] [INFO ] [Nat]Absence check using 63 positive place invariants in 25 ms returned sat
[2023-03-15 18:18:46] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 22 ms returned sat
[2023-03-15 18:18:47] [INFO ] After 895ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 18:18:47] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 18:18:47] [INFO ] After 127ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 18:18:48] [INFO ] Deduced a trap composed of 228 places in 316 ms of which 1 ms to minimize.
[2023-03-15 18:18:48] [INFO ] Deduced a trap composed of 232 places in 274 ms of which 1 ms to minimize.
[2023-03-15 18:18:48] [INFO ] Deduced a trap composed of 241 places in 285 ms of which 1 ms to minimize.
[2023-03-15 18:18:49] [INFO ] Deduced a trap composed of 240 places in 297 ms of which 0 ms to minimize.
[2023-03-15 18:18:49] [INFO ] Deduced a trap composed of 238 places in 322 ms of which 1 ms to minimize.
[2023-03-15 18:18:49] [INFO ] Deduced a trap composed of 232 places in 284 ms of which 0 ms to minimize.
[2023-03-15 18:18:50] [INFO ] Deduced a trap composed of 232 places in 292 ms of which 1 ms to minimize.
[2023-03-15 18:18:50] [INFO ] Deduced a trap composed of 229 places in 298 ms of which 0 ms to minimize.
[2023-03-15 18:18:50] [INFO ] Deduced a trap composed of 228 places in 325 ms of which 1 ms to minimize.
[2023-03-15 18:18:51] [INFO ] Deduced a trap composed of 233 places in 280 ms of which 1 ms to minimize.
[2023-03-15 18:18:51] [INFO ] Deduced a trap composed of 236 places in 299 ms of which 0 ms to minimize.
[2023-03-15 18:18:52] [INFO ] Deduced a trap composed of 230 places in 303 ms of which 1 ms to minimize.
[2023-03-15 18:18:52] [INFO ] Deduced a trap composed of 237 places in 304 ms of which 1 ms to minimize.
[2023-03-15 18:18:52] [INFO ] Deduced a trap composed of 231 places in 282 ms of which 1 ms to minimize.
[2023-03-15 18:18:53] [INFO ] Deduced a trap composed of 241 places in 267 ms of which 1 ms to minimize.
[2023-03-15 18:18:53] [INFO ] Deduced a trap composed of 241 places in 280 ms of which 1 ms to minimize.
[2023-03-15 18:18:53] [INFO ] Deduced a trap composed of 233 places in 287 ms of which 0 ms to minimize.
[2023-03-15 18:18:54] [INFO ] Deduced a trap composed of 244 places in 294 ms of which 1 ms to minimize.
[2023-03-15 18:18:54] [INFO ] Deduced a trap composed of 239 places in 284 ms of which 1 ms to minimize.
[2023-03-15 18:18:55] [INFO ] Deduced a trap composed of 230 places in 299 ms of which 1 ms to minimize.
[2023-03-15 18:18:55] [INFO ] Deduced a trap composed of 232 places in 285 ms of which 1 ms to minimize.
[2023-03-15 18:18:56] [INFO ] Deduced a trap composed of 224 places in 302 ms of which 1 ms to minimize.
[2023-03-15 18:18:56] [INFO ] Deduced a trap composed of 218 places in 319 ms of which 1 ms to minimize.
[2023-03-15 18:18:56] [INFO ] Deduced a trap composed of 222 places in 289 ms of which 1 ms to minimize.
[2023-03-15 18:18:57] [INFO ] Deduced a trap composed of 230 places in 284 ms of which 0 ms to minimize.
[2023-03-15 18:18:57] [INFO ] Deduced a trap composed of 230 places in 280 ms of which 1 ms to minimize.
[2023-03-15 18:18:57] [INFO ] Deduced a trap composed of 222 places in 289 ms of which 0 ms to minimize.
[2023-03-15 18:18:58] [INFO ] Deduced a trap composed of 226 places in 284 ms of which 0 ms to minimize.
[2023-03-15 18:18:58] [INFO ] Deduced a trap composed of 241 places in 285 ms of which 1 ms to minimize.
[2023-03-15 18:18:58] [INFO ] Deduced a trap composed of 230 places in 289 ms of which 0 ms to minimize.
[2023-03-15 18:18:59] [INFO ] Deduced a trap composed of 224 places in 285 ms of which 1 ms to minimize.
[2023-03-15 18:18:59] [INFO ] Deduced a trap composed of 239 places in 284 ms of which 2 ms to minimize.
[2023-03-15 18:18:59] [INFO ] Deduced a trap composed of 226 places in 278 ms of which 0 ms to minimize.
[2023-03-15 18:19:00] [INFO ] Deduced a trap composed of 224 places in 265 ms of which 0 ms to minimize.
[2023-03-15 18:19:00] [INFO ] Deduced a trap composed of 239 places in 288 ms of which 0 ms to minimize.
[2023-03-15 18:19:01] [INFO ] Deduced a trap composed of 228 places in 291 ms of which 1 ms to minimize.
[2023-03-15 18:19:02] [INFO ] Deduced a trap composed of 237 places in 281 ms of which 0 ms to minimize.
[2023-03-15 18:19:02] [INFO ] Deduced a trap composed of 239 places in 290 ms of which 0 ms to minimize.
[2023-03-15 18:19:02] [INFO ] Deduced a trap composed of 232 places in 290 ms of which 1 ms to minimize.
[2023-03-15 18:19:03] [INFO ] Deduced a trap composed of 245 places in 268 ms of which 1 ms to minimize.
[2023-03-15 18:19:03] [INFO ] Deduced a trap composed of 228 places in 303 ms of which 0 ms to minimize.
[2023-03-15 18:19:03] [INFO ] Deduced a trap composed of 228 places in 271 ms of which 0 ms to minimize.
[2023-03-15 18:19:04] [INFO ] Deduced a trap composed of 222 places in 290 ms of which 0 ms to minimize.
[2023-03-15 18:19:04] [INFO ] Deduced a trap composed of 224 places in 290 ms of which 1 ms to minimize.
[2023-03-15 18:19:05] [INFO ] Deduced a trap composed of 241 places in 289 ms of which 0 ms to minimize.
[2023-03-15 18:19:05] [INFO ] Deduced a trap composed of 228 places in 268 ms of which 0 ms to minimize.
[2023-03-15 18:19:05] [INFO ] Deduced a trap composed of 226 places in 289 ms of which 0 ms to minimize.
[2023-03-15 18:19:06] [INFO ] Deduced a trap composed of 232 places in 307 ms of which 0 ms to minimize.
[2023-03-15 18:19:06] [INFO ] Deduced a trap composed of 240 places in 267 ms of which 0 ms to minimize.
[2023-03-15 18:19:07] [INFO ] Deduced a trap composed of 230 places in 289 ms of which 1 ms to minimize.
[2023-03-15 18:19:07] [INFO ] Deduced a trap composed of 230 places in 274 ms of which 0 ms to minimize.
[2023-03-15 18:19:09] [INFO ] Deduced a trap composed of 232 places in 270 ms of which 0 ms to minimize.
[2023-03-15 18:19:10] [INFO ] Deduced a trap composed of 232 places in 356 ms of which 1 ms to minimize.
[2023-03-15 18:19:10] [INFO ] Deduced a trap composed of 237 places in 279 ms of which 0 ms to minimize.
[2023-03-15 18:19:11] [INFO ] Deduced a trap composed of 236 places in 280 ms of which 1 ms to minimize.
[2023-03-15 18:19:11] [INFO ] Deduced a trap composed of 234 places in 275 ms of which 0 ms to minimize.
[2023-03-15 18:19:11] [INFO ] Deduced a trap composed of 244 places in 317 ms of which 0 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 18:19:11] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 18:19:11] [INFO ] After 25174ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:1
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 39 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 580/580 places, 1251/1251 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 580/580 places, 1251/1251 transitions.
Applied a total of 0 rules in 78 ms. Remains 580 /580 variables (removed 0) and now considering 1251/1251 (removed 0) transitions.
[2023-03-15 18:19:11] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-15 18:19:11] [INFO ] Invariant cache hit.
[2023-03-15 18:19:12] [INFO ] Implicit Places using invariants in 706 ms returned []
[2023-03-15 18:19:12] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-15 18:19:12] [INFO ] Invariant cache hit.
[2023-03-15 18:19:13] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 18:19:20] [INFO ] Implicit Places using invariants and state equation in 8011 ms returned []
Implicit Place search using SMT with State Equation took 8734 ms to find 0 implicit places.
[2023-03-15 18:19:20] [INFO ] Redundant transitions in 78 ms returned []
[2023-03-15 18:19:20] [INFO ] Flow matrix only has 1242 transitions (discarded 9 similar events)
[2023-03-15 18:19:20] [INFO ] Invariant cache hit.
[2023-03-15 18:19:21] [INFO ] Dead Transitions using invariants and state equation in 701 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9601 ms. Remains : 580/580 places, 1251/1251 transitions.
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 580 transition count 1242
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 9 place count 580 transition count 1241
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 579 transition count 1241
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 579 transition count 1240
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 13 place count 578 transition count 1240
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 2 with 10 rules applied. Total rules applied 23 place count 578 transition count 1230
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 33 place count 568 transition count 1230
Applied a total of 33 rules in 223 ms. Remains 568 /580 variables (removed 12) and now considering 1230/1251 (removed 21) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1230 rows 568 cols
[2023-03-15 18:19:21] [INFO ] Computed 82 place invariants in 14 ms
[2023-03-15 18:19:22] [INFO ] [Real]Absence check using 62 positive place invariants in 156 ms returned sat
[2023-03-15 18:19:22] [INFO ] [Real]Absence check using 62 positive and 20 generalized place invariants in 23 ms returned sat
[2023-03-15 18:19:22] [INFO ] After 355ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 18:19:22] [INFO ] [Nat]Absence check using 62 positive place invariants in 12 ms returned sat
[2023-03-15 18:19:22] [INFO ] [Nat]Absence check using 62 positive and 20 generalized place invariants in 27 ms returned sat
[2023-03-15 18:19:22] [INFO ] After 642ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 18:19:23] [INFO ] Deduced a trap composed of 226 places in 266 ms of which 0 ms to minimize.
[2023-03-15 18:19:23] [INFO ] Deduced a trap composed of 222 places in 250 ms of which 1 ms to minimize.
[2023-03-15 18:19:23] [INFO ] Deduced a trap composed of 236 places in 256 ms of which 1 ms to minimize.
[2023-03-15 18:19:24] [INFO ] Deduced a trap composed of 222 places in 253 ms of which 0 ms to minimize.
[2023-03-15 18:19:24] [INFO ] Deduced a trap composed of 226 places in 255 ms of which 1 ms to minimize.
[2023-03-15 18:19:24] [INFO ] Deduced a trap composed of 232 places in 272 ms of which 1 ms to minimize.
[2023-03-15 18:19:24] [INFO ] Deduced a trap composed of 240 places in 251 ms of which 0 ms to minimize.
[2023-03-15 18:19:25] [INFO ] Deduced a trap composed of 234 places in 261 ms of which 1 ms to minimize.
[2023-03-15 18:19:25] [INFO ] Deduced a trap composed of 238 places in 257 ms of which 1 ms to minimize.
[2023-03-15 18:19:25] [INFO ] Deduced a trap composed of 238 places in 257 ms of which 1 ms to minimize.
[2023-03-15 18:19:26] [INFO ] Deduced a trap composed of 231 places in 258 ms of which 1 ms to minimize.
[2023-03-15 18:19:26] [INFO ] Deduced a trap composed of 229 places in 248 ms of which 0 ms to minimize.
[2023-03-15 18:19:26] [INFO ] Deduced a trap composed of 230 places in 261 ms of which 0 ms to minimize.
[2023-03-15 18:19:27] [INFO ] Deduced a trap composed of 231 places in 253 ms of which 0 ms to minimize.
[2023-03-15 18:19:27] [INFO ] Deduced a trap composed of 231 places in 248 ms of which 0 ms to minimize.
[2023-03-15 18:19:27] [INFO ] Deduced a trap composed of 229 places in 242 ms of which 1 ms to minimize.
[2023-03-15 18:19:27] [INFO ] Deduced a trap composed of 230 places in 252 ms of which 0 ms to minimize.
[2023-03-15 18:19:28] [INFO ] Deduced a trap composed of 226 places in 256 ms of which 1 ms to minimize.
[2023-03-15 18:19:28] [INFO ] Deduced a trap composed of 222 places in 234 ms of which 0 ms to minimize.
[2023-03-15 18:19:28] [INFO ] Deduced a trap composed of 234 places in 233 ms of which 0 ms to minimize.
[2023-03-15 18:19:29] [INFO ] Deduced a trap composed of 224 places in 239 ms of which 0 ms to minimize.
[2023-03-15 18:19:29] [INFO ] Deduced a trap composed of 230 places in 254 ms of which 0 ms to minimize.
[2023-03-15 18:19:29] [INFO ] Deduced a trap composed of 225 places in 236 ms of which 1 ms to minimize.
[2023-03-15 18:19:29] [INFO ] Deduced a trap composed of 228 places in 238 ms of which 1 ms to minimize.
[2023-03-15 18:19:30] [INFO ] Deduced a trap composed of 224 places in 240 ms of which 1 ms to minimize.
[2023-03-15 18:19:30] [INFO ] Deduced a trap composed of 224 places in 236 ms of which 0 ms to minimize.
[2023-03-15 18:19:30] [INFO ] Deduced a trap composed of 230 places in 237 ms of which 1 ms to minimize.
[2023-03-15 18:19:31] [INFO ] Deduced a trap composed of 230 places in 236 ms of which 1 ms to minimize.
[2023-03-15 18:19:31] [INFO ] Deduced a trap composed of 226 places in 247 ms of which 0 ms to minimize.
[2023-03-15 18:19:31] [INFO ] Deduced a trap composed of 238 places in 258 ms of which 1 ms to minimize.
[2023-03-15 18:19:32] [INFO ] Deduced a trap composed of 222 places in 256 ms of which 0 ms to minimize.
[2023-03-15 18:19:32] [INFO ] Deduced a trap composed of 232 places in 265 ms of which 4 ms to minimize.
[2023-03-15 18:19:32] [INFO ] Deduced a trap composed of 230 places in 255 ms of which 1 ms to minimize.
[2023-03-15 18:19:32] [INFO ] Deduced a trap composed of 236 places in 231 ms of which 1 ms to minimize.
[2023-03-15 18:19:33] [INFO ] Deduced a trap composed of 226 places in 253 ms of which 0 ms to minimize.
[2023-03-15 18:19:33] [INFO ] Deduced a trap composed of 230 places in 254 ms of which 0 ms to minimize.
[2023-03-15 18:19:33] [INFO ] Deduced a trap composed of 226 places in 254 ms of which 1 ms to minimize.
[2023-03-15 18:19:34] [INFO ] Deduced a trap composed of 223 places in 263 ms of which 0 ms to minimize.
[2023-03-15 18:19:34] [INFO ] Deduced a trap composed of 229 places in 253 ms of which 0 ms to minimize.
[2023-03-15 18:19:34] [INFO ] Deduced a trap composed of 225 places in 256 ms of which 1 ms to minimize.
[2023-03-15 18:19:35] [INFO ] Deduced a trap composed of 234 places in 260 ms of which 1 ms to minimize.
[2023-03-15 18:19:35] [INFO ] Deduced a trap composed of 228 places in 249 ms of which 0 ms to minimize.
[2023-03-15 18:19:35] [INFO ] Deduced a trap composed of 228 places in 251 ms of which 1 ms to minimize.
[2023-03-15 18:19:36] [INFO ] Deduced a trap composed of 226 places in 253 ms of which 0 ms to minimize.
[2023-03-15 18:19:36] [INFO ] Deduced a trap composed of 226 places in 250 ms of which 0 ms to minimize.
[2023-03-15 18:19:37] [INFO ] Deduced a trap composed of 232 places in 243 ms of which 0 ms to minimize.
[2023-03-15 18:19:37] [INFO ] Deduced a trap composed of 233 places in 227 ms of which 0 ms to minimize.
[2023-03-15 18:19:37] [INFO ] Deduced a trap composed of 236 places in 241 ms of which 1 ms to minimize.
[2023-03-15 18:19:38] [INFO ] Deduced a trap composed of 221 places in 246 ms of which 0 ms to minimize.
[2023-03-15 18:19:38] [INFO ] Deduced a trap composed of 228 places in 249 ms of which 1 ms to minimize.
[2023-03-15 18:19:38] [INFO ] Deduced a trap composed of 237 places in 254 ms of which 1 ms to minimize.
[2023-03-15 18:19:39] [INFO ] Deduced a trap composed of 228 places in 250 ms of which 1 ms to minimize.
[2023-03-15 18:19:39] [INFO ] Deduced a trap composed of 234 places in 247 ms of which 0 ms to minimize.
[2023-03-15 18:19:40] [INFO ] Deduced a trap composed of 224 places in 247 ms of which 0 ms to minimize.
[2023-03-15 18:19:40] [INFO ] Deduced a trap composed of 222 places in 254 ms of which 0 ms to minimize.
[2023-03-15 18:19:41] [INFO ] Deduced a trap composed of 218 places in 238 ms of which 1 ms to minimize.
[2023-03-15 18:19:41] [INFO ] Deduced a trap composed of 234 places in 231 ms of which 0 ms to minimize.
[2023-03-15 18:19:41] [INFO ] Deduced a trap composed of 234 places in 246 ms of which 1 ms to minimize.
[2023-03-15 18:19:42] [INFO ] Deduced a trap composed of 224 places in 247 ms of which 1 ms to minimize.
[2023-03-15 18:19:42] [INFO ] Deduced a trap composed of 226 places in 266 ms of which 1 ms to minimize.
[2023-03-15 18:19:42] [INFO ] Deduced a trap composed of 232 places in 252 ms of which 1 ms to minimize.
[2023-03-15 18:19:43] [INFO ] Deduced a trap composed of 230 places in 249 ms of which 1 ms to minimize.
[2023-03-15 18:19:43] [INFO ] Deduced a trap composed of 228 places in 255 ms of which 1 ms to minimize.
[2023-03-15 18:19:44] [INFO ] Deduced a trap composed of 232 places in 237 ms of which 2 ms to minimize.
[2023-03-15 18:19:44] [INFO ] Deduced a trap composed of 228 places in 262 ms of which 1 ms to minimize.
[2023-03-15 18:19:44] [INFO ] Deduced a trap composed of 232 places in 251 ms of which 1 ms to minimize.
[2023-03-15 18:19:44] [INFO ] Deduced a trap composed of 224 places in 251 ms of which 1 ms to minimize.
[2023-03-15 18:19:45] [INFO ] Deduced a trap composed of 230 places in 244 ms of which 1 ms to minimize.
[2023-03-15 18:19:45] [INFO ] Deduced a trap composed of 228 places in 244 ms of which 0 ms to minimize.
[2023-03-15 18:19:45] [INFO ] Deduced a trap composed of 232 places in 250 ms of which 0 ms to minimize.
[2023-03-15 18:19:46] [INFO ] Deduced a trap composed of 226 places in 239 ms of which 0 ms to minimize.
[2023-03-15 18:19:46] [INFO ] Deduced a trap composed of 228 places in 229 ms of which 0 ms to minimize.
[2023-03-15 18:19:46] [INFO ] Deduced a trap composed of 238 places in 251 ms of which 0 ms to minimize.
[2023-03-15 18:19:46] [INFO ] Deduced a trap composed of 228 places in 246 ms of which 0 ms to minimize.
[2023-03-15 18:19:47] [INFO ] Deduced a trap composed of 242 places in 252 ms of which 1 ms to minimize.
[2023-03-15 18:19:47] [INFO ] Deduced a trap composed of 224 places in 248 ms of which 0 ms to minimize.
[2023-03-15 18:19:47] [INFO ] Deduced a trap composed of 224 places in 254 ms of which 1 ms to minimize.
[2023-03-15 18:19:48] [INFO ] Deduced a trap composed of 230 places in 238 ms of which 1 ms to minimize.
[2023-03-15 18:19:48] [INFO ] Deduced a trap composed of 228 places in 233 ms of which 1 ms to minimize.
[2023-03-15 18:19:49] [INFO ] Deduced a trap composed of 230 places in 255 ms of which 1 ms to minimize.
[2023-03-15 18:19:49] [INFO ] Deduced a trap composed of 226 places in 248 ms of which 2 ms to minimize.
[2023-03-15 18:19:49] [INFO ] Deduced a trap composed of 228 places in 256 ms of which 1 ms to minimize.
[2023-03-15 18:19:50] [INFO ] Deduced a trap composed of 238 places in 264 ms of which 1 ms to minimize.
[2023-03-15 18:19:50] [INFO ] Deduced a trap composed of 224 places in 244 ms of which 1 ms to minimize.
[2023-03-15 18:19:50] [INFO ] Deduced a trap composed of 234 places in 247 ms of which 1 ms to minimize.
[2023-03-15 18:19:51] [INFO ] Deduced a trap composed of 244 places in 251 ms of which 15 ms to minimize.
[2023-03-15 18:19:51] [INFO ] Deduced a trap composed of 224 places in 256 ms of which 1 ms to minimize.
[2023-03-15 18:19:51] [INFO ] Deduced a trap composed of 236 places in 253 ms of which 1 ms to minimize.
[2023-03-15 18:19:51] [INFO ] Deduced a trap composed of 230 places in 256 ms of which 1 ms to minimize.
[2023-03-15 18:19:52] [INFO ] Deduced a trap composed of 234 places in 251 ms of which 0 ms to minimize.
[2023-03-15 18:19:53] [INFO ] Deduced a trap composed of 235 places in 255 ms of which 0 ms to minimize.
[2023-03-15 18:19:56] [INFO ] Deduced a trap composed of 230 places in 250 ms of which 1 ms to minimize.
[2023-03-15 18:19:56] [INFO ] Deduced a trap composed of 218 places in 252 ms of which 1 ms to minimize.
[2023-03-15 18:19:57] [INFO ] Deduced a trap composed of 230 places in 253 ms of which 0 ms to minimize.
[2023-03-15 18:19:58] [INFO ] Deduced a trap composed of 232 places in 253 ms of which 0 ms to minimize.
[2023-03-15 18:19:58] [INFO ] Deduced a trap composed of 230 places in 251 ms of which 0 ms to minimize.
[2023-03-15 18:19:58] [INFO ] Deduced a trap composed of 228 places in 247 ms of which 0 ms to minimize.
[2023-03-15 18:19:58] [INFO ] Deduced a trap composed of 224 places in 249 ms of which 0 ms to minimize.
[2023-03-15 18:19:59] [INFO ] Deduced a trap composed of 220 places in 251 ms of which 0 ms to minimize.
[2023-03-15 18:20:00] [INFO ] Deduced a trap composed of 224 places in 250 ms of which 1 ms to minimize.
[2023-03-15 18:20:00] [INFO ] Deduced a trap composed of 228 places in 252 ms of which 0 ms to minimize.
[2023-03-15 18:20:00] [INFO ] Deduced a trap composed of 230 places in 258 ms of which 1 ms to minimize.
[2023-03-15 18:20:00] [INFO ] Deduced a trap composed of 232 places in 250 ms of which 0 ms to minimize.
[2023-03-15 18:20:01] [INFO ] Deduced a trap composed of 228 places in 239 ms of which 1 ms to minimize.
[2023-03-15 18:20:01] [INFO ] Deduced a trap composed of 232 places in 254 ms of which 1 ms to minimize.
[2023-03-15 18:20:01] [INFO ] Deduced a trap composed of 238 places in 254 ms of which 0 ms to minimize.
[2023-03-15 18:20:02] [INFO ] Deduced a trap composed of 232 places in 258 ms of which 0 ms to minimize.
[2023-03-15 18:20:02] [INFO ] Deduced a trap composed of 230 places in 252 ms of which 1 ms to minimize.
[2023-03-15 18:20:02] [INFO ] Deduced a trap composed of 224 places in 244 ms of which 0 ms to minimize.
[2023-03-15 18:20:03] [INFO ] Deduced a trap composed of 230 places in 256 ms of which 0 ms to minimize.
[2023-03-15 18:20:03] [INFO ] Deduced a trap composed of 222 places in 252 ms of which 1 ms to minimize.
[2023-03-15 18:20:03] [INFO ] Deduced a trap composed of 234 places in 261 ms of which 0 ms to minimize.
[2023-03-15 18:20:03] [INFO ] Deduced a trap composed of 236 places in 251 ms of which 1 ms to minimize.
[2023-03-15 18:20:04] [INFO ] Deduced a trap composed of 236 places in 251 ms of which 1 ms to minimize.
[2023-03-15 18:20:04] [INFO ] Deduced a trap composed of 224 places in 255 ms of which 1 ms to minimize.
[2023-03-15 18:20:04] [INFO ] Deduced a trap composed of 228 places in 255 ms of which 0 ms to minimize.
[2023-03-15 18:20:05] [INFO ] Deduced a trap composed of 228 places in 254 ms of which 0 ms to minimize.
[2023-03-15 18:20:05] [INFO ] Deduced a trap composed of 230 places in 254 ms of which 0 ms to minimize.
[2023-03-15 18:20:05] [INFO ] Deduced a trap composed of 226 places in 251 ms of which 0 ms to minimize.
[2023-03-15 18:20:06] [INFO ] Deduced a trap composed of 226 places in 252 ms of which 0 ms to minimize.
[2023-03-15 18:20:06] [INFO ] Deduced a trap composed of 228 places in 259 ms of which 0 ms to minimize.
[2023-03-15 18:20:06] [INFO ] Deduced a trap composed of 232 places in 249 ms of which 0 ms to minimize.
[2023-03-15 18:20:06] [INFO ] Deduced a trap composed of 224 places in 250 ms of which 0 ms to minimize.
[2023-03-15 18:20:07] [INFO ] Deduced a trap composed of 230 places in 255 ms of which 0 ms to minimize.
[2023-03-15 18:20:07] [INFO ] Deduced a trap composed of 228 places in 250 ms of which 1 ms to minimize.
[2023-03-15 18:20:07] [INFO ] Deduced a trap composed of 238 places in 254 ms of which 0 ms to minimize.
[2023-03-15 18:20:08] [INFO ] Deduced a trap composed of 228 places in 249 ms of which 1 ms to minimize.
[2023-03-15 18:20:08] [INFO ] Deduced a trap composed of 240 places in 238 ms of which 1 ms to minimize.
[2023-03-15 18:20:08] [INFO ] Deduced a trap composed of 224 places in 248 ms of which 1 ms to minimize.
[2023-03-15 18:20:09] [INFO ] Deduced a trap composed of 236 places in 254 ms of which 0 ms to minimize.
[2023-03-15 18:20:09] [INFO ] Deduced a trap composed of 226 places in 266 ms of which 1 ms to minimize.
[2023-03-15 18:20:09] [INFO ] Deduced a trap composed of 228 places in 255 ms of which 1 ms to minimize.
[2023-03-15 18:20:09] [INFO ] Deduced a trap composed of 224 places in 252 ms of which 1 ms to minimize.
[2023-03-15 18:20:10] [INFO ] Deduced a trap composed of 234 places in 254 ms of which 1 ms to minimize.
[2023-03-15 18:20:10] [INFO ] Deduced a trap composed of 224 places in 256 ms of which 0 ms to minimize.
[2023-03-15 18:20:10] [INFO ] Deduced a trap composed of 232 places in 257 ms of which 1 ms to minimize.
[2023-03-15 18:20:11] [INFO ] Deduced a trap composed of 220 places in 248 ms of which 0 ms to minimize.
[2023-03-15 18:20:11] [INFO ] Deduced a trap composed of 230 places in 252 ms of which 1 ms to minimize.
[2023-03-15 18:20:11] [INFO ] Deduced a trap composed of 230 places in 254 ms of which 1 ms to minimize.
[2023-03-15 18:20:12] [INFO ] Deduced a trap composed of 224 places in 260 ms of which 1 ms to minimize.
[2023-03-15 18:20:14] [INFO ] Deduced a trap composed of 228 places in 252 ms of which 0 ms to minimize.
[2023-03-15 18:20:15] [INFO ] Deduced a trap composed of 230 places in 234 ms of which 1 ms to minimize.
[2023-03-15 18:20:15] [INFO ] Deduced a trap composed of 226 places in 248 ms of which 0 ms to minimize.
[2023-03-15 18:20:15] [INFO ] Deduced a trap composed of 224 places in 256 ms of which 0 ms to minimize.
[2023-03-15 18:20:24] [INFO ] Trap strengthening (SAT) tested/added 144/144 trap constraints in 61880 ms
[2023-03-15 18:20:25] [INFO ] After 63044ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-15 18:20:25] [INFO ] After 63179ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
FORMULA PolyORBNT-PT-S10J30-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBNT-PT-S10J30-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F((G(p1)||G(p2))))))'
Support contains 5 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 654 transition count 1291
Reduce places removed 34 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 36 rules applied. Total rules applied 70 place count 620 transition count 1289
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 72 place count 618 transition count 1289
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 72 place count 618 transition count 1257
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 136 place count 586 transition count 1257
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 137 place count 585 transition count 1256
Iterating global reduction 3 with 1 rules applied. Total rules applied 138 place count 585 transition count 1256
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 142 place count 583 transition count 1254
Applied a total of 142 rules in 126 ms. Remains 583 /664 variables (removed 81) and now considering 1254/1325 (removed 71) transitions.
[2023-03-15 18:20:25] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
// Phase 1: matrix 1245 rows 583 cols
[2023-03-15 18:20:25] [INFO ] Computed 82 place invariants in 18 ms
[2023-03-15 18:20:26] [INFO ] Dead Transitions using invariants and state equation in 684 ms found 0 transitions.
[2023-03-15 18:20:26] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-15 18:20:26] [INFO ] Invariant cache hit.
[2023-03-15 18:20:27] [INFO ] Implicit Places using invariants in 642 ms returned []
[2023-03-15 18:20:27] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-15 18:20:27] [INFO ] Invariant cache hit.
[2023-03-15 18:20:27] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 18:20:34] [INFO ] Implicit Places using invariants and state equation in 7594 ms returned []
Implicit Place search using SMT with State Equation took 8238 ms to find 0 implicit places.
[2023-03-15 18:20:34] [INFO ] Redundant transitions in 58 ms returned []
[2023-03-15 18:20:34] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-15 18:20:34] [INFO ] Invariant cache hit.
[2023-03-15 18:20:35] [INFO ] Dead Transitions using invariants and state equation in 690 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 583/664 places, 1254/1325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9810 ms. Remains : 583/664 places, 1254/1325 transitions.
Stuttering acceptance computed with spot in 227 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}], [{ cond=(AND p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={1} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s251 1) (LT s327 1)), p1:(AND (GEQ s3 1) (GEQ s187 1)), p2:(LT s255 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 6849 reset in 721 ms.
Product exploration explored 100000 steps with 6847 reset in 653 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) p2), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (X p0)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 9 factoid took 488 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 683 resets, run finished after 82 ms. (steps per millisecond=121 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 18:20:37] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-15 18:20:37] [INFO ] Invariant cache hit.
[2023-03-15 18:20:37] [INFO ] [Real]Absence check using 63 positive place invariants in 13 ms returned sat
[2023-03-15 18:20:37] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 21 ms returned sat
[2023-03-15 18:20:37] [INFO ] After 147ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 p2))), (X (X p0)), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 p2)))), (G (NOT (AND p1 (NOT p2))))]
False Knowledge obtained : [(X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (NOT (AND (NOT p1) p2))), (F (AND (NOT p1) (NOT p2))), (F (NOT p0)), (F (AND p1 p2)), (F (NOT (OR (NOT p1) (NOT p2))))]
Knowledge based reduction with 10 factoid took 559 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Support contains 5 out of 583 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 583/583 places, 1254/1254 transitions.
Applied a total of 0 rules in 35 ms. Remains 583 /583 variables (removed 0) and now considering 1254/1254 (removed 0) transitions.
[2023-03-15 18:20:38] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-15 18:20:38] [INFO ] Invariant cache hit.
[2023-03-15 18:20:39] [INFO ] Dead Transitions using invariants and state equation in 650 ms found 0 transitions.
[2023-03-15 18:20:39] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-15 18:20:39] [INFO ] Invariant cache hit.
[2023-03-15 18:20:40] [INFO ] Implicit Places using invariants in 653 ms returned []
[2023-03-15 18:20:40] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-15 18:20:40] [INFO ] Invariant cache hit.
[2023-03-15 18:20:40] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 18:20:47] [INFO ] Implicit Places using invariants and state equation in 7644 ms returned []
Implicit Place search using SMT with State Equation took 8309 ms to find 0 implicit places.
[2023-03-15 18:20:47] [INFO ] Redundant transitions in 29 ms returned []
[2023-03-15 18:20:47] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-15 18:20:47] [INFO ] Invariant cache hit.
[2023-03-15 18:20:48] [INFO ] Dead Transitions using invariants and state equation in 700 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9741 ms. Remains : 583/583 places, 1254/1254 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 p0 (NOT p1) p2), (X p2), (X p0), (X (X p0))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2)))]
Knowledge based reduction with 4 factoid took 198 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Incomplete random walk after 10000 steps, including 686 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 103 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 18:20:48] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-15 18:20:48] [INFO ] Invariant cache hit.
[2023-03-15 18:20:49] [INFO ] [Real]Absence check using 63 positive place invariants in 12 ms returned sat
[2023-03-15 18:20:49] [INFO ] [Real]Absence check using 63 positive and 19 generalized place invariants in 21 ms returned sat
[2023-03-15 18:20:49] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 18:20:49] [INFO ] [Nat]Absence check using 63 positive place invariants in 11 ms returned sat
[2023-03-15 18:20:49] [INFO ] [Nat]Absence check using 63 positive and 19 generalized place invariants in 22 ms returned sat
[2023-03-15 18:20:50] [INFO ] After 1006ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 18:20:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 18:20:50] [INFO ] After 262ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 18:20:52] [INFO ] Deduced a trap composed of 250 places in 295 ms of which 1 ms to minimize.
[2023-03-15 18:20:52] [INFO ] Deduced a trap composed of 246 places in 300 ms of which 1 ms to minimize.
[2023-03-15 18:20:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 743 ms
[2023-03-15 18:20:52] [INFO ] After 2611ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 109 ms.
[2023-03-15 18:20:52] [INFO ] After 3869ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 583 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 583/583 places, 1254/1254 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 583 transition count 1252
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 581 transition count 1252
Applied a total of 4 rules in 34 ms. Remains 581 /583 variables (removed 2) and now considering 1252/1254 (removed 2) transitions.
[2023-03-15 18:20:53] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-15 18:20:53] [INFO ] Computed 82 place invariants in 28 ms
[2023-03-15 18:20:53] [INFO ] Dead Transitions using invariants and state equation in 882 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 921 ms. Remains : 581/583 places, 1252/1254 transitions.
Finished random walk after 217 steps, including 17 resets, run visited all 1 properties in 2 ms. (steps per millisecond=108 )
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X p0), (X (X p0))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (F (NOT p0)), (F (NOT p2)), (F p1)]
Knowledge based reduction with 4 factoid took 245 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 91 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2)]
Product exploration explored 100000 steps with 6844 reset in 628 ms.
Product exploration explored 100000 steps with 6856 reset in 646 ms.
Support contains 5 out of 583 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 583/583 places, 1254/1254 transitions.
Applied a total of 0 rules in 31 ms. Remains 583 /583 variables (removed 0) and now considering 1254/1254 (removed 0) transitions.
[2023-03-15 18:20:55] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
// Phase 1: matrix 1245 rows 583 cols
[2023-03-15 18:20:55] [INFO ] Computed 82 place invariants in 15 ms
[2023-03-15 18:20:56] [INFO ] Dead Transitions using invariants and state equation in 727 ms found 0 transitions.
[2023-03-15 18:20:56] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-15 18:20:56] [INFO ] Invariant cache hit.
[2023-03-15 18:20:57] [INFO ] Implicit Places using invariants in 607 ms returned []
[2023-03-15 18:20:57] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-15 18:20:57] [INFO ] Invariant cache hit.
[2023-03-15 18:20:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 18:21:04] [INFO ] Implicit Places using invariants and state equation in 7341 ms returned []
Implicit Place search using SMT with State Equation took 7965 ms to find 0 implicit places.
[2023-03-15 18:21:04] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-15 18:21:04] [INFO ] Flow matrix only has 1245 transitions (discarded 9 similar events)
[2023-03-15 18:21:04] [INFO ] Invariant cache hit.
[2023-03-15 18:21:05] [INFO ] Dead Transitions using invariants and state equation in 671 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9454 ms. Remains : 583/583 places, 1254/1254 transitions.
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-00 finished in 39869 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)||G(p1)))'
Support contains 363 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Drop transitions removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 664 transition count 1321
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 660 transition count 1321
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 8 place count 660 transition count 1286
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 78 place count 625 transition count 1286
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 79 place count 624 transition count 1285
Iterating global reduction 2 with 1 rules applied. Total rules applied 80 place count 624 transition count 1285
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 82 place count 623 transition count 1284
Applied a total of 82 rules in 122 ms. Remains 623 /664 variables (removed 41) and now considering 1284/1325 (removed 41) transitions.
[2023-03-15 18:21:05] [INFO ] Flow matrix only has 1275 transitions (discarded 9 similar events)
// Phase 1: matrix 1275 rows 623 cols
[2023-03-15 18:21:05] [INFO ] Computed 92 place invariants in 15 ms
[2023-03-15 18:21:06] [INFO ] Dead Transitions using invariants and state equation in 866 ms found 0 transitions.
[2023-03-15 18:21:06] [INFO ] Flow matrix only has 1275 transitions (discarded 9 similar events)
[2023-03-15 18:21:06] [INFO ] Invariant cache hit.
[2023-03-15 18:21:06] [INFO ] Implicit Places using invariants in 445 ms returned []
[2023-03-15 18:21:06] [INFO ] Flow matrix only has 1275 transitions (discarded 9 similar events)
[2023-03-15 18:21:06] [INFO ] Invariant cache hit.
[2023-03-15 18:21:07] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 18:21:12] [INFO ] Implicit Places using invariants and state equation in 5156 ms returned []
Implicit Place search using SMT with State Equation took 5643 ms to find 0 implicit places.
[2023-03-15 18:21:12] [INFO ] Redundant transitions in 28 ms returned []
[2023-03-15 18:21:12] [INFO ] Flow matrix only has 1275 transitions (discarded 9 similar events)
[2023-03-15 18:21:12] [INFO ] Invariant cache hit.
[2023-03-15 18:21:12] [INFO ] Dead Transitions using invariants and state equation in 794 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 623/664 places, 1284/1325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7483 ms. Remains : 623/664 places, 1284/1325 transitions.
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(OR (AND (GEQ s135 1) (GEQ s572 1)) (AND (GEQ s441 1) (GEQ s555 1)) (AND (GEQ s165 1) (GEQ s485 1)) (AND (GEQ s19 1) (GEQ s47 1)) (AND (GEQ s256 1) (GE...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 41 steps with 1 reset in 3 ms.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-01 finished in 7573 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 12 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 654 transition count 1290
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 619 transition count 1290
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 34 Pre rules applied. Total rules applied 70 place count 619 transition count 1256
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 2 with 68 rules applied. Total rules applied 138 place count 585 transition count 1256
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 139 place count 584 transition count 1255
Iterating global reduction 2 with 1 rules applied. Total rules applied 140 place count 584 transition count 1255
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 144 place count 582 transition count 1253
Applied a total of 144 rules in 88 ms. Remains 582 /664 variables (removed 82) and now considering 1253/1325 (removed 72) transitions.
[2023-03-15 18:21:13] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2023-03-15 18:21:13] [INFO ] Computed 82 place invariants in 18 ms
[2023-03-15 18:21:13] [INFO ] Dead Transitions using invariants and state equation in 789 ms found 0 transitions.
[2023-03-15 18:21:13] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-15 18:21:13] [INFO ] Invariant cache hit.
[2023-03-15 18:21:14] [INFO ] Implicit Places using invariants in 545 ms returned []
[2023-03-15 18:21:14] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-15 18:21:14] [INFO ] Invariant cache hit.
[2023-03-15 18:21:15] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 18:21:21] [INFO ] Implicit Places using invariants and state equation in 7174 ms returned []
Implicit Place search using SMT with State Equation took 7728 ms to find 0 implicit places.
[2023-03-15 18:21:21] [INFO ] Redundant transitions in 24 ms returned []
[2023-03-15 18:21:21] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-15 18:21:21] [INFO ] Invariant cache hit.
[2023-03-15 18:21:22] [INFO ] Dead Transitions using invariants and state equation in 709 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 582/664 places, 1253/1325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9384 ms. Remains : 582/664 places, 1253/1325 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s88 8) (GEQ s333 2) (GEQ s511 1)) (AND (GEQ s88 8) (GEQ s96 1) (GEQ s182 1) (GEQ s511 1)) (AND (GEQ s88 8) (GEQ s98 1) (GEQ s411 1) (GEQ ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-02 finished in 9441 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 654 transition count 1292
Reduce places removed 33 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 34 rules applied. Total rules applied 67 place count 621 transition count 1291
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 68 place count 620 transition count 1291
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 68 place count 620 transition count 1257
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 136 place count 586 transition count 1257
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 137 place count 585 transition count 1256
Iterating global reduction 3 with 1 rules applied. Total rules applied 138 place count 585 transition count 1256
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 140 place count 584 transition count 1255
Applied a total of 140 rules in 91 ms. Remains 584 /664 variables (removed 80) and now considering 1255/1325 (removed 70) transitions.
[2023-03-15 18:21:22] [INFO ] Flow matrix only has 1246 transitions (discarded 9 similar events)
// Phase 1: matrix 1246 rows 584 cols
[2023-03-15 18:21:22] [INFO ] Computed 82 place invariants in 14 ms
[2023-03-15 18:21:23] [INFO ] Dead Transitions using invariants and state equation in 783 ms found 0 transitions.
[2023-03-15 18:21:23] [INFO ] Flow matrix only has 1246 transitions (discarded 9 similar events)
[2023-03-15 18:21:23] [INFO ] Invariant cache hit.
[2023-03-15 18:21:24] [INFO ] Implicit Places using invariants in 658 ms returned []
[2023-03-15 18:21:24] [INFO ] Flow matrix only has 1246 transitions (discarded 9 similar events)
[2023-03-15 18:21:24] [INFO ] Invariant cache hit.
[2023-03-15 18:21:24] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 18:21:33] [INFO ] Implicit Places using invariants and state equation in 9362 ms returned []
Implicit Place search using SMT with State Equation took 10028 ms to find 0 implicit places.
[2023-03-15 18:21:33] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-15 18:21:33] [INFO ] Flow matrix only has 1246 transitions (discarded 9 similar events)
[2023-03-15 18:21:33] [INFO ] Invariant cache hit.
[2023-03-15 18:21:34] [INFO ] Dead Transitions using invariants and state equation in 695 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 584/664 places, 1255/1325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11655 ms. Remains : 584/664 places, 1255/1325 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-03 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:(AND (GEQ s122 1) (LT s494 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 15 steps with 0 reset in 1 ms.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-03 finished in 11752 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G((p1 U !p2)))))'
Support contains 36 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 654 transition count 1290
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 619 transition count 1289
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 72 place count 618 transition count 1289
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 72 place count 618 transition count 1255
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 140 place count 584 transition count 1255
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 141 place count 583 transition count 1254
Iterating global reduction 3 with 1 rules applied. Total rules applied 142 place count 583 transition count 1254
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 146 place count 581 transition count 1252
Applied a total of 146 rules in 83 ms. Remains 581 /664 variables (removed 83) and now considering 1252/1325 (removed 73) transitions.
[2023-03-15 18:21:34] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
// Phase 1: matrix 1243 rows 581 cols
[2023-03-15 18:21:34] [INFO ] Computed 82 place invariants in 13 ms
[2023-03-15 18:21:35] [INFO ] Dead Transitions using invariants and state equation in 691 ms found 0 transitions.
[2023-03-15 18:21:35] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-15 18:21:35] [INFO ] Invariant cache hit.
[2023-03-15 18:21:35] [INFO ] Implicit Places using invariants in 623 ms returned []
[2023-03-15 18:21:35] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-15 18:21:35] [INFO ] Invariant cache hit.
[2023-03-15 18:21:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 18:21:45] [INFO ] Implicit Places using invariants and state equation in 9988 ms returned []
Implicit Place search using SMT with State Equation took 10626 ms to find 0 implicit places.
[2023-03-15 18:21:45] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-15 18:21:45] [INFO ] Flow matrix only has 1243 transitions (discarded 9 similar events)
[2023-03-15 18:21:45] [INFO ] Invariant cache hit.
[2023-03-15 18:21:46] [INFO ] Dead Transitions using invariants and state equation in 633 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 581/664 places, 1252/1325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12110 ms. Remains : 581/664 places, 1252/1325 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (NOT p0) p2), p2, p2]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (AND p2 (NOT p1))), acceptance={0} source=0 dest: 0}, { cond=(OR (AND p0 (NOT p2)) (AND p0 p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p2 p1), acceptance={0} source=0 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(OR (NOT p2) p1), acceptance={} source=1 dest: 1}, { cond=(AND p2 p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p2 p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (GEQ s67 1) (GEQ s144 1) (GEQ s534 1)) (AND (GEQ s67 1) (GEQ s483 1) (GEQ s534 1)) (AND (GEQ s67 1) (GEQ s92 1) (GEQ s534 1)) (AND (GEQ s67 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 23 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-04 finished in 12252 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U p1)||(F(p2)&&X(p1))))'
Support contains 54 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1324
Applied a total of 12 rules in 23 ms. Remains 653 /664 variables (removed 11) and now considering 1324/1325 (removed 1) transitions.
[2023-03-15 18:21:46] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2023-03-15 18:21:46] [INFO ] Computed 82 place invariants in 16 ms
[2023-03-15 18:21:47] [INFO ] Dead Transitions using invariants and state equation in 1364 ms found 0 transitions.
[2023-03-15 18:21:47] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-15 18:21:47] [INFO ] Invariant cache hit.
[2023-03-15 18:21:48] [INFO ] Implicit Places using invariants in 446 ms returned []
[2023-03-15 18:21:48] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-15 18:21:48] [INFO ] Invariant cache hit.
[2023-03-15 18:21:48] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 18:21:54] [INFO ] Implicit Places using invariants and state equation in 5720 ms returned []
Implicit Place search using SMT with State Equation took 6185 ms to find 0 implicit places.
[2023-03-15 18:21:54] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-15 18:21:54] [INFO ] Invariant cache hit.
[2023-03-15 18:21:55] [INFO ] Dead Transitions using invariants and state equation in 1020 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 653/664 places, 1324/1325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8621 ms. Remains : 653/664 places, 1324/1325 transitions.
Stuttering acceptance computed with spot in 208 ms :[(NOT p1), (NOT p1), (NOT p2), (AND (NOT p2) (NOT p0)), (NOT p1), true, (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 4}], [{ cond=(NOT p1), acceptance={} source=1 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 5}, { cond=(AND (NOT p1) p0), 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=[p1:(OR (AND (GEQ s102 7) (GEQ s180 1) (GEQ s511 1) (GEQ s572 1) (GEQ s647 1)) (AND (GEQ s102 7) (GEQ s111 2) (GEQ s437 1) (GEQ s572 1)) (AND (GEQ s102 7) ...], 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 1 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-07 finished in 8872 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 4 out of 664 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Drop transitions removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 35 place count 654 transition count 1290
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 70 place count 619 transition count 1290
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 35 Pre rules applied. Total rules applied 70 place count 619 transition count 1255
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 2 with 70 rules applied. Total rules applied 140 place count 584 transition count 1255
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 141 place count 583 transition count 1254
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 583 transition count 1254
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 144 place count 582 transition count 1253
Applied a total of 144 rules in 82 ms. Remains 582 /664 variables (removed 82) and now considering 1253/1325 (removed 72) transitions.
[2023-03-15 18:21:55] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
// Phase 1: matrix 1244 rows 582 cols
[2023-03-15 18:21:55] [INFO ] Computed 82 place invariants in 14 ms
[2023-03-15 18:21:56] [INFO ] Dead Transitions using invariants and state equation in 841 ms found 0 transitions.
[2023-03-15 18:21:56] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-15 18:21:56] [INFO ] Invariant cache hit.
[2023-03-15 18:21:56] [INFO ] Implicit Places using invariants in 638 ms returned []
[2023-03-15 18:21:56] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-15 18:21:56] [INFO ] Invariant cache hit.
[2023-03-15 18:21:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 18:22:04] [INFO ] Implicit Places using invariants and state equation in 7437 ms returned []
Implicit Place search using SMT with State Equation took 8103 ms to find 0 implicit places.
[2023-03-15 18:22:04] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-15 18:22:04] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-15 18:22:04] [INFO ] Invariant cache hit.
[2023-03-15 18:22:05] [INFO ] Dead Transitions using invariants and state equation in 641 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 582/664 places, 1253/1325 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9726 ms. Remains : 582/664 places, 1253/1325 transitions.
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s119 1) (GEQ s299 1) (GEQ s310 1)), p1:(LT s357 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 7269 reset in 711 ms.
Product exploration explored 100000 steps with 7289 reset in 730 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 285 ms. Reduced automaton from 1 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 695 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 96 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 18:22:07] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-15 18:22:07] [INFO ] Invariant cache hit.
[2023-03-15 18:22:07] [INFO ] [Real]Absence check using 62 positive place invariants in 17 ms returned sat
[2023-03-15 18:22:07] [INFO ] [Real]Absence check using 62 positive and 20 generalized place invariants in 50 ms returned sat
[2023-03-15 18:22:07] [INFO ] After 212ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 p1)), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 10 factoid took 400 ms. Reduced automaton from 1 states, 4 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 p1)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p1)]
Support contains 1 out of 582 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 : 582/582 places, 1253/1253 transitions.
Applied a total of 0 rules in 26 ms. Remains 582 /582 variables (removed 0) and now considering 1253/1253 (removed 0) transitions.
[2023-03-15 18:22:07] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-15 18:22:07] [INFO ] Invariant cache hit.
[2023-03-15 18:22:08] [INFO ] Dead Transitions using invariants and state equation in 703 ms found 0 transitions.
[2023-03-15 18:22:08] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-15 18:22:08] [INFO ] Invariant cache hit.
[2023-03-15 18:22:09] [INFO ] Implicit Places using invariants in 613 ms returned []
[2023-03-15 18:22:09] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-15 18:22:09] [INFO ] Invariant cache hit.
[2023-03-15 18:22:09] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 18:22:17] [INFO ] Implicit Places using invariants and state equation in 8212 ms returned []
Implicit Place search using SMT with State Equation took 8837 ms to find 0 implicit places.
[2023-03-15 18:22:17] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-15 18:22:17] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-15 18:22:17] [INFO ] Invariant cache hit.
[2023-03-15 18:22:18] [INFO ] Dead Transitions using invariants and state equation in 617 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10271 ms. Remains : 582/582 places, 1253/1253 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 : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 126 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 32 ms :[(NOT p1)]
Finished random walk after 45 steps, including 2 resets, run visited all 1 properties in 2 ms. (steps per millisecond=22 )
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 108 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 22 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p1)]
Product exploration explored 100000 steps with 7247 reset in 681 ms.
Product exploration explored 100000 steps with 7301 reset in 704 ms.
Support contains 1 out of 582 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 582/582 places, 1253/1253 transitions.
Applied a total of 0 rules in 22 ms. Remains 582 /582 variables (removed 0) and now considering 1253/1253 (removed 0) transitions.
[2023-03-15 18:22:19] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-15 18:22:19] [INFO ] Invariant cache hit.
[2023-03-15 18:22:20] [INFO ] Dead Transitions using invariants and state equation in 652 ms found 0 transitions.
[2023-03-15 18:22:20] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-15 18:22:20] [INFO ] Invariant cache hit.
[2023-03-15 18:22:21] [INFO ] Implicit Places using invariants in 598 ms returned []
[2023-03-15 18:22:21] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-15 18:22:21] [INFO ] Invariant cache hit.
[2023-03-15 18:22:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 18:22:29] [INFO ] Implicit Places using invariants and state equation in 8089 ms returned []
Implicit Place search using SMT with State Equation took 8704 ms to find 0 implicit places.
[2023-03-15 18:22:29] [INFO ] Redundant transitions in 22 ms returned []
[2023-03-15 18:22:29] [INFO ] Flow matrix only has 1244 transitions (discarded 9 similar events)
[2023-03-15 18:22:29] [INFO ] Invariant cache hit.
[2023-03-15 18:22:29] [INFO ] Dead Transitions using invariants and state equation in 645 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10081 ms. Remains : 582/582 places, 1253/1253 transitions.
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-10 finished in 34661 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U ((p1 U p2)||F((p3||X(p3)))))))'
Support contains 10 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 9 places
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 655 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 654 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 654 transition count 1324
Applied a total of 11 rules in 27 ms. Remains 654 /664 variables (removed 10) and now considering 1324/1325 (removed 1) transitions.
[2023-03-15 18:22:30] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 654 cols
[2023-03-15 18:22:30] [INFO ] Computed 83 place invariants in 20 ms
[2023-03-15 18:22:31] [INFO ] Dead Transitions using invariants and state equation in 1010 ms found 0 transitions.
[2023-03-15 18:22:31] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-15 18:22:31] [INFO ] Invariant cache hit.
[2023-03-15 18:22:31] [INFO ] Implicit Places using invariants in 662 ms returned []
[2023-03-15 18:22:31] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-15 18:22:31] [INFO ] Invariant cache hit.
[2023-03-15 18:22:32] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 18:22:39] [INFO ] Implicit Places using invariants and state equation in 7894 ms returned []
Implicit Place search using SMT with State Equation took 8557 ms to find 0 implicit places.
[2023-03-15 18:22:39] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-15 18:22:39] [INFO ] Invariant cache hit.
[2023-03-15 18:22:40] [INFO ] Dead Transitions using invariants and state equation in 1033 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 654/664 places, 1324/1325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10641 ms. Remains : 654/664 places, 1324/1325 transitions.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p3), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p3) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1 (NOT p3) (NOT p0)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p3:(LT s475 1), p2:(AND (GEQ s102 1) (GEQ s133 1) (GEQ s174 1) (GEQ s599 1)), p1:(GEQ s143 1), p0:(AND (GEQ s102 7) (GEQ s181 1) (GEQ s375 1) (GEQ s446 1)...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 973 ms.
Product exploration explored 100000 steps with 50000 reset in 944 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 p3 p2 p1 (NOT p0)), (X (NOT (AND (NOT p2) (NOT p3) p0))), (X (NOT (AND (NOT p2) p1 (NOT p3) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3) p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p3) (NOT p0))))), (X (X p3)), (X (X (NOT (AND (NOT p2) p1 (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p3) (NOT p0)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p2) (NOT p1) (NOT p3) (NOT p0))))
Knowledge based reduction with 10 factoid took 184 ms. Reduced automaton from 4 states, 7 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA PolyORBNT-PT-S10J30-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-12 finished in 12921 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((G(F(p0))||(!p0&&F(p0))))))'
Support contains 3 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1324
Applied a total of 12 rules in 25 ms. Remains 653 /664 variables (removed 11) and now considering 1324/1325 (removed 1) transitions.
[2023-03-15 18:22:42] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
// Phase 1: matrix 1315 rows 653 cols
[2023-03-15 18:22:43] [INFO ] Computed 82 place invariants in 18 ms
[2023-03-15 18:22:44] [INFO ] Dead Transitions using invariants and state equation in 1035 ms found 0 transitions.
[2023-03-15 18:22:44] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-15 18:22:44] [INFO ] Invariant cache hit.
[2023-03-15 18:22:44] [INFO ] Implicit Places using invariants in 692 ms returned []
[2023-03-15 18:22:44] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-15 18:22:44] [INFO ] Invariant cache hit.
[2023-03-15 18:22:45] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 18:22:52] [INFO ] Implicit Places using invariants and state equation in 7518 ms returned []
Implicit Place search using SMT with State Equation took 8236 ms to find 0 implicit places.
[2023-03-15 18:22:52] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-15 18:22:52] [INFO ] Invariant cache hit.
[2023-03-15 18:22:53] [INFO ] Dead Transitions using invariants and state equation in 985 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 653/664 places, 1324/1325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10317 ms. Remains : 653/664 places, 1324/1325 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s79 1) (GEQ s141 1) (GEQ s603 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]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-13 finished in 10414 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)||(p1 U X(p2)))))'
Support contains 7 out of 664 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 664/664 places, 1325/1325 transitions.
Ensure Unique test removed 10 places
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 654 transition count 1325
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 653 transition count 1324
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 653 transition count 1324
Applied a total of 12 rules in 26 ms. Remains 653 /664 variables (removed 11) and now considering 1324/1325 (removed 1) transitions.
[2023-03-15 18:22:53] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-15 18:22:53] [INFO ] Invariant cache hit.
[2023-03-15 18:22:54] [INFO ] Dead Transitions using invariants and state equation in 964 ms found 0 transitions.
[2023-03-15 18:22:54] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-15 18:22:54] [INFO ] Invariant cache hit.
[2023-03-15 18:22:55] [INFO ] Implicit Places using invariants in 676 ms returned []
[2023-03-15 18:22:55] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-15 18:22:55] [INFO ] Invariant cache hit.
[2023-03-15 18:22:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-15 18:23:01] [INFO ] Implicit Places using invariants and state equation in 6893 ms returned []
Implicit Place search using SMT with State Equation took 7580 ms to find 0 implicit places.
[2023-03-15 18:23:01] [INFO ] Flow matrix only has 1315 transitions (discarded 9 similar events)
[2023-03-15 18:23:01] [INFO ] Invariant cache hit.
[2023-03-15 18:23:02] [INFO ] Dead Transitions using invariants and state equation in 1014 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 653/664 places, 1324/1325 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9637 ms. Remains : 653/664 places, 1324/1325 transitions.
Stuttering acceptance computed with spot in 158 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), p0, (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : PolyORBNT-PT-S10J30-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={0} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 4}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 2}]], initial=0, aps=[p0:(OR (LT s284 1) (LT s366 1)), p1:(OR (AND (GEQ s284 1) (GEQ s366 1)) (NOT (AND (GEQ s102 7) (GEQ s111 1) (GEQ s437 1) (GEQ s462 1) (GEQ s572 1)))), p2:...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 17 steps with 0 reset in 0 ms.
FORMULA PolyORBNT-PT-S10J30-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBNT-PT-S10J30-LTLFireability-14 finished in 9812 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)&&F((G(p1)||G(p2))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
[2023-03-15 18:23:03] [INFO ] Flatten gal took : 102 ms
[2023-03-15 18:23:03] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2023-03-15 18:23:03] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 664 places, 1325 transitions and 8384 arcs took 8 ms.
Total runtime 319952 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT PolyORBNT-PT-S10J30
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability

BK_STOP 1678905039739

--------------------
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/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:544
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: LAUNCH task # 8 (type EXCL) for 7 PolyORBNT-PT-S10J30-LTLFireability-10
lola: time limit : 1200 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-S10J30-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 5/1200 1/32 PolyORBNT-PT-S10J30-LTLFireability-10 54755 m, 10951 m/sec, 99513 t fired, .

Time elapsed: 5 secs. Pages in use: 1
# 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-S10J30-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 10/1200 2/32 PolyORBNT-PT-S10J30-LTLFireability-10 124582 m, 13965 m/sec, 213706 t fired, .

Time elapsed: 10 secs. Pages in use: 2
# 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-S10J30-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 15/1200 3/32 PolyORBNT-PT-S10J30-LTLFireability-10 185421 m, 12167 m/sec, 330892 t fired, .

Time elapsed: 15 secs. Pages in use: 3
# 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-S10J30-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 20/1200 3/32 PolyORBNT-PT-S10J30-LTLFireability-10 235258 m, 9967 m/sec, 436534 t fired, .

Time elapsed: 20 secs. Pages in use: 3
# 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-S10J30-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 25/1200 4/32 PolyORBNT-PT-S10J30-LTLFireability-10 294317 m, 11811 m/sec, 539697 t fired, .

Time elapsed: 25 secs. Pages in use: 4
# 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-S10J30-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 30/1200 5/32 PolyORBNT-PT-S10J30-LTLFireability-10 353685 m, 11873 m/sec, 647849 t fired, .

Time elapsed: 30 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-S10J30-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 35/1200 6/32 PolyORBNT-PT-S10J30-LTLFireability-10 416893 m, 12641 m/sec, 765699 t fired, .

Time elapsed: 35 secs. Pages in use: 6
# 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-S10J30-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 40/1200 6/32 PolyORBNT-PT-S10J30-LTLFireability-10 469876 m, 10596 m/sec, 871787 t fired, .

Time elapsed: 40 secs. Pages in use: 6
# 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-S10J30-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 45/1200 7/32 PolyORBNT-PT-S10J30-LTLFireability-10 528563 m, 11737 m/sec, 974641 t fired, .

Time elapsed: 45 secs. Pages in use: 7
# 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-S10J30-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 50/1200 7/32 PolyORBNT-PT-S10J30-LTLFireability-10 587114 m, 11710 m/sec, 1079593 t fired, .

Time elapsed: 50 secs. Pages in use: 7
# 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-S10J30-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 55/1200 8/32 PolyORBNT-PT-S10J30-LTLFireability-10 646553 m, 11887 m/sec, 1194870 t fired, .

Time elapsed: 55 secs. Pages in use: 8
# 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-S10J30-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 60/1200 9/32 PolyORBNT-PT-S10J30-LTLFireability-10 703991 m, 11487 m/sec, 1305885 t fired, .

Time elapsed: 60 secs. Pages in use: 9
# 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-S10J30-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 65/1200 9/32 PolyORBNT-PT-S10J30-LTLFireability-10 761753 m, 11552 m/sec, 1408505 t fired, .

Time elapsed: 65 secs. Pages in use: 9
# 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-S10J30-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 70/1200 10/32 PolyORBNT-PT-S10J30-LTLFireability-10 826118 m, 12873 m/sec, 1523170 t fired, .

Time elapsed: 70 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-S10J30-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 75/1200 11/32 PolyORBNT-PT-S10J30-LTLFireability-10 878392 m, 10454 m/sec, 1637478 t fired, .

Time elapsed: 75 secs. Pages in use: 11
# 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-S10J30-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 80/1200 11/32 PolyORBNT-PT-S10J30-LTLFireability-10 937418 m, 11805 m/sec, 1739802 t fired, .

Time elapsed: 80 secs. Pages in use: 11
# 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-S10J30-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 85/1200 12/32 PolyORBNT-PT-S10J30-LTLFireability-10 995793 m, 11675 m/sec, 1843541 t fired, .

Time elapsed: 85 secs. Pages in use: 12
# 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-S10J30-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 90/1200 13/32 PolyORBNT-PT-S10J30-LTLFireability-10 1054271 m, 11695 m/sec, 1950760 t fired, .

Time elapsed: 90 secs. Pages in use: 13
# 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-S10J30-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 95/1200 13/32 PolyORBNT-PT-S10J30-LTLFireability-10 1111870 m, 11519 m/sec, 2070613 t fired, .

Time elapsed: 95 secs. Pages in use: 13
# 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-S10J30-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 100/1200 14/32 PolyORBNT-PT-S10J30-LTLFireability-10 1170115 m, 11649 m/sec, 2173080 t fired, .

Time elapsed: 100 secs. Pages in use: 14
# 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-S10J30-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 105/1200 15/32 PolyORBNT-PT-S10J30-LTLFireability-10 1228739 m, 11724 m/sec, 2278524 t fired, .

Time elapsed: 105 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-S10J30-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 110/1200 16/32 PolyORBNT-PT-S10J30-LTLFireability-10 1287834 m, 11819 m/sec, 2397807 t fired, .

Time elapsed: 110 secs. Pages in use: 16
# 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-S10J30-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 115/1200 16/32 PolyORBNT-PT-S10J30-LTLFireability-10 1344645 m, 11362 m/sec, 2503773 t fired, .

Time elapsed: 115 secs. Pages in use: 16
# 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-S10J30-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 120/1200 17/32 PolyORBNT-PT-S10J30-LTLFireability-10 1402260 m, 11523 m/sec, 2608309 t fired, .

Time elapsed: 120 secs. Pages in use: 17
# 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-S10J30-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 125/1200 18/32 PolyORBNT-PT-S10J30-LTLFireability-10 1467987 m, 13145 m/sec, 2729907 t fired, .

Time elapsed: 125 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-S10J30-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 130/1200 18/32 PolyORBNT-PT-S10J30-LTLFireability-10 1519451 m, 10292 m/sec, 2835341 t fired, .

Time elapsed: 130 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-S10J30-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 135/1200 19/32 PolyORBNT-PT-S10J30-LTLFireability-10 1576806 m, 11471 m/sec, 2936422 t fired, .

Time elapsed: 135 secs. Pages in use: 19
# 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-S10J30-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 140/1200 20/32 PolyORBNT-PT-S10J30-LTLFireability-10 1636819 m, 12002 m/sec, 3045276 t fired, .

Time elapsed: 140 secs. Pages in use: 20
# 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-S10J30-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 145/1200 20/32 PolyORBNT-PT-S10J30-LTLFireability-10 1689912 m, 10618 m/sec, 3159086 t fired, .

Time elapsed: 145 secs. Pages in use: 20
# 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-S10J30-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 150/1200 21/32 PolyORBNT-PT-S10J30-LTLFireability-10 1746414 m, 11300 m/sec, 3258965 t fired, .

Time elapsed: 150 secs. Pages in use: 21
# 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-S10J30-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 155/1200 22/32 PolyORBNT-PT-S10J30-LTLFireability-10 1803393 m, 11395 m/sec, 3362069 t fired, .

Time elapsed: 155 secs. Pages in use: 22
# 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-S10J30-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 160/1200 22/32 PolyORBNT-PT-S10J30-LTLFireability-10 1859450 m, 11211 m/sec, 3481914 t fired, .

Time elapsed: 160 secs. Pages in use: 22
# 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-S10J30-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 165/1200 23/32 PolyORBNT-PT-S10J30-LTLFireability-10 1916674 m, 11444 m/sec, 3582462 t fired, .

Time elapsed: 165 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-S10J30-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 170/1200 24/32 PolyORBNT-PT-S10J30-LTLFireability-10 1974236 m, 11512 m/sec, 3685662 t fired, .

Time elapsed: 170 secs. Pages in use: 24
# 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-S10J30-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 175/1200 24/32 PolyORBNT-PT-S10J30-LTLFireability-10 2030457 m, 11244 m/sec, 3803242 t fired, .

Time elapsed: 175 secs. Pages in use: 24
# 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-S10J30-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 180/1200 25/32 PolyORBNT-PT-S10J30-LTLFireability-10 2087699 m, 11448 m/sec, 3909968 t fired, .

Time elapsed: 180 secs. Pages in use: 25
# 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-S10J30-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 185/1200 26/32 PolyORBNT-PT-S10J30-LTLFireability-10 2152860 m, 13032 m/sec, 4021136 t fired, .

Time elapsed: 185 secs. Pages in use: 26
# 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-S10J30-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 190/1200 26/32 PolyORBNT-PT-S10J30-LTLFireability-10 2202216 m, 9871 m/sec, 4128526 t fired, .

Time elapsed: 190 secs. Pages in use: 26
# 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-S10J30-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 195/1200 27/32 PolyORBNT-PT-S10J30-LTLFireability-10 2258980 m, 11352 m/sec, 4232806 t fired, .

Time elapsed: 195 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-S10J30-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 200/1200 27/32 PolyORBNT-PT-S10J30-LTLFireability-10 2316482 m, 11500 m/sec, 4335866 t fired, .

Time elapsed: 200 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-S10J30-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 205/1200 28/32 PolyORBNT-PT-S10J30-LTLFireability-10 2374202 m, 11544 m/sec, 4449584 t fired, .

Time elapsed: 205 secs. Pages in use: 28
# 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-S10J30-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 210/1200 29/32 PolyORBNT-PT-S10J30-LTLFireability-10 2430209 m, 11201 m/sec, 4561721 t fired, .

Time elapsed: 210 secs. Pages in use: 29
# 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-S10J30-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 215/1200 29/32 PolyORBNT-PT-S10J30-LTLFireability-10 2496592 m, 13276 m/sec, 4674155 t fired, .

Time elapsed: 215 secs. Pages in use: 29
# 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-S10J30-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 220/1200 30/32 PolyORBNT-PT-S10J30-LTLFireability-10 2547490 m, 10179 m/sec, 4783191 t fired, .

Time elapsed: 220 secs. Pages in use: 30
# 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-S10J30-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 225/1200 31/32 PolyORBNT-PT-S10J30-LTLFireability-10 2604787 m, 11459 m/sec, 4892749 t fired, .

Time elapsed: 225 secs. Pages in use: 31
# 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-S10J30-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 230/1200 32/32 PolyORBNT-PT-S10J30-LTLFireability-10 2671036 m, 13249 m/sec, 5008436 t fired, .

Time elapsed: 230 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-S10J30-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
8 LTL EXCL 235/1200 32/32 PolyORBNT-PT-S10J30-LTLFireability-10 2719903 m, 9773 m/sec, 5116712 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
PolyORBNT-PT-S10J30-LTLFireability-00: CONJ 0 2 0 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 240 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 3 (type EXCL) for 0 PolyORBNT-PT-S10J30-LTLFireability-00
lola: time limit : 1680 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-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 5/1680 2/32 PolyORBNT-PT-S10J30-LTLFireability-00 134435 m, 26887 m/sec, 356072 t fired, .

Time elapsed: 245 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-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 10/1680 4/32 PolyORBNT-PT-S10J30-LTLFireability-00 305878 m, 34288 m/sec, 826043 t fired, .

Time elapsed: 250 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-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 15/1680 6/32 PolyORBNT-PT-S10J30-LTLFireability-00 465189 m, 31862 m/sec, 1225902 t fired, .

Time elapsed: 255 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-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 20/1680 8/32 PolyORBNT-PT-S10J30-LTLFireability-00 602925 m, 27547 m/sec, 1632402 t fired, .

Time elapsed: 260 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-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 25/1680 9/32 PolyORBNT-PT-S10J30-LTLFireability-00 699545 m, 19324 m/sec, 1936315 t fired, .

Time elapsed: 265 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-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 30/1680 10/32 PolyORBNT-PT-S10J30-LTLFireability-00 827092 m, 25509 m/sec, 2295580 t fired, .

Time elapsed: 270 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-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 35/1680 12/32 PolyORBNT-PT-S10J30-LTLFireability-00 966628 m, 27907 m/sec, 2663961 t fired, .

Time elapsed: 275 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-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 40/1680 14/32 PolyORBNT-PT-S10J30-LTLFireability-00 1107394 m, 28153 m/sec, 3073717 t fired, .

Time elapsed: 280 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-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 45/1680 15/32 PolyORBNT-PT-S10J30-LTLFireability-00 1264504 m, 31422 m/sec, 3477104 t fired, .

Time elapsed: 285 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-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 50/1680 17/32 PolyORBNT-PT-S10J30-LTLFireability-00 1386718 m, 24442 m/sec, 3857861 t fired, .

Time elapsed: 290 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-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 55/1680 18/32 PolyORBNT-PT-S10J30-LTLFireability-00 1508151 m, 24286 m/sec, 4209239 t fired, .

Time elapsed: 295 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-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 60/1680 20/32 PolyORBNT-PT-S10J30-LTLFireability-00 1646721 m, 27714 m/sec, 4573596 t fired, .

Time elapsed: 300 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-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 65/1680 21/32 PolyORBNT-PT-S10J30-LTLFireability-00 1784910 m, 27637 m/sec, 4944089 t fired, .

Time elapsed: 305 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-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 70/1680 23/32 PolyORBNT-PT-S10J30-LTLFireability-00 1920914 m, 27200 m/sec, 5314819 t fired, .

Time elapsed: 310 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-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 75/1680 24/32 PolyORBNT-PT-S10J30-LTLFireability-00 2056151 m, 27047 m/sec, 5718650 t fired, .

Time elapsed: 315 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-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 80/1680 26/32 PolyORBNT-PT-S10J30-LTLFireability-00 2187457 m, 26261 m/sec, 6118402 t fired, .

Time elapsed: 320 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-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 85/1680 27/32 PolyORBNT-PT-S10J30-LTLFireability-00 2325598 m, 27628 m/sec, 6480357 t fired, .

Time elapsed: 325 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-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 90/1680 29/32 PolyORBNT-PT-S10J30-LTLFireability-00 2468941 m, 28668 m/sec, 6867036 t fired, .

Time elapsed: 330 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-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 95/1680 31/32 PolyORBNT-PT-S10J30-LTLFireability-00 2614795 m, 29170 m/sec, 7274320 t fired, .

Time elapsed: 335 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-S10J30-LTLFireability-00: CONJ 0 1 1 0 2 0 0 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
3 LTL EXCL 100/1680 32/32 PolyORBNT-PT-S10J30-LTLFireability-00 2753829 m, 27806 m/sec, 7682208 t fired, .

Time elapsed: 340 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 3 (type EXCL) for PolyORBNT-PT-S10J30-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-S10J30-LTLFireability-00: CONJ 0 1 0 0 2 0 1 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 345 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 5 (type EXCL) for 0 PolyORBNT-PT-S10J30-LTLFireability-00
lola: time limit : 3255 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-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 5/3255 2/32 PolyORBNT-PT-S10J30-LTLFireability-00 122322 m, 24464 m/sec, 222309 t fired, .

Time elapsed: 350 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-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 10/3255 3/32 PolyORBNT-PT-S10J30-LTLFireability-00 247864 m, 25108 m/sec, 462496 t fired, .

Time elapsed: 355 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-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 15/3255 5/32 PolyORBNT-PT-S10J30-LTLFireability-00 374414 m, 25310 m/sec, 677719 t fired, .

Time elapsed: 360 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-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 20/3255 7/32 PolyORBNT-PT-S10J30-LTLFireability-00 514474 m, 28012 m/sec, 954028 t fired, .

Time elapsed: 365 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-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 25/3255 8/32 PolyORBNT-PT-S10J30-LTLFireability-00 651341 m, 27373 m/sec, 1217251 t fired, .

Time elapsed: 370 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-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 30/3255 10/32 PolyORBNT-PT-S10J30-LTLFireability-00 778393 m, 25410 m/sec, 1443757 t fired, .

Time elapsed: 375 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-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 35/3255 11/32 PolyORBNT-PT-S10J30-LTLFireability-00 911083 m, 26538 m/sec, 1698690 t fired, .

Time elapsed: 380 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-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 40/3255 13/32 PolyORBNT-PT-S10J30-LTLFireability-00 1030419 m, 23867 m/sec, 1916229 t fired, .

Time elapsed: 385 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-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 45/3255 14/32 PolyORBNT-PT-S10J30-LTLFireability-00 1162546 m, 26425 m/sec, 2168072 t fired, .

Time elapsed: 390 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-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 50/3255 16/32 PolyORBNT-PT-S10J30-LTLFireability-00 1292211 m, 25933 m/sec, 2415735 t fired, .

Time elapsed: 395 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-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 55/3255 17/32 PolyORBNT-PT-S10J30-LTLFireability-00 1422596 m, 26077 m/sec, 2646782 t fired, .

Time elapsed: 400 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-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 60/3255 19/32 PolyORBNT-PT-S10J30-LTLFireability-00 1552781 m, 26037 m/sec, 2902428 t fired, .

Time elapsed: 405 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-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 65/3255 20/32 PolyORBNT-PT-S10J30-LTLFireability-00 1678806 m, 25205 m/sec, 3144084 t fired, .

Time elapsed: 410 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-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 70/3255 22/32 PolyORBNT-PT-S10J30-LTLFireability-00 1799333 m, 24105 m/sec, 3361488 t fired, .

Time elapsed: 415 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-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 75/3255 23/32 PolyORBNT-PT-S10J30-LTLFireability-00 1930192 m, 26171 m/sec, 3613176 t fired, .

Time elapsed: 420 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-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 80/3255 25/32 PolyORBNT-PT-S10J30-LTLFireability-00 2058018 m, 25565 m/sec, 3859220 t fired, .

Time elapsed: 425 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-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 85/3255 26/32 PolyORBNT-PT-S10J30-LTLFireability-00 2176809 m, 23758 m/sec, 4082142 t fired, .

Time elapsed: 430 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-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 90/3255 27/32 PolyORBNT-PT-S10J30-LTLFireability-00 2299930 m, 24624 m/sec, 4309046 t fired, .

Time elapsed: 435 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-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 95/3255 29/32 PolyORBNT-PT-S10J30-LTLFireability-00 2431322 m, 26278 m/sec, 4565003 t fired, .

Time elapsed: 440 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-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 100/3255 30/32 PolyORBNT-PT-S10J30-LTLFireability-00 2553107 m, 24357 m/sec, 4798886 t fired, .

Time elapsed: 445 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-S10J30-LTLFireability-00: CONJ 0 0 1 0 2 0 1 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
5 LTL EXCL 105/3255 32/32 PolyORBNT-PT-S10J30-LTLFireability-00 2673276 m, 24033 m/sec, 5021197 t fired, .

Time elapsed: 450 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 5 (type EXCL) for PolyORBNT-PT-S10J30-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-S10J30-LTLFireability-00: CONJ 0 0 0 0 2 0 2 0
PolyORBNT-PT-S10J30-LTLFireability-10: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 455 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-S10J30-LTLFireability-00: CONJ unknown CONJ
PolyORBNT-PT-S10J30-LTLFireability-10: LTL unknown AGGR


Time elapsed: 455 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-S10J30"
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-S10J30, 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-167873948300764"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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