Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r039-tajo-167813692900684.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is CANConstruction-PT-090, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692900684
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 13M
-rw-r--r-- 1 mcc users 7.3K Feb 25 22:35 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 25 22:35 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 22:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K Feb 25 22:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.6K Feb 25 22:48 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 22:48 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 16K Feb 25 22:42 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K Feb 25 22:42 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 12M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678505156618

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=CANConstruction-PT-090
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-11 03:25:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-11 03:25:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 03:25:58] [INFO ] Load time of PNML (sax parser for PT used): 506 ms
[2023-03-11 03:25:58] [INFO ] Transformed 17282 places.
[2023-03-11 03:25:58] [INFO ] Transformed 33120 transitions.
[2023-03-11 03:25:58] [INFO ] Parsed PT model containing 17282 places and 33120 transitions and 99000 arcs in 725 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CANConstruction-PT-090-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-090-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-090-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 17282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17282/17282 places, 33120/33120 transitions.
Discarding 7902 places :
Symmetric choice reduction at 0 with 7902 rule applications. Total rules 7902 place count 9380 transition count 17316
Iterating global reduction 0 with 7902 rules applied. Total rules applied 15804 place count 9380 transition count 17316
Applied a total of 15804 rules in 6713 ms. Remains 9380 /17282 variables (removed 7902) and now considering 17316/33120 (removed 15804) transitions.
// Phase 1: matrix 17316 rows 9380 cols
[2023-03-11 03:26:06] [INFO ] Computed 181 place invariants in 503 ms
[2023-03-11 03:26:07] [INFO ] Implicit Places using invariants in 1855 ms returned []
Implicit Place search using SMT only with invariants took 1889 ms to find 0 implicit places.
[2023-03-11 03:26:07] [INFO ] Invariant cache hit.
[2023-03-11 03:26:08] [INFO ] Dead Transitions using invariants and state equation in 746 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9380/17282 places, 17316/33120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9358 ms. Remains : 9380/17282 places, 17316/33120 transitions.
Support contains 45 out of 9380 places after structural reductions.
[2023-03-11 03:26:10] [INFO ] Flatten gal took : 1307 ms
[2023-03-11 03:26:11] [INFO ] Flatten gal took : 978 ms
[2023-03-11 03:26:13] [INFO ] Input system was already deterministic with 17316 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 784 ms. (steps per millisecond=12 ) properties (out of 30) seen :12
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2023-03-11 03:26:14] [INFO ] Invariant cache hit.
[2023-03-11 03:26:18] [INFO ] [Real]Absence check using 91 positive place invariants in 260 ms returned sat
[2023-03-11 03:26:18] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 135 ms returned sat
[2023-03-11 03:26:19] [INFO ] After 4749ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-03-11 03:26:22] [INFO ] [Nat]Absence check using 91 positive place invariants in 286 ms returned sat
[2023-03-11 03:26:23] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 136 ms returned sat
[2023-03-11 03:26:43] [INFO ] After 17054ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2023-03-11 03:26:43] [INFO ] State equation strengthened by 16110 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Broken pipe ...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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-11 03:26:44] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 03:26:44] [INFO ] After 25027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:18
Fused 18 Parikh solutions to 16 different solutions.
Parikh walk visited 2 properties in 1146 ms.
Support contains 22 out of 9380 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9380/9380 places, 17316/17316 transitions.
Drop transitions removed 626 transitions
Trivial Post-agglo rules discarded 626 transitions
Performed 626 trivial Post agglomeration. Transition count delta: 626
Iterating post reduction 0 with 626 rules applied. Total rules applied 626 place count 9380 transition count 16690
Reduce places removed 626 places and 0 transitions.
Iterating post reduction 1 with 626 rules applied. Total rules applied 1252 place count 8754 transition count 16690
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 1256 place count 8750 transition count 16682
Iterating global reduction 2 with 4 rules applied. Total rules applied 1260 place count 8750 transition count 16682
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 5 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 1440 place count 8660 transition count 16592
Free-agglomeration rule applied 152 times.
Iterating global reduction 2 with 152 rules applied. Total rules applied 1592 place count 8660 transition count 16440
Reduce places removed 152 places and 0 transitions.
Iterating post reduction 2 with 152 rules applied. Total rules applied 1744 place count 8508 transition count 16440
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 3 with 4 rules applied. Total rules applied 1748 place count 8508 transition count 16436
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 1752 place count 8504 transition count 16436
Partial Free-agglomeration rule applied 28 times.
Drop transitions removed 28 transitions
Iterating global reduction 4 with 28 rules applied. Total rules applied 1780 place count 8504 transition count 16436
Applied a total of 1780 rules in 19574 ms. Remains 8504 /9380 variables (removed 876) and now considering 16436/17316 (removed 880) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19579 ms. Remains : 8504/9380 places, 16436/17316 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 627 ms. (steps per millisecond=15 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 16436 rows 8504 cols
[2023-03-11 03:27:05] [INFO ] Computed 181 place invariants in 111 ms
[2023-03-11 03:27:09] [INFO ] [Real]Absence check using 91 positive place invariants in 253 ms returned sat
[2023-03-11 03:27:09] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 100 ms returned sat
[2023-03-11 03:27:09] [INFO ] After 3548ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-11 03:27:12] [INFO ] [Nat]Absence check using 91 positive place invariants in 246 ms returned sat
[2023-03-11 03:27:12] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 99 ms returned sat
[2023-03-11 03:27:28] [INFO ] After 14047ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-11 03:27:28] [INFO ] State equation strengthened by 16214 read => feed constraints.
[2023-03-11 03:27:34] [INFO ] After 5940ms SMT Verify possible using 16214 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-11 03:27:34] [INFO ] After 5942ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-11 03:27:34] [INFO ] After 25049ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 2 properties in 61 ms.
Support contains 12 out of 8504 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8504/8504 places, 16436/16436 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 8500 transition count 16432
Applied a total of 8 rules in 5732 ms. Remains 8500 /8504 variables (removed 4) and now considering 16432/16436 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5732 ms. Remains : 8500/8504 places, 16432/16436 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 483 ms. (steps per millisecond=20 ) properties (out of 10) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 16432 rows 8500 cols
[2023-03-11 03:27:41] [INFO ] Computed 181 place invariants in 115 ms
[2023-03-11 03:27:42] [INFO ] [Real]Absence check using 91 positive place invariants in 226 ms returned sat
[2023-03-11 03:27:42] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 104 ms returned sat
[2023-03-11 03:27:53] [INFO ] After 9826ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
[2023-03-11 03:27:53] [INFO ] State equation strengthened by 16218 read => feed constraints.
[2023-03-11 03:27:57] [INFO ] After 3945ms SMT Verify possible using 16218 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 03:27:57] [INFO ] After 16238ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 03:27:59] [INFO ] [Nat]Absence check using 91 positive place invariants in 239 ms returned sat
[2023-03-11 03:27:59] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 119 ms returned sat
[2023-03-11 03:28:09] [INFO ] After 9471ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 03:28:13] [INFO ] After 4006ms SMT Verify possible using 16218 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 03:28:17] [INFO ] After 8130ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 3239 ms.
[2023-03-11 03:28:20] [INFO ] After 23358ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 2 properties in 22 ms.
Support contains 5 out of 8500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8500/8500 places, 16432/16432 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 8493 transition count 16425
Applied a total of 14 rules in 5149 ms. Remains 8493 /8500 variables (removed 7) and now considering 16425/16432 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5149 ms. Remains : 8493/8500 places, 16425/16432 transitions.
Computed a total of 361 stabilizing places and 450 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 9380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9380/9380 places, 17316/17316 transitions.
Drop transitions removed 628 transitions
Trivial Post-agglo rules discarded 628 transitions
Performed 628 trivial Post agglomeration. Transition count delta: 628
Iterating post reduction 0 with 628 rules applied. Total rules applied 628 place count 9380 transition count 16688
Reduce places removed 628 places and 0 transitions.
Iterating post reduction 1 with 628 rules applied. Total rules applied 1256 place count 8752 transition count 16688
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 1274 place count 8734 transition count 16652
Iterating global reduction 2 with 18 rules applied. Total rules applied 1292 place count 8734 transition count 16652
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 6 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 1472 place count 8644 transition count 16562
Applied a total of 1472 rules in 8984 ms. Remains 8644 /9380 variables (removed 736) and now considering 16562/17316 (removed 754) transitions.
// Phase 1: matrix 16562 rows 8644 cols
[2023-03-11 03:28:35] [INFO ] Computed 181 place invariants in 152 ms
[2023-03-11 03:28:42] [INFO ] Implicit Places using invariants in 7002 ms returned []
Implicit Place search using SMT only with invariants took 7006 ms to find 0 implicit places.
[2023-03-11 03:28:42] [INFO ] Invariant cache hit.
[2023-03-11 03:28:53] [INFO ] Dead Transitions using invariants and state equation in 10501 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8644/9380 places, 16562/17316 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 26497 ms. Remains : 8644/9380 places, 16562/17316 transitions.
Stuttering acceptance computed with spot in 157 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s455 1) (GEQ s8096 1) (OR (LT s388 1) (LT s1498 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 738 steps with 0 reset in 73 ms.
FORMULA CANConstruction-PT-090-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLFireability-00 finished in 26838 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F((G(F(!p1))||(!p2&&F(!p1)))))))'
Support contains 5 out of 9380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9380/9380 places, 17316/17316 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 9365 transition count 17286
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 9365 transition count 17286
Applied a total of 30 rules in 6657 ms. Remains 9365 /9380 variables (removed 15) and now considering 17286/17316 (removed 30) transitions.
// Phase 1: matrix 17286 rows 9365 cols
[2023-03-11 03:29:00] [INFO ] Computed 181 place invariants in 159 ms
[2023-03-11 03:29:06] [INFO ] Implicit Places using invariants in 6660 ms returned []
Implicit Place search using SMT only with invariants took 6660 ms to find 0 implicit places.
[2023-03-11 03:29:06] [INFO ] Invariant cache hit.
[2023-03-11 03:29:17] [INFO ] Dead Transitions using invariants and state equation in 10435 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9365/9380 places, 17286/17316 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23754 ms. Remains : 9365/9380 places, 17286/17316 transitions.
Stuttering acceptance computed with spot in 282 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1, p1]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2), 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: 3}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=p1, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s3058 1), p2:(AND (GEQ s5933 1) (NOT (AND (GEQ s230 1) (GEQ s5999 1)))), p1:(AND (GEQ s4191 1) (GEQ s5933 1) (GEQ s230 1) (GEQ s5999 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA CANConstruction-PT-090-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLFireability-02 finished in 24128 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)||(p1&&F(p2))) U p2)||F(p3)||G(p1)))'
Support contains 5 out of 9380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9380/9380 places, 17316/17316 transitions.
Drop transitions removed 628 transitions
Trivial Post-agglo rules discarded 628 transitions
Performed 628 trivial Post agglomeration. Transition count delta: 628
Iterating post reduction 0 with 628 rules applied. Total rules applied 628 place count 9380 transition count 16688
Reduce places removed 628 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 629 rules applied. Total rules applied 1257 place count 8752 transition count 16687
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1258 place count 8751 transition count 16687
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1258 place count 8751 transition count 16686
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1260 place count 8750 transition count 16686
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 1275 place count 8735 transition count 16656
Iterating global reduction 3 with 15 rules applied. Total rules applied 1290 place count 8735 transition count 16656
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 3 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 1468 place count 8646 transition count 16567
Applied a total of 1468 rules in 8048 ms. Remains 8646 /9380 variables (removed 734) and now considering 16567/17316 (removed 749) transitions.
// Phase 1: matrix 16567 rows 8646 cols
[2023-03-11 03:29:25] [INFO ] Computed 181 place invariants in 154 ms
[2023-03-11 03:29:26] [INFO ] Implicit Places using invariants in 962 ms returned []
Implicit Place search using SMT only with invariants took 963 ms to find 0 implicit places.
[2023-03-11 03:29:26] [INFO ] Invariant cache hit.
[2023-03-11 03:29:27] [INFO ] Dead Transitions using invariants and state equation in 828 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8646/9380 places, 16567/17316 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9842 ms. Remains : 8646/9380 places, 16567/17316 transitions.
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1 (NOT p3)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p3)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p3)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p0) (NOT p1) (NOT p3)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s468 1) (GEQ s469 1)), p1:(GEQ s2341 1), p3:(GEQ s4695 1), p0:(GEQ s3463 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 804 steps with 0 reset in 55 ms.
FORMULA CANConstruction-PT-090-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLFireability-03 finished in 10082 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 9380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9380/9380 places, 17316/17316 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 9363 transition count 17282
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 9363 transition count 17282
Applied a total of 34 rules in 5686 ms. Remains 9363 /9380 variables (removed 17) and now considering 17282/17316 (removed 34) transitions.
// Phase 1: matrix 17282 rows 9363 cols
[2023-03-11 03:29:33] [INFO ] Computed 181 place invariants in 177 ms
[2023-03-11 03:29:34] [INFO ] Implicit Places using invariants in 1037 ms returned []
Implicit Place search using SMT only with invariants took 1039 ms to find 0 implicit places.
[2023-03-11 03:29:34] [INFO ] Invariant cache hit.
[2023-03-11 03:29:44] [INFO ] Dead Transitions using invariants and state equation in 10643 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9363/9380 places, 17282/17316 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17370 ms. Remains : 9363/9380 places, 17282/17316 transitions.
Stuttering acceptance computed with spot in 47 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s1600 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 1453 steps with 0 reset in 26 ms.
FORMULA CANConstruction-PT-090-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLFireability-05 finished in 17489 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 3 out of 9380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9380/9380 places, 17316/17316 transitions.
Drop transitions removed 628 transitions
Trivial Post-agglo rules discarded 628 transitions
Performed 628 trivial Post agglomeration. Transition count delta: 628
Iterating post reduction 0 with 628 rules applied. Total rules applied 628 place count 9380 transition count 16688
Reduce places removed 628 places and 0 transitions.
Iterating post reduction 1 with 628 rules applied. Total rules applied 1256 place count 8752 transition count 16688
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1256 place count 8752 transition count 16687
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1258 place count 8751 transition count 16687
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1275 place count 8734 transition count 16653
Iterating global reduction 2 with 17 rules applied. Total rules applied 1292 place count 8734 transition count 16653
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 3 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 1470 place count 8645 transition count 16564
Applied a total of 1470 rules in 8462 ms. Remains 8645 /9380 variables (removed 735) and now considering 16564/17316 (removed 752) transitions.
// Phase 1: matrix 16564 rows 8645 cols
[2023-03-11 03:29:53] [INFO ] Computed 181 place invariants in 151 ms
[2023-03-11 03:29:54] [INFO ] Implicit Places using invariants in 1232 ms returned []
Implicit Place search using SMT only with invariants took 1234 ms to find 0 implicit places.
[2023-03-11 03:29:54] [INFO ] Invariant cache hit.
[2023-03-11 03:30:05] [INFO ] Dead Transitions using invariants and state equation in 11129 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8645/9380 places, 16564/17316 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20828 ms. Remains : 8645/9380 places, 16564/17316 transitions.
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s3548 1), p0:(AND (GEQ s82 1) (GEQ s492 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 767 steps with 0 reset in 26 ms.
FORMULA CANConstruction-PT-090-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLFireability-06 finished in 20975 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((p1&&G(p2)))&&p0))&&F((!p3 U (p4||G(!p3))))))'
Support contains 6 out of 9380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9380/9380 places, 17316/17316 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 9364 transition count 17284
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 9364 transition count 17284
Applied a total of 32 rules in 6061 ms. Remains 9364 /9380 variables (removed 16) and now considering 17284/17316 (removed 32) transitions.
// Phase 1: matrix 17284 rows 9364 cols
[2023-03-11 03:30:12] [INFO ] Computed 181 place invariants in 174 ms
[2023-03-11 03:30:13] [INFO ] Implicit Places using invariants in 1048 ms returned []
Implicit Place search using SMT only with invariants took 1050 ms to find 0 implicit places.
[2023-03-11 03:30:13] [INFO ] Invariant cache hit.
[2023-03-11 03:30:14] [INFO ] Dead Transitions using invariants and state equation in 951 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9364/9380 places, 17284/17316 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8066 ms. Remains : 9364/9380 places, 17284/17316 transitions.
Stuttering acceptance computed with spot in 297 ms :[(OR (NOT p0) (NOT p1) (NOT p2) (AND p3 (NOT p4))), (OR (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p4) p3), true, (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p4), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p4) (NOT p3)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p4) p3), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p1 p2), acceptance={} source=4 dest: 5}], [{ cond=(NOT p2), acceptance={} source=5 dest: 3}, { cond=p2, acceptance={} source=5 dest: 5}]], initial=0, aps=[p4:(AND (LT s2571 1) (NOT (AND (GEQ s81 1) (GEQ s902 1)))), p0:(AND (GEQ s81 1) (GEQ s902 1)), p3:(AND (GEQ s81 1) (GEQ s902 1)), p1:(OR (LT s1210 1) (LT ...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-090-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLFireability-07 finished in 8426 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(F(p0)) U p1)))'
Support contains 5 out of 9380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9380/9380 places, 17316/17316 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 9363 transition count 17282
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 9363 transition count 17282
Applied a total of 34 rules in 6037 ms. Remains 9363 /9380 variables (removed 17) and now considering 17282/17316 (removed 34) transitions.
// Phase 1: matrix 17282 rows 9363 cols
[2023-03-11 03:30:20] [INFO ] Computed 181 place invariants in 122 ms
[2023-03-11 03:30:21] [INFO ] Implicit Places using invariants in 1001 ms returned []
Implicit Place search using SMT only with invariants took 1002 ms to find 0 implicit places.
[2023-03-11 03:30:21] [INFO ] Invariant cache hit.
[2023-03-11 03:30:32] [INFO ] Dead Transitions using invariants and state equation in 11050 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9363/9380 places, 17282/17316 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18090 ms. Remains : 9363/9380 places, 17282/17316 transitions.
Stuttering acceptance computed with spot in 97 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(OR (GEQ s6942 1) (AND (GEQ s174 1) (GEQ s1117 1))), p0:(AND (GEQ s538 1) (GEQ s655 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 1534 steps with 0 reset in 26 ms.
FORMULA CANConstruction-PT-090-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLFireability-08 finished in 18255 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(!(p0 U p1))&&!p0))))'
Support contains 4 out of 9380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9380/9380 places, 17316/17316 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 9362 transition count 17280
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 9362 transition count 17280
Applied a total of 36 rules in 6148 ms. Remains 9362 /9380 variables (removed 18) and now considering 17280/17316 (removed 36) transitions.
// Phase 1: matrix 17280 rows 9362 cols
[2023-03-11 03:30:38] [INFO ] Computed 181 place invariants in 156 ms
[2023-03-11 03:30:39] [INFO ] Implicit Places using invariants in 1023 ms returned []
Implicit Place search using SMT only with invariants took 1025 ms to find 0 implicit places.
[2023-03-11 03:30:39] [INFO ] Invariant cache hit.
[2023-03-11 03:30:40] [INFO ] Dead Transitions using invariants and state equation in 820 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9362/9380 places, 17280/17316 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7998 ms. Remains : 9362/9380 places, 17280/17316 transitions.
Stuttering acceptance computed with spot in 149 ms :[true, (OR p1 p0), p1, (OR p1 p0), (OR p1 p0)]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 0}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=3, aps=[p0:(AND (GEQ s76 1) (GEQ s4472 1)), p1:(AND (GEQ s711 1) (GEQ s1042 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 4344 ms.
Product exploration explored 100000 steps with 25000 reset in 3739 ms.
Computed a total of 361 stabilizing places and 450 stable transitions
Computed a total of 361 stabilizing places and 450 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 110 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[true, p1, p1, p1, p1]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 214 ms. (steps per millisecond=46 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 03:30:49] [INFO ] Invariant cache hit.
[2023-03-11 03:30:50] [INFO ] [Real]Absence check using 91 positive place invariants in 209 ms returned sat
[2023-03-11 03:30:50] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 92 ms returned sat
[2023-03-11 03:31:00] [INFO ] After 11061ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:31:01] [INFO ] [Nat]Absence check using 91 positive place invariants in 204 ms returned sat
[2023-03-11 03:31:01] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 141 ms returned sat
[2023-03-11 03:31:11] [INFO ] After 9689ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:31:11] [INFO ] State equation strengthened by 16110 read => feed constraints.
[2023-03-11 03:31:14] [INFO ] After 2409ms SMT Verify possible using 16110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:31:15] [INFO ] After 3655ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 702 ms.
[2023-03-11 03:31:16] [INFO ] After 15683ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 4 out of 9362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9362/9362 places, 17280/17280 transitions.
Drop transitions removed 627 transitions
Trivial Post-agglo rules discarded 627 transitions
Performed 627 trivial Post agglomeration. Transition count delta: 627
Iterating post reduction 0 with 627 rules applied. Total rules applied 627 place count 9362 transition count 16653
Reduce places removed 627 places and 0 transitions.
Iterating post reduction 1 with 627 rules applied. Total rules applied 1254 place count 8735 transition count 16653
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1254 place count 8735 transition count 16652
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1256 place count 8734 transition count 16652
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 4 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 1434 place count 8645 transition count 16563
Free-agglomeration rule applied 180 times.
Iterating global reduction 2 with 180 rules applied. Total rules applied 1614 place count 8645 transition count 16383
Reduce places removed 180 places and 0 transitions.
Iterating post reduction 2 with 180 rules applied. Total rules applied 1794 place count 8465 transition count 16383
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1796 place count 8465 transition count 16381
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1798 place count 8463 transition count 16381
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1799 place count 8463 transition count 16381
Applied a total of 1799 rules in 14161 ms. Remains 8463 /9362 variables (removed 899) and now considering 16381/17280 (removed 899) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14161 ms. Remains : 8463/9362 places, 16381/17280 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 1) seen :0
Finished Best-First random walk after 451 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=150 )
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) p0))]
Knowledge based reduction with 2 factoid took 162 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[true, p1, p1, p1, p1]
Stuttering acceptance computed with spot in 168 ms :[true, p1, p1, p1, p1]
Support contains 4 out of 9362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9362/9362 places, 17280/17280 transitions.
Applied a total of 0 rules in 3225 ms. Remains 9362 /9362 variables (removed 0) and now considering 17280/17280 (removed 0) transitions.
[2023-03-11 03:31:34] [INFO ] Invariant cache hit.
[2023-03-11 03:31:35] [INFO ] Implicit Places using invariants in 872 ms returned []
Implicit Place search using SMT only with invariants took 874 ms to find 0 implicit places.
[2023-03-11 03:31:35] [INFO ] Invariant cache hit.
[2023-03-11 03:31:36] [INFO ] Dead Transitions using invariants and state equation in 921 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5023 ms. Remains : 9362/9362 places, 17280/17280 transitions.
Computed a total of 361 stabilizing places and 450 stable transitions
Computed a total of 361 stabilizing places and 450 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[true, p1, p1, p1, p1]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 2) seen :1
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
Running SMT prover for 1 properties.
[2023-03-11 03:31:36] [INFO ] Invariant cache hit.
[2023-03-11 03:31:38] [INFO ] [Real]Absence check using 91 positive place invariants in 204 ms returned sat
[2023-03-11 03:31:38] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 87 ms returned sat
[2023-03-11 03:31:47] [INFO ] After 10502ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:31:48] [INFO ] [Nat]Absence check using 91 positive place invariants in 241 ms returned sat
[2023-03-11 03:31:48] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 142 ms returned sat
[2023-03-11 03:31:58] [INFO ] After 9567ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:31:58] [INFO ] State equation strengthened by 16110 read => feed constraints.
[2023-03-11 03:32:01] [INFO ] After 2633ms SMT Verify possible using 16110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:32:02] [INFO ] After 3964ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 682 ms.
[2023-03-11 03:32:03] [INFO ] After 15736ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 9362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9362/9362 places, 17280/17280 transitions.
Drop transitions removed 627 transitions
Trivial Post-agglo rules discarded 627 transitions
Performed 627 trivial Post agglomeration. Transition count delta: 627
Iterating post reduction 0 with 627 rules applied. Total rules applied 627 place count 9362 transition count 16653
Reduce places removed 627 places and 0 transitions.
Iterating post reduction 1 with 627 rules applied. Total rules applied 1254 place count 8735 transition count 16653
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1254 place count 8735 transition count 16652
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1256 place count 8734 transition count 16652
Performed 89 Post agglomeration using F-continuation condition.Transition count delta: 89
Deduced a syphon composed of 89 places in 3 ms
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 2 with 178 rules applied. Total rules applied 1434 place count 8645 transition count 16563
Free-agglomeration rule applied 180 times.
Iterating global reduction 2 with 180 rules applied. Total rules applied 1614 place count 8645 transition count 16383
Reduce places removed 180 places and 0 transitions.
Iterating post reduction 2 with 180 rules applied. Total rules applied 1794 place count 8465 transition count 16383
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1796 place count 8465 transition count 16381
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 1798 place count 8463 transition count 16381
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1799 place count 8463 transition count 16381
Applied a total of 1799 rules in 14515 ms. Remains 8463 /9362 variables (removed 899) and now considering 16381/17280 (removed 899) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14516 ms. Remains : 8463/9362 places, 16381/17280 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 228 ms. (steps per millisecond=43 ) properties (out of 1) seen :0
Finished Best-First random walk after 2701 steps, including 0 resets, run visited all 1 properties in 7 ms. (steps per millisecond=385 )
Knowledge obtained : [(AND (NOT p1) (NOT p0)), true]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) p0))]
Knowledge based reduction with 2 factoid took 134 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[true, p1, p1, p1, p1]
Stuttering acceptance computed with spot in 120 ms :[true, p1, p1, p1, p1]
Stuttering acceptance computed with spot in 101 ms :[true, p1, p1, p1, p1]
Product exploration explored 100000 steps with 25000 reset in 3457 ms.
Product exploration explored 100000 steps with 25000 reset in 3755 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 133 ms :[true, p1, p1, p1, p1]
Support contains 4 out of 9362 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9362/9362 places, 17280/17280 transitions.
Performed 447 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 447 rules applied. Total rules applied 447 place count 9362 transition count 17280
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 93 Pre rules applied. Total rules applied 447 place count 9362 transition count 17280
Deduced a syphon composed of 540 places in 5 ms
Iterating global reduction 1 with 93 rules applied. Total rules applied 540 place count 9362 transition count 17280
Discarding 180 places :
Symmetric choice reduction at 1 with 180 rule applications. Total rules 720 place count 9182 transition count 17100
Deduced a syphon composed of 360 places in 5 ms
Iterating global reduction 1 with 180 rules applied. Total rules applied 900 place count 9182 transition count 17100
Performed 177 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 537 places in 4 ms
Iterating global reduction 1 with 177 rules applied. Total rules applied 1077 place count 9182 transition count 17100
Discarding 354 places :
Symmetric choice reduction at 1 with 354 rule applications. Total rules 1431 place count 8828 transition count 16746
Deduced a syphon composed of 183 places in 3 ms
Iterating global reduction 1 with 354 rules applied. Total rules applied 1785 place count 8828 transition count 16746
Deduced a syphon composed of 183 places in 2 ms
Applied a total of 1785 rules in 11438 ms. Remains 8828 /9362 variables (removed 534) and now considering 16746/17280 (removed 534) transitions.
// Phase 1: matrix 16746 rows 8828 cols
[2023-03-11 03:32:37] [INFO ] Computed 181 place invariants in 156 ms
[2023-03-11 03:32:47] [INFO ] Dead Transitions using invariants and state equation in 10600 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8828/9362 places, 16746/17280 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 22042 ms. Remains : 8828/9362 places, 16746/17280 transitions.
Support contains 4 out of 9362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9362/9362 places, 17280/17280 transitions.
Applied a total of 0 rules in 3517 ms. Remains 9362 /9362 variables (removed 0) and now considering 17280/17280 (removed 0) transitions.
// Phase 1: matrix 17280 rows 9362 cols
[2023-03-11 03:32:51] [INFO ] Computed 181 place invariants in 157 ms
[2023-03-11 03:32:52] [INFO ] Implicit Places using invariants in 1096 ms returned []
Implicit Place search using SMT only with invariants took 1098 ms to find 0 implicit places.
[2023-03-11 03:32:52] [INFO ] Invariant cache hit.
[2023-03-11 03:32:53] [INFO ] Dead Transitions using invariants and state equation in 868 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5485 ms. Remains : 9362/9362 places, 17280/17280 transitions.
Treatment of property CANConstruction-PT-090-LTLFireability-09 finished in 141640 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 9380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9380/9380 places, 17316/17316 transitions.
Drop transitions removed 630 transitions
Trivial Post-agglo rules discarded 630 transitions
Performed 630 trivial Post agglomeration. Transition count delta: 630
Iterating post reduction 0 with 630 rules applied. Total rules applied 630 place count 9380 transition count 16686
Reduce places removed 630 places and 0 transitions.
Iterating post reduction 1 with 630 rules applied. Total rules applied 1260 place count 8750 transition count 16686
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 1277 place count 8733 transition count 16652
Iterating global reduction 2 with 17 rules applied. Total rules applied 1294 place count 8733 transition count 16652
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 3 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 1474 place count 8643 transition count 16562
Applied a total of 1474 rules in 9737 ms. Remains 8643 /9380 variables (removed 737) and now considering 16562/17316 (removed 754) transitions.
// Phase 1: matrix 16562 rows 8643 cols
[2023-03-11 03:33:04] [INFO ] Computed 181 place invariants in 150 ms
[2023-03-11 03:33:05] [INFO ] Implicit Places using invariants in 1054 ms returned []
Implicit Place search using SMT only with invariants took 1055 ms to find 0 implicit places.
[2023-03-11 03:33:05] [INFO ] Invariant cache hit.
[2023-03-11 03:33:15] [INFO ] Dead Transitions using invariants and state equation in 10601 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8643/9380 places, 16562/17316 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21395 ms. Remains : 8643/9380 places, 16562/17316 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ s8218 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 802 steps with 0 reset in 18 ms.
FORMULA CANConstruction-PT-090-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLFireability-10 finished in 21495 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 2 out of 9380 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9380/9380 places, 17316/17316 transitions.
Drop transitions removed 630 transitions
Trivial Post-agglo rules discarded 630 transitions
Performed 630 trivial Post agglomeration. Transition count delta: 630
Iterating post reduction 0 with 630 rules applied. Total rules applied 630 place count 9380 transition count 16686
Reduce places removed 630 places and 0 transitions.
Iterating post reduction 1 with 630 rules applied. Total rules applied 1260 place count 8750 transition count 16686
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 1276 place count 8734 transition count 16654
Iterating global reduction 2 with 16 rules applied. Total rules applied 1292 place count 8734 transition count 16654
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 3 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 1472 place count 8644 transition count 16564
Applied a total of 1472 rules in 8689 ms. Remains 8644 /9380 variables (removed 736) and now considering 16564/17316 (removed 752) transitions.
// Phase 1: matrix 16564 rows 8644 cols
[2023-03-11 03:33:24] [INFO ] Computed 181 place invariants in 152 ms
[2023-03-11 03:33:25] [INFO ] Implicit Places using invariants in 966 ms returned []
Implicit Place search using SMT only with invariants took 967 ms to find 0 implicit places.
[2023-03-11 03:33:25] [INFO ] Invariant cache hit.
[2023-03-11 03:33:26] [INFO ] Dead Transitions using invariants and state equation in 828 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8644/9380 places, 16564/17316 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10486 ms. Remains : 8644/9380 places, 16564/17316 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(GEQ s3181 1), p0:(GEQ s6733 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 826 steps with 0 reset in 27 ms.
FORMULA CANConstruction-PT-090-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLFireability-11 finished in 10639 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) U X((p1 U !p2))))))'
Support contains 4 out of 9380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9380/9380 places, 17316/17316 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 9364 transition count 17284
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 9364 transition count 17284
Applied a total of 32 rules in 6390 ms. Remains 9364 /9380 variables (removed 16) and now considering 17284/17316 (removed 32) transitions.
// Phase 1: matrix 17284 rows 9364 cols
[2023-03-11 03:33:33] [INFO ] Computed 181 place invariants in 158 ms
[2023-03-11 03:33:33] [INFO ] Implicit Places using invariants in 1063 ms returned []
Implicit Place search using SMT only with invariants took 1064 ms to find 0 implicit places.
[2023-03-11 03:33:33] [INFO ] Invariant cache hit.
[2023-03-11 03:33:44] [INFO ] Dead Transitions using invariants and state equation in 10348 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9364/9380 places, 17284/17316 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17804 ms. Remains : 9364/9380 places, 17284/17316 transitions.
Stuttering acceptance computed with spot in 156 ms :[p2, p2, p2, p2, p2, true, (NOT p0)]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=(AND p2 p1), acceptance={0} source=3 dest: 3}, { cond=(AND p2 (NOT p1)), acceptance={0} source=3 dest: 5}], [{ cond=(AND (NOT p0) p2 p1), acceptance={0} source=4 dest: 3}, { cond=(AND p0 p2), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=4 dest: 5}, { cond=(AND p0 p2 (NOT p1)), acceptance={0} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(LT s8337 1), p2:(AND (GEQ s916 1) (GEQ s4976 1)), p1:(GEQ s5477 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, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 3309 ms.
Product exploration explored 100000 steps with 25000 reset in 3374 ms.
Computed a total of 361 stabilizing places and 450 stable transitions
Computed a total of 361 stabilizing places and 450 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 7 states, 13 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 217 ms :[p2, p2, p2, p2, p2, true, (NOT p0)]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 343 ms. (steps per millisecond=29 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-11 03:33:52] [INFO ] Invariant cache hit.
[2023-03-11 03:33:53] [INFO ] [Real]Absence check using 91 positive place invariants in 277 ms returned sat
[2023-03-11 03:33:54] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 125 ms returned sat
[2023-03-11 03:34:03] [INFO ] After 9218ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:5
[2023-03-11 03:34:03] [INFO ] State equation strengthened by 16110 read => feed constraints.
[2023-03-11 03:34:05] [INFO ] After 2144ms SMT Verify possible using 16110 Read/Feed constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 03:34:05] [INFO ] After 13933ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 03:34:07] [INFO ] [Nat]Absence check using 91 positive place invariants in 262 ms returned sat
[2023-03-11 03:34:08] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 125 ms returned sat
[2023-03-11 03:34:20] [INFO ] After 11854ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 03:34:27] [INFO ] After 6167ms SMT Verify possible using 16110 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-11 03:34:31] [INFO ] After 10121ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-11 03:34:31] [INFO ] After 25040ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 3 properties in 35 ms.
Support contains 4 out of 9364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9364/9364 places, 17284/17284 transitions.
Drop transitions removed 629 transitions
Trivial Post-agglo rules discarded 629 transitions
Performed 629 trivial Post agglomeration. Transition count delta: 629
Iterating post reduction 0 with 629 rules applied. Total rules applied 629 place count 9364 transition count 16655
Reduce places removed 629 places and 0 transitions.
Iterating post reduction 1 with 629 rules applied. Total rules applied 1258 place count 8735 transition count 16655
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 3 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 1438 place count 8645 transition count 16565
Free-agglomeration rule applied 176 times.
Iterating global reduction 2 with 176 rules applied. Total rules applied 1614 place count 8645 transition count 16389
Reduce places removed 176 places and 0 transitions.
Iterating post reduction 2 with 176 rules applied. Total rules applied 1790 place count 8469 transition count 16389
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1791 place count 8469 transition count 16388
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1792 place count 8468 transition count 16388
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 1796 place count 8468 transition count 16388
Applied a total of 1796 rules in 15461 ms. Remains 8468 /9364 variables (removed 896) and now considering 16388/17284 (removed 896) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15461 ms. Remains : 8468/9364 places, 16388/17284 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 379 ms. (steps per millisecond=26 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 98583 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 98583 steps, saw 90775 distinct states, run finished after 3003 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 16388 rows 8468 cols
[2023-03-11 03:34:50] [INFO ] Computed 181 place invariants in 113 ms
[2023-03-11 03:34:51] [INFO ] [Real]Absence check using 91 positive place invariants in 202 ms returned sat
[2023-03-11 03:34:51] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 112 ms returned sat
[2023-03-11 03:35:00] [INFO ] After 8286ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2023-03-11 03:35:00] [INFO ] State equation strengthened by 16202 read => feed constraints.
[2023-03-11 03:35:02] [INFO ] After 2450ms SMT Verify possible using 16202 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:35:02] [INFO ] After 12835ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:35:04] [INFO ] [Nat]Absence check using 91 positive place invariants in 233 ms returned sat
[2023-03-11 03:35:04] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 148 ms returned sat
[2023-03-11 03:35:14] [INFO ] After 9555ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:35:17] [INFO ] After 3388ms SMT Verify possible using 16202 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 03:35:20] [INFO ] After 5952ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1744 ms.
[2023-03-11 03:35:22] [INFO ] After 19266ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 21 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=10 )
Parikh walk visited 3 properties in 4 ms.
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (X p0))]
False Knowledge obtained : [(F (AND (NOT p1) p2 (NOT p0))), (F (AND p2 p0)), (F (NOT p0)), (F (AND (NOT p1) p2 p0)), (F (AND p1 p2)), (F (AND p1 p2 (NOT p0))), (F (AND (NOT p1) p2))]
Knowledge based reduction with 2 factoid took 260 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 244 ms :[p2, p2, p2, p2, p2, true, (NOT p0)]
Stuttering acceptance computed with spot in 295 ms :[p2, p2, p2, p2, p2, true, (NOT p0)]
Support contains 4 out of 9364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9364/9364 places, 17284/17284 transitions.
Applied a total of 0 rules in 3479 ms. Remains 9364 /9364 variables (removed 0) and now considering 17284/17284 (removed 0) transitions.
// Phase 1: matrix 17284 rows 9364 cols
[2023-03-11 03:35:26] [INFO ] Computed 181 place invariants in 158 ms
[2023-03-11 03:35:27] [INFO ] Implicit Places using invariants in 1049 ms returned []
Implicit Place search using SMT only with invariants took 1050 ms to find 0 implicit places.
[2023-03-11 03:35:27] [INFO ] Invariant cache hit.
[2023-03-11 03:35:38] [INFO ] Dead Transitions using invariants and state equation in 11029 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15562 ms. Remains : 9364/9364 places, 17284/17284 transitions.
Computed a total of 361 stabilizing places and 450 stable transitions
Computed a total of 361 stabilizing places and 450 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 131 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[p2, p2, p2, p2, p2, true, (NOT p0)]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 361 ms. (steps per millisecond=27 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) 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 4) 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 4) 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 4) seen :0
Running SMT prover for 4 properties.
[2023-03-11 03:35:39] [INFO ] Invariant cache hit.
[2023-03-11 03:35:41] [INFO ] [Real]Absence check using 91 positive place invariants in 285 ms returned sat
[2023-03-11 03:35:41] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 127 ms returned sat
[2023-03-11 03:35:51] [INFO ] After 10099ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2023-03-11 03:35:51] [INFO ] State equation strengthened by 16110 read => feed constraints.
[2023-03-11 03:35:54] [INFO ] After 2923ms SMT Verify possible using 16110 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 03:35:54] [INFO ] After 15291ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 03:35:56] [INFO ] [Nat]Absence check using 91 positive place invariants in 290 ms returned sat
[2023-03-11 03:35:56] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 145 ms returned sat
[2023-03-11 03:36:07] [INFO ] After 10197ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 03:36:11] [INFO ] After 4328ms SMT Verify possible using 16110 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 03:36:15] [INFO ] After 8384ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2837 ms.
[2023-03-11 03:36:18] [INFO ] After 23941ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 1 properties in 14 ms.
Support contains 4 out of 9364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9364/9364 places, 17284/17284 transitions.
Drop transitions removed 629 transitions
Trivial Post-agglo rules discarded 629 transitions
Performed 629 trivial Post agglomeration. Transition count delta: 629
Iterating post reduction 0 with 629 rules applied. Total rules applied 629 place count 9364 transition count 16655
Reduce places removed 629 places and 0 transitions.
Iterating post reduction 1 with 629 rules applied. Total rules applied 1258 place count 8735 transition count 16655
Performed 90 Post agglomeration using F-continuation condition.Transition count delta: 90
Deduced a syphon composed of 90 places in 3 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 2 with 180 rules applied. Total rules applied 1438 place count 8645 transition count 16565
Free-agglomeration rule applied 176 times.
Iterating global reduction 2 with 176 rules applied. Total rules applied 1614 place count 8645 transition count 16389
Reduce places removed 176 places and 0 transitions.
Iterating post reduction 2 with 176 rules applied. Total rules applied 1790 place count 8469 transition count 16389
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 1791 place count 8469 transition count 16388
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1792 place count 8468 transition count 16388
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 1796 place count 8468 transition count 16388
Applied a total of 1796 rules in 14629 ms. Remains 8468 /9364 variables (removed 896) and now considering 16388/17284 (removed 896) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14629 ms. Remains : 8468/9364 places, 16388/17284 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 291 ms. (steps per millisecond=34 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 96014 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 96014 steps, saw 90159 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 16388 rows 8468 cols
[2023-03-11 03:36:36] [INFO ] Computed 181 place invariants in 150 ms
[2023-03-11 03:36:38] [INFO ] [Real]Absence check using 91 positive place invariants in 228 ms returned sat
[2023-03-11 03:36:38] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 116 ms returned sat
[2023-03-11 03:36:47] [INFO ] After 8774ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:1
[2023-03-11 03:36:47] [INFO ] State equation strengthened by 16202 read => feed constraints.
[2023-03-11 03:36:50] [INFO ] After 2649ms SMT Verify possible using 16202 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:36:50] [INFO ] After 13560ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:36:51] [INFO ] [Nat]Absence check using 91 positive place invariants in 216 ms returned sat
[2023-03-11 03:36:51] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 107 ms returned sat
[2023-03-11 03:37:01] [INFO ] After 8869ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:37:04] [INFO ] After 3247ms SMT Verify possible using 16202 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 03:37:06] [INFO ] After 5781ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1667 ms.
[2023-03-11 03:37:08] [INFO ] After 18167ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 21 steps, including 0 resets, run visited all 3 properties in 4 ms. (steps per millisecond=5 )
Parikh walk visited 3 properties in 6 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p2) p0), true]
False Knowledge obtained : [(F (AND (NOT p1) p2 (NOT p0))), (F (AND p2 p0)), (F (NOT p0)), (F (AND (NOT p1) p2 p0)), (F (AND p1 p2)), (F (AND p1 p2 (NOT p0))), (F (AND (NOT p1) p2))]
Knowledge based reduction with 2 factoid took 290 ms. Reduced automaton from 7 states, 12 edges and 3 AP (stutter sensitive) to 7 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 226 ms :[p2, p2, p2, p2, p2, true, (NOT p0)]
Stuttering acceptance computed with spot in 252 ms :[p2, p2, p2, p2, p2, true, (NOT p0)]
Stuttering acceptance computed with spot in 286 ms :[p2, p2, p2, p2, p2, true, (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 3673 ms.
Product exploration explored 100000 steps with 25000 reset in 3751 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 199 ms :[p2, p2, p2, p2, p2, true, (NOT p0)]
Support contains 4 out of 9364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9364/9364 places, 17284/17284 transitions.
Performed 449 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 449 rules applied. Total rules applied 449 place count 9364 transition count 17284
Performed 91 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 91 Pre rules applied. Total rules applied 449 place count 9364 transition count 17284
Deduced a syphon composed of 540 places in 5 ms
Iterating global reduction 1 with 91 rules applied. Total rules applied 540 place count 9364 transition count 17284
Discarding 180 places :
Symmetric choice reduction at 1 with 180 rule applications. Total rules 720 place count 9184 transition count 17104
Deduced a syphon composed of 360 places in 4 ms
Iterating global reduction 1 with 180 rules applied. Total rules applied 900 place count 9184 transition count 17104
Performed 179 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 539 places in 3 ms
Iterating global reduction 1 with 179 rules applied. Total rules applied 1079 place count 9184 transition count 17104
Discarding 358 places :
Symmetric choice reduction at 1 with 358 rule applications. Total rules 1437 place count 8826 transition count 16746
Deduced a syphon composed of 181 places in 2 ms
Iterating global reduction 1 with 358 rules applied. Total rules applied 1795 place count 8826 transition count 16746
Deduced a syphon composed of 181 places in 2 ms
Applied a total of 1795 rules in 14340 ms. Remains 8826 /9364 variables (removed 538) and now considering 16746/17284 (removed 538) transitions.
// Phase 1: matrix 16746 rows 8826 cols
[2023-03-11 03:37:31] [INFO ] Computed 181 place invariants in 154 ms
[2023-03-11 03:37:32] [INFO ] Dead Transitions using invariants and state equation in 1013 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8826/9364 places, 16746/17284 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15355 ms. Remains : 8826/9364 places, 16746/17284 transitions.
Support contains 4 out of 9364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9364/9364 places, 17284/17284 transitions.
Applied a total of 0 rules in 3192 ms. Remains 9364 /9364 variables (removed 0) and now considering 17284/17284 (removed 0) transitions.
// Phase 1: matrix 17284 rows 9364 cols
[2023-03-11 03:37:36] [INFO ] Computed 181 place invariants in 159 ms
[2023-03-11 03:37:37] [INFO ] Implicit Places using invariants in 1085 ms returned []
Implicit Place search using SMT only with invariants took 1087 ms to find 0 implicit places.
[2023-03-11 03:37:37] [INFO ] Invariant cache hit.
[2023-03-11 03:37:37] [INFO ] Dead Transitions using invariants and state equation in 880 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5161 ms. Remains : 9364/9364 places, 17284/17284 transitions.
Treatment of property CANConstruction-PT-090-LTLFireability-12 finished in 252044 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||F(G(p1)))))'
Support contains 4 out of 9380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9380/9380 places, 17316/17316 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 9362 transition count 17280
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 9362 transition count 17280
Applied a total of 36 rules in 6674 ms. Remains 9362 /9380 variables (removed 18) and now considering 17280/17316 (removed 36) transitions.
// Phase 1: matrix 17280 rows 9362 cols
[2023-03-11 03:37:45] [INFO ] Computed 181 place invariants in 155 ms
[2023-03-11 03:37:46] [INFO ] Implicit Places using invariants in 1061 ms returned []
Implicit Place search using SMT only with invariants took 1063 ms to find 0 implicit places.
[2023-03-11 03:37:46] [INFO ] Invariant cache hit.
[2023-03-11 03:37:47] [INFO ] Dead Transitions using invariants and state equation in 936 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9362/9380 places, 17280/17316 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8675 ms. Remains : 9362/9380 places, 17280/17316 transitions.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p0:(OR (LT s454 1) (LT s1019 1)), p1:(AND (GEQ s748 1) (GEQ s7902 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 4775 steps with 2 reset in 115 ms.
FORMULA CANConstruction-PT-090-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLFireability-14 finished in 8995 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||G(F(p1)))))'
Support contains 2 out of 9380 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9380/9380 places, 17316/17316 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 9364 transition count 17284
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 9364 transition count 17284
Applied a total of 32 rules in 6414 ms. Remains 9364 /9380 variables (removed 16) and now considering 17284/17316 (removed 32) transitions.
// Phase 1: matrix 17284 rows 9364 cols
[2023-03-11 03:37:54] [INFO ] Computed 181 place invariants in 165 ms
[2023-03-11 03:38:00] [INFO ] Implicit Places using invariants in 6807 ms returned []
Implicit Place search using SMT only with invariants took 6814 ms to find 0 implicit places.
[2023-03-11 03:38:00] [INFO ] Invariant cache hit.
[2023-03-11 03:38:11] [INFO ] Dead Transitions using invariants and state equation in 10446 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9364/9380 places, 17284/17316 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 23678 ms. Remains : 9364/9380 places, 17284/17316 transitions.
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-090-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s3484 1), p1:(OR (GEQ s3833 1) (GEQ s3484 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 1597 steps with 0 reset in 27 ms.
FORMULA CANConstruction-PT-090-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLFireability-15 finished in 23865 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(!(p0 U p1))&&!p0))))'
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) U X((p1 U !p2))))))'
[2023-03-11 03:38:11] [INFO ] Flatten gal took : 410 ms
[2023-03-11 03:38:11] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-11 03:38:12] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 9380 places, 17316 transitions and 67392 arcs took 76 ms.
Total runtime 733964 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CANConstruction-PT-090
BK_EXAMINATION: LTLFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/376
LTLFireability

FORMULA CANConstruction-PT-090-LTLFireability-09 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA CANConstruction-PT-090-LTLFireability-12 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1678505915543

--------------------
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/376/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/376/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/376/LTLFireability.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:337
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: rewrite Frontend/Parser/formula_rewrite.k:296
lola: RELEASE
lola: rewrite Frontend/Parser/formula_rewrite.k:430
lola: rewrite Frontend/Parser/formula_rewrite.k:355
lola: rewrite Frontend/Parser/formula_rewrite.k:433
lola: Created skeleton in 0.000000 secs.
lola: RELEASE
lola: NOTDEADLOCKFREE
lola: LAUNCH task # 6 (type SKEL/SRCH) for 0 CANConstruction-PT-090-LTLFireability-09
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 6 (type SKEL/SRCH) for CANConstruction-PT-090-LTLFireability-09
lola: result : true
lola: markings : 65
lola: fired transitions : 64
lola: time used : 0.000000
lola: memory pages used : 1
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: NOTDEADLOCKFREE
lola: planning for CANConstruction-PT-090-LTLFireability-09 stopped (result already fixed).
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANConstruction-PT-090-LTLFireability-09: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-090-LTLFireability-12: LTL 0 0 0 0 1 0 0 0

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

Time elapsed: 13 secs. Pages in use: 1
# running tasks: 0 of 4 Visible: 2
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANConstruction-PT-090-LTLFireability-09: LTL true skeleton: LTL model checker

PENDING FORMULAS: CATEGORY IDL ACT RUN SUS FIN C/T C/M OBS
CANConstruction-PT-090-LTLFireability-12: LTL 0 0 0 0 1 0 0 0

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

Time elapsed: 18 secs. Pages in use: 1
# running tasks: 0 of 4 Visible: 2
lola: LAUNCH task # 4 (type EXCL) for 3 CANConstruction-PT-090-LTLFireability-12
lola: time limit : 3577 sec
lola: memory limit: 32 pages
lola: FINISHED task # 4 (type EXCL) for CANConstruction-PT-090-LTLFireability-12
lola: result : true
lola: markings : 451
lola: fired transitions : 450
lola: time used : 0.000000
lola: memory pages used : 1
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANConstruction-PT-090-LTLFireability-09: LTL true skeleton: LTL model checker
CANConstruction-PT-090-LTLFireability-12: LTL true LTL model checker


Time elapsed: 23 secs. Pages in use: 1

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="CANConstruction-PT-090"
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 CANConstruction-PT-090, 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 r039-tajo-167813692900684"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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