About the Execution of LTSMin+red for JoinFreeModules-PT-5000
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16210.779 | 2751157.00 | 7527108.00 | 59071.00 | FFTFFF??FFFFFF?F | normal |
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.r233-tall-167856418600228.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is JoinFreeModules-PT-5000, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r233-tall-167856418600228
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 17M
-rw-r--r-- 1 mcc users 7.0K Feb 25 12:18 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 25 12:18 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Feb 25 12:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 25 12:07 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 4.3K Feb 25 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Feb 25 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:41 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Feb 25 12:41 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 12:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 25 12:29 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 16M 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-5000-LTLFireability-00
FORMULA_NAME JoinFreeModules-PT-5000-LTLFireability-01
FORMULA_NAME JoinFreeModules-PT-5000-LTLFireability-02
FORMULA_NAME JoinFreeModules-PT-5000-LTLFireability-03
FORMULA_NAME JoinFreeModules-PT-5000-LTLFireability-04
FORMULA_NAME JoinFreeModules-PT-5000-LTLFireability-05
FORMULA_NAME JoinFreeModules-PT-5000-LTLFireability-06
FORMULA_NAME JoinFreeModules-PT-5000-LTLFireability-07
FORMULA_NAME JoinFreeModules-PT-5000-LTLFireability-08
FORMULA_NAME JoinFreeModules-PT-5000-LTLFireability-09
FORMULA_NAME JoinFreeModules-PT-5000-LTLFireability-10
FORMULA_NAME JoinFreeModules-PT-5000-LTLFireability-11
FORMULA_NAME JoinFreeModules-PT-5000-LTLFireability-12
FORMULA_NAME JoinFreeModules-PT-5000-LTLFireability-13
FORMULA_NAME JoinFreeModules-PT-5000-LTLFireability-14
FORMULA_NAME JoinFreeModules-PT-5000-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1679477306934
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-5000
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 09:28:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 09:28:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 09:28:29] [INFO ] Load time of PNML (sax parser for PT used): 776 ms
[2023-03-22 09:28:29] [INFO ] Transformed 25001 places.
[2023-03-22 09:28:29] [INFO ] Transformed 40001 transitions.
[2023-03-22 09:28:29] [INFO ] Parsed PT model containing 25001 places and 40001 transitions and 115002 arcs in 1184 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 33 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-5000-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-5000-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-5000-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 7775 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
// Phase 1: matrix 40001 rows 25000 cols
[2023-03-22 09:28:38] [INFO ] Computed 5000 place invariants in 234 ms
[2023-03-22 09:28:40] [INFO ] Dead Transitions using invariants and state equation in 2723 ms found 0 transitions.
[2023-03-22 09:28:40] [INFO ] Invariant cache hit.
[2023-03-22 09:28:46] [INFO ] Implicit Places using invariants in 6478 ms returned []
Implicit Place search using SMT only with invariants took 6480 ms to find 0 implicit places.
[2023-03-22 09:28:46] [INFO ] Invariant cache hit.
[2023-03-22 09:28:49] [INFO ] Dead Transitions using invariants and state equation in 2090 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19100 ms. Remains : 25000/25000 places, 40001/40001 transitions.
Support contains 28 out of 25000 places after structural reductions.
[2023-03-22 09:28:50] [INFO ] Flatten gal took : 1122 ms
[2023-03-22 09:28:51] [INFO ] Flatten gal took : 909 ms
[2023-03-22 09:28:53] [INFO ] Input system was already deterministic with 40001 transitions.
Support contains 25 out of 25000 places (down from 28) after GAL structural reductions.
Incomplete random walk after 10005 steps, including 2 resets, run finished after 2242 ms. (steps per millisecond=4 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 263 ms. (steps per millisecond=3 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 335 ms. (steps per millisecond=2 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 250 ms. (steps per millisecond=4 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 250 ms. (steps per millisecond=4 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 255 ms. (steps per millisecond=3 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 259 ms. (steps per millisecond=3 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 246 ms. (steps per millisecond=4 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 243 ms. (steps per millisecond=4 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 258 ms. (steps per millisecond=3 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 316 ms. (steps per millisecond=3 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 256 ms. (steps per millisecond=3 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 255 ms. (steps per millisecond=3 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 255 ms. (steps per millisecond=3 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 257 ms. (steps per millisecond=3 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 241 ms. (steps per millisecond=4 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 240 ms. (steps per millisecond=4 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 255 ms. (steps per millisecond=3 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 279 ms. (steps per millisecond=3 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 256 ms. (steps per millisecond=3 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 254 ms. (steps per millisecond=3 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 255 ms. (steps per millisecond=3 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 255 ms. (steps per millisecond=3 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 244 ms. (steps per millisecond=4 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 226 ms. (steps per millisecond=4 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 0 resets, run finished after 252 ms. (steps per millisecond=3 ) properties (out of 25) seen :0
Probabilistic random walk after 67014 steps, saw 66991 distinct states, run finished after 24015 ms. (steps per millisecond=2 ) properties seen :5
Running SMT prover for 20 properties.
[2023-03-22 09:29:26] [INFO ] Invariant cache hit.
[2023-03-22 09:29:37] [INFO ] [Real]Absence check using 5000 positive place invariants in 2996 ms returned sat
[2023-03-22 09:29:51] [INFO ] After 12563ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:17
[2023-03-22 09:29:51] [INFO ] State equation strengthened by 5000 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:339)
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-22 09:29:51] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 09:29:51] [INFO ] After 25129ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 20 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 20 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Graph (complete) has 60000 edges and 25000 vertex of which 100 are kept as prefixes of interest. Removing 24900 places using SCC suffix rule.50 ms
Discarding 24900 places :
Also discarding 39840 output transitions
Drop transitions removed 39840 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 100 transition count 160
Applied a total of 2 rules in 156 ms. Remains 100 /25000 variables (removed 24900) and now considering 160/40001 (removed 39841) transitions.
// Phase 1: matrix 160 rows 100 cols
[2023-03-22 09:29:51] [INFO ] Computed 20 place invariants in 0 ms
[2023-03-22 09:29:51] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 236 ms. Remains : 100/25000 places, 160/40001 transitions.
Incomplete random walk after 12505 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=833 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) 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 17) 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 16) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 15) 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 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 :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) 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 :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 10) 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 10) 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 10) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 9) 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 9) seen :1
Running SMT prover for 8 properties.
[2023-03-22 09:29:51] [INFO ] Invariant cache hit.
[2023-03-22 09:29:51] [INFO ] [Real]Absence check using 20 positive place invariants in 3 ms returned sat
[2023-03-22 09:29:51] [INFO ] After 141ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-22 09:29:51] [INFO ] [Nat]Absence check using 20 positive place invariants in 2 ms returned sat
[2023-03-22 09:29:52] [INFO ] After 275ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-22 09:29:52] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-22 09:29:52] [INFO ] After 95ms SMT Verify possible using 20 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-22 09:29:52] [INFO ] After 222ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 109 ms.
[2023-03-22 09:29:52] [INFO ] After 677ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 7 different solutions.
Finished Parikh walk after 51031 steps, including 0 resets, run visited all 8 properties in 782 ms. (steps per millisecond=65 )
Parikh walk visited 8 properties in 786 ms.
FORMULA JoinFreeModules-PT-5000-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&X(F(p1)))))'
Support contains 2 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 3545 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
// Phase 1: matrix 40001 rows 25000 cols
[2023-03-22 09:30:04] [INFO ] Computed 5000 place invariants in 97 ms
[2023-03-22 09:30:06] [INFO ] Dead Transitions using invariants and state equation in 1947 ms found 0 transitions.
[2023-03-22 09:30:06] [INFO ] Invariant cache hit.
[2023-03-22 09:30:12] [INFO ] Implicit Places using invariants in 6187 ms returned []
Implicit Place search using SMT only with invariants took 6189 ms to find 0 implicit places.
[2023-03-22 09:30:12] [INFO ] Invariant cache hit.
[2023-03-22 09:30:14] [INFO ] Dead Transitions using invariants and state equation in 1871 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13560 ms. Remains : 25000/25000 places, 40001/40001 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : JoinFreeModules-PT-5000-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LT s11159 5), p1:(GEQ s16684 5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 10 ms.
FORMULA JoinFreeModules-PT-5000-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-5000-LTLFireability-00 finished in 13920 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(X(G(p0)))&&F((X(p1) U p2))))'
Support contains 2 out of 25000 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 3190 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
[2023-03-22 09:30:17] [INFO ] Invariant cache hit.
[2023-03-22 09:30:19] [INFO ] Dead Transitions using invariants and state equation in 1837 ms found 0 transitions.
[2023-03-22 09:30:19] [INFO ] Invariant cache hit.
[2023-03-22 09:30:25] [INFO ] Implicit Places using invariants in 6028 ms returned []
Implicit Place search using SMT only with invariants took 6029 ms to find 0 implicit places.
[2023-03-22 09:30:25] [INFO ] Invariant cache hit.
[2023-03-22 09:30:27] [INFO ] Dead Transitions using invariants and state equation in 1844 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12905 ms. Remains : 25000/25000 places, 40001/40001 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), true, (OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : JoinFreeModules-PT-5000-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 0}, { cond=(NOT p2), acceptance={} source=2 dest: 3}], [{ cond=(AND p2 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(GEQ s7301 2), p2:(LT s11627 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 4 ms.
FORMULA JoinFreeModules-PT-5000-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-5000-LTLFireability-01 finished in 13102 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(p0))||(X(!p0)&&F(p1))))'
Support contains 2 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 6158 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
[2023-03-22 09:30:34] [INFO ] Invariant cache hit.
[2023-03-22 09:30:36] [INFO ] Dead Transitions using invariants and state equation in 2125 ms found 0 transitions.
[2023-03-22 09:30:36] [INFO ] Invariant cache hit.
[2023-03-22 09:30:42] [INFO ] Implicit Places using invariants in 6335 ms returned []
Implicit Place search using SMT only with invariants took 6338 ms to find 0 implicit places.
[2023-03-22 09:30:42] [INFO ] Invariant cache hit.
[2023-03-22 09:30:44] [INFO ] Dead Transitions using invariants and state equation in 2091 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16720 ms. Remains : 25000/25000 places, 40001/40001 transitions.
Stuttering acceptance computed with spot in 259 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), false, (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-5000-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}], [{ cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s20933 4), p1:(LT s17611 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, null, null][false, false, false, false, false, false]]
Product exploration timeout after 11250 steps with 5625 reset in 10003 ms.
Product exploration timeout after 10850 steps with 5425 reset in 10004 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 p0))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1))))]
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 2 factoid took 152 ms. Reduced automaton from 6 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA JoinFreeModules-PT-5000-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property JoinFreeModules-PT-5000-LTLFireability-02 finished in 45403 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' '!((((p0 U p1)&&G(p2)) U X(p1)))'
Support contains 3 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 6699 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
[2023-03-22 09:31:20] [INFO ] Invariant cache hit.
[2023-03-22 09:31:21] [INFO ] Dead Transitions using invariants and state equation in 1906 ms found 0 transitions.
[2023-03-22 09:31:21] [INFO ] Invariant cache hit.
[2023-03-22 09:31:28] [INFO ] Implicit Places using invariants in 6814 ms returned []
Implicit Place search using SMT only with invariants took 6820 ms to find 0 implicit places.
[2023-03-22 09:31:28] [INFO ] Invariant cache hit.
[2023-03-22 09:31:30] [INFO ] Dead Transitions using invariants and state equation in 2156 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17588 ms. Remains : 25000/25000 places, 40001/40001 transitions.
Stuttering acceptance computed with spot in 214 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, (NOT p2)]
Running random walk in product with property : JoinFreeModules-PT-5000-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p1) (NOT p0)) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={} source=0 dest: 2}, { cond=(OR (AND p1 p2) (AND p0 p2)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0) p2), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0 p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 4}, { cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 5}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(GEQ s12729 5), p0:(GEQ s19899 5), p2:(LT s16555 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]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 4 ms.
FORMULA JoinFreeModules-PT-5000-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-5000-LTLFireability-03 finished in 17886 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))'
Support contains 1 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 3419 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
[2023-03-22 09:31:34] [INFO ] Invariant cache hit.
[2023-03-22 09:31:36] [INFO ] Dead Transitions using invariants and state equation in 1907 ms found 0 transitions.
[2023-03-22 09:31:36] [INFO ] Invariant cache hit.
[2023-03-22 09:31:42] [INFO ] Implicit Places using invariants in 5856 ms returned []
Implicit Place search using SMT only with invariants took 5858 ms to find 0 implicit places.
[2023-03-22 09:31:42] [INFO ] Invariant cache hit.
[2023-03-22 09:31:44] [INFO ] Dead Transitions using invariants and state equation in 1882 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13068 ms. Remains : 25000/25000 places, 40001/40001 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : JoinFreeModules-PT-5000-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s7950 5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 4 ms.
FORMULA JoinFreeModules-PT-5000-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-5000-LTLFireability-04 finished in 13231 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 18674 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
[2023-03-22 09:32:03] [INFO ] Invariant cache hit.
[2023-03-22 09:32:05] [INFO ] Dead Transitions using invariants and state equation in 1985 ms found 0 transitions.
[2023-03-22 09:32:05] [INFO ] Invariant cache hit.
[2023-03-22 09:32:11] [INFO ] Implicit Places using invariants in 6144 ms returned []
Implicit Place search using SMT only with invariants took 6146 ms to find 0 implicit places.
[2023-03-22 09:32:11] [INFO ] Invariant cache hit.
[2023-03-22 09:32:13] [INFO ] Dead Transitions using invariants and state equation in 1931 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 28751 ms. Remains : 25000/25000 places, 40001/40001 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-5000-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s10254 5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration timeout after 7110 steps with 0 reset in 10012 ms.
Product exploration timeout after 6730 steps with 0 reset in 10015 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10007 steps, including 2 resets, run finished after 2042 ms. (steps per millisecond=4 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2221 ms. (steps per millisecond=4 ) properties (out of 1) seen :0
Probabilistic random walk after 39005 steps, saw 39002 distinct states, run finished after 12253 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 09:32:58] [INFO ] Invariant cache hit.
[2023-03-22 09:33:04] [INFO ] [Real]Absence check using 5000 positive place invariants in 3536 ms returned sat
[2023-03-22 09:33:23] [INFO ] After 25018ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Graph (complete) has 60000 edges and 25000 vertex of which 5 are kept as prefixes of interest. Removing 24995 places using SCC suffix rule.9 ms
Discarding 24995 places :
Also discarding 39992 output transitions
Drop transitions removed 39992 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 5 transition count 8
Applied a total of 2 rules in 50 ms. Remains 5 /25000 variables (removed 24995) and now considering 8/40001 (removed 39993) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 09:33:23] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-22 09:33:23] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 83 ms. Remains : 5/25000 places, 8/40001 transitions.
Finished random walk after 2501 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2501 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 17260 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
// Phase 1: matrix 40001 rows 25000 cols
[2023-03-22 09:33:40] [INFO ] Computed 5000 place invariants in 84 ms
[2023-03-22 09:33:42] [INFO ] Dead Transitions using invariants and state equation in 2059 ms found 0 transitions.
[2023-03-22 09:33:42] [INFO ] Invariant cache hit.
[2023-03-22 09:33:48] [INFO ] Implicit Places using invariants in 6069 ms returned []
Implicit Place search using SMT only with invariants took 6072 ms to find 0 implicit places.
[2023-03-22 09:33:48] [INFO ] Invariant cache hit.
[2023-03-22 09:33:50] [INFO ] Dead Transitions using invariants and state equation in 1919 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 27318 ms. Remains : 25000/25000 places, 40001/40001 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 12505 steps, including 2 resets, run finished after 2477 ms. (steps per millisecond=5 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2212 ms. (steps per millisecond=4 ) properties (out of 1) seen :0
Probabilistic random walk after 39005 steps, saw 39002 distinct states, run finished after 12221 ms. (steps per millisecond=3 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 09:34:16] [INFO ] Invariant cache hit.
[2023-03-22 09:34:22] [INFO ] [Real]Absence check using 5000 positive place invariants in 3173 ms returned sat
[2023-03-22 09:34:41] [INFO ] After 25011ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Graph (complete) has 60000 edges and 25000 vertex of which 5 are kept as prefixes of interest. Removing 24995 places using SCC suffix rule.9 ms
Discarding 24995 places :
Also discarding 39992 output transitions
Drop transitions removed 39992 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 5 transition count 8
Applied a total of 2 rules in 40 ms. Remains 5 /25000 variables (removed 24995) and now considering 8/40001 (removed 39993) transitions.
// Phase 1: matrix 8 rows 5 cols
[2023-03-22 09:34:41] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-22 09:34:41] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 5/25000 places, 8/40001 transitions.
Incomplete random walk after 10003 steps, including 1 resets, run finished after 2 ms. (steps per millisecond=5001 ) properties (out of 1) seen :0
Finished Best-First random walk after 18 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=18 )
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Product exploration timeout after 7480 steps with 0 reset in 10006 ms.
Product exploration timeout after 7040 steps with 0 reset in 10007 ms.
Support contains 1 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 16797 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
// Phase 1: matrix 40001 rows 25000 cols
[2023-03-22 09:35:18] [INFO ] Computed 5000 place invariants in 84 ms
[2023-03-22 09:35:20] [INFO ] Dead Transitions using invariants and state equation in 1939 ms found 0 transitions.
[2023-03-22 09:35:20] [INFO ] Invariant cache hit.
[2023-03-22 09:35:26] [INFO ] Implicit Places using invariants in 6010 ms returned []
Implicit Place search using SMT only with invariants took 6012 ms to find 0 implicit places.
[2023-03-22 09:35:26] [INFO ] Invariant cache hit.
[2023-03-22 09:35:28] [INFO ] Dead Transitions using invariants and state equation in 1886 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 26637 ms. Remains : 25000/25000 places, 40001/40001 transitions.
Treatment of property JoinFreeModules-PT-5000-LTLFireability-06 finished in 225084 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F(F((F(!(p0 U p1))&&p2))))||X(F(G(p0)))))'
Support contains 3 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 17586 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
[2023-03-22 09:35:47] [INFO ] Invariant cache hit.
[2023-03-22 09:35:48] [INFO ] Dead Transitions using invariants and state equation in 1884 ms found 0 transitions.
[2023-03-22 09:35:49] [INFO ] Invariant cache hit.
[2023-03-22 09:35:54] [INFO ] Implicit Places using invariants in 5964 ms returned []
Implicit Place search using SMT only with invariants took 5965 ms to find 0 implicit places.
[2023-03-22 09:35:54] [INFO ] Invariant cache hit.
[2023-03-22 09:35:56] [INFO ] Dead Transitions using invariants and state equation in 1910 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 27348 ms. Remains : 25000/25000 places, 40001/40001 transitions.
Stuttering acceptance computed with spot in 109 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : JoinFreeModules-PT-5000-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s19532 1), p1:(GEQ s21009 5), p2:(LT s2312 2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration timeout after 7020 steps with 0 reset in 10013 ms.
Product exploration timeout after 6600 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 p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p2))), (X p0)]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 207 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10003 steps, including 1 resets, run finished after 2030 ms. (steps per millisecond=4 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2330 ms. (steps per millisecond=4 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2228 ms. (steps per millisecond=4 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2241 ms. (steps per millisecond=4 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2188 ms. (steps per millisecond=4 ) properties (out of 4) seen :0
Probabilistic random walk after 83023 steps, saw 82970 distinct states, run finished after 58600 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-22 09:37:35] [INFO ] Invariant cache hit.
[2023-03-22 09:37:58] [INFO ] [Real]Absence check using 5000 positive place invariants in 3395 ms returned sat
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:629)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
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-22 09:38:03] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 09:38:03] [INFO ] After 27683ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 3 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Graph (complete) has 60000 edges and 25000 vertex of which 15 are kept as prefixes of interest. Removing 24985 places using SCC suffix rule.37 ms
Discarding 24985 places :
Also discarding 39976 output transitions
Drop transitions removed 39976 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 15 transition count 24
Applied a total of 2 rules in 173 ms. Remains 15 /25000 variables (removed 24985) and now considering 24/40001 (removed 39977) transitions.
// Phase 1: matrix 24 rows 15 cols
[2023-03-22 09:38:03] [INFO ] Computed 3 place invariants in 3 ms
[2023-03-22 09:38:03] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 215 ms. Remains : 15/25000 places, 24/40001 transitions.
Incomplete random walk after 12505 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=1042 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 09:38:03] [INFO ] Invariant cache hit.
[2023-03-22 09:38:03] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2023-03-22 09:38:03] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 09:38:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-22 09:38:03] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 09:38:03] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-22 09:38:03] [INFO ] After 6ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 09:38:03] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-22 09:38:03] [INFO ] After 57ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 2514 steps, including 0 resets, run visited all 1 properties in 11 ms. (steps per millisecond=228 )
Parikh walk visited 1 properties in 13 ms.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p2))), (X p0)]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2)))), (F (AND p1 (NOT p0))), (F (NOT p0)), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 5 factoid took 416 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 182 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 139 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2))]
Support contains 3 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 31921 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
// Phase 1: matrix 40001 rows 25000 cols
[2023-03-22 09:38:36] [INFO ] Computed 5000 place invariants in 86 ms
[2023-03-22 09:38:38] [INFO ] Dead Transitions using invariants and state equation in 2027 ms found 0 transitions.
[2023-03-22 09:38:38] [INFO ] Invariant cache hit.
[2023-03-22 09:38:44] [INFO ] Implicit Places using invariants in 6337 ms returned []
Implicit Place search using SMT only with invariants took 6338 ms to find 0 implicit places.
[2023-03-22 09:38:44] [INFO ] Invariant cache hit.
[2023-03-22 09:38:46] [INFO ] Dead Transitions using invariants and state equation in 1925 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 42230 ms. Remains : 25000/25000 places, 40001/40001 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 p1) p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0)))), (X (AND p0 (NOT p2))), (X p0)]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 186 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10003 steps, including 1 resets, run finished after 1984 ms. (steps per millisecond=5 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2416 ms. (steps per millisecond=4 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2372 ms. (steps per millisecond=4 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2415 ms. (steps per millisecond=4 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2163 ms. (steps per millisecond=4 ) properties (out of 4) seen :0
Probabilistic random walk after 85023 steps, saw 84970 distinct states, run finished after 39177 ms. (steps per millisecond=2 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-22 09:39:47] [INFO ] Invariant cache hit.
[2023-03-22 09:39:58] [INFO ] [Real]Absence check using 5000 positive place invariants in 3396 ms returned sat
[2023-03-22 09:40:14] [INFO ] After 15281ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2023-03-22 09:40:14] [INFO ] State equation strengthened by 5000 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:339)
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-22 09:40:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-22 09:40:14] [INFO ] After 27164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 25000 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Graph (complete) has 60000 edges and 25000 vertex of which 15 are kept as prefixes of interest. Removing 24985 places using SCC suffix rule.16 ms
Discarding 24985 places :
Also discarding 39976 output transitions
Drop transitions removed 39976 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 15 transition count 24
Applied a total of 2 rules in 74 ms. Remains 15 /25000 variables (removed 24985) and now considering 24/40001 (removed 39977) transitions.
// Phase 1: matrix 24 rows 15 cols
[2023-03-22 09:40:14] [INFO ] Computed 3 place invariants in 0 ms
[2023-03-22 09:40:14] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 15/25000 places, 24/40001 transitions.
Incomplete random walk after 10006 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=2501 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-22 09:40:14] [INFO ] Invariant cache hit.
[2023-03-22 09:40:14] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-22 09:40:14] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-22 09:40:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-22 09:40:14] [INFO ] After 15ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-22 09:40:14] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-22 09:40:14] [INFO ] After 7ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-22 09:40:14] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-22 09:40:14] [INFO ] After 67ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 7556 steps, including 0 resets, run visited all 1 properties in 6 ms. (steps per millisecond=1259 )
Parikh walk visited 2 properties in 100 ms.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p1 (NOT p0)))), (X (AND p0 (NOT p2))), (X p0)]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2)))), (F (AND p1 (NOT p0))), (F (NOT p0)), (F (AND (NOT p0) (NOT p2)))]
Knowledge based reduction with 5 factoid took 393 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 133 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 148 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2))]
Product exploration timeout after 6220 steps with 0 reset in 10003 ms.
Product exploration timeout after 3150 steps with 0 reset in 10013 ms.
Support contains 3 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 24783 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
// Phase 1: matrix 40001 rows 25000 cols
[2023-03-22 09:41:00] [INFO ] Computed 5000 place invariants in 80 ms
[2023-03-22 09:41:03] [INFO ] Dead Transitions using invariants and state equation in 2339 ms found 0 transitions.
[2023-03-22 09:41:03] [INFO ] Invariant cache hit.
[2023-03-22 09:41:09] [INFO ] Implicit Places using invariants in 6793 ms returned []
Implicit Place search using SMT only with invariants took 6798 ms to find 0 implicit places.
[2023-03-22 09:41:09] [INFO ] Invariant cache hit.
[2023-03-22 09:41:12] [INFO ] Dead Transitions using invariants and state equation in 2164 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 36087 ms. Remains : 25000/25000 places, 40001/40001 transitions.
Treatment of property JoinFreeModules-PT-5000-LTLFireability-07 finished in 343607 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 25000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 19199 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
[2023-03-22 09:41:32] [INFO ] Invariant cache hit.
[2023-03-22 09:41:34] [INFO ] Dead Transitions using invariants and state equation in 2222 ms found 0 transitions.
[2023-03-22 09:41:34] [INFO ] Invariant cache hit.
[2023-03-22 09:41:41] [INFO ] Implicit Places using invariants in 6882 ms returned []
Implicit Place search using SMT only with invariants took 6883 ms to find 0 implicit places.
[2023-03-22 09:41:41] [INFO ] Invariant cache hit.
[2023-03-22 09:41:43] [INFO ] Dead Transitions using invariants and state equation in 2235 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30544 ms. Remains : 25000/25000 places, 40001/40001 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-5000-LTLFireability-08 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 s14057 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 4 ms.
FORMULA JoinFreeModules-PT-5000-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-5000-LTLFireability-08 finished in 30682 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 25000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 25939 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
[2023-03-22 09:42:09] [INFO ] Invariant cache hit.
[2023-03-22 09:42:11] [INFO ] Dead Transitions using invariants and state equation in 2130 ms found 0 transitions.
[2023-03-22 09:42:11] [INFO ] Invariant cache hit.
[2023-03-22 09:42:18] [INFO ] Implicit Places using invariants in 6812 ms returned []
Implicit Place search using SMT only with invariants took 6812 ms to find 0 implicit places.
[2023-03-22 09:42:18] [INFO ] Invariant cache hit.
[2023-03-22 09:42:20] [INFO ] Dead Transitions using invariants and state equation in 1921 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 36807 ms. Remains : 25000/25000 places, 40001/40001 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0)]
Running random walk in product with property : JoinFreeModules-PT-5000-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s12821 2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 4 ms.
FORMULA JoinFreeModules-PT-5000-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-5000-LTLFireability-10 finished in 36995 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F(p1)))'
Support contains 2 out of 25000 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 21574 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
[2023-03-22 09:42:42] [INFO ] Invariant cache hit.
[2023-03-22 09:42:44] [INFO ] Dead Transitions using invariants and state equation in 1888 ms found 0 transitions.
[2023-03-22 09:42:44] [INFO ] Invariant cache hit.
[2023-03-22 09:42:50] [INFO ] Implicit Places using invariants in 6396 ms returned []
Implicit Place search using SMT only with invariants took 6397 ms to find 0 implicit places.
[2023-03-22 09:42:50] [INFO ] Invariant cache hit.
[2023-03-22 09:42:52] [INFO ] Dead Transitions using invariants and state equation in 2204 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32066 ms. Remains : 25000/25000 places, 40001/40001 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-5000-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(LT s9701 2), p0:(GEQ s24201 2)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 4 ms.
FORMULA JoinFreeModules-PT-5000-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-5000-LTLFireability-11 finished in 32263 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G((F(p0) U p1)))||G((p0||G(p2))))))'
Support contains 3 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 3871 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
[2023-03-22 09:42:56] [INFO ] Invariant cache hit.
[2023-03-22 09:42:59] [INFO ] Dead Transitions using invariants and state equation in 2186 ms found 0 transitions.
[2023-03-22 09:42:59] [INFO ] Invariant cache hit.
[2023-03-22 09:43:05] [INFO ] Implicit Places using invariants in 6417 ms returned []
Implicit Place search using SMT only with invariants took 6419 ms to find 0 implicit places.
[2023-03-22 09:43:05] [INFO ] Invariant cache hit.
[2023-03-22 09:43:07] [INFO ] Dead Transitions using invariants and state equation in 1878 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14365 ms. Remains : 25000/25000 places, 40001/40001 transitions.
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : JoinFreeModules-PT-5000-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 3}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 0}]], initial=5, aps=[p0:(GEQ s21720 5), p2:(GEQ s23638 4), p1:(GEQ s22855 5)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 4 ms.
FORMULA JoinFreeModules-PT-5000-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property JoinFreeModules-PT-5000-LTLFireability-13 finished in 14706 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)||X(X(G(p1)))))))'
Support contains 2 out of 25000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25000/25000 places, 40001/40001 transitions.
Applied a total of 0 rules in 3668 ms. Remains 25000 /25000 variables (removed 0) and now considering 40001/40001 (removed 0) transitions.
[2023-03-22 09:43:11] [INFO ] Invariant cache hit.
[2023-03-22 09:43:13] [INFO ] Dead Transitions using invariants and state equation in 1885 ms found 0 transitions.
[2023-03-22 09:43:13] [INFO ] Invariant cache hit.
[2023-03-22 09:43:19] [INFO ] Implicit Places using invariants in 6042 ms returned []
Implicit Place search using SMT only with invariants took 6044 ms to find 0 implicit places.
[2023-03-22 09:43:19] [INFO ] Invariant cache hit.
[2023-03-22 09:43:21] [INFO ] Dead Transitions using invariants and state equation in 1893 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13492 ms. Remains : 25000/25000 places, 40001/40001 transitions.
Stuttering acceptance computed with spot in 275 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : JoinFreeModules-PT-5000-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 2}], [{ cond=(NOT p0), acceptance={} source=6 dest: 4}, { cond=p0, acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={} source=7 dest: 6}], [{ cond=true, acceptance={} source=8 dest: 7}]], initial=8, aps=[p1:(GEQ s1343 4), p0:(GEQ s122 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, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration timeout after 7380 steps with 0 reset in 10002 ms.
Product exploration timeout after 7040 steps with 0 reset in 10016 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 p1) p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 58 ms. Reduced automaton from 9 states, 16 edges and 2 AP (stutter sensitive) to 9 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 291 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10003 steps, including 1 resets, run finished after 2190 ms. (steps per millisecond=4 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2506 ms. (steps per millisecond=3 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2197 ms. (steps per millisecond=4 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2193 ms. (steps per millisecond=4 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2208 ms. (steps per millisecond=4 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2185 ms. (steps per millisecond=4 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 0 resets, run finished after 2165 ms. (steps per millisecond=4 ) properties (out of 6) seen :0
Probabilistic random walk after 83023 steps, saw 82970 distinct states, run finished after 55019 ms. (steps per millisecond=1 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-22 09:45:01] [INFO ] Invariant cache hit.
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1337/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1337/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1337/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1337/ltl_3_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1337/ltl_4_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1337/ltl_5_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1337/ltl_6_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1337/ltl_7_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1337/ltl_8_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1337/ltl_9_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1337/ltl_10_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1337/ltl_11_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1337/ltl_12_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1337/ltl_13_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1337/ltl_14_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1337/ltl_15_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : JoinFreeModules-PT-5000-LTLFireability-00
Could not compute solution for formula : JoinFreeModules-PT-5000-LTLFireability-01
Could not compute solution for formula : JoinFreeModules-PT-5000-LTLFireability-02
Could not compute solution for formula : JoinFreeModules-PT-5000-LTLFireability-03
Could not compute solution for formula : JoinFreeModules-PT-5000-LTLFireability-04
Could not compute solution for formula : JoinFreeModules-PT-5000-LTLFireability-05
Could not compute solution for formula : JoinFreeModules-PT-5000-LTLFireability-06
Could not compute solution for formula : JoinFreeModules-PT-5000-LTLFireability-07
Could not compute solution for formula : JoinFreeModules-PT-5000-LTLFireability-08
Could not compute solution for formula : JoinFreeModules-PT-5000-LTLFireability-09
Could not compute solution for formula : JoinFreeModules-PT-5000-LTLFireability-10
Could not compute solution for formula : JoinFreeModules-PT-5000-LTLFireability-11
Could not compute solution for formula : JoinFreeModules-PT-5000-LTLFireability-12
Could not compute solution for formula : JoinFreeModules-PT-5000-LTLFireability-13
Could not compute solution for formula : JoinFreeModules-PT-5000-LTLFireability-14
Could not compute solution for formula : JoinFreeModules-PT-5000-LTLFireability-15
BK_STOP 1679480058091
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name JoinFreeModules-PT-5000-LTLFireability-00
ltl formula formula --ltl=/tmp/1337/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 25001 places, 40001 transitions and 115002 arcs
pnml2lts-mc( 0/ 4): Petri net JoinFreeModules-PT-5000 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 4.870 real 1.600 user 1.790 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1337/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1337/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1337/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1337/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name JoinFreeModules-PT-5000-LTLFireability-01
ltl formula formula --ltl=/tmp/1337/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 25001 places, 40001 transitions and 115002 arcs
pnml2lts-mc( 0/ 4): Petri net JoinFreeModules-PT-5000 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 4.950 real 1.640 user 2.010 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1337/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1337/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1337/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1337/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name JoinFreeModules-PT-5000-LTLFireability-02
ltl formula formula --ltl=/tmp/1337/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 25001 places, 40001 transitions and 115002 arcs
pnml2lts-mc( 0/ 4): Petri net JoinFreeModules-PT-5000 analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1337/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1337/ltl_2_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 9.220 real 1.830 user 2.420 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1337/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1337/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name JoinFreeModules-PT-5000-LTLFireability-03
ltl formula formula --ltl=/tmp/1337/ltl_3_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 25001 places, 40001 transitions and 115002 arcs
pnml2lts-mc( 0/ 4): Petri net JoinFreeModules-PT-5000 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 4.920 real 1.600 user 1.920 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1337/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1337/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1337/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1337/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name JoinFreeModules-PT-5000-LTLFireability-04
ltl formula formula --ltl=/tmp/1337/ltl_4_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 25001 places, 40001 transitions and 115002 arcs
pnml2lts-mc( 0/ 4): Petri net JoinFreeModules-PT-5000 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1337/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1337/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1337/ltl_4_
pnml2lts-mc( 0/ 4): Loading Petri net took 4.660 real 1.600 user 2.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1337/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name JoinFreeModules-PT-5000-LTLFireability-05
ltl formula formula --ltl=/tmp/1337/ltl_5_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 25001 places, 40001 transitions and 115002 arcs
pnml2lts-mc( 0/ 4): Petri net JoinFreeModules-PT-5000 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 4.720 real 1.600 user 1.810 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1337/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1337/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1337/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1337/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name JoinFreeModules-PT-5000-LTLFireability-06
ltl formula formula --ltl=/tmp/1337/ltl_6_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 25001 places, 40001 transitions and 115002 arcs
pnml2lts-mc( 0/ 4): Petri net JoinFreeModules-PT-5000 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1337/ltl_6_
pnml2lts-mc( 0/ 4): Loading Petri net took 8.340 real 1.690 user 2.160 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1337/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1337/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1337/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name JoinFreeModules-PT-5000-LTLFireability-07
ltl formula formula --ltl=/tmp/1337/ltl_7_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 25001 places, 40001 transitions and 115002 arcs
pnml2lts-mc( 0/ 4): Petri net JoinFreeModules-PT-5000 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1337/ltl_7_
pnml2lts-mc( 0/ 4): Loading Petri net took 8.670 real 1.700 user 2.240 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1337/ltl_7_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1337/ltl_7_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1337/ltl_7_
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name JoinFreeModules-PT-5000-LTLFireability-08
ltl formula formula --ltl=/tmp/1337/ltl_8_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 25001 places, 40001 transitions and 115002 arcs
pnml2lts-mc( 0/ 4): Petri net JoinFreeModules-PT-5000 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1337/ltl_8_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1337/ltl_8_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1337/ltl_8_
pnml2lts-mc( 0/ 4): Loading Petri net took 5.200 real 1.700 user 1.740 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1337/ltl_8_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name JoinFreeModules-PT-5000-LTLFireability-09
ltl formula formula --ltl=/tmp/1337/ltl_9_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 25001 places, 40001 transitions and 115002 arcs
pnml2lts-mc( 0/ 4): Petri net JoinFreeModules-PT-5000 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 8.370 real 1.640 user 2.200 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1337/ltl_9_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1337/ltl_9_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1337/ltl_9_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1337/ltl_9_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name JoinFreeModules-PT-5000-LTLFireability-10
ltl formula formula --ltl=/tmp/1337/ltl_10_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 25001 places, 40001 transitions and 115002 arcs
pnml2lts-mc( 0/ 4): Petri net JoinFreeModules-PT-5000 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 4.740 real 1.650 user 1.750 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1337/ltl_10_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1337/ltl_10_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1337/ltl_10_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1337/ltl_10_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name JoinFreeModules-PT-5000-LTLFireability-11
ltl formula formula --ltl=/tmp/1337/ltl_11_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 25001 places, 40001 transitions and 115002 arcs
pnml2lts-mc( 0/ 4): Petri net JoinFreeModules-PT-5000 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 4.750 real 1.540 user 1.840 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1337/ltl_11_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1337/ltl_11_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1337/ltl_11_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1337/ltl_11_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name JoinFreeModules-PT-5000-LTLFireability-12
ltl formula formula --ltl=/tmp/1337/ltl_12_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 25001 places, 40001 transitions and 115002 arcs
pnml2lts-mc( 0/ 4): Petri net JoinFreeModules-PT-5000 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 4.710 real 1.630 user 1.770 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1337/ltl_12_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1337/ltl_12_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1337/ltl_12_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1337/ltl_12_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
0: pnml2lts-mc(+0xa23f4) [0x55d98bd4b3f4]
1: pnml2lts-mc(+0xa2496) [0x55d98bd4b496]
2: /lib/x86_64-linux-gnu/libpthread.so.0(+0x13140) [0x7f85cbf5c140]
3: pnml2lts-mc(+0x405b30) [0x55d98c0aeb30]
4: pnml2lts-mc(+0x164ad3) [0x55d98be0dad3]
5: pnml2lts-mc(+0x272e0a) [0x55d98bf1be0a]
6: pnml2lts-mc(+0xb61f0) [0x55d98bd5f1f0]
7: /lib/x86_64-linux-gnu/libc.so.6(+0x3b4d7) [0x7f85cbdaf4d7]
8: /lib/x86_64-linux-gnu/libc.so.6(+0x3b67a) [0x7f85cbdaf67a]
9: pnml2lts-mc(+0xa1581) [0x55d98bd4a581]
10: pnml2lts-mc(+0xa1910) [0x55d98bd4a910]
11: pnml2lts-mc(+0xa32a2) [0x55d98bd4c2a2]
12: pnml2lts-mc(+0xa50f4) [0x55d98bd4e0f4]
13: pnml2lts-mc(+0xa516b) [0x55d98bd4e16b]
14: pnml2lts-mc(+0x3f2e60) [0x55d98c09be60]
15: pnml2lts-mc(+0x3f30a2) [0x55d98c09c0a2]
16: pnml2lts-mc(+0x6943b) [0x55d98bd1243b]
17: pnml2lts-mc(+0x64be1) [0x55d98bd0dbe1]
18: pnml2lts-mc(+0x60a02) [0x55d98bd09a02]
19: pnml2lts-mc(+0x5eb0a) [0x55d98bd07b0a]
20: /lib/x86_64-linux-gnu/libc.so.6(__libc_start_main+0xea) [0x7f85cbd97d0a]
21: pnml2lts-mc(+0x6075e) [0x55d98bd0975e]
ltl formula name JoinFreeModules-PT-5000-LTLFireability-13
ltl formula formula --ltl=/tmp/1337/ltl_13_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 25001 places, 40001 transitions and 115002 arcs
pnml2lts-mc( 0/ 4): Petri net JoinFreeModules-PT-5000 analyzed
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1337/ltl_13_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1337/ltl_13_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 9.510 real 1.980 user 2.180 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1337/ltl_13_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1337/ltl_13_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
ltl formula name JoinFreeModules-PT-5000-LTLFireability-14
ltl formula formula --ltl=/tmp/1337/ltl_14_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 25001 places, 40001 transitions and 115002 arcs
pnml2lts-mc( 0/ 4): Petri net JoinFreeModules-PT-5000 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 4.730 real 1.570 user 2.070 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1337/ltl_14_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1337/ltl_14_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1337/ltl_14_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1337/ltl_14_
pnml2lts-mc( 0/ 4): buchi has 9 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
free(): double free detected in tcache 2
ltl formula name JoinFreeModules-PT-5000-LTLFireability-15
ltl formula formula --ltl=/tmp/1337/ltl_15_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 25001 places, 40001 transitions and 115002 arcs
pnml2lts-mc( 0/ 4): Petri net JoinFreeModules-PT-5000 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 4.770 real 1.550 user 1.930 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1337/ltl_15_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1337/ltl_15_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1337/ltl_15_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1337/ltl_15_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
*** segmentation fault ***
Please send information on how to reproduce this problem to:
ltsmin-support@lists.utwente.nl
along with all output preceding this message.
In addition, include the following information:
Package: ltsmin 3.1.0
Stack trace:
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-5000"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is JoinFreeModules-PT-5000, 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 r233-tall-167856418600228"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-5000.tgz
mv JoinFreeModules-PT-5000 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 '
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 ;