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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 6.6M
-rw-r--r-- 1 mcc users 6.0K Feb 25 11:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 25 11:58 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 25 11:56 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 11:56 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.4K Feb 25 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 12:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 67K Feb 25 12:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Feb 25 12:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 12:00 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 6.2M 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-2000-LTLFireability-00
FORMULA_NAME JoinFreeModules-PT-2000-LTLFireability-01
FORMULA_NAME JoinFreeModules-PT-2000-LTLFireability-02
FORMULA_NAME JoinFreeModules-PT-2000-LTLFireability-03
FORMULA_NAME JoinFreeModules-PT-2000-LTLFireability-04
FORMULA_NAME JoinFreeModules-PT-2000-LTLFireability-05
FORMULA_NAME JoinFreeModules-PT-2000-LTLFireability-06
FORMULA_NAME JoinFreeModules-PT-2000-LTLFireability-07
FORMULA_NAME JoinFreeModules-PT-2000-LTLFireability-08
FORMULA_NAME JoinFreeModules-PT-2000-LTLFireability-09
FORMULA_NAME JoinFreeModules-PT-2000-LTLFireability-10
FORMULA_NAME JoinFreeModules-PT-2000-LTLFireability-11
FORMULA_NAME JoinFreeModules-PT-2000-LTLFireability-12
FORMULA_NAME JoinFreeModules-PT-2000-LTLFireability-13
FORMULA_NAME JoinFreeModules-PT-2000-LTLFireability-14
FORMULA_NAME JoinFreeModules-PT-2000-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679439848973

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-2000
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-21 23:04:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 23:04:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 23:04:10] [INFO ] Load time of PNML (sax parser for PT used): 414 ms
[2023-03-21 23:04:10] [INFO ] Transformed 10001 places.
[2023-03-21 23:04:11] [INFO ] Transformed 16001 transitions.
[2023-03-21 23:04:11] [INFO ] Parsed PT model containing 10001 places and 16001 transitions and 46002 arcs in 603 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-2000-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-2000-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 1382 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2023-03-21 23:04:12] [INFO ] Computed 2000 place invariants in 94 ms
[2023-03-21 23:04:14] [INFO ] Dead Transitions using invariants and state equation in 1471 ms found 0 transitions.
[2023-03-21 23:04:14] [INFO ] Invariant cache hit.
[2023-03-21 23:04:15] [INFO ] Implicit Places using invariants in 1617 ms returned []
Implicit Place search using SMT only with invariants took 1619 ms to find 0 implicit places.
[2023-03-21 23:04:15] [INFO ] Invariant cache hit.
[2023-03-21 23:04:16] [INFO ] Dead Transitions using invariants and state equation in 814 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5320 ms. Remains : 10000/10000 places, 16001/16001 transitions.
Support contains 24 out of 10000 places after structural reductions.
[2023-03-21 23:04:17] [INFO ] Flatten gal took : 544 ms
[2023-03-21 23:04:17] [INFO ] Flatten gal took : 379 ms
[2023-03-21 23:04:18] [INFO ] Input system was already deterministic with 16001 transitions.
Support contains 23 out of 10000 places (down from 24) after GAL structural reductions.
Incomplete random walk after 10008 steps, including 2 resets, run finished after 817 ms. (steps per millisecond=12 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 90 ms. (steps per millisecond=11 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 89 ms. (steps per millisecond=11 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 89 ms. (steps per millisecond=11 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 88 ms. (steps per millisecond=11 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 124 ms. (steps per millisecond=8 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 111 ms. (steps per millisecond=9 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 104 ms. (steps per millisecond=9 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 104 ms. (steps per millisecond=9 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 105 ms. (steps per millisecond=9 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 140 ms. (steps per millisecond=7 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 113 ms. (steps per millisecond=8 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 113 ms. (steps per millisecond=8 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 105 ms. (steps per millisecond=9 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 105 ms. (steps per millisecond=9 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 105 ms. (steps per millisecond=9 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 104 ms. (steps per millisecond=9 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 107 ms. (steps per millisecond=9 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 112 ms. (steps per millisecond=8 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 105 ms. (steps per millisecond=9 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 105 ms. (steps per millisecond=9 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 91 ms. (steps per millisecond=11 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 101 ms. (steps per millisecond=9 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 95 ms. (steps per millisecond=10 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 89 ms. (steps per millisecond=11 ) properties (out of 24) seen :0
Probabilistic random walk after 58049 steps, saw 58028 distinct states, run finished after 9126 ms. (steps per millisecond=6 ) properties seen :5
Running SMT prover for 19 properties.
[2023-03-21 23:04:31] [INFO ] Invariant cache hit.
[2023-03-21 23:04:35] [INFO ] [Real]Absence check using 2000 positive place invariants in 658 ms returned sat
[2023-03-21 23:04:37] [INFO ] After 6580ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2023-03-21 23:04:41] [INFO ] [Nat]Absence check using 2000 positive place invariants in 662 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 23:05:02] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 23:05:02] [INFO ] After 25038ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:19
Fused 19 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 18 out of 10000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Graph (complete) has 24000 edges and 10000 vertex of which 90 are kept as prefixes of interest. Removing 9910 places using SCC suffix rule.22 ms
Discarding 9910 places :
Also discarding 15856 output transitions
Drop transitions removed 15856 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 90 transition count 144
Applied a total of 2 rules in 73 ms. Remains 90 /10000 variables (removed 9910) and now considering 144/16001 (removed 15857) transitions.
// Phase 1: matrix 144 rows 90 cols
[2023-03-21 23:05:02] [INFO ] Computed 18 place invariants in 0 ms
[2023-03-21 23:05:02] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 90/10000 places, 144/16001 transitions.
Incomplete random walk after 10009 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 19) seen :3
Incomplete Best-First random walk after 1000 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 14 ms. (steps per millisecond=71 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 15) seen :1
Incomplete Best-First random walk after 1000 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 3 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) 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 3 ms. (steps per millisecond=333 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 10) 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 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
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
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 23:05:03] [INFO ] Invariant cache hit.
[2023-03-21 23:05:03] [INFO ] [Real]Absence check using 18 positive place invariants in 2 ms returned sat
[2023-03-21 23:05:03] [INFO ] After 139ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:9
[2023-03-21 23:05:03] [INFO ] [Nat]Absence check using 18 positive place invariants in 2 ms returned sat
[2023-03-21 23:05:03] [INFO ] After 279ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :9
[2023-03-21 23:05:03] [INFO ] State equation strengthened by 18 read => feed constraints.
[2023-03-21 23:05:03] [INFO ] After 77ms SMT Verify possible using 18 Read/Feed constraints in natural domain returned unsat :0 sat :9
[2023-03-21 23:05:03] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 3 ms to minimize.
[2023-03-21 23:05:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2023-03-21 23:05:03] [INFO ] After 238ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :9
Attempting to minimize the solution found.
Minimization took 74 ms.
[2023-03-21 23:05:03] [INFO ] After 656ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :9
Finished Parikh walk after 356 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=178 )
Parikh walk visited 9 properties in 674 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' '!(X(G(p0)))'
Support contains 1 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 897 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2023-03-21 23:05:06] [INFO ] Computed 2000 place invariants in 36 ms
[2023-03-21 23:05:07] [INFO ] Dead Transitions using invariants and state equation in 901 ms found 0 transitions.
[2023-03-21 23:05:07] [INFO ] Invariant cache hit.
[2023-03-21 23:05:09] [INFO ] Implicit Places using invariants in 1839 ms returned []
Implicit Place search using SMT only with invariants took 1840 ms to find 0 implicit places.
[2023-03-21 23:05:09] [INFO ] Invariant cache hit.
[2023-03-21 23:05:10] [INFO ] Dead Transitions using invariants and state equation in 962 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4602 ms. Remains : 10000/10000 places, 16001/16001 transitions.
Stuttering acceptance computed with spot in 278 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-2000-LTLFireability-00 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:(LT s4027 2)], 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 8 ms.
FORMULA JoinFreeModules-PT-2000-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-2000-LTLFireability-00 finished in 4975 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 1018 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
[2023-03-21 23:05:11] [INFO ] Invariant cache hit.
[2023-03-21 23:05:12] [INFO ] Dead Transitions using invariants and state equation in 938 ms found 0 transitions.
[2023-03-21 23:05:12] [INFO ] Invariant cache hit.
[2023-03-21 23:05:14] [INFO ] Implicit Places using invariants in 1518 ms returned []
Implicit Place search using SMT only with invariants took 1519 ms to find 0 implicit places.
[2023-03-21 23:05:14] [INFO ] Invariant cache hit.
[2023-03-21 23:05:15] [INFO ] Dead Transitions using invariants and state equation in 851 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4334 ms. Remains : 10000/10000 places, 16001/16001 transitions.
Stuttering acceptance computed with spot in 156 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-2000-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(GEQ s9101 2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA JoinFreeModules-PT-2000-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-2000-LTLFireability-01 finished in 4547 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X((X(p1) U (p0&&X(p1)))))))'
Support contains 2 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 881 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
[2023-03-21 23:05:16] [INFO ] Invariant cache hit.
[2023-03-21 23:05:17] [INFO ] Dead Transitions using invariants and state equation in 842 ms found 0 transitions.
[2023-03-21 23:05:17] [INFO ] Invariant cache hit.
[2023-03-21 23:05:18] [INFO ] Implicit Places using invariants in 1484 ms returned []
Implicit Place search using SMT only with invariants took 1492 ms to find 0 implicit places.
[2023-03-21 23:05:18] [INFO ] Invariant cache hit.
[2023-03-21 23:05:19] [INFO ] Dead Transitions using invariants and state equation in 909 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4137 ms. Remains : 10000/10000 places, 16001/16001 transitions.
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (NOT p0), (OR (NOT p1) (NOT p0)), (NOT p1), true]
Running random walk in product with property : JoinFreeModules-PT-2000-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(LT s3817 2), p1:(LT s1449 5)], nbAcceptance=0, 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 2 ms.
FORMULA JoinFreeModules-PT-2000-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-2000-LTLFireability-02 finished in 4392 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(p1)))))'
Support contains 2 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 921 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
[2023-03-21 23:05:20] [INFO ] Invariant cache hit.
[2023-03-21 23:05:21] [INFO ] Dead Transitions using invariants and state equation in 944 ms found 0 transitions.
[2023-03-21 23:05:21] [INFO ] Invariant cache hit.
[2023-03-21 23:05:23] [INFO ] Implicit Places using invariants in 1517 ms returned []
Implicit Place search using SMT only with invariants took 1518 ms to find 0 implicit places.
[2023-03-21 23:05:23] [INFO ] Invariant cache hit.
[2023-03-21 23:05:24] [INFO ] Dead Transitions using invariants and state equation in 958 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4348 ms. Remains : 10000/10000 places, 16001/16001 transitions.
Stuttering acceptance computed with spot in 142 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-2000-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s6102 1), p1:(GEQ s8136 2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 6 ms.
FORMULA JoinFreeModules-PT-2000-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-2000-LTLFireability-03 finished in 4556 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((G(p0)||F(p1)))))'
Support contains 2 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 852 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
[2023-03-21 23:05:25] [INFO ] Invariant cache hit.
[2023-03-21 23:05:26] [INFO ] Dead Transitions using invariants and state equation in 838 ms found 0 transitions.
[2023-03-21 23:05:26] [INFO ] Invariant cache hit.
[2023-03-21 23:05:27] [INFO ] Implicit Places using invariants in 1487 ms returned []
Implicit Place search using SMT only with invariants took 1488 ms to find 0 implicit places.
[2023-03-21 23:05:27] [INFO ] Invariant cache hit.
[2023-03-21 23:05:28] [INFO ] Dead Transitions using invariants and state equation in 835 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4014 ms. Remains : 10000/10000 places, 16001/16001 transitions.
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-2000-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s2795 3) (LT s3622 1)), p1:(LT s2795 3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 12940 steps with 0 reset in 10004 ms.
Product exploration timeout after 12360 steps with 0 reset in 10006 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 85 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10010 steps, including 2 resets, run finished after 795 ms. (steps per millisecond=12 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 934 ms. (steps per millisecond=10 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 889 ms. (steps per millisecond=11 ) properties (out of 2) seen :0
Probabilistic random walk after 45034 steps, saw 45017 distinct states, run finished after 6033 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-21 23:05:58] [INFO ] Invariant cache hit.
[2023-03-21 23:06:00] [INFO ] [Real]Absence check using 2000 positive place invariants in 694 ms returned sat
[2023-03-21 23:06:19] [INFO ] After 20792ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 23:06:21] [INFO ] [Nat]Absence check using 2000 positive place invariants in 682 ms returned sat
[2023-03-21 23:06:44] [INFO ] After 22745ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 23:06:44] [INFO ] State equation strengthened by 2000 read => feed constraints.
[2023-03-21 23:06:44] [INFO ] After 192ms SMT Verify possible using 2000 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 23:06:44] [INFO ] After 194ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-21 23:06:44] [INFO ] After 25031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4008 ms.
Support contains 2 out of 10000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Graph (complete) has 24000 edges and 10000 vertex of which 10 are kept as prefixes of interest. Removing 9990 places using SCC suffix rule.7 ms
Discarding 9990 places :
Also discarding 15984 output transitions
Drop transitions removed 15984 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 52 ms. Remains 10 /10000 variables (removed 9990) and now considering 16/16001 (removed 15985) transitions.
// Phase 1: matrix 16 rows 10 cols
[2023-03-21 23:06:48] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-21 23:06:48] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 88 ms. Remains : 10/10000 places, 16/16001 transitions.
Incomplete random walk after 10233 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3411 ) properties (out of 2) seen :1
Finished Best-First random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 153 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 971 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2023-03-21 23:06:50] [INFO ] Computed 2000 place invariants in 46 ms
[2023-03-21 23:06:51] [INFO ] Dead Transitions using invariants and state equation in 910 ms found 0 transitions.
[2023-03-21 23:06:51] [INFO ] Invariant cache hit.
[2023-03-21 23:06:52] [INFO ] Implicit Places using invariants in 1472 ms returned []
Implicit Place search using SMT only with invariants took 1473 ms to find 0 implicit places.
[2023-03-21 23:06:52] [INFO ] Invariant cache hit.
[2023-03-21 23:06:53] [INFO ] Dead Transitions using invariants and state equation in 836 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4214 ms. Remains : 10000/10000 places, 16001/16001 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10008 steps, including 2 resets, run finished after 779 ms. (steps per millisecond=12 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 941 ms. (steps per millisecond=10 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 868 ms. (steps per millisecond=11 ) properties (out of 2) seen :0
Probabilistic random walk after 47034 steps, saw 47017 distinct states, run finished after 6108 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-21 23:07:03] [INFO ] Invariant cache hit.
[2023-03-21 23:07:05] [INFO ] [Real]Absence check using 2000 positive place invariants in 650 ms returned sat
[2023-03-21 23:07:20] [INFO ] After 16805ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 23:07:22] [INFO ] [Nat]Absence check using 2000 positive place invariants in 653 ms returned sat
[2023-03-21 23:07:45] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 10000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Graph (complete) has 24000 edges and 10000 vertex of which 10 are kept as prefixes of interest. Removing 9990 places using SCC suffix rule.4 ms
Discarding 9990 places :
Also discarding 15984 output transitions
Drop transitions removed 15984 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 28 ms. Remains 10 /10000 variables (removed 9990) and now considering 16/16001 (removed 15985) transitions.
// Phase 1: matrix 16 rows 10 cols
[2023-03-21 23:07:45] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-21 23:07:45] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 10/10000 places, 16/16001 transitions.
Finished random walk after 2706 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=1353 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 124 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration timeout after 15550 steps with 1 reset in 10003 ms.
Product exploration timeout after 13670 steps with 1 reset in 10005 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 3259 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2023-03-21 23:08:09] [INFO ] Computed 2000 place invariants in 85 ms
[2023-03-21 23:08:10] [INFO ] Dead Transitions using invariants and state equation in 920 ms found 0 transitions.
[2023-03-21 23:08:10] [INFO ] Invariant cache hit.
[2023-03-21 23:08:11] [INFO ] Dead Transitions using invariants and state equation in 843 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5029 ms. Remains : 10000/10000 places, 16001/16001 transitions.
Support contains 2 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 897 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
[2023-03-21 23:08:12] [INFO ] Invariant cache hit.
[2023-03-21 23:08:13] [INFO ] Dead Transitions using invariants and state equation in 854 ms found 0 transitions.
[2023-03-21 23:08:13] [INFO ] Invariant cache hit.
[2023-03-21 23:08:14] [INFO ] Implicit Places using invariants in 1472 ms returned []
Implicit Place search using SMT only with invariants took 1474 ms to find 0 implicit places.
[2023-03-21 23:08:14] [INFO ] Invariant cache hit.
[2023-03-21 23:08:15] [INFO ] Dead Transitions using invariants and state equation in 839 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4068 ms. Remains : 10000/10000 places, 16001/16001 transitions.
Treatment of property JoinFreeModules-PT-2000-LTLFireability-04 finished in 171639 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(X(F(p0))))&&(p1 U (p2||G(p1)))))'
Support contains 3 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 938 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
[2023-03-21 23:08:16] [INFO ] Invariant cache hit.
[2023-03-21 23:08:17] [INFO ] Dead Transitions using invariants and state equation in 825 ms found 0 transitions.
[2023-03-21 23:08:17] [INFO ] Invariant cache hit.
[2023-03-21 23:08:19] [INFO ] Implicit Places using invariants in 1500 ms returned []
Implicit Place search using SMT only with invariants took 1501 ms to find 0 implicit places.
[2023-03-21 23:08:19] [INFO ] Invariant cache hit.
[2023-03-21 23:08:20] [INFO ] Dead Transitions using invariants and state equation in 936 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4202 ms. Remains : 10000/10000 places, 16001/16001 transitions.
Stuttering acceptance computed with spot in 214 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-2000-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(OR p2 p1), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GEQ s7056 2) (LT s2593 3)), p1:(LT s2593 3), p0:(LT s2488 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, null][false, false, false, false, false, false]]
Product exploration timeout after 14800 steps with 4 reset in 10005 ms.
Entered a terminal (fully accepting) state of product in 6104 steps with 4 reset in 3811 ms.
FORMULA JoinFreeModules-PT-2000-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-2000-LTLFireability-05 finished in 18275 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 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 2697 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
[2023-03-21 23:08:36] [INFO ] Invariant cache hit.
[2023-03-21 23:08:37] [INFO ] Dead Transitions using invariants and state equation in 831 ms found 0 transitions.
[2023-03-21 23:08:37] [INFO ] Invariant cache hit.
[2023-03-21 23:08:39] [INFO ] Implicit Places using invariants in 1459 ms returned []
Implicit Place search using SMT only with invariants took 1460 ms to find 0 implicit places.
[2023-03-21 23:08:39] [INFO ] Invariant cache hit.
[2023-03-21 23:08:40] [INFO ] Dead Transitions using invariants and state equation in 849 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5841 ms. Remains : 10000/10000 places, 16001/16001 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-2000-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s290 5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration timeout after 13210 steps with 0 reset in 10008 ms.
Stack based approach found an accepted trace after 6859 steps with 0 reset with depth 6860 and stack size 4078 in 4587 ms.
FORMULA JoinFreeModules-PT-2000-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property JoinFreeModules-PT-2000-LTLFireability-06 finished in 20510 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||G(p1)))))'
Support contains 2 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 907 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
[2023-03-21 23:08:55] [INFO ] Invariant cache hit.
[2023-03-21 23:08:56] [INFO ] Dead Transitions using invariants and state equation in 885 ms found 0 transitions.
[2023-03-21 23:08:56] [INFO ] Invariant cache hit.
[2023-03-21 23:08:58] [INFO ] Implicit Places using invariants in 1474 ms returned []
Implicit Place search using SMT only with invariants took 1476 ms to find 0 implicit places.
[2023-03-21 23:08:58] [INFO ] Invariant cache hit.
[2023-03-21 23:08:58] [INFO ] Dead Transitions using invariants and state equation in 841 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4111 ms. Remains : 10000/10000 places, 16001/16001 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : JoinFreeModules-PT-2000-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(GEQ s6178 4), p0:(GEQ s1700 5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 3 ms.
FORMULA JoinFreeModules-PT-2000-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-2000-LTLFireability-08 finished in 4232 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&X(X(G(p1))))))'
Support contains 2 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 2680 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
[2023-03-21 23:09:01] [INFO ] Invariant cache hit.
[2023-03-21 23:09:02] [INFO ] Dead Transitions using invariants and state equation in 854 ms found 0 transitions.
[2023-03-21 23:09:02] [INFO ] Invariant cache hit.
[2023-03-21 23:09:04] [INFO ] Implicit Places using invariants in 1526 ms returned []
Implicit Place search using SMT only with invariants took 1528 ms to find 0 implicit places.
[2023-03-21 23:09:04] [INFO ] Invariant cache hit.
[2023-03-21 23:09:04] [INFO ] Dead Transitions using invariants and state equation in 838 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5901 ms. Remains : 10000/10000 places, 16001/16001 transitions.
Stuttering acceptance computed with spot in 226 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-2000-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0, 1} source=0 dest: 0}, { cond=p0, acceptance={1} source=0 dest: 1}, { cond=p0, acceptance={0, 1} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 0}, { cond=p0, acceptance={1} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0, 1} source=2 dest: 3}, { cond=p0, acceptance={1} source=2 dest: 4}, { cond=p0, acceptance={0, 1} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=3 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={} source=3 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={1} source=4 dest: 1}], [{ cond=(AND (NOT p0) p1), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=5 dest: 3}, { cond=(AND p0 p1), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={1} source=5 dest: 4}, { cond=(AND p0 p1), acceptance={0} source=5 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={0, 1} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s1780 5), p1:(GEQ s5456 2)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA JoinFreeModules-PT-2000-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-2000-LTLFireability-10 finished in 6173 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||F((G(F(p1))||(F(p1)&&G(!p2))))))))'
Support contains 2 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 2725 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
[2023-03-21 23:09:07] [INFO ] Invariant cache hit.
[2023-03-21 23:09:08] [INFO ] Dead Transitions using invariants and state equation in 847 ms found 0 transitions.
[2023-03-21 23:09:08] [INFO ] Invariant cache hit.
[2023-03-21 23:09:10] [INFO ] Implicit Places using invariants in 1586 ms returned []
Implicit Place search using SMT only with invariants took 1587 ms to find 0 implicit places.
[2023-03-21 23:09:10] [INFO ] Invariant cache hit.
[2023-03-21 23:09:11] [INFO ] Dead Transitions using invariants and state equation in 849 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6011 ms. Remains : 10000/10000 places, 16001/16001 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-2000-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s2983 4), p1:(LT s3678 4)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration timeout after 15510 steps with 1 reset in 10008 ms.
Product exploration timeout after 12820 steps with 0 reset in 10009 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 115 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 57 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10008 steps, including 2 resets, run finished after 830 ms. (steps per millisecond=12 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 949 ms. (steps per millisecond=10 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 916 ms. (steps per millisecond=10 ) properties (out of 2) seen :0
Probabilistic random walk after 45034 steps, saw 45017 distinct states, run finished after 6120 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-21 23:09:41] [INFO ] Invariant cache hit.
[2023-03-21 23:09:43] [INFO ] [Real]Absence check using 2000 positive place invariants in 703 ms returned sat
[2023-03-21 23:09:57] [INFO ] After 15835ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 23:09:58] [INFO ] [Nat]Absence check using 2000 positive place invariants in 674 ms returned sat
[2023-03-21 23:10:15] [INFO ] After 16637ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 23:10:15] [INFO ] State equation strengthened by 2000 read => feed constraints.
[2023-03-21 23:10:17] [INFO ] After 1272ms SMT Verify possible using 2000 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-21 23:10:20] [INFO ] Deduced a trap composed of 3 places in 3093 ms of which 4 ms to minimize.
[2023-03-21 23:10:24] [INFO ] Deduced a trap composed of 3 places in 3314 ms of which 5 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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 23:10:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 23:10:24] [INFO ] After 26980ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 4007 ms.
Support contains 2 out of 10000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Graph (complete) has 24000 edges and 10000 vertex of which 10 are kept as prefixes of interest. Removing 9990 places using SCC suffix rule.3 ms
Discarding 9990 places :
Also discarding 15984 output transitions
Drop transitions removed 15984 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 /10000 variables (removed 9990) and now considering 16/16001 (removed 15985) transitions.
// Phase 1: matrix 16 rows 10 cols
[2023-03-21 23:10:28] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-21 23:10:28] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 10/10000 places, 16/16001 transitions.
Incomplete random walk after 10064 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3354 ) properties (out of 2) seen :1
Finished Best-First random walk after 46 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=46 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 149 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 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 2615 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2023-03-21 23:10:31] [INFO ] Computed 2000 place invariants in 34 ms
[2023-03-21 23:10:32] [INFO ] Dead Transitions using invariants and state equation in 902 ms found 0 transitions.
[2023-03-21 23:10:32] [INFO ] Invariant cache hit.
[2023-03-21 23:10:33] [INFO ] Implicit Places using invariants in 1495 ms returned []
Implicit Place search using SMT only with invariants took 1496 ms to find 0 implicit places.
[2023-03-21 23:10:33] [INFO ] Invariant cache hit.
[2023-03-21 23:10:34] [INFO ] Dead Transitions using invariants and state equation in 846 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5865 ms. Remains : 10000/10000 places, 16001/16001 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)))), (X (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 127 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 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10010 steps, including 2 resets, run finished after 874 ms. (steps per millisecond=11 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 952 ms. (steps per millisecond=10 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 940 ms. (steps per millisecond=10 ) properties (out of 2) seen :0
Probabilistic random walk after 45034 steps, saw 45017 distinct states, run finished after 6066 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-21 23:10:44] [INFO ] Invariant cache hit.
[2023-03-21 23:10:46] [INFO ] [Real]Absence check using 2000 positive place invariants in 652 ms returned sat
[2023-03-21 23:11:00] [INFO ] After 15627ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 23:11:01] [INFO ] [Nat]Absence check using 2000 positive place invariants in 650 ms returned sat
[2023-03-21 23:11:22] [INFO ] After 20479ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 23:11:22] [INFO ] State equation strengthened by 2000 read => feed constraints.
[2023-03-21 23:11:24] [INFO ] After 1908ms SMT Verify possible using 2000 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-21 23:11:28] [INFO ] Deduced a trap composed of 3 places in 3133 ms of which 10 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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 23:11:28] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 23:11:28] [INFO ] After 27819ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 4003 ms.
Support contains 2 out of 10000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Graph (complete) has 24000 edges and 10000 vertex of which 10 are kept as prefixes of interest. Removing 9990 places using SCC suffix rule.3 ms
Discarding 9990 places :
Also discarding 15984 output transitions
Drop transitions removed 15984 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 23 ms. Remains 10 /10000 variables (removed 9990) and now considering 16/16001 (removed 15985) transitions.
// Phase 1: matrix 16 rows 10 cols
[2023-03-21 23:11:32] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-21 23:11:32] [INFO ] Dead Transitions using invariants and state equation in 23 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 10/10000 places, 16/16001 transitions.
Incomplete random walk after 11663 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2915 ) properties (out of 2) seen :1
Finished Best-First random walk after 46 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=46 )
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 144 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 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration timeout after 15250 steps with 1 reset in 10001 ms.
Product exploration timeout after 14430 steps with 1 reset in 10007 ms.
Support contains 2 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 2763 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2023-03-21 23:11:55] [INFO ] Computed 2000 place invariants in 28 ms
[2023-03-21 23:11:56] [INFO ] Dead Transitions using invariants and state equation in 891 ms found 0 transitions.
[2023-03-21 23:11:56] [INFO ] Invariant cache hit.
[2023-03-21 23:11:57] [INFO ] Implicit Places using invariants in 1533 ms returned []
Implicit Place search using SMT only with invariants took 1534 ms to find 0 implicit places.
[2023-03-21 23:11:57] [INFO ] Invariant cache hit.
[2023-03-21 23:11:58] [INFO ] Dead Transitions using invariants and state equation in 846 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6042 ms. Remains : 10000/10000 places, 16001/16001 transitions.
Treatment of property JoinFreeModules-PT-2000-LTLFireability-11 finished in 173710 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(G((X(p0)||F(p1)))))))'
Support contains 2 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 923 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
[2023-03-21 23:11:59] [INFO ] Invariant cache hit.
[2023-03-21 23:12:00] [INFO ] Dead Transitions using invariants and state equation in 846 ms found 0 transitions.
[2023-03-21 23:12:00] [INFO ] Invariant cache hit.
[2023-03-21 23:12:02] [INFO ] Implicit Places using invariants in 1499 ms returned []
Implicit Place search using SMT only with invariants took 1500 ms to find 0 implicit places.
[2023-03-21 23:12:02] [INFO ] Invariant cache hit.
[2023-03-21 23:12:03] [INFO ] Dead Transitions using invariants and state equation in 860 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4134 ms. Remains : 10000/10000 places, 16001/16001 transitions.
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-2000-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LT s2360 5), p1:(LT s3790 5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 13480 steps with 0 reset in 10009 ms.
Product exploration timeout after 12930 steps with 0 reset in 10001 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0)]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 11009 steps, including 2 resets, run finished after 916 ms. (steps per millisecond=12 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1025 ms. (steps per millisecond=9 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 908 ms. (steps per millisecond=11 ) properties (out of 2) seen :0
Probabilistic random walk after 43028 steps, saw 43013 distinct states, run finished after 6143 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-21 23:12:33] [INFO ] Invariant cache hit.
[2023-03-21 23:12:35] [INFO ] [Real]Absence check using 2000 positive place invariants in 651 ms returned sat
[2023-03-21 23:12:48] [INFO ] After 15471ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 23:12:50] [INFO ] [Nat]Absence check using 2000 positive place invariants in 647 ms returned sat
[2023-03-21 23:13:14] [INFO ] After 23189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 23:13:14] [INFO ] State equation strengthened by 2000 read => feed constraints.
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.verifyPossible(DeadlockTester.java:642)
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 23:13:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 23:13:14] [INFO ] After 25123ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 2001 ms.
Support contains 2 out of 10000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Graph (complete) has 24000 edges and 10000 vertex of which 10 are kept as prefixes of interest. Removing 9990 places using SCC suffix rule.3 ms
Discarding 9990 places :
Also discarding 15984 output transitions
Drop transitions removed 15984 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 12 ms. Remains 10 /10000 variables (removed 9990) and now considering 16/16001 (removed 15985) transitions.
// Phase 1: matrix 16 rows 10 cols
[2023-03-21 23:13:16] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-21 23:13:16] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 10/10000 places, 16/16001 transitions.
Incomplete random walk after 10661 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3553 ) properties (out of 2) seen :1
Finished Best-First random walk after 180 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=180 )
Knowledge obtained : [(AND p0 p1), (X p0)]
False Knowledge obtained : [(F (AND (NOT p1) (NOT p0))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 2 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 2581 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2023-03-21 23:13:19] [INFO ] Computed 2000 place invariants in 42 ms
[2023-03-21 23:13:19] [INFO ] Dead Transitions using invariants and state equation in 877 ms found 0 transitions.
[2023-03-21 23:13:19] [INFO ] Invariant cache hit.
[2023-03-21 23:13:21] [INFO ] Implicit Places using invariants in 1591 ms returned []
Implicit Place search using SMT only with invariants took 1592 ms to find 0 implicit places.
[2023-03-21 23:13:21] [INFO ] Invariant cache hit.
[2023-03-21 23:13:22] [INFO ] Dead Transitions using invariants and state equation in 833 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5888 ms. Remains : 10000/10000 places, 16001/16001 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 92 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10009 steps, including 2 resets, run finished after 852 ms. (steps per millisecond=11 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 954 ms. (steps per millisecond=10 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 969 ms. (steps per millisecond=10 ) properties (out of 2) seen :0
Probabilistic random walk after 44028 steps, saw 44012 distinct states, run finished after 6049 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-21 23:13:32] [INFO ] Invariant cache hit.
[2023-03-21 23:13:34] [INFO ] [Real]Absence check using 2000 positive place invariants in 664 ms returned sat
[2023-03-21 23:13:47] [INFO ] After 14835ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 23:13:48] [INFO ] [Nat]Absence check using 2000 positive place invariants in 626 ms returned sat
[2023-03-21 23:14:10] [INFO ] After 21676ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 23:14:10] [INFO ] State equation strengthened by 2000 read => feed constraints.
[2023-03-21 23:14:11] [INFO ] After 954ms SMT Verify possible using 2000 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 23:14:15] [INFO ] Deduced a trap composed of 3 places in 3219 ms of which 3 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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 23:14:15] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 23:14:15] [INFO ] After 28062ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 2001 ms.
Support contains 2 out of 10000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Graph (complete) has 24000 edges and 10000 vertex of which 10 are kept as prefixes of interest. Removing 9990 places using SCC suffix rule.3 ms
Discarding 9990 places :
Also discarding 15984 output transitions
Drop transitions removed 15984 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 12 ms. Remains 10 /10000 variables (removed 9990) and now considering 16/16001 (removed 15985) transitions.
// Phase 1: matrix 16 rows 10 cols
[2023-03-21 23:14:17] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-21 23:14:17] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 10/10000 places, 16/16001 transitions.
Finished random walk after 2988 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=1494 )
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 2 factoid took 94 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter insensitive) to 3 states, 5 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration timeout after 13420 steps with 0 reset in 10002 ms.
Product exploration timeout after 12890 steps with 0 reset in 10009 ms.
Support contains 2 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 2572 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2023-03-21 23:14:40] [INFO ] Computed 2000 place invariants in 25 ms
[2023-03-21 23:14:41] [INFO ] Dead Transitions using invariants and state equation in 862 ms found 0 transitions.
[2023-03-21 23:14:41] [INFO ] Invariant cache hit.
[2023-03-21 23:14:42] [INFO ] Implicit Places using invariants in 1452 ms returned []
Implicit Place search using SMT only with invariants took 1453 ms to find 0 implicit places.
[2023-03-21 23:14:42] [INFO ] Invariant cache hit.
[2023-03-21 23:14:43] [INFO ] Dead Transitions using invariants and state equation in 827 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5720 ms. Remains : 10000/10000 places, 16001/16001 transitions.
Treatment of property JoinFreeModules-PT-2000-LTLFireability-12 finished in 164930 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 878 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
[2023-03-21 23:14:44] [INFO ] Invariant cache hit.
[2023-03-21 23:14:45] [INFO ] Dead Transitions using invariants and state equation in 854 ms found 0 transitions.
[2023-03-21 23:14:45] [INFO ] Invariant cache hit.
[2023-03-21 23:14:47] [INFO ] Implicit Places using invariants in 1442 ms returned []
Implicit Place search using SMT only with invariants took 1442 ms to find 0 implicit places.
[2023-03-21 23:14:47] [INFO ] Invariant cache hit.
[2023-03-21 23:14:47] [INFO ] Dead Transitions using invariants and state equation in 815 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3990 ms. Remains : 10000/10000 places, 16001/16001 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-2000-LTLFireability-13 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:(LT s5967 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA JoinFreeModules-PT-2000-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-2000-LTLFireability-13 finished in 4131 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 1 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 850 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
[2023-03-21 23:14:48] [INFO ] Invariant cache hit.
[2023-03-21 23:14:49] [INFO ] Dead Transitions using invariants and state equation in 830 ms found 0 transitions.
[2023-03-21 23:14:49] [INFO ] Invariant cache hit.
[2023-03-21 23:14:51] [INFO ] Implicit Places using invariants in 1451 ms returned []
Implicit Place search using SMT only with invariants took 1452 ms to find 0 implicit places.
[2023-03-21 23:14:51] [INFO ] Invariant cache hit.
[2023-03-21 23:14:51] [INFO ] Dead Transitions using invariants and state equation in 838 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3974 ms. Remains : 10000/10000 places, 16001/16001 transitions.
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-2000-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LT s5887 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA JoinFreeModules-PT-2000-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-2000-LTLFireability-14 finished in 4129 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 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 841 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
[2023-03-21 23:14:52] [INFO ] Invariant cache hit.
[2023-03-21 23:14:53] [INFO ] Dead Transitions using invariants and state equation in 885 ms found 0 transitions.
[2023-03-21 23:14:53] [INFO ] Invariant cache hit.
[2023-03-21 23:14:55] [INFO ] Implicit Places using invariants in 1465 ms returned []
Implicit Place search using SMT only with invariants took 1466 ms to find 0 implicit places.
[2023-03-21 23:14:55] [INFO ] Invariant cache hit.
[2023-03-21 23:14:56] [INFO ] Dead Transitions using invariants and state equation in 830 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4024 ms. Remains : 10000/10000 places, 16001/16001 transitions.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-2000-LTLFireability-15 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 s9998 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-2000-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-2000-LTLFireability-15 finished in 4131 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((G(p0)||F(p1)))))'
Found a Lengthening insensitive property : JoinFreeModules-PT-2000-LTLFireability-04
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 2617 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
[2023-03-21 23:14:59] [INFO ] Invariant cache hit.
[2023-03-21 23:14:59] [INFO ] Dead Transitions using invariants and state equation in 841 ms found 0 transitions.
[2023-03-21 23:14:59] [INFO ] Invariant cache hit.
[2023-03-21 23:15:01] [INFO ] Implicit Places using invariants in 1525 ms returned []
Implicit Place search using SMT only with invariants took 1526 ms to find 0 implicit places.
[2023-03-21 23:15:01] [INFO ] Invariant cache hit.
[2023-03-21 23:15:02] [INFO ] Dead Transitions using invariants and state equation in 948 ms found 0 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 5935 ms. Remains : 10000/10000 places, 16001/16001 transitions.
Running random walk in product with property : JoinFreeModules-PT-2000-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s2795 3) (LT s3622 1)), p1:(LT s2795 3)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 13030 steps with 0 reset in 10006 ms.
Product exploration timeout after 12550 steps with 0 reset in 10008 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 79 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10008 steps, including 2 resets, run finished after 867 ms. (steps per millisecond=11 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 1104 ms. (steps per millisecond=9 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 937 ms. (steps per millisecond=10 ) properties (out of 2) seen :0
Probabilistic random walk after 43028 steps, saw 43013 distinct states, run finished after 6014 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-21 23:15:32] [INFO ] Invariant cache hit.
[2023-03-21 23:15:34] [INFO ] [Real]Absence check using 2000 positive place invariants in 670 ms returned sat
[2023-03-21 23:15:47] [INFO ] After 14422ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 23:15:48] [INFO ] [Nat]Absence check using 2000 positive place invariants in 631 ms returned sat
[2023-03-21 23:16:12] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 10000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Graph (complete) has 24000 edges and 10000 vertex of which 10 are kept as prefixes of interest. Removing 9990 places using SCC suffix rule.3 ms
Discarding 9990 places :
Also discarding 15984 output transitions
Drop transitions removed 15984 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 12 ms. Remains 10 /10000 variables (removed 9990) and now considering 16/16001 (removed 15985) transitions.
// Phase 1: matrix 16 rows 10 cols
[2023-03-21 23:16:12] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-21 23:16:12] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 10/10000 places, 16/16001 transitions.
Incomplete random walk after 10823 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2164 ) properties (out of 2) seen :1
Finished Best-First random walk after 11 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=11 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 915 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2023-03-21 23:16:13] [INFO ] Computed 2000 place invariants in 28 ms
[2023-03-21 23:16:14] [INFO ] Dead Transitions using invariants and state equation in 837 ms found 0 transitions.
[2023-03-21 23:16:14] [INFO ] Invariant cache hit.
[2023-03-21 23:16:15] [INFO ] Implicit Places using invariants in 1415 ms returned []
Implicit Place search using SMT only with invariants took 1416 ms to find 0 implicit places.
[2023-03-21 23:16:15] [INFO ] Invariant cache hit.
[2023-03-21 23:16:16] [INFO ] Dead Transitions using invariants and state equation in 832 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4002 ms. Remains : 10000/10000 places, 16001/16001 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 11009 steps, including 2 resets, run finished after 914 ms. (steps per millisecond=12 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 960 ms. (steps per millisecond=10 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 890 ms. (steps per millisecond=11 ) properties (out of 2) seen :0
Probabilistic random walk after 45034 steps, saw 45017 distinct states, run finished after 6024 ms. (steps per millisecond=7 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-21 23:16:26] [INFO ] Invariant cache hit.
[2023-03-21 23:16:28] [INFO ] [Real]Absence check using 2000 positive place invariants in 684 ms returned sat
[2023-03-21 23:16:41] [INFO ] After 14824ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-21 23:16:43] [INFO ] [Nat]Absence check using 2000 positive place invariants in 640 ms returned sat
[2023-03-21 23:17:01] [INFO ] After 18027ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-21 23:17:01] [INFO ] State equation strengthened by 2000 read => feed constraints.
[2023-03-21 23:17:02] [INFO ] After 1111ms SMT Verify possible using 2000 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-21 23:17:06] [INFO ] Deduced a trap composed of 3 places in 3245 ms of which 4 ms to minimize.
[2023-03-21 23:17:09] [INFO ] Deduced a trap composed of 3 places in 3250 ms of which 4 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
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 23:17:09] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-21 23:17:09] [INFO ] After 28384ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:2
Parikh walk visited 0 properties in 4003 ms.
Support contains 2 out of 10000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Graph (complete) has 24000 edges and 10000 vertex of which 10 are kept as prefixes of interest. Removing 9990 places using SCC suffix rule.4 ms
Discarding 9990 places :
Also discarding 15984 output transitions
Drop transitions removed 15984 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 15 ms. Remains 10 /10000 variables (removed 9990) and now considering 16/16001 (removed 15985) transitions.
// Phase 1: matrix 16 rows 10 cols
[2023-03-21 23:17:13] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-21 23:17:13] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 10/10000 places, 16/16001 transitions.
Finished random walk after 9460 steps, including 2 resets, run visited all 2 properties in 3 ms. (steps per millisecond=3153 )
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 185 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration timeout after 12700 steps with 0 reset in 10005 ms.
Product exploration timeout after 12260 steps with 0 reset in 10001 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 2 out of 10000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 2756 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
// Phase 1: matrix 16001 rows 10000 cols
[2023-03-21 23:17:37] [INFO ] Computed 2000 place invariants in 32 ms
[2023-03-21 23:17:38] [INFO ] Dead Transitions using invariants and state equation in 927 ms found 0 transitions.
[2023-03-21 23:17:38] [INFO ] Invariant cache hit.
[2023-03-21 23:17:39] [INFO ] Dead Transitions using invariants and state equation in 963 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4652 ms. Remains : 10000/10000 places, 16001/16001 transitions.
Support contains 2 out of 10000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 10000/10000 places, 16001/16001 transitions.
Applied a total of 0 rules in 1034 ms. Remains 10000 /10000 variables (removed 0) and now considering 16001/16001 (removed 0) transitions.
[2023-03-21 23:17:40] [INFO ] Invariant cache hit.
[2023-03-21 23:17:41] [INFO ] Dead Transitions using invariants and state equation in 863 ms found 0 transitions.
[2023-03-21 23:17:41] [INFO ] Invariant cache hit.
[2023-03-21 23:17:42] [INFO ] Implicit Places using invariants in 1856 ms returned []
Implicit Place search using SMT only with invariants took 1857 ms to find 0 implicit places.
[2023-03-21 23:17:42] [INFO ] Invariant cache hit.
[2023-03-21 23:17:43] [INFO ] Dead Transitions using invariants and state equation in 965 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4721 ms. Remains : 10000/10000 places, 16001/16001 transitions.
Treatment of property JoinFreeModules-PT-2000-LTLFireability-04 finished in 168119 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||F((G(F(p1))||(F(p1)&&G(!p2))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(G((X(p0)||F(p1)))))))'
[2023-03-21 23:17:44] [INFO ] Flatten gal took : 365 ms
[2023-03-21 23:17:44] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-21 23:17:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 10000 places, 16001 transitions and 46000 arcs took 64 ms.
Total runtime 814575 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT JoinFreeModules-PT-2000
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability

BK_STOP 1679440812764

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-2000-LTLFireability-04: LTL 0 0 0 0 1 0 0 0
JoinFreeModules-PT-2000-LTLFireability-11: LTL 0 0 0 0 0 0 0 0
JoinFreeModules-PT-2000-LTLFireability-12: CONJ 0 0 0 0 1 0 0 0

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

Time elapsed: 17 secs. Pages in use: 1
# running tasks: 0 of 4 Visible: 3
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: NOTDEADLOCKFREE
lola: NOTDEADLOCKFREE
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-2000-LTLFireability-04: LTL 0 0 0 0 1 0 0 0
JoinFreeModules-PT-2000-LTLFireability-11: LTL 0 0 0 0 1 0 0 0
JoinFreeModules-PT-2000-LTLFireability-12: CONJ 0 0 0 0 2 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-2000-LTLFireability-04: LTL 0 0 0 0 1 0 0 0
JoinFreeModules-PT-2000-LTLFireability-11: LTL 0 0 0 0 1 0 0 0
JoinFreeModules-PT-2000-LTLFireability-12: CONJ 0 0 0 0 2 0 0 0

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-2000-LTLFireability-04: LTL 0 0 0 0 1 0 0 0
JoinFreeModules-PT-2000-LTLFireability-11: LTL 0 0 0 0 1 0 0 0
JoinFreeModules-PT-2000-LTLFireability-12: CONJ 0 0 0 0 2 0 0 0

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

Time elapsed: 32 secs. Pages in use: 1
# running tasks: 0 of 4 Visible: 3
lola: LAUNCH task # 11 (type EXCL) for 6 JoinFreeModules-PT-2000-LTLFireability-12
lola: time limit : 891 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-2000-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-2000-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-2000-LTLFireability-12: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 4/891 3/32 JoinFreeModules-PT-2000-LTLFireability-12 26382 m, 5276 m/sec, 37170 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-2000-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-2000-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-2000-LTLFireability-12: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 9/891 7/32 JoinFreeModules-PT-2000-LTLFireability-12 65972 m, 7918 m/sec, 92961 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-2000-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-2000-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-2000-LTLFireability-12: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 14/891 10/32 JoinFreeModules-PT-2000-LTLFireability-12 105421 m, 7889 m/sec, 148515 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-2000-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-2000-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-2000-LTLFireability-12: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 19/891 14/32 JoinFreeModules-PT-2000-LTLFireability-12 144887 m, 7893 m/sec, 204774 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-2000-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-2000-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-2000-LTLFireability-12: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 24/891 18/32 JoinFreeModules-PT-2000-LTLFireability-12 184086 m, 7839 m/sec, 261937 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-2000-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-2000-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-2000-LTLFireability-12: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 29/891 21/32 JoinFreeModules-PT-2000-LTLFireability-12 223357 m, 7854 m/sec, 318929 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-2000-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-2000-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-2000-LTLFireability-12: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 34/891 25/32 JoinFreeModules-PT-2000-LTLFireability-12 263166 m, 7961 m/sec, 375100 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-2000-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-2000-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-2000-LTLFireability-12: CONJ 0 1 1 0 2 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
11 LTL EXCL 39/891 29/32 JoinFreeModules-PT-2000-LTLFireability-12 302972 m, 7961 m/sec, 431269 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-2000-LTLFireability-04: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-2000-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-2000-LTLFireability-12: CONJ 0 1 0 0 2 0 1 0

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

Time elapsed: 77 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 9 (type EXCL) for 6 JoinFreeModules-PT-2000-LTLFireability-12
lola: time limit : 1174 sec
lola: memory limit: 32 pages
lola: FINISHED task # 9 (type EXCL) for JoinFreeModules-PT-2000-LTLFireability-12
lola: result : true
lola: markings : 4002
lola: fired transitions : 4001
lola: time used : 0.000000
lola: memory pages used : 2
lola: LAUNCH task # 1 (type EXCL) for 0 JoinFreeModules-PT-2000-LTLFireability-04
lola: time limit : 1761 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-2000-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-2000-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-2000-LTLFireability-12: CONJ 0 0 0 0 3 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 5/1761 4/32 JoinFreeModules-PT-2000-LTLFireability-04 36640 m, 7328 m/sec, 50625 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-2000-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-2000-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-2000-LTLFireability-12: CONJ 0 0 0 0 3 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 10/1761 8/32 JoinFreeModules-PT-2000-LTLFireability-04 76597 m, 7991 m/sec, 107061 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-2000-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-2000-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-2000-LTLFireability-12: CONJ 0 0 0 0 3 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 15/1761 11/32 JoinFreeModules-PT-2000-LTLFireability-04 115984 m, 7877 m/sec, 163890 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-2000-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-2000-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-2000-LTLFireability-12: CONJ 0 0 0 0 3 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 20/1761 15/32 JoinFreeModules-PT-2000-LTLFireability-04 155004 m, 7804 m/sec, 220880 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-2000-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-2000-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-2000-LTLFireability-12: CONJ 0 0 0 0 3 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 25/1761 19/32 JoinFreeModules-PT-2000-LTLFireability-04 194525 m, 7904 m/sec, 277460 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-2000-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-2000-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-2000-LTLFireability-12: CONJ 0 0 0 0 3 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 30/1761 22/32 JoinFreeModules-PT-2000-LTLFireability-04 234439 m, 7982 m/sec, 333820 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-2000-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-2000-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-2000-LTLFireability-12: CONJ 0 0 0 0 3 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 35/1761 26/32 JoinFreeModules-PT-2000-LTLFireability-04 274317 m, 7975 m/sec, 390122 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-2000-LTLFireability-04: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-2000-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-2000-LTLFireability-12: CONJ 0 0 0 0 3 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 40/1761 30/32 JoinFreeModules-PT-2000-LTLFireability-04 314274 m, 7991 m/sec, 446551 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-2000-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
JoinFreeModules-PT-2000-LTLFireability-11: LTL 0 1 0 0 1 0 0 0
JoinFreeModules-PT-2000-LTLFireability-12: CONJ 0 0 0 0 3 0 1 0

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

Time elapsed: 122 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 3
lola: LAUNCH task # 4 (type EXCL) for 3 JoinFreeModules-PT-2000-LTLFireability-11
lola: time limit : 3478 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-2000-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
JoinFreeModules-PT-2000-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-2000-LTLFireability-12: CONJ 0 0 0 0 3 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/3478 7/32 JoinFreeModules-PT-2000-LTLFireability-11 68184 m, 13636 m/sec, 69644 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-2000-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
JoinFreeModules-PT-2000-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-2000-LTLFireability-12: CONJ 0 0 0 0 3 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/3478 14/32 JoinFreeModules-PT-2000-LTLFireability-11 137950 m, 13953 m/sec, 140894 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-2000-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
JoinFreeModules-PT-2000-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-2000-LTLFireability-12: CONJ 0 0 0 0 3 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/3478 20/32 JoinFreeModules-PT-2000-LTLFireability-11 204857 m, 13381 m/sec, 209219 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-2000-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
JoinFreeModules-PT-2000-LTLFireability-11: LTL 0 0 1 0 1 0 0 0
JoinFreeModules-PT-2000-LTLFireability-12: CONJ 0 0 0 0 3 0 1 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/3478 26/32 JoinFreeModules-PT-2000-LTLFireability-11 272801 m, 13588 m/sec, 278609 t fired, .

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
JoinFreeModules-PT-2000-LTLFireability-04: LTL 0 0 0 0 1 0 1 0
JoinFreeModules-PT-2000-LTLFireability-11: LTL 0 0 0 0 1 0 1 0
JoinFreeModules-PT-2000-LTLFireability-12: CONJ 0 0 0 0 3 0 1 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
JoinFreeModules-PT-2000-LTLFireability-04: LTL unknown AGGR
JoinFreeModules-PT-2000-LTLFireability-11: LTL unknown AGGR
JoinFreeModules-PT-2000-LTLFireability-12: CONJ unknown CONJ


Time elapsed: 147 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-2000"
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-2000, 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-167856415700220"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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