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.r231-tall-167856415700212.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 JoinFreeModules-PT-1000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r231-tall-167856415700212
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.5M
-rw-r--r-- 1 mcc users 6.0K Feb 25 11:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 25 11:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 11:55 CTLFireability.txt
-rw-r--r-- 1 mcc users 29K Feb 25 11:55 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 25 11:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Feb 25 11:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Feb 25 11:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K Feb 25 11:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 3.1M Mar 5 18:22 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 JoinFreeModules-PT-1000-LTLFireability-00
FORMULA_NAME JoinFreeModules-PT-1000-LTLFireability-01
FORMULA_NAME JoinFreeModules-PT-1000-LTLFireability-02
FORMULA_NAME JoinFreeModules-PT-1000-LTLFireability-03
FORMULA_NAME JoinFreeModules-PT-1000-LTLFireability-04
FORMULA_NAME JoinFreeModules-PT-1000-LTLFireability-05
FORMULA_NAME JoinFreeModules-PT-1000-LTLFireability-06
FORMULA_NAME JoinFreeModules-PT-1000-LTLFireability-07
FORMULA_NAME JoinFreeModules-PT-1000-LTLFireability-08
FORMULA_NAME JoinFreeModules-PT-1000-LTLFireability-09
FORMULA_NAME JoinFreeModules-PT-1000-LTLFireability-10
FORMULA_NAME JoinFreeModules-PT-1000-LTLFireability-11
FORMULA_NAME JoinFreeModules-PT-1000-LTLFireability-12
FORMULA_NAME JoinFreeModules-PT-1000-LTLFireability-13
FORMULA_NAME JoinFreeModules-PT-1000-LTLFireability-14
FORMULA_NAME JoinFreeModules-PT-1000-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679439091896

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=JoinFreeModules-PT-1000
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-21 22:51:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 22:51:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 22:51:33] [INFO ] Load time of PNML (sax parser for PT used): 267 ms
[2023-03-21 22:51:33] [INFO ] Transformed 5001 places.
[2023-03-21 22:51:33] [INFO ] Transformed 8001 transitions.
[2023-03-21 22:51:33] [INFO ] Parsed PT model containing 5001 places and 8001 transitions and 23002 arcs in 393 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-1000-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-1000-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-1000-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-1000-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-1000-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 555 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2023-03-21 22:51:34] [INFO ] Computed 1000 place invariants in 61 ms
[2023-03-21 22:51:39] [INFO ] Dead Transitions using invariants and state equation in 4654 ms found 0 transitions.
[2023-03-21 22:51:39] [INFO ] Invariant cache hit.
[2023-03-21 22:51:40] [INFO ] Implicit Places using invariants in 780 ms returned []
[2023-03-21 22:51:40] [INFO ] Invariant cache hit.
[2023-03-21 22:51:40] [INFO ] Implicit Places using invariants and state equation in 676 ms returned []
Implicit Place search using SMT with State Equation took 1471 ms to find 0 implicit places.
[2023-03-21 22:51:40] [INFO ] Invariant cache hit.
[2023-03-21 22:51:45] [INFO ] Dead Transitions using invariants and state equation in 4757 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11475 ms. Remains : 5000/5000 places, 8001/8001 transitions.
Support contains 28 out of 5000 places after structural reductions.
[2023-03-21 22:51:46] [INFO ] Flatten gal took : 374 ms
[2023-03-21 22:51:46] [INFO ] Flatten gal took : 217 ms
[2023-03-21 22:51:46] [INFO ] Input system was already deterministic with 8001 transitions.
Incomplete random walk after 10516 steps, including 2 resets, run finished after 512 ms. (steps per millisecond=20 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 71 ms. (steps per millisecond=14 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 45 ms. (steps per millisecond=22 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 46 ms. (steps per millisecond=21 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 73 ms. (steps per millisecond=13 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 55 ms. (steps per millisecond=18 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 54 ms. (steps per millisecond=18 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 52 ms. (steps per millisecond=19 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 53 ms. (steps per millisecond=18 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 47 ms. (steps per millisecond=21 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 43 ms. (steps per millisecond=23 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 44 ms. (steps per millisecond=22 ) properties (out of 23) seen :0
Probabilistic random walk after 31050 steps, saw 31029 distinct states, run finished after 3006 ms. (steps per millisecond=10 ) properties seen :2
Running SMT prover for 21 properties.
[2023-03-21 22:51:51] [INFO ] Invariant cache hit.
[2023-03-21 22:51:53] [INFO ] [Real]Absence check using 1000 positive place invariants in 224 ms returned sat
[2023-03-21 22:52:00] [INFO ] After 8987ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:21
[2023-03-21 22:52:02] [INFO ] [Nat]Absence check using 1000 positive place invariants in 251 ms returned sat
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.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
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-21 22:52:25] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 22:52:25] [INFO ] After 25021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:21
Fused 21 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 26 out of 5000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Graph (complete) has 12000 edges and 5000 vertex of which 125 are kept as prefixes of interest. Removing 4875 places using SCC suffix rule.12 ms
Discarding 4875 places :
Also discarding 7800 output transitions
Drop transitions removed 7800 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 125 transition count 200
Applied a total of 2 rules in 49 ms. Remains 125 /5000 variables (removed 4875) and now considering 200/8001 (removed 7801) transitions.
// Phase 1: matrix 200 rows 125 cols
[2023-03-21 22:52:25] [INFO ] Computed 25 place invariants in 1 ms
[2023-03-21 22:52:25] [INFO ] Dead Transitions using invariants and state equation in 77 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 128 ms. Remains : 125/5000 places, 200/8001 transitions.
Incomplete random walk after 10015 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=667 ) properties (out of 21) seen :5
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 14) 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 14) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 13) 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 13) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 12) 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 12) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 11) 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 11) 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 11) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 9) 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 9) seen :0
Running SMT prover for 9 properties.
[2023-03-21 22:52:25] [INFO ] Invariant cache hit.
[2023-03-21 22:52:25] [INFO ] [Real]Absence check using 25 positive place invariants in 4 ms returned sat
[2023-03-21 22:52:26] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-21 22:52:26] [INFO ] [Nat]Absence check using 25 positive place invariants in 4 ms returned sat
[2023-03-21 22:52:26] [INFO ] After 331ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-21 22:52:26] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-21 22:52:26] [INFO ] After 141ms SMT Verify possible using 25 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-21 22:52:26] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 4 ms to minimize.
[2023-03-21 22:52:26] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
[2023-03-21 22:52:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 86 ms
[2023-03-21 22:52:26] [INFO ] After 377ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 101 ms.
[2023-03-21 22:52:26] [INFO ] After 883ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Finished Parikh walk after 31 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=31 )
Parikh walk visited 9 properties in 2381 ms.
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)))'
Support contains 1 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 848 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2023-03-21 22:52:30] [INFO ] Computed 1000 place invariants in 24 ms
[2023-03-21 22:52:35] [INFO ] Dead Transitions using invariants and state equation in 4636 ms found 0 transitions.
[2023-03-21 22:52:35] [INFO ] Invariant cache hit.
[2023-03-21 22:52:36] [INFO ] Implicit Places using invariants in 978 ms returned []
[2023-03-21 22:52:36] [INFO ] Invariant cache hit.
[2023-03-21 22:52:37] [INFO ] Implicit Places using invariants and state equation in 666 ms returned []
Implicit Place search using SMT with State Equation took 1652 ms to find 0 implicit places.
[2023-03-21 22:52:38] [INFO ] Redundant transitions in 1060 ms returned []
[2023-03-21 22:52:38] [INFO ] Invariant cache hit.
[2023-03-21 22:52:42] [INFO ] Dead Transitions using invariants and state equation in 4613 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12820 ms. Remains : 5000/5000 places, 8001/8001 transitions.
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-1000-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s2794 5)], 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 0 steps with 0 reset in 3 ms.
FORMULA JoinFreeModules-PT-1000-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-1000-LTLFireability-02 finished in 13068 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 783 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
[2023-03-21 22:52:43] [INFO ] Invariant cache hit.
[2023-03-21 22:52:48] [INFO ] Dead Transitions using invariants and state equation in 4545 ms found 0 transitions.
[2023-03-21 22:52:48] [INFO ] Invariant cache hit.
[2023-03-21 22:52:48] [INFO ] Implicit Places using invariants in 680 ms returned []
[2023-03-21 22:52:48] [INFO ] Invariant cache hit.
[2023-03-21 22:52:49] [INFO ] Implicit Places using invariants and state equation in 669 ms returned []
Implicit Place search using SMT with State Equation took 1355 ms to find 0 implicit places.
[2023-03-21 22:52:50] [INFO ] Redundant transitions in 905 ms returned []
[2023-03-21 22:52:50] [INFO ] Invariant cache hit.
[2023-03-21 22:52:54] [INFO ] Dead Transitions using invariants and state equation in 4448 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12055 ms. Remains : 5000/5000 places, 8001/8001 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-1000-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s3785 5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-1000-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-1000-LTLFireability-03 finished in 12124 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 2 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 601 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
[2023-03-21 22:52:55] [INFO ] Invariant cache hit.
[2023-03-21 22:53:00] [INFO ] Dead Transitions using invariants and state equation in 4821 ms found 0 transitions.
[2023-03-21 22:53:00] [INFO ] Invariant cache hit.
[2023-03-21 22:53:01] [INFO ] Implicit Places using invariants in 708 ms returned []
[2023-03-21 22:53:01] [INFO ] Invariant cache hit.
[2023-03-21 22:53:01] [INFO ] Implicit Places using invariants and state equation in 705 ms returned []
Implicit Place search using SMT with State Equation took 1415 ms to find 0 implicit places.
[2023-03-21 22:53:02] [INFO ] Redundant transitions in 616 ms returned []
[2023-03-21 22:53:02] [INFO ] Invariant cache hit.
[2023-03-21 22:53:07] [INFO ] Dead Transitions using invariants and state equation in 4543 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12012 ms. Remains : 5000/5000 places, 8001/8001 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : JoinFreeModules-PT-1000-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s3677 2), p0:(GEQ s4961 2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration timeout after 20650 steps with 0 reset in 10003 ms.
Product exploration timeout after 19910 steps with 0 reset in 10005 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0))))]
Knowledge based reduction with 2 factoid took 148 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10515 steps, including 2 resets, run finished after 419 ms. (steps per millisecond=25 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 438 ms. (steps per millisecond=22 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 450 ms. (steps per millisecond=22 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-21 22:53:28] [INFO ] Invariant cache hit.
[2023-03-21 22:53:29] [INFO ] [Real]Absence check using 1000 positive place invariants in 235 ms returned sat
[2023-03-21 22:53:33] [INFO ] After 4597ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:53:34] [INFO ] [Nat]Absence check using 1000 positive place invariants in 229 ms returned sat
[2023-03-21 22:53:58] [INFO ] After 25010ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 5000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Graph (complete) has 12000 edges and 5000 vertex of which 10 are kept as prefixes of interest. Removing 4990 places using SCC suffix rule.8 ms
Discarding 4990 places :
Also discarding 7984 output transitions
Drop transitions removed 7984 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 16
Applied a total of 2 rules in 26 ms. Remains 10 /5000 variables (removed 4990) and now considering 16/8001 (removed 7985) transitions.
// Phase 1: matrix 16 rows 10 cols
[2023-03-21 22:53:58] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-21 22:53:58] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47 ms. Remains : 10/5000 places, 16/8001 transitions.
Finished random walk after 501 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=501 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 2 factoid took 185 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 611 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2023-03-21 22:53:59] [INFO ] Computed 1000 place invariants in 23 ms
[2023-03-21 22:54:04] [INFO ] Dead Transitions using invariants and state equation in 4674 ms found 0 transitions.
[2023-03-21 22:54:04] [INFO ] Invariant cache hit.
[2023-03-21 22:54:04] [INFO ] Implicit Places using invariants in 675 ms returned []
[2023-03-21 22:54:04] [INFO ] Invariant cache hit.
[2023-03-21 22:54:05] [INFO ] Implicit Places using invariants and state equation in 657 ms returned []
Implicit Place search using SMT with State Equation took 1334 ms to find 0 implicit places.
[2023-03-21 22:54:06] [INFO ] Redundant transitions in 887 ms returned []
[2023-03-21 22:54:06] [INFO ] Invariant cache hit.
[2023-03-21 22:54:11] [INFO ] Dead Transitions using invariants and state equation in 4585 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12108 ms. Remains : 5000/5000 places, 8001/8001 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10015 steps, including 2 resets, run finished after 377 ms. (steps per millisecond=26 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 423 ms. (steps per millisecond=23 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 421 ms. (steps per millisecond=23 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-21 22:54:12] [INFO ] Invariant cache hit.
[2023-03-21 22:54:13] [INFO ] [Real]Absence check using 1000 positive place invariants in 239 ms returned sat
[2023-03-21 22:54:17] [INFO ] After 4880ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 22:54:18] [INFO ] [Nat]Absence check using 1000 positive place invariants in 241 ms returned sat
[2023-03-21 22:54:42] [INFO ] After 25011ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 5000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Graph (complete) has 12000 edges and 5000 vertex of which 10 are kept as prefixes of interest. Removing 4990 places using SCC suffix rule.2 ms
Discarding 4990 places :
Also discarding 7984 output transitions
Drop transitions removed 7984 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 16
Applied a total of 2 rules in 13 ms. Remains 10 /5000 variables (removed 4990) and now considering 16/8001 (removed 7985) transitions.
// Phase 1: matrix 16 rows 10 cols
[2023-03-21 22:54:42] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-21 22:54:42] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 10/5000 places, 16/8001 transitions.
Finished random walk after 1001 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=500 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 2 factoid took 169 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration timeout after 20530 steps with 0 reset in 10005 ms.
Product exploration timeout after 19700 steps with 0 reset in 10007 ms.
Support contains 2 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 581 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2023-03-21 22:55:03] [INFO ] Computed 1000 place invariants in 22 ms
[2023-03-21 22:55:08] [INFO ] Dead Transitions using invariants and state equation in 4639 ms found 0 transitions.
[2023-03-21 22:55:08] [INFO ] Invariant cache hit.
[2023-03-21 22:55:08] [INFO ] Implicit Places using invariants in 633 ms returned []
[2023-03-21 22:55:08] [INFO ] Invariant cache hit.
[2023-03-21 22:55:09] [INFO ] Implicit Places using invariants and state equation in 632 ms returned []
Implicit Place search using SMT with State Equation took 1267 ms to find 0 implicit places.
[2023-03-21 22:55:10] [INFO ] Redundant transitions in 896 ms returned []
[2023-03-21 22:55:10] [INFO ] Invariant cache hit.
[2023-03-21 22:55:15] [INFO ] Dead Transitions using invariants and state equation in 4599 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11995 ms. Remains : 5000/5000 places, 8001/8001 transitions.
Treatment of property JoinFreeModules-PT-1000-LTLFireability-05 finished in 140570 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(F(p2))||p1)))))'
Support contains 4 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 582 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
[2023-03-21 22:55:16] [INFO ] Invariant cache hit.
[2023-03-21 22:55:20] [INFO ] Dead Transitions using invariants and state equation in 4276 ms found 0 transitions.
[2023-03-21 22:55:20] [INFO ] Invariant cache hit.
[2023-03-21 22:55:21] [INFO ] Implicit Places using invariants in 643 ms returned []
[2023-03-21 22:55:21] [INFO ] Invariant cache hit.
[2023-03-21 22:55:21] [INFO ] Implicit Places using invariants and state equation in 638 ms returned []
Implicit Place search using SMT with State Equation took 1282 ms to find 0 implicit places.
[2023-03-21 22:55:22] [INFO ] Redundant transitions in 905 ms returned []
[2023-03-21 22:55:22] [INFO ] Invariant cache hit.
[2023-03-21 22:55:27] [INFO ] Dead Transitions using invariants and state equation in 4635 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11694 ms. Remains : 5000/5000 places, 8001/8001 transitions.
Stuttering acceptance computed with spot in 106 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : JoinFreeModules-PT-1000-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s1574 5), p1:(OR (LT s58 4) (GEQ s3678 3)), p2:(LT s1160 5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA JoinFreeModules-PT-1000-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-1000-LTLFireability-06 finished in 11834 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 215 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
[2023-03-21 22:55:27] [INFO ] Invariant cache hit.
[2023-03-21 22:55:32] [INFO ] Dead Transitions using invariants and state equation in 4721 ms found 0 transitions.
[2023-03-21 22:55:32] [INFO ] Invariant cache hit.
[2023-03-21 22:55:33] [INFO ] Implicit Places using invariants in 698 ms returned []
[2023-03-21 22:55:33] [INFO ] Invariant cache hit.
[2023-03-21 22:55:33] [INFO ] Implicit Places using invariants and state equation in 693 ms returned []
Implicit Place search using SMT with State Equation took 1392 ms to find 0 implicit places.
[2023-03-21 22:55:33] [INFO ] Invariant cache hit.
[2023-03-21 22:55:38] [INFO ] Dead Transitions using invariants and state equation in 4855 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11185 ms. Remains : 5000/5000 places, 8001/8001 transitions.
Stuttering acceptance computed with spot in 81 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-1000-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (GEQ s4984 5) (AND (LT s4984 5) (LT s4615 3) (GEQ s4313 3)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-1000-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-1000-LTLFireability-07 finished in 11292 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||X(G(p2)))))'
Support contains 5 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 228 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
[2023-03-21 22:55:38] [INFO ] Invariant cache hit.
[2023-03-21 22:55:43] [INFO ] Dead Transitions using invariants and state equation in 4616 ms found 0 transitions.
[2023-03-21 22:55:43] [INFO ] Invariant cache hit.
[2023-03-21 22:55:44] [INFO ] Implicit Places using invariants in 641 ms returned []
[2023-03-21 22:55:44] [INFO ] Invariant cache hit.
[2023-03-21 22:55:44] [INFO ] Implicit Places using invariants and state equation in 637 ms returned []
Implicit Place search using SMT with State Equation took 1279 ms to find 0 implicit places.
[2023-03-21 22:55:44] [INFO ] Invariant cache hit.
[2023-03-21 22:55:49] [INFO ] Dead Transitions using invariants and state equation in 4638 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10762 ms. Remains : 5000/5000 places, 8001/8001 transitions.
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : JoinFreeModules-PT-1000-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (GEQ s160 3) (GEQ s2788 3)), p2:(AND (GEQ s3683 4) (GEQ s1343 3)), p1:(AND (GEQ s1721 2) (GEQ s160 3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-1000-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-1000-LTLFireability-08 finished in 10919 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||F((p1&&G(!p0)))))'
Support contains 2 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 212 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
[2023-03-21 22:55:49] [INFO ] Invariant cache hit.
[2023-03-21 22:55:54] [INFO ] Dead Transitions using invariants and state equation in 4653 ms found 0 transitions.
[2023-03-21 22:55:54] [INFO ] Invariant cache hit.
[2023-03-21 22:55:55] [INFO ] Implicit Places using invariants in 637 ms returned []
[2023-03-21 22:55:55] [INFO ] Invariant cache hit.
[2023-03-21 22:55:55] [INFO ] Implicit Places using invariants and state equation in 641 ms returned []
Implicit Place search using SMT with State Equation took 1282 ms to find 0 implicit places.
[2023-03-21 22:55:55] [INFO ] Invariant cache hit.
[2023-03-21 22:56:00] [INFO ] Dead Transitions using invariants and state equation in 4664 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10813 ms. Remains : 5000/5000 places, 8001/8001 transitions.
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), false, (AND (NOT p1) (NOT p0)), false, (OR (NOT p1) p0), p0]
Running random walk in product with property : JoinFreeModules-PT-1000-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) p0), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(OR (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p0), acceptance={} source=4 dest: 6}], [{ cond=(OR (NOT p1) p0), acceptance={0} source=5 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={0} source=6 dest: 5}, { cond=(NOT p0), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(LT s3530 5), p0:(GEQ s4515 5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration timeout after 20570 steps with 0 reset in 10002 ms.
Product exploration timeout after 19910 steps with 0 reset in 10007 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (OR (NOT p1) p0))), (X (NOT p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 144 ms. Reduced automaton from 7 states, 13 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[false, false, false, (OR (NOT p1) p0), p0]
Incomplete random walk after 10515 steps, including 2 resets, run finished after 399 ms. (steps per millisecond=26 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 434 ms. (steps per millisecond=23 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 432 ms. (steps per millisecond=23 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 423 ms. (steps per millisecond=23 ) properties (out of 3) seen :0
Probabilistic random walk after 42071 steps, saw 42042 distinct states, run finished after 3006 ms. (steps per millisecond=13 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-21 22:56:26] [INFO ] Invariant cache hit.
[2023-03-21 22:56:26] [INFO ] [Real]Absence check using 1000 positive place invariants in 228 ms returned sat
[2023-03-21 22:56:31] [INFO ] After 5477ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 22:56:32] [INFO ] [Nat]Absence check using 1000 positive place invariants in 236 ms returned sat
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.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 22:56:56] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 22:56:56] [INFO ] After 25021ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 5000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Graph (complete) has 12000 edges and 5000 vertex of which 10 are kept as prefixes of interest. Removing 4990 places using SCC suffix rule.4 ms
Discarding 4990 places :
Also discarding 7984 output transitions
Drop transitions removed 7984 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 16
Applied a total of 2 rules in 17 ms. Remains 10 /5000 variables (removed 4990) and now considering 16/8001 (removed 7985) transitions.
// Phase 1: matrix 16 rows 10 cols
[2023-03-21 22:56:56] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-21 22:56:56] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 10/5000 places, 16/8001 transitions.
Finished random walk after 2503 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=834 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (AND p1 (NOT p0))), (X (NOT (OR (NOT p1) p0))), (X (NOT p0))]
False Knowledge obtained : [(F p0), (F (NOT (AND p1 (NOT p0)))), (F (OR (NOT p1) p0))]
Knowledge based reduction with 4 factoid took 205 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[false, false, false, (OR (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 186 ms :[false, false, false, (OR (NOT p1) p0), p0]
Support contains 2 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 273 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2023-03-21 22:56:57] [INFO ] Computed 1000 place invariants in 19 ms
[2023-03-21 22:57:02] [INFO ] Dead Transitions using invariants and state equation in 4824 ms found 0 transitions.
[2023-03-21 22:57:02] [INFO ] Invariant cache hit.
[2023-03-21 22:57:02] [INFO ] Implicit Places using invariants in 639 ms returned []
[2023-03-21 22:57:02] [INFO ] Invariant cache hit.
[2023-03-21 22:57:03] [INFO ] Implicit Places using invariants and state equation in 671 ms returned []
Implicit Place search using SMT with State Equation took 1312 ms to find 0 implicit places.
[2023-03-21 22:57:03] [INFO ] Invariant cache hit.
[2023-03-21 22:57:08] [INFO ] Dead Transitions using invariants and state equation in 4737 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11150 ms. Remains : 5000/5000 places, 8001/8001 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 47 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[false, false, false, (OR (NOT p1) p0), p0]
Incomplete random walk after 10515 steps, including 2 resets, run finished after 413 ms. (steps per millisecond=25 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 449 ms. (steps per millisecond=22 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 419 ms. (steps per millisecond=23 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 465 ms. (steps per millisecond=21 ) properties (out of 3) seen :0
Probabilistic random walk after 43076 steps, saw 43045 distinct states, run finished after 3047 ms. (steps per millisecond=14 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-21 22:57:13] [INFO ] Invariant cache hit.
[2023-03-21 22:57:14] [INFO ] [Real]Absence check using 1000 positive place invariants in 229 ms returned sat
[2023-03-21 22:57:19] [INFO ] After 5465ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-21 22:57:19] [INFO ] [Nat]Absence check using 1000 positive place invariants in 235 ms returned sat
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.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:631)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-21 22:57:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 22:57:44] [INFO ] After 25028ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 5000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Graph (complete) has 12000 edges and 5000 vertex of which 10 are kept as prefixes of interest. Removing 4990 places using SCC suffix rule.3 ms
Discarding 4990 places :
Also discarding 7984 output transitions
Drop transitions removed 7984 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 10 transition count 16
Applied a total of 2 rules in 14 ms. Remains 10 /5000 variables (removed 4990) and now considering 16/8001 (removed 7985) transitions.
// Phase 1: matrix 16 rows 10 cols
[2023-03-21 22:57:44] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-21 22:57:44] [INFO ] Dead Transitions using invariants and state equation in 20 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 10/5000 places, 16/8001 transitions.
Finished random walk after 2016 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=1008 )
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p0) p1))), (F (OR p0 (NOT p1)))]
Knowledge based reduction with 1 factoid took 106 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[false, false, false, (OR (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 167 ms :[false, false, false, (OR (NOT p1) p0), p0]
Stuttering acceptance computed with spot in 171 ms :[false, false, false, (OR (NOT p1) p0), p0]
Product exploration timeout after 20840 steps with 0 reset in 10001 ms.
Product exploration timeout after 20160 steps with 0 reset in 10004 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 192 ms :[false, false, false, (OR (NOT p1) p0), p0]
Support contains 2 out of 5000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 712 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
// Phase 1: matrix 8001 rows 5000 cols
[2023-03-21 22:58:05] [INFO ] Computed 1000 place invariants in 20 ms
[2023-03-21 22:58:10] [INFO ] Dead Transitions using invariants and state equation in 4603 ms found 0 transitions.
[2023-03-21 22:58:11] [INFO ] Redundant transitions in 914 ms returned []
[2023-03-21 22:58:11] [INFO ] Invariant cache hit.
[2023-03-21 22:58:15] [INFO ] Dead Transitions using invariants and state equation in 4598 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10835 ms. Remains : 5000/5000 places, 8001/8001 transitions.
Support contains 2 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 190 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
[2023-03-21 22:58:16] [INFO ] Invariant cache hit.
[2023-03-21 22:58:20] [INFO ] Dead Transitions using invariants and state equation in 4526 ms found 0 transitions.
[2023-03-21 22:58:20] [INFO ] Invariant cache hit.
[2023-03-21 22:58:21] [INFO ] Implicit Places using invariants in 635 ms returned []
[2023-03-21 22:58:21] [INFO ] Invariant cache hit.
[2023-03-21 22:58:22] [INFO ] Implicit Places using invariants and state equation in 678 ms returned []
Implicit Place search using SMT with State Equation took 1315 ms to find 0 implicit places.
[2023-03-21 22:58:22] [INFO ] Invariant cache hit.
[2023-03-21 22:58:26] [INFO ] Dead Transitions using invariants and state equation in 4633 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10666 ms. Remains : 5000/5000 places, 8001/8001 transitions.
Treatment of property JoinFreeModules-PT-1000-LTLFireability-09 finished in 157186 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)&&G(p2))))'
Support contains 3 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 201 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
[2023-03-21 22:58:27] [INFO ] Invariant cache hit.
[2023-03-21 22:58:31] [INFO ] Dead Transitions using invariants and state equation in 4218 ms found 0 transitions.
[2023-03-21 22:58:31] [INFO ] Invariant cache hit.
[2023-03-21 22:58:31] [INFO ] Implicit Places using invariants in 614 ms returned []
[2023-03-21 22:58:31] [INFO ] Invariant cache hit.
[2023-03-21 22:58:32] [INFO ] Implicit Places using invariants and state equation in 655 ms returned []
Implicit Place search using SMT with State Equation took 1273 ms to find 0 implicit places.
[2023-03-21 22:58:32] [INFO ] Invariant cache hit.
[2023-03-21 22:58:37] [INFO ] Dead Transitions using invariants and state equation in 4569 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10262 ms. Remains : 5000/5000 places, 8001/8001 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2))]
Running random walk in product with property : JoinFreeModules-PT-1000-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p2), acceptance={0} source=3 dest: 0}, { cond=(OR (AND (NOT p1) (NOT p0)) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p2:(GEQ s2457 2), p1:(GEQ s3814 5), p0:(OR (GEQ s3814 5) (GEQ s3968 3))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA JoinFreeModules-PT-1000-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-1000-LTLFireability-10 finished in 10432 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 202 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
[2023-03-21 22:58:37] [INFO ] Invariant cache hit.
[2023-03-21 22:58:42] [INFO ] Dead Transitions using invariants and state equation in 4933 ms found 0 transitions.
[2023-03-21 22:58:42] [INFO ] Invariant cache hit.
[2023-03-21 22:58:43] [INFO ] Implicit Places using invariants in 688 ms returned []
[2023-03-21 22:58:43] [INFO ] Invariant cache hit.
[2023-03-21 22:58:43] [INFO ] Implicit Places using invariants and state equation in 628 ms returned []
Implicit Place search using SMT with State Equation took 1317 ms to find 0 implicit places.
[2023-03-21 22:58:43] [INFO ] Invariant cache hit.
[2023-03-21 22:58:47] [INFO ] Dead Transitions using invariants and state equation in 4210 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10665 ms. Remains : 5000/5000 places, 8001/8001 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-1000-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s1738 3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-1000-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-1000-LTLFireability-12 finished in 10771 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((F((X(p0) U p1))&&F(p2))))'
Support contains 2 out of 5000 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 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 588 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
[2023-03-21 22:58:48] [INFO ] Invariant cache hit.
[2023-03-21 22:58:53] [INFO ] Dead Transitions using invariants and state equation in 4845 ms found 0 transitions.
[2023-03-21 22:58:53] [INFO ] Invariant cache hit.
[2023-03-21 22:58:54] [INFO ] Implicit Places using invariants in 692 ms returned []
[2023-03-21 22:58:54] [INFO ] Invariant cache hit.
[2023-03-21 22:58:54] [INFO ] Implicit Places using invariants and state equation in 636 ms returned []
Implicit Place search using SMT with State Equation took 1331 ms to find 0 implicit places.
[2023-03-21 22:58:55] [INFO ] Redundant transitions in 888 ms returned []
[2023-03-21 22:58:55] [INFO ] Invariant cache hit.
[2023-03-21 22:59:00] [INFO ] Dead Transitions using invariants and state equation in 4616 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12279 ms. Remains : 5000/5000 places, 8001/8001 transitions.
Stuttering acceptance computed with spot in 123 ms :[(NOT p1), (NOT p2), (OR (NOT p2) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-1000-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(GEQ s2200 3), p2:(GEQ s585 5)], 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, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-1000-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-1000-LTLFireability-13 finished in 12435 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((X((p1 U X(p2)))||p0)))'
Support contains 3 out of 5000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5000/5000 places, 8001/8001 transitions.
Applied a total of 0 rules in 208 ms. Remains 5000 /5000 variables (removed 0) and now considering 8001/8001 (removed 0) transitions.
[2023-03-21 22:59:00] [INFO ] Invariant cache hit.
[2023-03-21 22:59:05] [INFO ] Dead Transitions using invariants and state equation in 4545 ms found 0 transitions.
[2023-03-21 22:59:05] [INFO ] Invariant cache hit.
[2023-03-21 22:59:05] [INFO ] Implicit Places using invariants in 627 ms returned []
[2023-03-21 22:59:05] [INFO ] Invariant cache hit.
[2023-03-21 22:59:06] [INFO ] Implicit Places using invariants and state equation in 631 ms returned []
Implicit Place search using SMT with State Equation took 1260 ms to find 0 implicit places.
[2023-03-21 22:59:06] [INFO ] Invariant cache hit.
[2023-03-21 22:59:10] [INFO ] Dead Transitions using invariants and state equation in 4301 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10315 ms. Remains : 5000/5000 places, 8001/8001 transitions.
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (NOT p2), true]
Running random walk in product with property : JoinFreeModules-PT-1000-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=p1, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (GEQ s4513 3) (AND (GEQ s850 3) (GEQ s2381 2))), p1:(GEQ s850 3), p2:(GEQ s4513 3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-1000-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-1000-LTLFireability-14 finished in 10572 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0))||F((p1&&G(!p0)))))'
[2023-03-21 22:59:11] [INFO ] Flatten gal took : 171 ms
[2023-03-21 22:59:11] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-21 22:59:11] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 5000 places, 8001 transitions and 23000 arcs took 34 ms.
Total runtime 458098 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT JoinFreeModules-PT-1000
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/375
LTLFireability

BK_STOP 1679439688914

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/375/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/375/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/375/LTLFireability.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 4 (type EXCL) for 3 JoinFreeModules-PT-1000-LTLFireability-09
lola: time limit : 1797 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
JoinFreeModules-PT-1000-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-1000-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 0/1797 2/32 JoinFreeModules-PT-1000-LTLFireability-09 7505 m, 1501 m/sec, 10494 t fired, .

Time elapsed: 6 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
JoinFreeModules-PT-1000-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-1000-LTLFireability-09: LTL 0 0 1 0 1 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/1797 25/32 JoinFreeModules-PT-1000-LTLFireability-09 92142 m, 16927 m/sec, 130992 t fired, .

Time elapsed: 11 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for JoinFreeModules-PT-1000-LTLFireability-09 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-1000-LTLFireability-05: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-1000-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 16 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 1 (type EXCL) for 0 JoinFreeModules-PT-1000-LTLFireability-05
lola: time limit : 3584 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
JoinFreeModules-PT-1000-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-1000-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/3584 3/32 JoinFreeModules-PT-1000-LTLFireability-05 8112 m, 1622 m/sec, 9114 t fired, .

Time elapsed: 21 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
JoinFreeModules-PT-1000-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-1000-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/3584 5/32 JoinFreeModules-PT-1000-LTLFireability-05 16122 m, 1602 m/sec, 18147 t fired, .

Time elapsed: 26 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
JoinFreeModules-PT-1000-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-1000-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/3584 6/32 JoinFreeModules-PT-1000-LTLFireability-05 24305 m, 1636 m/sec, 27368 t fired, .

Time elapsed: 31 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
JoinFreeModules-PT-1000-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-1000-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/3584 8/32 JoinFreeModules-PT-1000-LTLFireability-05 32509 m, 1640 m/sec, 36610 t fired, .

Time elapsed: 36 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
JoinFreeModules-PT-1000-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-1000-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/3584 10/32 JoinFreeModules-PT-1000-LTLFireability-05 40782 m, 1654 m/sec, 45935 t fired, .

Time elapsed: 41 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
JoinFreeModules-PT-1000-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-1000-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/3584 11/32 JoinFreeModules-PT-1000-LTLFireability-05 49045 m, 1652 m/sec, 55244 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-1000-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-1000-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/3584 13/32 JoinFreeModules-PT-1000-LTLFireability-05 57303 m, 1651 m/sec, 64549 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-1000-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-1000-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/3584 14/32 JoinFreeModules-PT-1000-LTLFireability-05 65573 m, 1654 m/sec, 73864 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-1000-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-1000-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 45/3584 15/32 JoinFreeModules-PT-1000-LTLFireability-05 73839 m, 1653 m/sec, 83175 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-1000-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-1000-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 50/3584 17/32 JoinFreeModules-PT-1000-LTLFireability-05 82129 m, 1658 m/sec, 92520 t fired, .

Time elapsed: 66 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
JoinFreeModules-PT-1000-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-1000-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 55/3584 18/32 JoinFreeModules-PT-1000-LTLFireability-05 90409 m, 1656 m/sec, 101850 t fired, .

Time elapsed: 71 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
JoinFreeModules-PT-1000-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-1000-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 60/3584 19/32 JoinFreeModules-PT-1000-LTLFireability-05 98710 m, 1660 m/sec, 111214 t fired, .

Time elapsed: 76 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
JoinFreeModules-PT-1000-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-1000-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 65/3584 20/32 JoinFreeModules-PT-1000-LTLFireability-05 106662 m, 1590 m/sec, 120167 t fired, .

Time elapsed: 81 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
JoinFreeModules-PT-1000-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-1000-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 70/3584 22/32 JoinFreeModules-PT-1000-LTLFireability-05 114608 m, 1589 m/sec, 129115 t fired, .

Time elapsed: 86 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
JoinFreeModules-PT-1000-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-1000-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 75/3584 23/32 JoinFreeModules-PT-1000-LTLFireability-05 122590 m, 1596 m/sec, 138106 t fired, .

Time elapsed: 91 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
JoinFreeModules-PT-1000-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-1000-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 80/3584 24/32 JoinFreeModules-PT-1000-LTLFireability-05 130497 m, 1581 m/sec, 147010 t fired, .

Time elapsed: 96 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
JoinFreeModules-PT-1000-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-1000-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 85/3584 25/32 JoinFreeModules-PT-1000-LTLFireability-05 138440 m, 1588 m/sec, 155955 t fired, .

Time elapsed: 101 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
JoinFreeModules-PT-1000-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-1000-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 90/3584 26/32 JoinFreeModules-PT-1000-LTLFireability-05 146575 m, 1627 m/sec, 165118 t fired, .

Time elapsed: 106 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
JoinFreeModules-PT-1000-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-1000-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 95/3584 27/32 JoinFreeModules-PT-1000-LTLFireability-05 154769 m, 1638 m/sec, 174343 t fired, .

Time elapsed: 111 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
JoinFreeModules-PT-1000-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-1000-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 100/3584 28/32 JoinFreeModules-PT-1000-LTLFireability-05 162695 m, 1585 m/sec, 183274 t fired, .

Time elapsed: 116 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
JoinFreeModules-PT-1000-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-1000-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 105/3584 30/32 JoinFreeModules-PT-1000-LTLFireability-05 170738 m, 1608 m/sec, 192330 t fired, .

Time elapsed: 121 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
JoinFreeModules-PT-1000-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-1000-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 110/3584 31/32 JoinFreeModules-PT-1000-LTLFireability-05 178804 m, 1613 m/sec, 201414 t fired, .

Time elapsed: 126 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
JoinFreeModules-PT-1000-LTLFireability-05: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-1000-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 115/3584 32/32 JoinFreeModules-PT-1000-LTLFireability-05 186939 m, 1627 m/sec, 210582 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-1000-LTLFireability-05: LTL 0 0 0 0 1 0 1 0
JoinFreeModules-PT-1000-LTLFireability-09: LTL 0 0 0 0 1 0 1 0

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

Time elapsed: 136 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
JoinFreeModules-PT-1000-LTLFireability-05: LTL unknown AGGR
JoinFreeModules-PT-1000-LTLFireability-09: LTL unknown AGGR


Time elapsed: 136 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="JoinFreeModules-PT-1000"
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 JoinFreeModules-PT-1000, 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 r231-tall-167856415700212"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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