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.r263-smll-167863538500636.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is Peterson-PT-6, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r263-smll-167863538500636
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 7.0M
-rw-r--r-- 1 mcc users 204K Feb 25 22:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 847K Feb 25 22:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 215K Feb 25 22:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 986K Feb 25 22:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 124K Feb 25 16:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 364K Feb 25 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 82K Feb 25 16:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 288K Feb 25 16:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 402K Feb 25 22:59 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 1.6M Feb 25 22:59 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 198K Feb 25 22:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 839K Feb 25 22:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 20K Feb 25 16:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 44K Feb 25 16:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 2 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 877K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678872621211

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Peterson-PT-6
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-15 09:30:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-15 09:30:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 09:30:25] [INFO ] Load time of PNML (sax parser for PT used): 322 ms
[2023-03-15 09:30:25] [INFO ] Transformed 1330 places.
[2023-03-15 09:30:25] [INFO ] Transformed 2030 transitions.
[2023-03-15 09:30:25] [INFO ] Found NUPN structural information;
[2023-03-15 09:30:25] [INFO ] Completing missing partition info from NUPN : creating a component with [IsEndLoop_3_0_5, IsEndLoop_0_0_5, BeginLoop_6_0_1, BeginLoop_5_0_1, BeginLoop_4_0_1, BeginLoop_4_2_2, BeginLoop_5_2_2, BeginLoop_6_2_2, BeginLoop_1_4_3, BeginLoop_1_3_3, BeginLoop_0_0_5, BeginLoop_2_5_4, BeginLoop_3_0_6, BeginLoop_1_1_6, TestAlone_2_1_3, TestAlone_2_0_3, TestAlone_6_4_3, TestAlone_6_0_4, TestAlone_5_0_4, TestAlone_5_2_3, TestAlone_4_3_6, TestAlone_4_4_6, TestAlone_0_4_5, TestAlone_3_3_5, TestTurn_3_5, TestTurn_3_4, TestIdentity_1_5_2, TestIdentity_1_2_3, TestIdentity_3_1_3, TestIdentity_0_4_6, TestIdentity_4_2_5, TestIdentity_4_3_5, TestIdentity_5_3_5, TestIdentity_6_3_5, TestIdentity_6_4_5, TestIdentity_5_4_5]
[2023-03-15 09:30:25] [INFO ] Parsed PT model containing 1330 places and 2030 transitions and 6272 arcs in 508 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 44 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Peterson-PT-6-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Peterson-PT-6-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 1330 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 52 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2023-03-15 09:30:25] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2023-03-15 09:30:25] [INFO ] Computed 27 place invariants in 55 ms
[2023-03-15 09:30:26] [INFO ] Implicit Places using invariants in 1016 ms returned []
[2023-03-15 09:30:26] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:30:26] [INFO ] Invariant cache hit.
[2023-03-15 09:30:27] [INFO ] Implicit Places using invariants and state equation in 592 ms returned []
Implicit Place search using SMT with State Equation took 1671 ms to find 0 implicit places.
[2023-03-15 09:30:27] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:30:27] [INFO ] Invariant cache hit.
[2023-03-15 09:30:29] [INFO ] Dead Transitions using invariants and state equation in 2155 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3901 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Support contains 1330 out of 1330 places after structural reductions.
[2023-03-15 09:30:30] [INFO ] Flatten gal took : 337 ms
[2023-03-15 09:30:30] [INFO ] Flatten gal took : 198 ms
[2023-03-15 09:30:31] [INFO ] Input system was already deterministic with 2030 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 887 ms. (steps per millisecond=11 ) properties (out of 37) seen :30
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2023-03-15 09:30:32] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:30:32] [INFO ] Invariant cache hit.
[2023-03-15 09:30:33] [INFO ] [Real]Absence check using 20 positive place invariants in 33 ms returned sat
[2023-03-15 09:30:33] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-15 09:30:33] [INFO ] After 802ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-15 09:30:34] [INFO ] [Nat]Absence check using 20 positive place invariants in 27 ms returned sat
[2023-03-15 09:30:34] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 6 ms returned sat
[2023-03-15 09:30:36] [INFO ] After 1850ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-15 09:30:36] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 09:30:37] [INFO ] After 1149ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-15 09:30:39] [INFO ] Deduced a trap composed of 39 places in 1288 ms of which 8 ms to minimize.
[2023-03-15 09:30:40] [INFO ] Deduced a trap composed of 45 places in 1009 ms of which 2 ms to minimize.
[2023-03-15 09:30:41] [INFO ] Deduced a trap composed of 75 places in 992 ms of which 2 ms to minimize.
[2023-03-15 09:30:42] [INFO ] Deduced a trap composed of 15 places in 1100 ms of which 4 ms to minimize.
[2023-03-15 09:30:43] [INFO ] Deduced a trap composed of 37 places in 1212 ms of which 2 ms to minimize.
[2023-03-15 09:30:45] [INFO ] Deduced a trap composed of 36 places in 1284 ms of which 2 ms to minimize.
[2023-03-15 09:30:46] [INFO ] Deduced a trap composed of 12 places in 1248 ms of which 3 ms to minimize.
[2023-03-15 09:30:48] [INFO ] Deduced a trap composed of 44 places in 1147 ms of which 3 ms to minimize.
[2023-03-15 09:30:49] [INFO ] Deduced a trap composed of 16 places in 1136 ms of which 2 ms to minimize.
[2023-03-15 09:30:50] [INFO ] Deduced a trap composed of 19 places in 1082 ms of which 2 ms to minimize.
[2023-03-15 09:30:52] [INFO ] Deduced a trap composed of 135 places in 1290 ms of which 1 ms to minimize.
[2023-03-15 09:30:53] [INFO ] Deduced a trap composed of 49 places in 1295 ms of which 2 ms to minimize.
[2023-03-15 09:30:54] [INFO ] Deduced a trap composed of 117 places in 1201 ms of which 2 ms to minimize.
[2023-03-15 09:30:56] [INFO ] Deduced a trap composed of 73 places in 1206 ms of which 2 ms to minimize.
[2023-03-15 09:30:58] [INFO ] Deduced a trap composed of 59 places in 1253 ms of which 2 ms to minimize.
[2023-03-15 09:30:59] [INFO ] Deduced a trap composed of 102 places in 1159 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 09:30:59] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 09:30:59] [INFO ] After 25997ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 69 ms.
Support contains 57 out of 1330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions removed 575 transitions
Trivial Post-agglo rules discarded 575 transitions
Performed 575 trivial Post agglomeration. Transition count delta: 575
Iterating post reduction 0 with 575 rules applied. Total rules applied 575 place count 1330 transition count 1455
Reduce places removed 575 places and 0 transitions.
Iterating post reduction 1 with 575 rules applied. Total rules applied 1150 place count 755 transition count 1455
Performed 300 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 300 Pre rules applied. Total rules applied 1150 place count 755 transition count 1155
Deduced a syphon composed of 300 places in 3 ms
Reduce places removed 300 places and 0 transitions.
Iterating global reduction 2 with 600 rules applied. Total rules applied 1750 place count 455 transition count 1155
Applied a total of 1750 rules in 304 ms. Remains 455 /1330 variables (removed 875) and now considering 1155/2030 (removed 875) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 305 ms. Remains : 455/1330 places, 1155/2030 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 434 ms. (steps per millisecond=23 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 359064 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :{}
Probabilistic random walk after 359064 steps, saw 52673 distinct states, run finished after 3002 ms. (steps per millisecond=119 ) properties seen :0
Running SMT prover for 5 properties.
[2023-03-15 09:31:03] [INFO ] Flow matrix only has 945 transitions (discarded 210 similar events)
// Phase 1: matrix 945 rows 455 cols
[2023-03-15 09:31:03] [INFO ] Computed 27 place invariants in 12 ms
[2023-03-15 09:31:04] [INFO ] [Real]Absence check using 20 positive place invariants in 14 ms returned sat
[2023-03-15 09:31:04] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-15 09:31:04] [INFO ] After 784ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-15 09:31:04] [INFO ] [Nat]Absence check using 20 positive place invariants in 12 ms returned sat
[2023-03-15 09:31:04] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-15 09:31:05] [INFO ] After 821ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-15 09:31:05] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 09:31:06] [INFO ] After 525ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2023-03-15 09:31:06] [INFO ] Deduced a trap composed of 25 places in 384 ms of which 1 ms to minimize.
[2023-03-15 09:31:07] [INFO ] Deduced a trap composed of 43 places in 469 ms of which 1 ms to minimize.
[2023-03-15 09:31:07] [INFO ] Deduced a trap composed of 37 places in 474 ms of which 2 ms to minimize.
[2023-03-15 09:31:08] [INFO ] Deduced a trap composed of 11 places in 359 ms of which 2 ms to minimize.
[2023-03-15 09:31:08] [INFO ] Deduced a trap composed of 36 places in 450 ms of which 3 ms to minimize.
[2023-03-15 09:31:09] [INFO ] Deduced a trap composed of 21 places in 451 ms of which 2 ms to minimize.
[2023-03-15 09:31:09] [INFO ] Deduced a trap composed of 30 places in 475 ms of which 3 ms to minimize.
[2023-03-15 09:31:10] [INFO ] Deduced a trap composed of 12 places in 437 ms of which 2 ms to minimize.
[2023-03-15 09:31:10] [INFO ] Deduced a trap composed of 31 places in 447 ms of which 2 ms to minimize.
[2023-03-15 09:31:11] [INFO ] Deduced a trap composed of 15 places in 367 ms of which 2 ms to minimize.
[2023-03-15 09:31:11] [INFO ] Deduced a trap composed of 12 places in 450 ms of which 2 ms to minimize.
[2023-03-15 09:31:12] [INFO ] Deduced a trap composed of 70 places in 292 ms of which 1 ms to minimize.
[2023-03-15 09:31:12] [INFO ] Deduced a trap composed of 22 places in 437 ms of which 1 ms to minimize.
[2023-03-15 09:31:13] [INFO ] Deduced a trap composed of 31 places in 401 ms of which 1 ms to minimize.
[2023-03-15 09:31:13] [INFO ] Deduced a trap composed of 15 places in 437 ms of which 1 ms to minimize.
[2023-03-15 09:31:14] [INFO ] Deduced a trap composed of 15 places in 417 ms of which 2 ms to minimize.
[2023-03-15 09:31:14] [INFO ] Deduced a trap composed of 21 places in 361 ms of which 0 ms to minimize.
[2023-03-15 09:31:15] [INFO ] Deduced a trap composed of 56 places in 403 ms of which 2 ms to minimize.
[2023-03-15 09:31:15] [INFO ] Deduced a trap composed of 22 places in 360 ms of which 10 ms to minimize.
[2023-03-15 09:31:16] [INFO ] Deduced a trap composed of 41 places in 430 ms of which 1 ms to minimize.
[2023-03-15 09:31:16] [INFO ] Deduced a trap composed of 21 places in 320 ms of which 1 ms to minimize.
[2023-03-15 09:31:16] [INFO ] Deduced a trap composed of 21 places in 438 ms of which 1 ms to minimize.
[2023-03-15 09:31:17] [INFO ] Deduced a trap composed of 35 places in 309 ms of which 1 ms to minimize.
[2023-03-15 09:31:17] [INFO ] Deduced a trap composed of 35 places in 358 ms of which 2 ms to minimize.
[2023-03-15 09:31:18] [INFO ] Deduced a trap composed of 65 places in 291 ms of which 1 ms to minimize.
[2023-03-15 09:31:18] [INFO ] Deduced a trap composed of 41 places in 238 ms of which 0 ms to minimize.
[2023-03-15 09:31:18] [INFO ] Deduced a trap composed of 41 places in 344 ms of which 1 ms to minimize.
[2023-03-15 09:31:19] [INFO ] Deduced a trap composed of 41 places in 362 ms of which 1 ms to minimize.
[2023-03-15 09:31:19] [INFO ] Deduced a trap composed of 21 places in 439 ms of which 1 ms to minimize.
[2023-03-15 09:31:20] [INFO ] Deduced a trap composed of 62 places in 371 ms of which 1 ms to minimize.
[2023-03-15 09:31:20] [INFO ] Deduced a trap composed of 50 places in 252 ms of which 1 ms to minimize.
[2023-03-15 09:31:21] [INFO ] Deduced a trap composed of 82 places in 388 ms of which 1 ms to minimize.
[2023-03-15 09:31:21] [INFO ] Deduced a trap composed of 49 places in 312 ms of which 1 ms to minimize.
[2023-03-15 09:31:21] [INFO ] Deduced a trap composed of 57 places in 385 ms of which 1 ms to minimize.
[2023-03-15 09:31:22] [INFO ] Deduced a trap composed of 55 places in 304 ms of which 2 ms to minimize.
[2023-03-15 09:31:22] [INFO ] Deduced a trap composed of 35 places in 364 ms of which 1 ms to minimize.
[2023-03-15 09:31:23] [INFO ] Deduced a trap composed of 29 places in 425 ms of which 1 ms to minimize.
[2023-03-15 09:31:23] [INFO ] Deduced a trap composed of 34 places in 345 ms of which 1 ms to minimize.
[2023-03-15 09:31:24] [INFO ] Deduced a trap composed of 50 places in 352 ms of which 1 ms to minimize.
[2023-03-15 09:31:25] [INFO ] Deduced a trap composed of 42 places in 309 ms of which 1 ms to minimize.
[2023-03-15 09:31:26] [INFO ] Deduced a trap composed of 35 places in 416 ms of which 4 ms to minimize.
[2023-03-15 09:31:26] [INFO ] Deduced a trap composed of 39 places in 405 ms of which 1 ms to minimize.
[2023-03-15 09:31:27] [INFO ] Deduced a trap composed of 12 places in 422 ms of which 1 ms to minimize.
[2023-03-15 09:31:27] [INFO ] Deduced a trap composed of 10 places in 397 ms of which 1 ms to minimize.
[2023-03-15 09:31:28] [INFO ] Deduced a trap composed of 20 places in 396 ms of which 1 ms to minimize.
[2023-03-15 09:31:28] [INFO ] Deduced a trap composed of 38 places in 420 ms of which 1 ms to minimize.
[2023-03-15 09:31:29] [INFO ] Deduced a trap composed of 11 places in 411 ms of which 1 ms to minimize.
[2023-03-15 09:31:29] [INFO ] Deduced a trap composed of 44 places in 393 ms of which 2 ms to minimize.
[2023-03-15 09:31:29] [INFO ] Deduced a trap composed of 32 places in 346 ms of which 4 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 09:31:29] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-15 09:31:29] [INFO ] After 25218ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:5
Parikh walk visited 0 properties in 7 ms.
Support contains 57 out of 455 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1155/1155 transitions.
Applied a total of 0 rules in 83 ms. Remains 455 /455 variables (removed 0) and now considering 1155/1155 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 455/455 places, 1155/1155 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 455/455 places, 1155/1155 transitions.
Applied a total of 0 rules in 56 ms. Remains 455 /455 variables (removed 0) and now considering 1155/1155 (removed 0) transitions.
[2023-03-15 09:31:30] [INFO ] Flow matrix only has 945 transitions (discarded 210 similar events)
[2023-03-15 09:31:30] [INFO ] Invariant cache hit.
[2023-03-15 09:31:30] [INFO ] Implicit Places using invariants in 744 ms returned []
[2023-03-15 09:31:30] [INFO ] Flow matrix only has 945 transitions (discarded 210 similar events)
[2023-03-15 09:31:30] [INFO ] Invariant cache hit.
[2023-03-15 09:31:31] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 09:31:34] [INFO ] Implicit Places using invariants and state equation in 3451 ms returned []
Implicit Place search using SMT with State Equation took 4205 ms to find 0 implicit places.
[2023-03-15 09:31:34] [INFO ] Redundant transitions in 143 ms returned []
[2023-03-15 09:31:34] [INFO ] Flow matrix only has 945 transitions (discarded 210 similar events)
[2023-03-15 09:31:34] [INFO ] Invariant cache hit.
[2023-03-15 09:31:35] [INFO ] Dead Transitions using invariants and state equation in 1218 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5637 ms. Remains : 455/455 places, 1155/1155 transitions.
Graph (trivial) has 803 edges and 455 vertex of which 293 / 455 are part of one of the 42 SCC in 7 ms
Free SCC test removed 251 places
Drop transitions removed 502 transitions
Ensure Unique test removed 210 transitions
Reduce isomorphic transitions removed 712 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -36
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 15 place count 197 transition count 479
Drop transitions removed 36 transitions
Redundant transition composition rules discarded 36 transitions
Iterating global reduction 0 with 36 rules applied. Total rules applied 51 place count 197 transition count 443
Partial Free-agglomeration rule applied 43 times.
Drop transitions removed 43 transitions
Iterating global reduction 0 with 43 rules applied. Total rules applied 94 place count 197 transition count 443
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 99 place count 197 transition count 438
Applied a total of 99 rules in 61 ms. Remains 197 /455 variables (removed 258) and now considering 438/1155 (removed 717) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 438 rows 197 cols
[2023-03-15 09:31:35] [INFO ] Computed 27 place invariants in 3 ms
[2023-03-15 09:31:35] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2023-03-15 09:31:35] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 09:31:35] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-15 09:31:35] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2023-03-15 09:31:35] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 2 ms returned sat
[2023-03-15 09:31:36] [INFO ] After 492ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-15 09:31:36] [INFO ] After 897ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 278 ms.
[2023-03-15 09:31:37] [INFO ] After 1296ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
FORMULA Peterson-PT-6-LTLFireability-09 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' '!(X(G((F(p1)&&p0))))'
Support contains 336 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 49 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2023-03-15 09:31:37] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2023-03-15 09:31:37] [INFO ] Computed 27 place invariants in 16 ms
[2023-03-15 09:31:38] [INFO ] Implicit Places using invariants in 1027 ms returned []
[2023-03-15 09:31:38] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:31:38] [INFO ] Invariant cache hit.
[2023-03-15 09:31:39] [INFO ] Implicit Places using invariants and state equation in 989 ms returned []
Implicit Place search using SMT with State Equation took 2020 ms to find 0 implicit places.
[2023-03-15 09:31:39] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:31:39] [INFO ] Invariant cache hit.
[2023-03-15 09:31:42] [INFO ] Dead Transitions using invariants and state equation in 2250 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4321 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 468 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Peterson-PT-6-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s911 0) (EQ s1106 0) (EQ s1033 0) (EQ s968 0) (EQ s1236 0) (EQ s903 0) (EQ s1114 0) (EQ s1244 0) (EQ s1025 0) (EQ s1155 0) (EQ s1090 0) (EQ s9...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 153 steps with 12 reset in 34 ms.
FORMULA Peterson-PT-6-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-6-LTLFireability-00 finished in 4923 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((p1&&(p2||F(p3)))))||p0)))'
Support contains 392 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 63 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2023-03-15 09:31:42] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:31:42] [INFO ] Invariant cache hit.
[2023-03-15 09:31:43] [INFO ] Implicit Places using invariants in 788 ms returned []
[2023-03-15 09:31:43] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:31:43] [INFO ] Invariant cache hit.
[2023-03-15 09:31:44] [INFO ] Implicit Places using invariants and state equation in 990 ms returned []
Implicit Place search using SMT with State Equation took 1783 ms to find 0 implicit places.
[2023-03-15 09:31:44] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:31:44] [INFO ] Invariant cache hit.
[2023-03-15 09:31:46] [INFO ] Dead Transitions using invariants and state equation in 2352 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4201 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 275 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1)))]
Running random walk in product with property : Peterson-PT-6-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1 (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=1 dest: 2}], [{ cond=(AND p2 p1 (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}]], initial=3, aps=[p0:(OR (AND (EQ s943 1) (EQ s1182 1)) (AND (EQ s915 1) (EQ s1197 1)) (AND (EQ s914 1) (EQ s1184 1)) (AND (EQ s924 1) (EQ s1195 1)) (AND (EQ s938 1) (EQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 952 reset in 3097 ms.
Stack based approach found an accepted trace after 779 steps with 11 reset with depth 260 and stack size 260 in 23 ms.
FORMULA Peterson-PT-6-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-6-LTLFireability-01 finished in 7640 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&F(p1)))))'
Support contains 112 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 42 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2023-03-15 09:31:50] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:31:50] [INFO ] Invariant cache hit.
[2023-03-15 09:31:51] [INFO ] Implicit Places using invariants in 920 ms returned []
[2023-03-15 09:31:51] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:31:51] [INFO ] Invariant cache hit.
[2023-03-15 09:31:52] [INFO ] Implicit Places using invariants and state equation in 870 ms returned []
Implicit Place search using SMT with State Equation took 1792 ms to find 0 implicit places.
[2023-03-15 09:31:52] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:31:52] [INFO ] Invariant cache hit.
[2023-03-15 09:31:54] [INFO ] Dead Transitions using invariants and state equation in 2490 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4326 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 196 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-PT-6-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=4, aps=[p1:(AND (OR (EQ s943 0) (EQ s1182 0)) (OR (EQ s915 0) (EQ s1197 0)) (OR (EQ s914 0) (EQ s1184 0)) (OR (EQ s924 0) (EQ s1195 0)) (OR (EQ s938 0) (EQ s1187 ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA Peterson-PT-6-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-6-LTLFireability-02 finished in 4551 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(X(p0))||(G(p2)&&p1))))'
Support contains 630 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 31 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2023-03-15 09:31:54] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:31:54] [INFO ] Invariant cache hit.
[2023-03-15 09:31:55] [INFO ] Implicit Places using invariants in 790 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 795 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 22 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 851 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 312 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (NOT p0), true, (AND (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : Peterson-PT-6-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 p2), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={} source=2 dest: 3}, { cond=p2, acceptance={} source=2 dest: 5}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=5 dest: 4}, { cond=(AND p2 (NOT p0)), acceptance={} source=5 dest: 6}], [{ cond=(NOT p2), acceptance={} source=6 dest: 4}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (EQ s1 0) (EQ s131 0) (EQ s66 0) (EQ s196 0) (EQ s139 0) (EQ s9 0) (EQ s74 0) (EQ s204 0) (EQ s17 0) (EQ s147 0) (EQ s82 0) (EQ s212 0) (EQ s155 0...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 24 steps with 0 reset in 1 ms.
FORMULA Peterson-PT-6-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-6-LTLFireability-03 finished in 1224 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)||(X(G(p1))&&G(p2))))'
Support contains 378 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 38 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2023-03-15 09:31:56] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:31:56] [INFO ] Invariant cache hit.
[2023-03-15 09:31:57] [INFO ] Implicit Places using invariants in 994 ms returned []
[2023-03-15 09:31:57] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:31:57] [INFO ] Invariant cache hit.
[2023-03-15 09:31:58] [INFO ] Implicit Places using invariants and state equation in 927 ms returned []
Implicit Place search using SMT with State Equation took 1923 ms to find 0 implicit places.
[2023-03-15 09:31:58] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:31:58] [INFO ] Invariant cache hit.
[2023-03-15 09:32:00] [INFO ] Dead Transitions using invariants and state equation in 2320 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4283 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 123 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : Peterson-PT-6-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2 p1), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (EQ s943 1) (EQ s1182 1)) (AND (EQ s915 1) (EQ s1197 1)) (AND (EQ s914 1) (EQ s1184 1)) (AND (EQ s924 1) (EQ s1195 1)) (AND (EQ s938 1) (EQ s1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 19880 reset in 1943 ms.
Product exploration explored 100000 steps with 19939 reset in 1519 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) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT p0)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))))]
Knowledge based reduction with 5 factoid took 423 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT p0)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))))), (F p0)]
Knowledge based reduction with 5 factoid took 416 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
[2023-03-15 09:32:05] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:32:05] [INFO ] Invariant cache hit.
[2023-03-15 09:32:08] [INFO ] [Real]Absence check using 20 positive place invariants in 70 ms returned sat
[2023-03-15 09:32:08] [INFO ] [Real]Absence check using 20 positive and 7 generalized place invariants in 65 ms returned sat
[2023-03-15 09:32:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:32:15] [INFO ] [Real]Absence check using state equation in 6396 ms returned sat
[2023-03-15 09:32:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:32:18] [INFO ] [Nat]Absence check using 20 positive place invariants in 54 ms returned sat
[2023-03-15 09:32:18] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 35 ms returned sat
[2023-03-15 09:32:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:32:25] [INFO ] [Nat]Absence check using state equation in 6969 ms returned sat
[2023-03-15 09:32:25] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 09:32:25] [INFO ] [Nat]Added 330 Read/Feed constraints in 320 ms returned sat
[2023-03-15 09:32:27] [INFO ] Deduced a trap composed of 20 places in 1432 ms of which 3 ms to minimize.
[2023-03-15 09:32:28] [INFO ] Deduced a trap composed of 23 places in 1155 ms of which 1 ms to minimize.
[2023-03-15 09:32:30] [INFO ] Deduced a trap composed of 19 places in 1030 ms of which 3 ms to minimize.
[2023-03-15 09:32:30] [INFO ] Trap strengthening (SAT) tested/added 3/3 trap constraints in 4352 ms
Could not prove EG (NOT p0)
Support contains 84 out of 1330 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 1330 transition count 2024
Reduce places removed 6 places and 0 transitions.
Performed 294 Post agglomeration using F-continuation condition.Transition count delta: 294
Iterating post reduction 1 with 300 rules applied. Total rules applied 306 place count 1324 transition count 1730
Reduce places removed 294 places and 0 transitions.
Iterating post reduction 2 with 294 rules applied. Total rules applied 600 place count 1030 transition count 1730
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 600 place count 1030 transition count 1688
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 684 place count 988 transition count 1688
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 756 place count 952 transition count 1652
Applied a total of 756 rules in 350 ms. Remains 952 /1330 variables (removed 378) and now considering 1652/2030 (removed 378) transitions.
[2023-03-15 09:32:30] [INFO ] Flow matrix only has 1442 transitions (discarded 210 similar events)
// Phase 1: matrix 1442 rows 952 cols
[2023-03-15 09:32:30] [INFO ] Computed 27 place invariants in 12 ms
[2023-03-15 09:32:31] [INFO ] Implicit Places using invariants in 813 ms returned [933, 934, 936, 944, 945, 946, 947]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 815 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 945/1330 places, 1652/2030 transitions.
Applied a total of 0 rules in 52 ms. Remains 945 /945 variables (removed 0) and now considering 1652/1652 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1218 ms. Remains : 945/1330 places, 1652/2030 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 : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 164 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 201 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
[2023-03-15 09:32:31] [INFO ] Flow matrix only has 1442 transitions (discarded 210 similar events)
// Phase 1: matrix 1442 rows 945 cols
[2023-03-15 09:32:32] [INFO ] Computed 20 place invariants in 12 ms
[2023-03-15 09:32:34] [INFO ] [Real]Absence check using 20 positive place invariants in 44 ms returned sat
[2023-03-15 09:32:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:32:37] [INFO ] [Real]Absence check using state equation in 2640 ms returned sat
[2023-03-15 09:32:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:32:40] [INFO ] [Nat]Absence check using 20 positive place invariants in 49 ms returned sat
[2023-03-15 09:32:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:32:43] [INFO ] [Nat]Absence check using state equation in 2246 ms returned sat
[2023-03-15 09:32:43] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 09:32:43] [INFO ] [Nat]Added 330 Read/Feed constraints in 226 ms returned sat
[2023-03-15 09:32:44] [INFO ] Deduced a trap composed of 56 places in 810 ms of which 1 ms to minimize.
[2023-03-15 09:32:45] [INFO ] Deduced a trap composed of 13 places in 750 ms of which 2 ms to minimize.
[2023-03-15 09:32:46] [INFO ] Deduced a trap composed of 19 places in 893 ms of which 1 ms to minimize.
[2023-03-15 09:32:47] [INFO ] Deduced a trap composed of 14 places in 850 ms of which 2 ms to minimize.
[2023-03-15 09:32:48] [INFO ] Deduced a trap composed of 34 places in 911 ms of which 1 ms to minimize.
[2023-03-15 09:32:49] [INFO ] Deduced a trap composed of 31 places in 896 ms of which 1 ms to minimize.
[2023-03-15 09:32:49] [INFO ] Deduced a trap composed of 11 places in 641 ms of which 1 ms to minimize.
[2023-03-15 09:32:50] [INFO ] Deduced a trap composed of 34 places in 792 ms of which 2 ms to minimize.
[2023-03-15 09:32:50] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 7527 ms
[2023-03-15 09:32:51] [INFO ] Computed and/alt/rep : 1351/3374/1351 causal constraints (skipped 84 transitions) in 194 ms.
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.refineWithCausalOrder(DeadlockTester.java:1186)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
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-15 09:32:52] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Product exploration explored 100000 steps with 19961 reset in 1203 ms.
Product exploration explored 100000 steps with 19932 reset in 827 ms.
Support contains 84 out of 945 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 945/945 places, 1652/1652 transitions.
Drop transitions removed 288 transitions
Trivial Post-agglo rules discarded 288 transitions
Performed 288 trivial Post agglomeration. Transition count delta: 288
Iterating post reduction 0 with 288 rules applied. Total rules applied 288 place count 945 transition count 1364
Reduce places removed 288 places and 0 transitions.
Iterating post reduction 1 with 288 rules applied. Total rules applied 576 place count 657 transition count 1364
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 252 Pre rules applied. Total rules applied 576 place count 657 transition count 1112
Deduced a syphon composed of 252 places in 0 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 1080 place count 405 transition count 1112
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 1092 place count 399 transition count 1106
Applied a total of 1092 rules in 91 ms. Remains 399 /945 variables (removed 546) and now considering 1106/1652 (removed 546) transitions.
[2023-03-15 09:32:54] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 09:32:54] [INFO ] Computed 20 place invariants in 4 ms
[2023-03-15 09:32:55] [INFO ] Implicit Places using invariants in 565 ms returned []
[2023-03-15 09:32:55] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 09:32:55] [INFO ] Invariant cache hit.
[2023-03-15 09:32:55] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 09:32:57] [INFO ] Implicit Places using invariants and state equation in 2396 ms returned []
Implicit Place search using SMT with State Equation took 2964 ms to find 0 implicit places.
[2023-03-15 09:32:57] [INFO ] Redundant transitions in 50 ms returned []
[2023-03-15 09:32:57] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 09:32:57] [INFO ] Invariant cache hit.
[2023-03-15 09:32:58] [INFO ] Dead Transitions using invariants and state equation in 1050 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 399/945 places, 1106/1652 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4164 ms. Remains : 399/945 places, 1106/1652 transitions.
Treatment of property Peterson-PT-6-LTLFireability-04 finished in 63033 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((X(F((p1&&F(p2))))||p0))))'
Support contains 301 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 53 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2023-03-15 09:32:59] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2023-03-15 09:32:59] [INFO ] Computed 27 place invariants in 13 ms
[2023-03-15 09:33:00] [INFO ] Implicit Places using invariants in 815 ms returned [1205, 1206, 1301, 1302, 1303]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 822 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1325/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 58 ms. Remains 1325 /1325 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 934 ms. Remains : 1325/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 236 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Peterson-PT-6-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s260 1) (EQ s261 1) (EQ s262 1) (EQ s263 1) (EQ s256 1) (EQ s257 1) (EQ s258 1) (EQ s259 1) (EQ s268 1) (EQ s269 1) (EQ s270 1) (EQ s271 1) (EQ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 1158 ms.
Stack based approach found an accepted trace after 522 steps with 0 reset with depth 523 and stack size 523 in 6 ms.
FORMULA Peterson-PT-6-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-6-LTLFireability-05 finished in 2407 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(F(p1)))))'
Support contains 42 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 50 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2023-03-15 09:33:01] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:33:01] [INFO ] Invariant cache hit.
[2023-03-15 09:33:02] [INFO ] Implicit Places using invariants in 883 ms returned []
[2023-03-15 09:33:02] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:33:02] [INFO ] Invariant cache hit.
[2023-03-15 09:33:03] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 09:33:10] [INFO ] Implicit Places using invariants and state equation in 8449 ms returned [1205, 1206, 1208, 1301, 1302, 1303, 1304]
Discarding 7 places :
Implicit Place search using SMT with State Equation took 9333 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 1323/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 38 ms. Remains 1323 /1323 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 9424 ms. Remains : 1323/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : Peterson-PT-6-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p1:(AND (EQ s341 0) (EQ s324 0) (EQ s343 0) (EQ s342 0) (EQ s323 0) (EQ s322 0) (EQ s344 0)), p0:(OR (EQ s333 1) (EQ s335 1) (EQ s334 1) (EQ s340 1) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-6-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-6-LTLFireability-06 finished in 9571 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(((p1 U X(G(!p2)))&&p0)))'
Support contains 350 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 19 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2023-03-15 09:33:11] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:33:11] [INFO ] Invariant cache hit.
[2023-03-15 09:33:12] [INFO ] Implicit Places using invariants in 991 ms returned []
[2023-03-15 09:33:12] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:33:12] [INFO ] Invariant cache hit.
[2023-03-15 09:33:13] [INFO ] Implicit Places using invariants and state equation in 1099 ms returned []
Implicit Place search using SMT with State Equation took 2093 ms to find 0 implicit places.
[2023-03-15 09:33:13] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:33:13] [INFO ] Invariant cache hit.
[2023-03-15 09:33:15] [INFO ] Dead Transitions using invariants and state equation in 2452 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4567 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) p2), (OR (NOT p0) p2), true, p2, p2]
Running random walk in product with property : Peterson-PT-6-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 2}, { cond=(NOT p2), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND p1 p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (OR (EQ s260 1) (EQ s261 1) (EQ s262 1) (EQ s263 1) (EQ s256 1) (EQ s257 1) (EQ s258 1) (EQ s259 1) (EQ s268 1) (EQ s269 1) (EQ s270 1) (EQ s271 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-6-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-6-LTLFireability-07 finished in 4749 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||(p1 U X(p2))))&&F(G(p3))))))'
Support contains 7 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 36 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2023-03-15 09:33:15] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:33:15] [INFO ] Invariant cache hit.
[2023-03-15 09:33:17] [INFO ] Implicit Places using invariants in 1133 ms returned []
[2023-03-15 09:33:17] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:33:17] [INFO ] Invariant cache hit.
[2023-03-15 09:33:18] [INFO ] Implicit Places using invariants and state equation in 1136 ms returned []
Implicit Place search using SMT with State Equation took 2271 ms to find 0 implicit places.
[2023-03-15 09:33:18] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:33:18] [INFO ] Invariant cache hit.
[2023-03-15 09:33:20] [INFO ] Dead Transitions using invariants and state equation in 2322 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4631 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 350 ms :[(OR (NOT p3) (AND (NOT p0) (NOT p2))), (OR (NOT p3) (AND (NOT p0) (NOT p2))), (OR (NOT p3) (AND (NOT p0) (NOT p2))), (NOT p2), (NOT p3), (NOT p2), true]
Running random walk in product with property : Peterson-PT-6-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p3), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={} source=3 dest: 6}], [{ cond=p3, acceptance={} source=4 dest: 4}, { cond=(NOT p3), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=5 dest: 3}, { cond=(AND p1 (NOT p2)), acceptance={0} source=5 dest: 5}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (EQ s949 1) (EQ s1198 1)), p1:(EQ s337 1), p3:(AND (EQ s925 1) (EQ s1209 1)), p2:(AND (EQ s1196 1) (EQ s1277 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA Peterson-PT-6-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-6-LTLFireability-10 finished in 5013 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U (G(p0)||(p0&&(p1||F(p2)))))&&(F(p4)||p3))))'
Support contains 5 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 55 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2023-03-15 09:33:20] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:33:20] [INFO ] Invariant cache hit.
[2023-03-15 09:33:22] [INFO ] Implicit Places using invariants in 1135 ms returned []
[2023-03-15 09:33:22] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:33:22] [INFO ] Invariant cache hit.
[2023-03-15 09:33:23] [INFO ] Implicit Places using invariants and state equation in 1108 ms returned []
Implicit Place search using SMT with State Equation took 2245 ms to find 0 implicit places.
[2023-03-15 09:33:23] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:33:23] [INFO ] Invariant cache hit.
[2023-03-15 09:33:25] [INFO ] Dead Transitions using invariants and state equation in 2331 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4637 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 335 ms :[(OR (NOT p0) (AND (NOT p3) (NOT p4))), (OR (NOT p0) (AND (NOT p3) (NOT p4))), true, (NOT p4), (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : Peterson-PT-6-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p4) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p4), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) p0), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(NEQ s253 1), p3:(OR (EQ s599 0) (EQ s674 0)), p4:(OR (EQ s601 0) (EQ s1313 0)), p1:(AND (EQ s599 1) (EQ s674 1)), p2:(AND (EQ s601 1) (EQ s1313 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 314 reset in 511 ms.
Product exploration explored 100000 steps with 337 reset in 553 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 p3 p4 (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2) p0)), (X p0), (X (NOT (AND (NOT p3) (NOT p4) p0))), true, (X (X (AND (NOT p1) (NOT p2) p0))), (X (X p4)), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 497 ms. Reduced automaton from 6 states, 9 edges and 5 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 162 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:33:27] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:33:27] [INFO ] Invariant cache hit.
[2023-03-15 09:33:28] [INFO ] After 473ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:33:28] [INFO ] [Nat]Absence check using 20 positive place invariants in 28 ms returned sat
[2023-03-15 09:33:28] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-15 09:33:29] [INFO ] After 1118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:33:29] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 09:33:30] [INFO ] After 146ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:33:30] [INFO ] After 485ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 132 ms.
[2023-03-15 09:33:30] [INFO ] After 2291ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 1330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions removed 586 transitions
Trivial Post-agglo rules discarded 586 transitions
Performed 586 trivial Post agglomeration. Transition count delta: 586
Iterating post reduction 0 with 586 rules applied. Total rules applied 586 place count 1330 transition count 1444
Reduce places removed 586 places and 0 transitions.
Iterating post reduction 1 with 586 rules applied. Total rules applied 1172 place count 744 transition count 1444
Performed 294 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 294 Pre rules applied. Total rules applied 1172 place count 744 transition count 1150
Deduced a syphon composed of 294 places in 1 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 2 with 588 rules applied. Total rules applied 1760 place count 450 transition count 1150
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 1842 place count 409 transition count 1109
Applied a total of 1842 rules in 121 ms. Remains 409 /1330 variables (removed 921) and now considering 1109/2030 (removed 921) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 409/1330 places, 1109/2030 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 1) seen :0
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
Interrupted probabilistic random walk after 659256 steps, run timeout after 3001 ms. (steps per millisecond=219 ) properties seen :{}
Probabilistic random walk after 659256 steps, saw 88545 distinct states, run finished after 3001 ms. (steps per millisecond=219 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:33:33] [INFO ] Flow matrix only has 899 transitions (discarded 210 similar events)
// Phase 1: matrix 899 rows 409 cols
[2023-03-15 09:33:33] [INFO ] Computed 27 place invariants in 6 ms
[2023-03-15 09:33:33] [INFO ] After 164ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:33:34] [INFO ] [Nat]Absence check using 20 positive place invariants in 16 ms returned sat
[2023-03-15 09:33:34] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-15 09:33:34] [INFO ] After 424ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:33:34] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 09:33:34] [INFO ] After 97ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:33:34] [INFO ] After 188ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-15 09:33:34] [INFO ] After 870ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 409 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 409/409 places, 1109/1109 transitions.
Applied a total of 0 rules in 26 ms. Remains 409 /409 variables (removed 0) and now considering 1109/1109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 409/409 places, 1109/1109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 409/409 places, 1109/1109 transitions.
Applied a total of 0 rules in 26 ms. Remains 409 /409 variables (removed 0) and now considering 1109/1109 (removed 0) transitions.
[2023-03-15 09:33:34] [INFO ] Flow matrix only has 899 transitions (discarded 210 similar events)
[2023-03-15 09:33:34] [INFO ] Invariant cache hit.
[2023-03-15 09:33:35] [INFO ] Implicit Places using invariants in 778 ms returned [389, 390, 392, 400, 401, 402, 403]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 782 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 402/409 places, 1109/1109 transitions.
Applied a total of 0 rules in 29 ms. Remains 402 /402 variables (removed 0) and now considering 1109/1109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 851 ms. Remains : 402/409 places, 1109/1109 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
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
Interrupted probabilistic random walk after 627544 steps, run timeout after 3001 ms. (steps per millisecond=209 ) properties seen :{}
Probabilistic random walk after 627544 steps, saw 85035 distinct states, run finished after 3001 ms. (steps per millisecond=209 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:33:38] [INFO ] Flow matrix only has 899 transitions (discarded 210 similar events)
// Phase 1: matrix 899 rows 402 cols
[2023-03-15 09:33:38] [INFO ] Computed 20 place invariants in 5 ms
[2023-03-15 09:33:38] [INFO ] After 157ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:33:39] [INFO ] [Nat]Absence check using 20 positive place invariants in 15 ms returned sat
[2023-03-15 09:33:39] [INFO ] After 450ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:33:39] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 09:33:39] [INFO ] After 145ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:33:39] [INFO ] After 249ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 51 ms.
[2023-03-15 09:33:39] [INFO ] After 960ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 1109/1109 transitions.
Applied a total of 0 rules in 29 ms. Remains 402 /402 variables (removed 0) and now considering 1109/1109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 402/402 places, 1109/1109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 1109/1109 transitions.
Applied a total of 0 rules in 25 ms. Remains 402 /402 variables (removed 0) and now considering 1109/1109 (removed 0) transitions.
[2023-03-15 09:33:39] [INFO ] Flow matrix only has 899 transitions (discarded 210 similar events)
[2023-03-15 09:33:39] [INFO ] Invariant cache hit.
[2023-03-15 09:33:40] [INFO ] Implicit Places using invariants in 660 ms returned []
[2023-03-15 09:33:40] [INFO ] Flow matrix only has 899 transitions (discarded 210 similar events)
[2023-03-15 09:33:40] [INFO ] Invariant cache hit.
[2023-03-15 09:33:40] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 09:33:42] [INFO ] Implicit Places using invariants and state equation in 2089 ms returned []
Implicit Place search using SMT with State Equation took 2758 ms to find 0 implicit places.
[2023-03-15 09:33:42] [INFO ] Redundant transitions in 163 ms returned []
[2023-03-15 09:33:42] [INFO ] Flow matrix only has 899 transitions (discarded 210 similar events)
[2023-03-15 09:33:42] [INFO ] Invariant cache hit.
[2023-03-15 09:33:43] [INFO ] Dead Transitions using invariants and state equation in 979 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3933 ms. Remains : 402/402 places, 1109/1109 transitions.
Graph (trivial) has 840 edges and 402 vertex of which 294 / 402 are part of one of the 42 SCC in 0 ms
Free SCC test removed 252 places
Drop transitions removed 504 transitions
Ensure Unique test removed 251 transitions
Reduce isomorphic transitions removed 755 transitions.
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 41 Pre rules applied. Total rules applied 1 place count 150 transition count 313
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 83 place count 109 transition count 313
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 103 place count 96 transition count 312
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 115 place count 90 transition count 306
Graph (trivial) has 43 edges and 90 vertex of which 36 / 90 are part of one of the 6 SCC in 1 ms
Free SCC test removed 30 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 122 place count 54 transition count 306
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Graph (trivial) has 223 edges and 54 vertex of which 36 / 54 are part of one of the 6 SCC in 1 ms
Free SCC test removed 30 places
Iterating post reduction 0 with 37 rules applied. Total rules applied 159 place count 24 transition count 270
Drop transitions removed 180 transitions
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 245 transitions.
Iterating post reduction 1 with 245 rules applied. Total rules applied 404 place count 24 transition count 25
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 422 place count 12 transition count 19
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 10 rules applied. Total rules applied 432 place count 12 transition count 9
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 435 place count 9 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 435 place count 9 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 439 place count 7 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 441 place count 6 transition count 6
Applied a total of 441 rules in 24 ms. Remains 6 /402 variables (removed 396) and now considering 6/1109 (removed 1103) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 6 rows 6 cols
[2023-03-15 09:33:43] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-15 09:33:43] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:33:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 09:33:43] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:33:43] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-15 09:33:43] [INFO ] After 48ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p3 p4 (NOT p1) (NOT p2)), (X (AND (NOT p1) (NOT p2) p0)), (X p0), (X (NOT (AND (NOT p3) (NOT p4) p0))), true, (X (X (AND (NOT p1) (NOT p2) p0))), (X (X p4)), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(F p2), (F (NOT (AND (NOT p1) p0 (NOT p2))))]
Knowledge based reduction with 8 factoid took 363 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 106 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 67 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2023-03-15 09:33:44] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2023-03-15 09:33:44] [INFO ] Computed 27 place invariants in 17 ms
[2023-03-15 09:33:45] [INFO ] Implicit Places using invariants in 1171 ms returned []
[2023-03-15 09:33:45] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:33:45] [INFO ] Invariant cache hit.
[2023-03-15 09:33:46] [INFO ] Implicit Places using invariants and state equation in 1098 ms returned []
Implicit Place search using SMT with State Equation took 2271 ms to find 0 implicit places.
[2023-03-15 09:33:46] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:33:46] [INFO ] Invariant cache hit.
[2023-03-15 09:33:49] [INFO ] Dead Transitions using invariants and state equation in 2597 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4936 ms. Remains : 1330/1330 places, 2030/2030 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 p2) p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p1) p0 (NOT p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p0 (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 320 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:33:50] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:33:50] [INFO ] Invariant cache hit.
[2023-03-15 09:33:50] [INFO ] After 453ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:33:51] [INFO ] [Nat]Absence check using 20 positive place invariants in 29 ms returned sat
[2023-03-15 09:33:51] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 7 ms returned sat
[2023-03-15 09:33:52] [INFO ] After 1143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:33:52] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 09:33:52] [INFO ] After 153ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:33:52] [INFO ] After 367ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 111 ms.
[2023-03-15 09:33:52] [INFO ] After 2170ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 1330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions removed 586 transitions
Trivial Post-agglo rules discarded 586 transitions
Performed 586 trivial Post agglomeration. Transition count delta: 586
Iterating post reduction 0 with 586 rules applied. Total rules applied 586 place count 1330 transition count 1444
Reduce places removed 586 places and 0 transitions.
Iterating post reduction 1 with 586 rules applied. Total rules applied 1172 place count 744 transition count 1444
Performed 294 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 294 Pre rules applied. Total rules applied 1172 place count 744 transition count 1150
Deduced a syphon composed of 294 places in 0 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 2 with 588 rules applied. Total rules applied 1760 place count 450 transition count 1150
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 1842 place count 409 transition count 1109
Applied a total of 1842 rules in 57 ms. Remains 409 /1330 variables (removed 921) and now considering 1109/2030 (removed 921) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 409/1330 places, 1109/2030 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 725752 steps, run timeout after 3001 ms. (steps per millisecond=241 ) properties seen :{}
Probabilistic random walk after 725752 steps, saw 97660 distinct states, run finished after 3001 ms. (steps per millisecond=241 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:33:55] [INFO ] Flow matrix only has 899 transitions (discarded 210 similar events)
// Phase 1: matrix 899 rows 409 cols
[2023-03-15 09:33:55] [INFO ] Computed 27 place invariants in 9 ms
[2023-03-15 09:33:55] [INFO ] After 157ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:33:56] [INFO ] [Nat]Absence check using 20 positive place invariants in 14 ms returned sat
[2023-03-15 09:33:56] [INFO ] [Nat]Absence check using 20 positive and 7 generalized place invariants in 3 ms returned sat
[2023-03-15 09:33:56] [INFO ] After 423ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:33:56] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 09:33:56] [INFO ] After 91ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:33:56] [INFO ] After 176ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 43 ms.
[2023-03-15 09:33:56] [INFO ] After 846ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 409 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 409/409 places, 1109/1109 transitions.
Applied a total of 0 rules in 20 ms. Remains 409 /409 variables (removed 0) and now considering 1109/1109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 409/409 places, 1109/1109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 409/409 places, 1109/1109 transitions.
Applied a total of 0 rules in 20 ms. Remains 409 /409 variables (removed 0) and now considering 1109/1109 (removed 0) transitions.
[2023-03-15 09:33:56] [INFO ] Flow matrix only has 899 transitions (discarded 210 similar events)
[2023-03-15 09:33:56] [INFO ] Invariant cache hit.
[2023-03-15 09:33:57] [INFO ] Implicit Places using invariants in 673 ms returned [389, 390, 392, 400, 401, 402, 403]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 676 ms to find 7 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 402/409 places, 1109/1109 transitions.
Applied a total of 0 rules in 21 ms. Remains 402 /402 variables (removed 0) and now considering 1109/1109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 719 ms. Remains : 402/409 places, 1109/1109 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 625408 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :{}
Probabilistic random walk after 625408 steps, saw 84802 distinct states, run finished after 3001 ms. (steps per millisecond=208 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-15 09:34:00] [INFO ] Flow matrix only has 899 transitions (discarded 210 similar events)
// Phase 1: matrix 899 rows 402 cols
[2023-03-15 09:34:00] [INFO ] Computed 20 place invariants in 4 ms
[2023-03-15 09:34:00] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:34:00] [INFO ] [Nat]Absence check using 20 positive place invariants in 8 ms returned sat
[2023-03-15 09:34:01] [INFO ] After 335ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:34:01] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 09:34:01] [INFO ] After 148ms SMT Verify possible using 330 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-15 09:34:01] [INFO ] After 250ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-15 09:34:01] [INFO ] After 776ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 1109/1109 transitions.
Applied a total of 0 rules in 24 ms. Remains 402 /402 variables (removed 0) and now considering 1109/1109 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 402/402 places, 1109/1109 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 1109/1109 transitions.
Applied a total of 0 rules in 23 ms. Remains 402 /402 variables (removed 0) and now considering 1109/1109 (removed 0) transitions.
[2023-03-15 09:34:01] [INFO ] Flow matrix only has 899 transitions (discarded 210 similar events)
[2023-03-15 09:34:01] [INFO ] Invariant cache hit.
[2023-03-15 09:34:02] [INFO ] Implicit Places using invariants in 700 ms returned []
[2023-03-15 09:34:02] [INFO ] Flow matrix only has 899 transitions (discarded 210 similar events)
[2023-03-15 09:34:02] [INFO ] Invariant cache hit.
[2023-03-15 09:34:02] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 09:34:05] [INFO ] Implicit Places using invariants and state equation in 2878 ms returned []
Implicit Place search using SMT with State Equation took 3580 ms to find 0 implicit places.
[2023-03-15 09:34:05] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-15 09:34:05] [INFO ] Flow matrix only has 899 transitions (discarded 210 similar events)
[2023-03-15 09:34:05] [INFO ] Invariant cache hit.
[2023-03-15 09:34:06] [INFO ] Dead Transitions using invariants and state equation in 1202 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4844 ms. Remains : 402/402 places, 1109/1109 transitions.
Graph (trivial) has 840 edges and 402 vertex of which 294 / 402 are part of one of the 42 SCC in 0 ms
Free SCC test removed 252 places
Drop transitions removed 504 transitions
Ensure Unique test removed 251 transitions
Reduce isomorphic transitions removed 755 transitions.
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 41 Pre rules applied. Total rules applied 1 place count 150 transition count 313
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 0 with 82 rules applied. Total rules applied 83 place count 109 transition count 313
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 103 place count 96 transition count 312
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 115 place count 90 transition count 306
Graph (trivial) has 43 edges and 90 vertex of which 36 / 90 are part of one of the 6 SCC in 0 ms
Free SCC test removed 30 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 7 rules applied. Total rules applied 122 place count 54 transition count 306
Drop transitions removed 36 transitions
Reduce isomorphic transitions removed 36 transitions.
Graph (trivial) has 223 edges and 54 vertex of which 36 / 54 are part of one of the 6 SCC in 0 ms
Free SCC test removed 30 places
Iterating post reduction 0 with 37 rules applied. Total rules applied 159 place count 24 transition count 270
Drop transitions removed 180 transitions
Ensure Unique test removed 65 transitions
Reduce isomorphic transitions removed 245 transitions.
Iterating post reduction 1 with 245 rules applied. Total rules applied 404 place count 24 transition count 25
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 422 place count 12 transition count 19
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 10 rules applied. Total rules applied 432 place count 12 transition count 9
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 435 place count 9 transition count 9
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 435 place count 9 transition count 7
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 439 place count 7 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 441 place count 6 transition count 6
Applied a total of 441 rules in 22 ms. Remains 6 /402 variables (removed 396) and now considering 6/1109 (removed 1103) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 6 rows 6 cols
[2023-03-15 09:34:06] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-15 09:34:06] [INFO ] After 15ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-15 09:34:06] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-15 09:34:06] [INFO ] After 4ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-15 09:34:06] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-15 09:34:06] [INFO ] After 29ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p1) p0 (NOT p2))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) p0 (NOT p2))))]
False Knowledge obtained : [(F p2), (F (NOT (AND p0 (NOT p1) (NOT p2))))]
Knowledge based reduction with 6 factoid took 304 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 143 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 163 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 304 reset in 472 ms.
Product exploration explored 100000 steps with 324 reset in 527 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 163 ms :[(NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Performed 334 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 334 rules applied. Total rules applied 334 place count 1330 transition count 2030
Performed 259 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 259 Pre rules applied. Total rules applied 334 place count 1330 transition count 2210
Deduced a syphon composed of 593 places in 2 ms
Iterating global reduction 1 with 259 rules applied. Total rules applied 593 place count 1330 transition count 2210
Discarding 149 places :
Symmetric choice reduction at 1 with 149 rule applications. Total rules 742 place count 1181 transition count 2061
Deduced a syphon composed of 444 places in 1 ms
Iterating global reduction 1 with 149 rules applied. Total rules applied 891 place count 1181 transition count 2061
Performed 327 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 771 places in 1 ms
Iterating global reduction 1 with 327 rules applied. Total rules applied 1218 place count 1181 transition count 2061
Discarding 290 places :
Symmetric choice reduction at 1 with 290 rule applications. Total rules 1508 place count 891 transition count 1771
Deduced a syphon composed of 481 places in 2 ms
Iterating global reduction 1 with 290 rules applied. Total rules applied 1798 place count 891 transition count 1771
Deduced a syphon composed of 481 places in 1 ms
Applied a total of 1798 rules in 636 ms. Remains 891 /1330 variables (removed 439) and now considering 1771/2030 (removed 259) transitions.
[2023-03-15 09:34:09] [INFO ] Redundant transitions in 68 ms returned []
[2023-03-15 09:34:09] [INFO ] Flow matrix only has 1561 transitions (discarded 210 similar events)
// Phase 1: matrix 1561 rows 891 cols
[2023-03-15 09:34:09] [INFO ] Computed 27 place invariants in 7 ms
[2023-03-15 09:34:10] [INFO ] Dead Transitions using invariants and state equation in 1444 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 891/1330 places, 1771/2030 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2161 ms. Remains : 891/1330 places, 1771/2030 transitions.
Support contains 5 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 45 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2023-03-15 09:34:10] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2023-03-15 09:34:10] [INFO ] Computed 27 place invariants in 7 ms
[2023-03-15 09:34:11] [INFO ] Implicit Places using invariants in 1013 ms returned []
[2023-03-15 09:34:11] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:34:11] [INFO ] Invariant cache hit.
[2023-03-15 09:34:12] [INFO ] Implicit Places using invariants and state equation in 994 ms returned []
Implicit Place search using SMT with State Equation took 2009 ms to find 0 implicit places.
[2023-03-15 09:34:12] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:34:12] [INFO ] Invariant cache hit.
[2023-03-15 09:34:14] [INFO ] Dead Transitions using invariants and state equation in 1837 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3897 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Treatment of property Peterson-PT-6-LTLFireability-11 finished in 53986 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions removed 588 transitions
Trivial Post-agglo rules discarded 588 transitions
Performed 588 trivial Post agglomeration. Transition count delta: 588
Iterating post reduction 0 with 588 rules applied. Total rules applied 588 place count 1330 transition count 1442
Reduce places removed 588 places and 0 transitions.
Iterating post reduction 1 with 588 rules applied. Total rules applied 1176 place count 742 transition count 1442
Performed 294 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 294 Pre rules applied. Total rules applied 1176 place count 742 transition count 1148
Deduced a syphon composed of 294 places in 0 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 2 with 588 rules applied. Total rules applied 1764 place count 448 transition count 1148
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 2 with 84 rules applied. Total rules applied 1848 place count 406 transition count 1106
Applied a total of 1848 rules in 73 ms. Remains 406 /1330 variables (removed 924) and now considering 1106/2030 (removed 924) transitions.
[2023-03-15 09:34:14] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 406 cols
[2023-03-15 09:34:14] [INFO ] Computed 27 place invariants in 2 ms
[2023-03-15 09:34:15] [INFO ] Implicit Places using invariants in 448 ms returned [387, 390, 398, 399, 400, 401]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 452 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 400/1330 places, 1106/2030 transitions.
Applied a total of 0 rules in 17 ms. Remains 400 /400 variables (removed 0) and now considering 1106/1106 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 543 ms. Remains : 400/1330 places, 1106/2030 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Peterson-PT-6-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s307 1) (EQ s387 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 194 reset in 253 ms.
Stack based approach found an accepted trace after 22 steps with 0 reset with depth 23 and stack size 23 in 1 ms.
FORMULA Peterson-PT-6-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-6-LTLFireability-12 finished in 889 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(!p0)) U (p1 U (!p0||G(p2)))))'
Support contains 5 out of 1330 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions removed 586 transitions
Trivial Post-agglo rules discarded 586 transitions
Performed 586 trivial Post agglomeration. Transition count delta: 586
Iterating post reduction 0 with 586 rules applied. Total rules applied 586 place count 1330 transition count 1444
Reduce places removed 586 places and 0 transitions.
Iterating post reduction 1 with 586 rules applied. Total rules applied 1172 place count 744 transition count 1444
Performed 294 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 294 Pre rules applied. Total rules applied 1172 place count 744 transition count 1150
Deduced a syphon composed of 294 places in 0 ms
Reduce places removed 294 places and 0 transitions.
Iterating global reduction 2 with 588 rules applied. Total rules applied 1760 place count 450 transition count 1150
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 2 with 82 rules applied. Total rules applied 1842 place count 409 transition count 1109
Applied a total of 1842 rules in 68 ms. Remains 409 /1330 variables (removed 921) and now considering 1109/2030 (removed 921) transitions.
[2023-03-15 09:34:15] [INFO ] Flow matrix only has 899 transitions (discarded 210 similar events)
// Phase 1: matrix 899 rows 409 cols
[2023-03-15 09:34:15] [INFO ] Computed 27 place invariants in 2 ms
[2023-03-15 09:34:16] [INFO ] Implicit Places using invariants in 521 ms returned [389, 390, 392, 400, 401, 402, 403]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 523 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 402/1330 places, 1109/2030 transitions.
Applied a total of 0 rules in 16 ms. Remains 402 /402 variables (removed 0) and now considering 1109/1109 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 607 ms. Remains : 402/1330 places, 1109/2030 transitions.
Stuttering acceptance computed with spot in 105 ms :[(AND p0 (NOT p2)), p0, (AND p0 (NOT p2))]
Running random walk in product with property : Peterson-PT-6-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p0 p2 p1), acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p2) p1), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND p0 p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(NEQ s211 1), p2:(AND (EQ s317 1) (EQ s378 1)), p1:(AND (EQ s298 1) (EQ s401 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 321 ms.
Stack based approach found an accepted trace after 48 steps with 0 reset with depth 49 and stack size 49 in 0 ms.
FORMULA Peterson-PT-6-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Peterson-PT-6-LTLFireability-13 finished in 1058 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U (p1&&G(p0)))))'
Support contains 6 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Applied a total of 0 rules in 65 ms. Remains 1330 /1330 variables (removed 0) and now considering 2030/2030 (removed 0) transitions.
[2023-03-15 09:34:16] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
// Phase 1: matrix 1820 rows 1330 cols
[2023-03-15 09:34:16] [INFO ] Computed 27 place invariants in 10 ms
[2023-03-15 09:34:18] [INFO ] Implicit Places using invariants in 1163 ms returned []
[2023-03-15 09:34:18] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:34:18] [INFO ] Invariant cache hit.
[2023-03-15 09:34:19] [INFO ] Implicit Places using invariants and state equation in 1084 ms returned []
Implicit Place search using SMT with State Equation took 2250 ms to find 0 implicit places.
[2023-03-15 09:34:19] [INFO ] Flow matrix only has 1820 transitions (discarded 210 similar events)
[2023-03-15 09:34:19] [INFO ] Invariant cache hit.
[2023-03-15 09:34:21] [INFO ] Dead Transitions using invariants and state equation in 2602 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4919 ms. Remains : 1330/1330 places, 2030/2030 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : Peterson-PT-6-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=3 dest: 0}, { cond=(NOT p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s296 1) (NOT (AND (EQ s681 1) (EQ s1205 1)))), p1:(OR (EQ s341 1) (AND (EQ s603 1) (EQ s1312 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Peterson-PT-6-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Peterson-PT-6-LTLFireability-14 finished in 5115 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)||(X(G(p1))&&G(p2))))'
Found a Lengthening insensitive property : Peterson-PT-6-LTLFireability-04
Stuttering acceptance computed with spot in 161 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Support contains 378 out of 1330 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1330/1330 places, 2030/2030 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 1330 transition count 2024
Reduce places removed 6 places and 0 transitions.
Performed 294 Post agglomeration using F-continuation condition.Transition count delta: 294
Iterating post reduction 1 with 300 rules applied. Total rules applied 306 place count 1324 transition count 1730
Reduce places removed 294 places and 0 transitions.
Iterating post reduction 2 with 294 rules applied. Total rules applied 600 place count 1030 transition count 1730
Performed 42 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 42 Pre rules applied. Total rules applied 600 place count 1030 transition count 1688
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 84 rules applied. Total rules applied 684 place count 988 transition count 1688
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 1 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 3 with 72 rules applied. Total rules applied 756 place count 952 transition count 1652
Applied a total of 756 rules in 177 ms. Remains 952 /1330 variables (removed 378) and now considering 1652/2030 (removed 378) transitions.
[2023-03-15 09:34:22] [INFO ] Flow matrix only has 1442 transitions (discarded 210 similar events)
// Phase 1: matrix 1442 rows 952 cols
[2023-03-15 09:34:22] [INFO ] Computed 27 place invariants in 18 ms
[2023-03-15 09:34:23] [INFO ] Implicit Places using invariants in 923 ms returned [933, 934, 936, 944, 945, 946, 947]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 926 ms to find 7 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 945/1330 places, 1652/2030 transitions.
Applied a total of 0 rules in 29 ms. Remains 945 /945 variables (removed 0) and now considering 1652/1652 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1134 ms. Remains : 945/1330 places, 1652/2030 transitions.
Running random walk in product with property : Peterson-PT-6-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p0) p2 p1), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (AND (EQ s882 1) (EQ s910 1)) (AND (EQ s854 1) (EQ s925 1)) (AND (EQ s853 1) (EQ s912 1)) (AND (EQ s863 1) (EQ s923 1)) (AND (EQ s877 1) (EQ s915 1...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 19925 reset in 1587 ms.
Product exploration explored 100000 steps with 19972 reset in 1350 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) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT p0)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))))]
Knowledge based reduction with 5 factoid took 290 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 2 states, 2 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT p0)), (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p2 p1))))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (X (X (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))))), (F p0)]
Knowledge based reduction with 5 factoid took 401 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
[2023-03-15 09:34:27] [INFO ] Flow matrix only has 1442 transitions (discarded 210 similar events)
// Phase 1: matrix 1442 rows 945 cols
[2023-03-15 09:34:27] [INFO ] Computed 20 place invariants in 7 ms
[2023-03-15 09:34:30] [INFO ] [Real]Absence check using 20 positive place invariants in 71 ms returned sat
[2023-03-15 09:34:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:34:33] [INFO ] [Real]Absence check using state equation in 2982 ms returned sat
[2023-03-15 09:34:33] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:34:36] [INFO ] [Nat]Absence check using 20 positive place invariants in 48 ms returned sat
[2023-03-15 09:34:36] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:34:38] [INFO ] [Nat]Absence check using state equation in 2186 ms returned sat
[2023-03-15 09:34:38] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 09:34:38] [INFO ] [Nat]Added 330 Read/Feed constraints in 249 ms returned sat
[2023-03-15 09:34:39] [INFO ] Deduced a trap composed of 56 places in 903 ms of which 1 ms to minimize.
[2023-03-15 09:34:40] [INFO ] Deduced a trap composed of 13 places in 920 ms of which 2 ms to minimize.
[2023-03-15 09:34:41] [INFO ] Deduced a trap composed of 19 places in 895 ms of which 1 ms to minimize.
[2023-03-15 09:34:42] [INFO ] Deduced a trap composed of 14 places in 750 ms of which 1 ms to minimize.
[2023-03-15 09:34:43] [INFO ] Deduced a trap composed of 34 places in 748 ms of which 1 ms to minimize.
[2023-03-15 09:34:44] [INFO ] Deduced a trap composed of 31 places in 888 ms of which 2 ms to minimize.
[2023-03-15 09:34:45] [INFO ] Deduced a trap composed of 11 places in 724 ms of which 2 ms to minimize.
[2023-03-15 09:34:46] [INFO ] Deduced a trap composed of 34 places in 823 ms of which 1 ms to minimize.
[2023-03-15 09:34:46] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 7659 ms
[2023-03-15 09:34:46] [INFO ] Computed and/alt/rep : 1351/3374/1351 causal constraints (skipped 84 transitions) in 146 ms.
[2023-03-15 09:34:48] [INFO ] Added : 50 causal constraints over 10 iterations in 1711 ms. Result :unknown
Could not prove EG (NOT p0)
Support contains 84 out of 945 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 945/945 places, 1652/1652 transitions.
Applied a total of 0 rules in 35 ms. Remains 945 /945 variables (removed 0) and now considering 1652/1652 (removed 0) transitions.
[2023-03-15 09:34:48] [INFO ] Flow matrix only has 1442 transitions (discarded 210 similar events)
[2023-03-15 09:34:48] [INFO ] Invariant cache hit.
[2023-03-15 09:34:49] [INFO ] Implicit Places using invariants in 854 ms returned []
[2023-03-15 09:34:49] [INFO ] Flow matrix only has 1442 transitions (discarded 210 similar events)
[2023-03-15 09:34:49] [INFO ] Invariant cache hit.
[2023-03-15 09:34:50] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 09:34:54] [INFO ] Implicit Places using invariants and state equation in 5623 ms returned []
Implicit Place search using SMT with State Equation took 6481 ms to find 0 implicit places.
[2023-03-15 09:34:54] [INFO ] Redundant transitions in 32 ms returned []
[2023-03-15 09:34:54] [INFO ] Flow matrix only has 1442 transitions (discarded 210 similar events)
[2023-03-15 09:34:54] [INFO ] Invariant cache hit.
[2023-03-15 09:34:56] [INFO ] Dead Transitions using invariants and state equation in 2055 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8612 ms. Remains : 945/945 places, 1652/1652 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 : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 163 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Finished random walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 199 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
[2023-03-15 09:34:57] [INFO ] Flow matrix only has 1442 transitions (discarded 210 similar events)
[2023-03-15 09:34:57] [INFO ] Invariant cache hit.
[2023-03-15 09:35:00] [INFO ] [Real]Absence check using 20 positive place invariants in 50 ms returned sat
[2023-03-15 09:35:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 09:35:02] [INFO ] [Real]Absence check using state equation in 2745 ms returned sat
[2023-03-15 09:35:02] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 09:35:05] [INFO ] [Nat]Absence check using 20 positive place invariants in 36 ms returned sat
[2023-03-15 09:35:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 09:35:07] [INFO ] [Nat]Absence check using state equation in 2369 ms returned sat
[2023-03-15 09:35:07] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 09:35:08] [INFO ] [Nat]Added 330 Read/Feed constraints in 361 ms returned sat
[2023-03-15 09:35:09] [INFO ] Deduced a trap composed of 13 places in 988 ms of which 1 ms to minimize.
[2023-03-15 09:35:10] [INFO ] Deduced a trap composed of 58 places in 990 ms of which 2 ms to minimize.
[2023-03-15 09:35:11] [INFO ] Deduced a trap composed of 52 places in 886 ms of which 2 ms to minimize.
[2023-03-15 09:35:12] [INFO ] Deduced a trap composed of 64 places in 761 ms of which 1 ms to minimize.
[2023-03-15 09:35:13] [INFO ] Deduced a trap composed of 40 places in 856 ms of which 1 ms to minimize.
[2023-03-15 09:35:13] [INFO ] Deduced a trap composed of 64 places in 588 ms of which 2 ms to minimize.
[2023-03-15 09:35:13] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 5719 ms
[2023-03-15 09:35:14] [INFO ] Computed and/alt/rep : 1351/3374/1351 causal constraints (skipped 84 transitions) in 187 ms.
[2023-03-15 09:35:19] [INFO ] Deduced a trap composed of 2 places in 1169 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLLengthAwareSolver.runSLCLLTLTest(LTLLengthAwareSolver.java:100)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:764)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-15 09:35:19] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (NOT p0)
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Product exploration explored 100000 steps with 19935 reset in 1074 ms.
Product exploration explored 100000 steps with 19941 reset in 1114 ms.
Support contains 84 out of 945 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 945/945 places, 1652/1652 transitions.
Drop transitions removed 288 transitions
Trivial Post-agglo rules discarded 288 transitions
Performed 288 trivial Post agglomeration. Transition count delta: 288
Iterating post reduction 0 with 288 rules applied. Total rules applied 288 place count 945 transition count 1364
Reduce places removed 288 places and 0 transitions.
Iterating post reduction 1 with 288 rules applied. Total rules applied 576 place count 657 transition count 1364
Performed 252 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 252 Pre rules applied. Total rules applied 576 place count 657 transition count 1112
Deduced a syphon composed of 252 places in 1 ms
Reduce places removed 252 places and 0 transitions.
Iterating global reduction 2 with 504 rules applied. Total rules applied 1080 place count 405 transition count 1112
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 1092 place count 399 transition count 1106
Applied a total of 1092 rules in 74 ms. Remains 399 /945 variables (removed 546) and now considering 1106/1652 (removed 546) transitions.
[2023-03-15 09:35:21] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
// Phase 1: matrix 896 rows 399 cols
[2023-03-15 09:35:21] [INFO ] Computed 20 place invariants in 3 ms
[2023-03-15 09:35:21] [INFO ] Implicit Places using invariants in 573 ms returned []
[2023-03-15 09:35:21] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 09:35:21] [INFO ] Invariant cache hit.
[2023-03-15 09:35:22] [INFO ] State equation strengthened by 330 read => feed constraints.
[2023-03-15 09:35:24] [INFO ] Implicit Places using invariants and state equation in 2245 ms returned []
Implicit Place search using SMT with State Equation took 2820 ms to find 0 implicit places.
[2023-03-15 09:35:24] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-15 09:35:24] [INFO ] Flow matrix only has 896 transitions (discarded 210 similar events)
[2023-03-15 09:35:24] [INFO ] Invariant cache hit.
[2023-03-15 09:35:25] [INFO ] Dead Transitions using invariants and state equation in 1118 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 399/945 places, 1106/1652 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4035 ms. Remains : 399/945 places, 1106/1652 transitions.
Treatment of property Peterson-PT-6-LTLFireability-04 finished in 63520 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U (G(p0)||(p0&&(p1||F(p2)))))&&(F(p4)||p3))))'
[2023-03-15 09:35:25] [INFO ] Flatten gal took : 168 ms
[2023-03-15 09:35:25] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 9 ms.
[2023-03-15 09:35:25] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1330 places, 2030 transitions and 6272 arcs took 11 ms.
Total runtime 301099 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT Peterson-PT-6
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
LTLFireability

FORMULA Peterson-PT-6-LTLFireability-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678873060579

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

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

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-6-LTLFireability-11: CONJ 0 0 1 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 4/3560 2/32 Peterson-PT-6-LTLFireability-11 136027 m, 27205 m/sec, 472398 t fired, .

Time elapsed: 44 secs. Pages in use: 2
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-6-LTLFireability-04: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-6-LTLFireability-11: CONJ 0 0 1 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 9/3560 4/32 Peterson-PT-6-LTLFireability-11 294642 m, 31723 m/sec, 1027361 t fired, .

Time elapsed: 49 secs. Pages in use: 4
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-6-LTLFireability-04: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-6-LTLFireability-11: CONJ 0 0 1 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 14/3560 6/32 Peterson-PT-6-LTLFireability-11 451557 m, 31383 m/sec, 1579566 t fired, .

Time elapsed: 54 secs. Pages in use: 6
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-6-LTLFireability-04: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-6-LTLFireability-11: CONJ 0 0 1 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 19/3560 8/32 Peterson-PT-6-LTLFireability-11 599618 m, 29612 m/sec, 2095278 t fired, .

Time elapsed: 59 secs. Pages in use: 8
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-6-LTLFireability-04: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-6-LTLFireability-11: CONJ 0 0 1 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 24/3560 9/32 Peterson-PT-6-LTLFireability-11 753997 m, 30875 m/sec, 2637129 t fired, .

Time elapsed: 64 secs. Pages in use: 9
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-6-LTLFireability-04: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-6-LTLFireability-11: CONJ 0 0 1 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 29/3560 11/32 Peterson-PT-6-LTLFireability-11 907060 m, 30612 m/sec, 3173784 t fired, .

Time elapsed: 69 secs. Pages in use: 11
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-6-LTLFireability-04: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-6-LTLFireability-11: CONJ 0 0 1 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 34/3560 13/32 Peterson-PT-6-LTLFireability-11 1061938 m, 30975 m/sec, 3714689 t fired, .

Time elapsed: 74 secs. Pages in use: 13
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-6-LTLFireability-04: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-6-LTLFireability-11: CONJ 0 0 1 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 39/3560 15/32 Peterson-PT-6-LTLFireability-11 1218705 m, 31353 m/sec, 4256582 t fired, .

Time elapsed: 79 secs. Pages in use: 15
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-6-LTLFireability-04: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-6-LTLFireability-11: CONJ 0 0 1 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 44/3560 16/32 Peterson-PT-6-LTLFireability-11 1370817 m, 30422 m/sec, 4796971 t fired, .

Time elapsed: 84 secs. Pages in use: 16
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-6-LTLFireability-04: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-6-LTLFireability-11: CONJ 0 0 1 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 49/3560 18/32 Peterson-PT-6-LTLFireability-11 1525101 m, 30856 m/sec, 5335469 t fired, .

Time elapsed: 89 secs. Pages in use: 18
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-6-LTLFireability-04: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-6-LTLFireability-11: CONJ 0 0 1 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 54/3560 20/32 Peterson-PT-6-LTLFireability-11 1677874 m, 30554 m/sec, 5872058 t fired, .

Time elapsed: 94 secs. Pages in use: 20
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-6-LTLFireability-04: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-6-LTLFireability-11: CONJ 0 0 1 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 59/3560 22/32 Peterson-PT-6-LTLFireability-11 1829339 m, 30293 m/sec, 6401932 t fired, .

Time elapsed: 99 secs. Pages in use: 22
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-6-LTLFireability-04: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-6-LTLFireability-11: CONJ 0 0 1 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 64/3560 23/32 Peterson-PT-6-LTLFireability-11 1981881 m, 30508 m/sec, 6935606 t fired, .

Time elapsed: 104 secs. Pages in use: 23
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-6-LTLFireability-04: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-6-LTLFireability-11: CONJ 0 0 1 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 69/3560 25/32 Peterson-PT-6-LTLFireability-11 2133732 m, 30370 m/sec, 7467428 t fired, .

Time elapsed: 109 secs. Pages in use: 25
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-6-LTLFireability-04: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-6-LTLFireability-11: CONJ 0 0 1 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 74/3560 27/32 Peterson-PT-6-LTLFireability-11 2286627 m, 30579 m/sec, 8002096 t fired, .

Time elapsed: 114 secs. Pages in use: 27
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-6-LTLFireability-04: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-6-LTLFireability-11: CONJ 0 0 1 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 79/3560 29/32 Peterson-PT-6-LTLFireability-11 2442194 m, 31113 m/sec, 8542655 t fired, .

Time elapsed: 119 secs. Pages in use: 29
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-6-LTLFireability-04: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-6-LTLFireability-11: CONJ 0 0 1 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 84/3560 30/32 Peterson-PT-6-LTLFireability-11 2592454 m, 30052 m/sec, 9072617 t fired, .

Time elapsed: 124 secs. Pages in use: 30
# running tasks: 1 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-6-LTLFireability-04: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-6-LTLFireability-11: CONJ 0 0 1 0 3 0 0 0

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
6 LTL EXCL 89/3560 32/32 Peterson-PT-6-LTLFireability-11 2743830 m, 30275 m/sec, 9602179 t fired, .

Time elapsed: 129 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 6 (type EXCL) for Peterson-PT-6-LTLFireability-11 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-6-LTLFireability-04: LTL true LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
Peterson-PT-6-LTLFireability-11: CONJ 0 0 0 0 3 0 1 0

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
Peterson-PT-6-LTLFireability-04: LTL true LTL model checker
Peterson-PT-6-LTLFireability-11: CONJ unknown CONJ


Time elapsed: 134 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is Peterson-PT-6, 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 r263-smll-167863538500636"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Peterson-PT-6.tgz
mv Peterson-PT-6 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;