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-167813692900683.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 LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r039-tajo-167813692900683
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME CANConstruction-PT-090-LTLCardinality-01
FORMULA_NAME CANConstruction-PT-090-LTLCardinality-02
FORMULA_NAME CANConstruction-PT-090-LTLCardinality-03
FORMULA_NAME CANConstruction-PT-090-LTLCardinality-04
FORMULA_NAME CANConstruction-PT-090-LTLCardinality-05
FORMULA_NAME CANConstruction-PT-090-LTLCardinality-06
FORMULA_NAME CANConstruction-PT-090-LTLCardinality-07
FORMULA_NAME CANConstruction-PT-090-LTLCardinality-08
FORMULA_NAME CANConstruction-PT-090-LTLCardinality-09
FORMULA_NAME CANConstruction-PT-090-LTLCardinality-10
FORMULA_NAME CANConstruction-PT-090-LTLCardinality-11
FORMULA_NAME CANConstruction-PT-090-LTLCardinality-12
FORMULA_NAME CANConstruction-PT-090-LTLCardinality-13
FORMULA_NAME CANConstruction-PT-090-LTLCardinality-14
FORMULA_NAME CANConstruction-PT-090-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678505046526

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=LTLCardinality
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:24:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 03:24:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 03:24:09] [INFO ] Load time of PNML (sax parser for PT used): 641 ms
[2023-03-11 03:24:09] [INFO ] Transformed 17282 places.
[2023-03-11 03:24:09] [INFO ] Transformed 33120 transitions.
[2023-03-11 03:24:09] [INFO ] Parsed PT model containing 17282 places and 33120 transitions and 99000 arcs in 846 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CANConstruction-PT-090-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-090-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-090-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 17282 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17282/17282 places, 33120/33120 transitions.
Discarding 7899 places :
Symmetric choice reduction at 0 with 7899 rule applications. Total rules 7899 place count 9383 transition count 17322
Iterating global reduction 0 with 7899 rules applied. Total rules applied 15798 place count 9383 transition count 17322
Applied a total of 15798 rules in 6050 ms. Remains 9383 /17282 variables (removed 7899) and now considering 17322/33120 (removed 15798) transitions.
// Phase 1: matrix 17322 rows 9383 cols
[2023-03-11 03:24:15] [INFO ] Computed 181 place invariants in 232 ms
[2023-03-11 03:24:16] [INFO ] Implicit Places using invariants in 1350 ms returned []
Implicit Place search using SMT only with invariants took 1377 ms to find 0 implicit places.
[2023-03-11 03:24:16] [INFO ] Invariant cache hit.
[2023-03-11 03:24:28] [INFO ] Dead Transitions using invariants and state equation in 11952 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9383/17282 places, 17322/33120 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19387 ms. Remains : 9383/17282 places, 17322/33120 transitions.
Support contains 46 out of 9383 places after structural reductions.
[2023-03-11 03:24:30] [INFO ] Flatten gal took : 742 ms
[2023-03-11 03:24:30] [INFO ] Flatten gal took : 429 ms
[2023-03-11 03:24:31] [INFO ] Input system was already deterministic with 17322 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 893 ms. (steps per millisecond=11 ) properties (out of 26) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) 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 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) 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 24) seen :0
Interrupted probabilistic random walk after 82454 steps, run timeout after 3003 ms. (steps per millisecond=27 ) properties seen :{1=1}
Probabilistic random walk after 82454 steps, saw 81224 distinct states, run finished after 3006 ms. (steps per millisecond=27 ) properties seen :1
Running SMT prover for 23 properties.
[2023-03-11 03:24:35] [INFO ] Invariant cache hit.
[2023-03-11 03:24:40] [INFO ] [Real]Absence check using 91 positive place invariants in 298 ms returned sat
[2023-03-11 03:24:41] [INFO ] [Real]Absence check using 91 positive and 90 generalized place invariants in 116 ms returned sat
[2023-03-11 03:24:41] [INFO ] After 5422ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:22
[2023-03-11 03:24:45] [INFO ] [Nat]Absence check using 91 positive place invariants in 294 ms returned sat
[2023-03-11 03:24:45] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 115 ms returned sat
[2023-03-11 03:25:05] [INFO ] After 16833ms SMT Verify possible using state equation in natural domain returned unsat :7 sat :16
[2023-03-11 03:25:05] [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: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.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:25:06] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-11 03:25:06] [INFO ] After 25018ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:22
Fused 23 Parikh solutions to 15 different solutions.
Parikh walk visited 0 properties in 991 ms.
Support contains 31 out of 9383 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9383/9383 places, 17322/17322 transitions.
Drop transitions removed 624 transitions
Trivial Post-agglo rules discarded 624 transitions
Performed 624 trivial Post agglomeration. Transition count delta: 624
Iterating post reduction 0 with 624 rules applied. Total rules applied 624 place count 9383 transition count 16698
Reduce places removed 624 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 626 rules applied. Total rules applied 1250 place count 8759 transition count 16696
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 1252 place count 8757 transition count 16696
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1252 place count 8757 transition count 16695
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 1254 place count 8756 transition count 16695
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 1259 place count 8751 transition count 16685
Iterating global reduction 3 with 5 rules applied. Total rules applied 1264 place count 8751 transition count 16685
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 3 with 178 rules applied. Total rules applied 1442 place count 8662 transition count 16596
Free-agglomeration rule applied 150 times.
Iterating global reduction 3 with 150 rules applied. Total rules applied 1592 place count 8662 transition count 16446
Reduce places removed 150 places and 0 transitions.
Iterating post reduction 3 with 150 rules applied. Total rules applied 1742 place count 8512 transition count 16446
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1743 place count 8512 transition count 16445
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1744 place count 8511 transition count 16445
Partial Free-agglomeration rule applied 31 times.
Drop transitions removed 31 transitions
Iterating global reduction 5 with 31 rules applied. Total rules applied 1775 place count 8511 transition count 16445
Applied a total of 1775 rules in 16209 ms. Remains 8511 /9383 variables (removed 872) and now considering 16445/17322 (removed 877) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16212 ms. Remains : 8511/9383 places, 16445/17322 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 437 ms. (steps per millisecond=22 ) properties (out of 16) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 12) 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 12) 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 12) 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 12) 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 12) 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 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 12) 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 12) 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 12) 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 12) seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 16445 rows 8511 cols
[2023-03-11 03:25:24] [INFO ] Computed 181 place invariants in 119 ms
[2023-03-11 03:25:26] [INFO ] After 2556ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-11 03:25:29] [INFO ] [Nat]Absence check using 91 positive place invariants in 239 ms returned sat
[2023-03-11 03:25:29] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 106 ms returned sat
[2023-03-11 03:25:46] [INFO ] After 14583ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-11 03:25:46] [INFO ] State equation strengthened by 16214 read => feed constraints.
[2023-03-11 03:25:51] [INFO ] After 5546ms SMT Verify possible using 16214 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-11 03:25:51] [INFO ] After 5547ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-11 03:25:51] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Parikh walk visited 3 properties in 38 ms.
Support contains 18 out of 8511 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8511/8511 places, 16445/16445 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 8511 transition count 16444
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 8510 transition count 16444
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 8504 transition count 16438
Applied a total of 14 rules in 5945 ms. Remains 8504 /8511 variables (removed 7) and now considering 16438/16445 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5945 ms. Remains : 8504/8511 places, 16438/16445 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 671 ms. (steps per millisecond=14 ) properties (out of 9) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) 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 6) 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 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 16438 rows 8504 cols
[2023-03-11 03:25:58] [INFO ] Computed 181 place invariants in 117 ms
[2023-03-11 03:26:00] [INFO ] After 1523ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-11 03:26:02] [INFO ] [Nat]Absence check using 91 positive place invariants in 227 ms returned sat
[2023-03-11 03:26:02] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 107 ms returned sat
[2023-03-11 03:26:13] [INFO ] After 10242ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-11 03:26:13] [INFO ] State equation strengthened by 16220 read => feed constraints.
[2023-03-11 03:26:19] [INFO ] After 5866ms SMT Verify possible using 16220 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-11 03:26:24] [INFO ] After 10744ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1091 ms.
[2023-03-11 03:26:25] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 3 properties in 13 ms.
Support contains 6 out of 8504 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8504/8504 places, 16438/16438 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 4 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 8494 transition count 16428
Applied a total of 20 rules in 6199 ms. Remains 8494 /8504 variables (removed 10) and now considering 16428/16438 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6200 ms. Remains : 8494/8504 places, 16428/16438 transitions.
Successfully simplified 7 atomic propositions for a total of 13 simplifications.
FORMULA CANConstruction-PT-090-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-090-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 361 stabilizing places and 450 stable transitions
FORMULA CANConstruction-PT-090-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F(p1)))))'
Support contains 4 out of 9383 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9383/9383 places, 17322/17322 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 9383 transition count 16692
Reduce places removed 630 places and 0 transitions.
Iterating post reduction 1 with 630 rules applied. Total rules applied 1260 place count 8753 transition count 16692
Discarding 21 places :
Symmetric choice reduction at 2 with 21 rule applications. Total rules 1281 place count 8732 transition count 16650
Iterating global reduction 2 with 21 rules applied. Total rules applied 1302 place count 8732 transition count 16650
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 1482 place count 8642 transition count 16560
Applied a total of 1482 rules in 10408 ms. Remains 8642 /9383 variables (removed 741) and now considering 16560/17322 (removed 762) transitions.
// Phase 1: matrix 16560 rows 8642 cols
[2023-03-11 03:26:42] [INFO ] Computed 181 place invariants in 156 ms
[2023-03-11 03:26:43] [INFO ] Implicit Places using invariants in 1148 ms returned []
Implicit Place search using SMT only with invariants took 1155 ms to find 0 implicit places.
[2023-03-11 03:26:43] [INFO ] Invariant cache hit.
[2023-03-11 03:26:44] [INFO ] Dead Transitions using invariants and state equation in 929 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8642/9383 places, 16560/17322 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12500 ms. Remains : 8642/9383 places, 16560/17322 transitions.
Stuttering acceptance computed with spot in 255 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CANConstruction-PT-090-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GT s6574 s6035), p1:(LEQ s4934 s3728)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 127 reset in 2613 ms.
Product exploration explored 100000 steps with 128 reset in 2411 ms.
Computed a total of 272 stabilizing places and 270 stable transitions
Computed a total of 272 stabilizing places and 270 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 227 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 12 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 03:26:50] [INFO ] Invariant cache hit.
[2023-03-11 03:26:51] [INFO ] After 1051ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:26:52] [INFO ] [Nat]Absence check using 91 positive place invariants in 206 ms returned sat
[2023-03-11 03:26:52] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 96 ms returned sat
[2023-03-11 03:27:02] [INFO ] After 9180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:27:02] [INFO ] State equation strengthened by 16200 read => feed constraints.
[2023-03-11 03:27:04] [INFO ] After 2539ms SMT Verify possible using 16200 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:27:05] [INFO ] After 3499ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 904 ms.
[2023-03-11 03:27:06] [INFO ] After 15175ms 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 8642 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8642/8642 places, 16560/16560 transitions.
Free-agglomeration rule applied 180 times.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 8642 transition count 16380
Reduce places removed 180 places and 0 transitions.
Iterating post reduction 0 with 180 rules applied. Total rules applied 360 place count 8462 transition count 16380
Applied a total of 360 rules in 6459 ms. Remains 8462 /8642 variables (removed 180) and now considering 16380/16560 (removed 180) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6466 ms. Remains : 8462/8642 places, 16380/16560 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 317 ms. (steps per millisecond=31 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 101691 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 101691 steps, saw 91525 distinct states, run finished after 3003 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 16380 rows 8462 cols
[2023-03-11 03:27:16] [INFO ] Computed 181 place invariants in 159 ms
[2023-03-11 03:27:17] [INFO ] After 916ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:27:18] [INFO ] [Nat]Absence check using 91 positive place invariants in 177 ms returned sat
[2023-03-11 03:27:18] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 83 ms returned sat
[2023-03-11 03:27:27] [INFO ] After 8903ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:27:28] [INFO ] State equation strengthened by 16200 read => feed constraints.
[2023-03-11 03:27:29] [INFO ] After 1927ms SMT Verify possible using 16200 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:27:30] [INFO ] After 2670ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 547 ms.
[2023-03-11 03:27:31] [INFO ] After 13501ms 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 8462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8462/8462 places, 16380/16380 transitions.
Applied a total of 0 rules in 3328 ms. Remains 8462 /8462 variables (removed 0) and now considering 16380/16380 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3330 ms. Remains : 8462/8462 places, 16380/16380 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8462/8462 places, 16380/16380 transitions.
Applied a total of 0 rules in 3100 ms. Remains 8462 /8462 variables (removed 0) and now considering 16380/16380 (removed 0) transitions.
[2023-03-11 03:27:37] [INFO ] Invariant cache hit.
[2023-03-11 03:27:38] [INFO ] Implicit Places using invariants in 871 ms returned []
Implicit Place search using SMT only with invariants took 872 ms to find 0 implicit places.
[2023-03-11 03:27:38] [INFO ] Invariant cache hit.
[2023-03-11 03:27:48] [INFO ] Dead Transitions using invariants and state equation in 10249 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14227 ms. Remains : 8462/8462 places, 16380/16380 transitions.
Graph (trivial) has 16102 edges and 8462 vertex of which 8186 / 8462 are part of one of the 90 SCC in 11 ms
Free SCC test removed 8096 places
Drop transitions removed 16102 transitions
Reduce isomorphic transitions removed 16102 transitions.
Graph (complete) has 819 edges and 366 vertex of which 12 are kept as prefixes of interest. Removing 354 places using SCC suffix rule.2 ms
Discarding 354 places :
Also discarding 258 output transitions
Drop transitions removed 258 transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 10 place count 12 transition count 12
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 12 transition count 12
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 18 place count 8 transition count 8
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 8 transition count 8
Applied a total of 22 rules in 63 ms. Remains 8 /8462 variables (removed 8454) and now considering 8/16380 (removed 16372) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 8 rows 8 cols
[2023-03-11 03:27:48] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-11 03:27:48] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:27:48] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-11 03:27:48] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:27:48] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-11 03:27:48] [INFO ] After 29ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 264 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 8642 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8642/8642 places, 16560/16560 transitions.
Applied a total of 0 rules in 3530 ms. Remains 8642 /8642 variables (removed 0) and now considering 16560/16560 (removed 0) transitions.
// Phase 1: matrix 16560 rows 8642 cols
[2023-03-11 03:27:53] [INFO ] Computed 181 place invariants in 149 ms
[2023-03-11 03:27:59] [INFO ] Implicit Places using invariants in 6807 ms returned []
Implicit Place search using SMT only with invariants took 6811 ms to find 0 implicit places.
[2023-03-11 03:27:59] [INFO ] Invariant cache hit.
[2023-03-11 03:28:10] [INFO ] Dead Transitions using invariants and state equation in 10738 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 21084 ms. Remains : 8642/8642 places, 16560/16560 transitions.
Computed a total of 272 stabilizing places and 270 stable transitions
Computed a total of 272 stabilizing places and 270 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 203 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 12 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 03:28:11] [INFO ] Invariant cache hit.
[2023-03-11 03:28:12] [INFO ] After 1056ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:28:13] [INFO ] [Nat]Absence check using 91 positive place invariants in 179 ms returned sat
[2023-03-11 03:28:13] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 86 ms returned sat
[2023-03-11 03:28:22] [INFO ] After 8975ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:28:22] [INFO ] State equation strengthened by 16200 read => feed constraints.
[2023-03-11 03:28:24] [INFO ] After 2302ms SMT Verify possible using 16200 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:28:25] [INFO ] After 3050ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 860 ms.
[2023-03-11 03:28:26] [INFO ] After 14369ms 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 8642 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8642/8642 places, 16560/16560 transitions.
Free-agglomeration rule applied 180 times.
Iterating global reduction 0 with 180 rules applied. Total rules applied 180 place count 8642 transition count 16380
Reduce places removed 180 places and 0 transitions.
Iterating post reduction 0 with 180 rules applied. Total rules applied 360 place count 8462 transition count 16380
Applied a total of 360 rules in 6253 ms. Remains 8462 /8642 variables (removed 180) and now considering 16380/16560 (removed 180) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6253 ms. Remains : 8462/8642 places, 16380/16560 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 103617 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 103617 steps, saw 92053 distinct states, run finished after 3002 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 16380 rows 8462 cols
[2023-03-11 03:28:36] [INFO ] Computed 181 place invariants in 148 ms
[2023-03-11 03:28:37] [INFO ] After 999ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:28:38] [INFO ] [Nat]Absence check using 91 positive place invariants in 229 ms returned sat
[2023-03-11 03:28:38] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 121 ms returned sat
[2023-03-11 03:28:46] [INFO ] After 7854ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:28:46] [INFO ] State equation strengthened by 16200 read => feed constraints.
[2023-03-11 03:28:48] [INFO ] After 1757ms SMT Verify possible using 16200 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:28:49] [INFO ] After 2910ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 584 ms.
[2023-03-11 03:28:50] [INFO ] After 12947ms 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 8462 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8462/8462 places, 16380/16380 transitions.
Applied a total of 0 rules in 2908 ms. Remains 8462 /8462 variables (removed 0) and now considering 16380/16380 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2909 ms. Remains : 8462/8462 places, 16380/16380 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8462/8462 places, 16380/16380 transitions.
Applied a total of 0 rules in 3084 ms. Remains 8462 /8462 variables (removed 0) and now considering 16380/16380 (removed 0) transitions.
[2023-03-11 03:28:56] [INFO ] Invariant cache hit.
[2023-03-11 03:29:02] [INFO ] Implicit Places using invariants in 6554 ms returned []
Implicit Place search using SMT only with invariants took 6555 ms to find 0 implicit places.
[2023-03-11 03:29:02] [INFO ] Invariant cache hit.
[2023-03-11 03:29:12] [INFO ] Dead Transitions using invariants and state equation in 9694 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19352 ms. Remains : 8462/8462 places, 16380/16380 transitions.
Graph (trivial) has 16102 edges and 8462 vertex of which 8186 / 8462 are part of one of the 90 SCC in 6 ms
Free SCC test removed 8096 places
Drop transitions removed 16102 transitions
Reduce isomorphic transitions removed 16102 transitions.
Graph (complete) has 819 edges and 366 vertex of which 12 are kept as prefixes of interest. Removing 354 places using SCC suffix rule.0 ms
Discarding 354 places :
Also discarding 258 output transitions
Drop transitions removed 258 transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 10 place count 12 transition count 12
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 14 place count 12 transition count 12
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 18 place count 8 transition count 8
Iterating global reduction 1 with 4 rules applied. Total rules applied 22 place count 8 transition count 8
Applied a total of 22 rules in 33 ms. Remains 8 /8462 variables (removed 8454) and now considering 8/16380 (removed 16372) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 8 rows 8 cols
[2023-03-11 03:29:12] [INFO ] Computed 4 place invariants in 1 ms
[2023-03-11 03:29:12] [INFO ] After 31ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:29:12] [INFO ] [Nat]Absence check using 4 positive place invariants in 0 ms returned sat
[2023-03-11 03:29:12] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:29:12] [INFO ] After 6ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-11 03:29:12] [INFO ] After 25ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 222 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 125 reset in 2484 ms.
Product exploration explored 100000 steps with 126 reset in 2218 ms.
Support contains 4 out of 8642 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8642/8642 places, 16560/16560 transitions.
Applied a total of 0 rules in 3227 ms. Remains 8642 /8642 variables (removed 0) and now considering 16560/16560 (removed 0) transitions.
// Phase 1: matrix 16560 rows 8642 cols
[2023-03-11 03:29:21] [INFO ] Computed 181 place invariants in 158 ms
[2023-03-11 03:29:27] [INFO ] Implicit Places using invariants in 6868 ms returned []
Implicit Place search using SMT only with invariants took 6870 ms to find 0 implicit places.
[2023-03-11 03:29:27] [INFO ] Invariant cache hit.
[2023-03-11 03:29:38] [INFO ] Dead Transitions using invariants and state equation in 10108 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20210 ms. Remains : 8642/8642 places, 16560/16560 transitions.
Treatment of property CANConstruction-PT-090-LTLCardinality-01 finished in 186843 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U G(p1)))'
Support contains 4 out of 9383 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9383/9383 places, 17322/17322 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 9383 transition count 16692
Reduce places removed 630 places and 0 transitions.
Iterating post reduction 1 with 630 rules applied. Total rules applied 1260 place count 8753 transition count 16692
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 1278 place count 8735 transition count 16656
Iterating global reduction 2 with 18 rules applied. Total rules applied 1296 place count 8735 transition count 16656
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 1476 place count 8645 transition count 16566
Applied a total of 1476 rules in 9158 ms. Remains 8645 /9383 variables (removed 738) and now considering 16566/17322 (removed 756) transitions.
// Phase 1: matrix 16566 rows 8645 cols
[2023-03-11 03:29:48] [INFO ] Computed 181 place invariants in 136 ms
[2023-03-11 03:29:49] [INFO ] Implicit Places using invariants in 1203 ms returned []
Implicit Place search using SMT only with invariants took 1205 ms to find 0 implicit places.
[2023-03-11 03:29:49] [INFO ] Invariant cache hit.
[2023-03-11 03:29:50] [INFO ] Dead Transitions using invariants and state equation in 1024 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8645/9383 places, 16566/17322 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11388 ms. Remains : 8645/9383 places, 16566/17322 transitions.
Stuttering acceptance computed with spot in 151 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : CANConstruction-PT-090-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ s2442 s3357), p0:(LEQ s6348 s1559)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 124 reset in 1839 ms.
Product exploration explored 100000 steps with 124 reset in 1952 ms.
Computed a total of 272 stabilizing places and 270 stable transitions
Computed a total of 272 stabilizing places and 270 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X p1), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 425 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 3 states, 7 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p1), true, (NOT p1)]
Incomplete random walk after 10000 steps, including 12 resets, run finished after 550 ms. (steps per millisecond=18 ) properties (out of 5) 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 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 5) seen :3
Running SMT prover for 2 properties.
[2023-03-11 03:29:55] [INFO ] Invariant cache hit.
[2023-03-11 03:29:56] [INFO ] After 1066ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:29:57] [INFO ] [Nat]Absence check using 91 positive place invariants in 250 ms returned sat
[2023-03-11 03:29:57] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 108 ms returned sat
[2023-03-11 03:30:07] [INFO ] After 9346ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 03:30:07] [INFO ] State equation strengthened by 16200 read => feed constraints.
[2023-03-11 03:30:10] [INFO ] After 2761ms SMT Verify possible using 16200 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 03:30:11] [INFO ] After 4287ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1533 ms.
[2023-03-11 03:30:13] [INFO ] After 16974ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 45 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=11 )
Parikh walk visited 2 properties in 5 ms.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 p0)), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND p1 (NOT p0)))), (X p1), true, (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p0) (NOT p1)))
Knowledge based reduction with 12 factoid took 204 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-090-LTLCardinality-02 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-090-LTLCardinality-02 finished in 34902 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 (p0&&X(p1))))'
Support contains 4 out of 9383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9383/9383 places, 17322/17322 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 9364 transition count 17284
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 9364 transition count 17284
Applied a total of 38 rules in 6957 ms. Remains 9364 /9383 variables (removed 19) and now considering 17284/17322 (removed 38) transitions.
// Phase 1: matrix 17284 rows 9364 cols
[2023-03-11 03:30:20] [INFO ] Computed 181 place invariants in 170 ms
[2023-03-11 03:30:21] [INFO ] Implicit Places using invariants in 1030 ms returned []
Implicit Place search using SMT only with invariants took 1032 ms to find 0 implicit places.
[2023-03-11 03:30:21] [INFO ] Invariant cache hit.
[2023-03-11 03:30:33] [INFO ] Dead Transitions using invariants and state equation in 12013 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9364/9383 places, 17284/17322 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20020 ms. Remains : 9364/9383 places, 17284/17322 transitions.
Stuttering acceptance computed with spot in 132 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p0), true]
Running random walk in product with property : CANConstruction-PT-090-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 1}, { cond=p0, acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s1535 s2060), p1:(LEQ s7334 s303)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 5115 ms.
Product exploration explored 100000 steps with 50000 reset in 5257 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 p1), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND p0 p1)
Knowledge based reduction with 10 factoid took 348 ms. Reduced automaton from 5 states, 10 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-090-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-090-LTLCardinality-04 finished in 30989 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 9383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9383/9383 places, 17322/17322 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 9363 transition count 17282
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 9363 transition count 17282
Applied a total of 40 rules in 6543 ms. Remains 9363 /9383 variables (removed 20) and now considering 17282/17322 (removed 40) transitions.
// Phase 1: matrix 17282 rows 9363 cols
[2023-03-11 03:30:51] [INFO ] Computed 181 place invariants in 90 ms
[2023-03-11 03:30:52] [INFO ] Implicit Places using invariants in 893 ms returned []
Implicit Place search using SMT only with invariants took 900 ms to find 0 implicit places.
[2023-03-11 03:30:52] [INFO ] Invariant cache hit.
[2023-03-11 03:30:53] [INFO ] Dead Transitions using invariants and state equation in 1023 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9363/9383 places, 17282/17322 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8469 ms. Remains : 9363/9383 places, 17282/17322 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-090-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(LEQ s4387 s3506)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 89694 steps with 55 reset in 1983 ms.
FORMULA CANConstruction-PT-090-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLCardinality-05 finished in 10611 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(G(G((G((X(p0) U p1))||p2)))))))'
Support contains 6 out of 9383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9383/9383 places, 17322/17322 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 9367 transition count 17290
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 9367 transition count 17290
Applied a total of 32 rules in 6960 ms. Remains 9367 /9383 variables (removed 16) and now considering 17290/17322 (removed 32) transitions.
// Phase 1: matrix 17290 rows 9367 cols
[2023-03-11 03:31:02] [INFO ] Computed 181 place invariants in 120 ms
[2023-03-11 03:31:03] [INFO ] Implicit Places using invariants in 1010 ms returned []
Implicit Place search using SMT only with invariants took 1013 ms to find 0 implicit places.
[2023-03-11 03:31:03] [INFO ] Invariant cache hit.
[2023-03-11 03:31:04] [INFO ] Dead Transitions using invariants and state equation in 841 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9367/9383 places, 17290/17322 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8835 ms. Remains : 9367/9383 places, 17290/17322 transitions.
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Running random walk in product with property : CANConstruction-PT-090-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(LEQ s6261 s4670), p1:(LEQ s4897 s4898), p0:(LEQ s2161 s7821)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 62 reset in 1475 ms.
Product exploration explored 100000 steps with 61 reset in 1463 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 p2 p1 p0), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 152 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 320 ms. (steps per millisecond=31 ) properties (out of 5) 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 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
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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-11 03:31:08] [INFO ] Invariant cache hit.
[2023-03-11 03:31:09] [INFO ] After 1049ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 03:31:10] [INFO ] [Nat]Absence check using 91 positive place invariants in 174 ms returned sat
[2023-03-11 03:31:10] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 90 ms returned sat
[2023-03-11 03:31:20] [INFO ] After 9983ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 03:31:21] [INFO ] State equation strengthened by 16110 read => feed constraints.
[2023-03-11 03:31:25] [INFO ] After 4535ms SMT Verify possible using 16110 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 03:31:29] [INFO ] After 8497ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2869 ms.
[2023-03-11 03:31:32] [INFO ] After 23257ms 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 16 ms.
Support contains 6 out of 9367 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9367/9367 places, 17290/17290 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 9367 transition count 16660
Reduce places removed 630 places and 0 transitions.
Iterating post reduction 1 with 630 rules applied. Total rules applied 1260 place count 8737 transition count 16660
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 1440 place count 8647 transition count 16570
Free-agglomeration rule applied 170 times.
Iterating global reduction 2 with 170 rules applied. Total rules applied 1610 place count 8647 transition count 16400
Reduce places removed 170 places and 0 transitions.
Iterating post reduction 2 with 170 rules applied. Total rules applied 1780 place count 8477 transition count 16400
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 1790 place count 8477 transition count 16400
Applied a total of 1790 rules in 10550 ms. Remains 8477 /9367 variables (removed 890) and now considering 16400/17290 (removed 890) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10551 ms. Remains : 8477/9367 places, 16400/17290 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 302 ms. (steps per millisecond=33 ) 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
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
Interrupted probabilistic random walk after 96640 steps, run timeout after 3001 ms. (steps per millisecond=32 ) properties seen :{}
Probabilistic random walk after 96640 steps, saw 90293 distinct states, run finished after 3002 ms. (steps per millisecond=32 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 16400 rows 8477 cols
[2023-03-11 03:31:46] [INFO ] Computed 181 place invariants in 163 ms
[2023-03-11 03:31:47] [INFO ] After 1202ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:31:48] [INFO ] [Nat]Absence check using 91 positive place invariants in 132 ms returned sat
[2023-03-11 03:31:48] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 75 ms returned sat
[2023-03-11 03:32:02] [INFO ] After 13189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:32:02] [INFO ] State equation strengthened by 16205 read => feed constraints.
[2023-03-11 03:32:05] [INFO ] After 3213ms SMT Verify possible using 16205 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-11 03:32:08] [INFO ] After 5829ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1610 ms.
[2023-03-11 03:32:09] [INFO ] After 22219ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 12 ms.
Support contains 6 out of 8477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8477/8477 places, 16400/16400 transitions.
Applied a total of 0 rules in 2665 ms. Remains 8477 /8477 variables (removed 0) and now considering 16400/16400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2665 ms. Remains : 8477/8477 places, 16400/16400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8477/8477 places, 16400/16400 transitions.
Applied a total of 0 rules in 2230 ms. Remains 8477 /8477 variables (removed 0) and now considering 16400/16400 (removed 0) transitions.
[2023-03-11 03:32:14] [INFO ] Invariant cache hit.
[2023-03-11 03:32:15] [INFO ] Implicit Places using invariants in 1019 ms returned []
Implicit Place search using SMT only with invariants took 1021 ms to find 0 implicit places.
[2023-03-11 03:32:15] [INFO ] Invariant cache hit.
[2023-03-11 03:32:16] [INFO ] Dead Transitions using invariants and state equation in 942 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4199 ms. Remains : 8477/8477 places, 16400/16400 transitions.
Graph (trivial) has 16108 edges and 8477 vertex of which 8184 / 8477 are part of one of the 90 SCC in 4 ms
Free SCC test removed 8094 places
Drop transitions removed 16098 transitions
Reduce isomorphic transitions removed 16098 transitions.
Graph (complete) has 848 edges and 383 vertex of which 28 are kept as prefixes of interest. Removing 355 places using SCC suffix rule.0 ms
Discarding 355 places :
Also discarding 257 output transitions
Drop transitions removed 257 transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 0 with 17 rules applied. Total rules applied 19 place count 28 transition count 28
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 24 place count 23 transition count 28
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 24 place count 23 transition count 23
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 34 place count 18 transition count 23
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 40 place count 18 transition count 23
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 46 place count 12 transition count 17
Iterating global reduction 2 with 6 rules applied. Total rules applied 52 place count 12 transition count 17
Applied a total of 52 rules in 24 ms. Remains 12 /8477 variables (removed 8465) and now considering 17/16400 (removed 16383) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 17 rows 12 cols
[2023-03-11 03:32:16] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-11 03:32:16] [INFO ] After 24ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 03:32:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 03:32:16] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 03:32:16] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-11 03:32:16] [INFO ] After 62ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p2 p1 p0), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (NOT p2))]
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Support contains 6 out of 9367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9367/9367 places, 17290/17290 transitions.
Applied a total of 0 rules in 2715 ms. Remains 9367 /9367 variables (removed 0) and now considering 17290/17290 (removed 0) transitions.
// Phase 1: matrix 17290 rows 9367 cols
[2023-03-11 03:32:20] [INFO ] Computed 181 place invariants in 148 ms
[2023-03-11 03:32:21] [INFO ] Implicit Places using invariants in 1177 ms returned []
Implicit Place search using SMT only with invariants took 1178 ms to find 0 implicit places.
[2023-03-11 03:32:21] [INFO ] Invariant cache hit.
[2023-03-11 03:32:32] [INFO ] Dead Transitions using invariants and state equation in 11378 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15274 ms. Remains : 9367/9367 places, 17290/17290 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 p2 p1 p0), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 160 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Incomplete random walk after 10000 steps, including 6 resets, run finished after 271 ms. (steps per millisecond=36 ) properties (out of 5) 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 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
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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-11 03:32:33] [INFO ] Invariant cache hit.
[2023-03-11 03:32:34] [INFO ] After 1294ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 03:32:36] [INFO ] [Nat]Absence check using 91 positive place invariants in 283 ms returned sat
[2023-03-11 03:32:36] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 131 ms returned sat
[2023-03-11 03:32:51] [INFO ] After 14517ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 03:32:52] [INFO ] State equation strengthened by 16110 read => feed constraints.
[2023-03-11 03:32:56] [INFO ] After 4404ms SMT Verify possible using 16110 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 03:32:59] [INFO ] After 7877ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-11 03:33:00] [INFO ] After 25074ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 15 ms.
Support contains 6 out of 9367 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 9367/9367 places, 17290/17290 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 9367 transition count 16660
Reduce places removed 630 places and 0 transitions.
Iterating post reduction 1 with 630 rules applied. Total rules applied 1260 place count 8737 transition count 16660
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 1440 place count 8647 transition count 16570
Free-agglomeration rule applied 170 times.
Iterating global reduction 2 with 170 rules applied. Total rules applied 1610 place count 8647 transition count 16400
Reduce places removed 170 places and 0 transitions.
Iterating post reduction 2 with 170 rules applied. Total rules applied 1780 place count 8477 transition count 16400
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 3 with 10 rules applied. Total rules applied 1790 place count 8477 transition count 16400
Applied a total of 1790 rules in 9521 ms. Remains 8477 /9367 variables (removed 890) and now considering 16400/17290 (removed 890) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9521 ms. Remains : 8477/9367 places, 16400/17290 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 308 ms. (steps per millisecond=32 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) 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 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 16400 rows 8477 cols
[2023-03-11 03:33:10] [INFO ] Computed 181 place invariants in 144 ms
[2023-03-11 03:33:11] [INFO ] After 1095ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:33:12] [INFO ] [Nat]Absence check using 91 positive place invariants in 157 ms returned sat
[2023-03-11 03:33:12] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 101 ms returned sat
[2023-03-11 03:33:21] [INFO ] After 8660ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 03:33:21] [INFO ] State equation strengthened by 16205 read => feed constraints.
[2023-03-11 03:33:24] [INFO ] After 2647ms SMT Verify possible using 16205 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 03:33:25] [INFO ] After 4378ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1229 ms.
[2023-03-11 03:33:27] [INFO ] After 15869ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 6 out of 8477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8477/8477 places, 16400/16400 transitions.
Applied a total of 0 rules in 2268 ms. Remains 8477 /8477 variables (removed 0) and now considering 16400/16400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2268 ms. Remains : 8477/8477 places, 16400/16400 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 281 ms. (steps per millisecond=35 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 99086 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 99086 steps, saw 90909 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-11 03:33:32] [INFO ] Invariant cache hit.
[2023-03-11 03:33:33] [INFO ] After 963ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:33:34] [INFO ] [Nat]Absence check using 91 positive place invariants in 236 ms returned sat
[2023-03-11 03:33:34] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 98 ms returned sat
[2023-03-11 03:33:44] [INFO ] After 9302ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 03:33:44] [INFO ] State equation strengthened by 16205 read => feed constraints.
[2023-03-11 03:33:47] [INFO ] After 2333ms SMT Verify possible using 16205 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 03:33:48] [INFO ] After 3815ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1103 ms.
[2023-03-11 03:33:49] [INFO ] After 15989ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 5 ms.
Support contains 6 out of 8477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8477/8477 places, 16400/16400 transitions.
Applied a total of 0 rules in 2481 ms. Remains 8477 /8477 variables (removed 0) and now considering 16400/16400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2481 ms. Remains : 8477/8477 places, 16400/16400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8477/8477 places, 16400/16400 transitions.
Applied a total of 0 rules in 2310 ms. Remains 8477 /8477 variables (removed 0) and now considering 16400/16400 (removed 0) transitions.
[2023-03-11 03:33:54] [INFO ] Invariant cache hit.
[2023-03-11 03:33:55] [INFO ] Implicit Places using invariants in 858 ms returned []
Implicit Place search using SMT only with invariants took 866 ms to find 0 implicit places.
[2023-03-11 03:33:55] [INFO ] Invariant cache hit.
[2023-03-11 03:33:55] [INFO ] Dead Transitions using invariants and state equation in 724 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3934 ms. Remains : 8477/8477 places, 16400/16400 transitions.
Graph (trivial) has 16108 edges and 8477 vertex of which 8184 / 8477 are part of one of the 90 SCC in 4 ms
Free SCC test removed 8094 places
Drop transitions removed 16098 transitions
Reduce isomorphic transitions removed 16098 transitions.
Graph (complete) has 848 edges and 383 vertex of which 28 are kept as prefixes of interest. Removing 355 places using SCC suffix rule.1 ms
Discarding 355 places :
Also discarding 257 output transitions
Drop transitions removed 257 transitions
Drop transitions removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 0 with 17 rules applied. Total rules applied 19 place count 28 transition count 28
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 24 place count 23 transition count 28
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 24 place count 23 transition count 23
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 34 place count 18 transition count 23
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 40 place count 18 transition count 23
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 46 place count 12 transition count 17
Iterating global reduction 2 with 6 rules applied. Total rules applied 52 place count 12 transition count 17
Applied a total of 52 rules in 20 ms. Remains 12 /8477 variables (removed 8465) and now considering 17/16400 (removed 16383) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 17 rows 12 cols
[2023-03-11 03:33:56] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-11 03:33:56] [INFO ] After 23ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:33:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 03:33:56] [INFO ] After 6ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 03:33:56] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-11 03:33:56] [INFO ] After 35ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p2 p1 p0), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p2)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Stuttering acceptance computed with spot in 132 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Product exploration explored 100000 steps with 63 reset in 1389 ms.
Product exploration explored 100000 steps with 62 reset in 1438 ms.
Applying partial POR strategy [false, false, false, true, false, true]
Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Support contains 6 out of 9367 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9367/9367 places, 17290/17290 transitions.
Performed 450 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 450 rules applied. Total rules applied 450 place count 9367 transition count 17290
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 90 Pre rules applied. Total rules applied 450 place count 9367 transition count 17290
Deduced a syphon composed of 540 places in 4 ms
Iterating global reduction 1 with 90 rules applied. Total rules applied 540 place count 9367 transition count 17290
Discarding 180 places :
Symmetric choice reduction at 1 with 180 rule applications. Total rules 720 place count 9187 transition count 17110
Deduced a syphon composed of 360 places in 4 ms
Iterating global reduction 1 with 180 rules applied. Total rules applied 900 place count 9187 transition count 17110
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 540 places in 3 ms
Iterating global reduction 1 with 180 rules applied. Total rules applied 1080 place count 9187 transition count 17110
Discarding 360 places :
Symmetric choice reduction at 1 with 360 rule applications. Total rules 1440 place count 8827 transition count 16750
Deduced a syphon composed of 180 places in 2 ms
Iterating global reduction 1 with 360 rules applied. Total rules applied 1800 place count 8827 transition count 16750
Deduced a syphon composed of 180 places in 2 ms
Applied a total of 1800 rules in 10169 ms. Remains 8827 /9367 variables (removed 540) and now considering 16750/17290 (removed 540) transitions.
// Phase 1: matrix 16750 rows 8827 cols
[2023-03-11 03:34:10] [INFO ] Computed 181 place invariants in 121 ms
[2023-03-11 03:34:11] [INFO ] Dead Transitions using invariants and state equation in 949 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8827/9367 places, 16750/17290 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11133 ms. Remains : 8827/9367 places, 16750/17290 transitions.
Support contains 6 out of 9367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9367/9367 places, 17290/17290 transitions.
Applied a total of 0 rules in 2710 ms. Remains 9367 /9367 variables (removed 0) and now considering 17290/17290 (removed 0) transitions.
// Phase 1: matrix 17290 rows 9367 cols
[2023-03-11 03:34:14] [INFO ] Computed 181 place invariants in 91 ms
[2023-03-11 03:34:21] [INFO ] Implicit Places using invariants in 6614 ms returned []
Implicit Place search using SMT only with invariants took 6629 ms to find 0 implicit places.
[2023-03-11 03:34:21] [INFO ] Invariant cache hit.
[2023-03-11 03:34:31] [INFO ] Dead Transitions using invariants and state equation in 10626 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19972 ms. Remains : 9367/9367 places, 17290/17290 transitions.
Treatment of property CANConstruction-PT-090-LTLCardinality-06 finished in 216838 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 9383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9383/9383 places, 17322/17322 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 9363 transition count 17282
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 9363 transition count 17282
Applied a total of 40 rules in 5433 ms. Remains 9363 /9383 variables (removed 20) and now considering 17282/17322 (removed 40) transitions.
// Phase 1: matrix 17282 rows 9363 cols
[2023-03-11 03:34:37] [INFO ] Computed 181 place invariants in 157 ms
[2023-03-11 03:34:38] [INFO ] Implicit Places using invariants in 1052 ms returned []
Implicit Place search using SMT only with invariants took 1066 ms to find 0 implicit places.
[2023-03-11 03:34:38] [INFO ] Invariant cache hit.
[2023-03-11 03:34:49] [INFO ] Dead Transitions using invariants and state equation in 10823 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9363/9383 places, 17282/17322 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17338 ms. Remains : 9363/9383 places, 17282/17322 transitions.
Stuttering acceptance computed with spot in 56 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-090-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s8860 s9349)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 23524 steps with 14 reset in 332 ms.
FORMULA CANConstruction-PT-090-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLCardinality-07 finished in 17770 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 9383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9383/9383 places, 17322/17322 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 9363 transition count 17282
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 9363 transition count 17282
Applied a total of 40 rules in 5800 ms. Remains 9363 /9383 variables (removed 20) and now considering 17282/17322 (removed 40) transitions.
// Phase 1: matrix 17282 rows 9363 cols
[2023-03-11 03:34:55] [INFO ] Computed 181 place invariants in 156 ms
[2023-03-11 03:35:02] [INFO ] Implicit Places using invariants in 6617 ms returned []
Implicit Place search using SMT only with invariants took 6631 ms to find 0 implicit places.
[2023-03-11 03:35:02] [INFO ] Invariant cache hit.
[2023-03-11 03:35:12] [INFO ] Dead Transitions using invariants and state equation in 10440 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9363/9383 places, 17282/17322 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22886 ms. Remains : 9363/9383 places, 17282/17322 transitions.
Stuttering acceptance computed with spot in 55 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-090-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (LEQ 1 s9058) (LEQ s8912 s2838))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CANConstruction-PT-090-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLCardinality-10 finished in 22991 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 9383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9383/9383 places, 17322/17322 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 9363 transition count 17282
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 9363 transition count 17282
Applied a total of 40 rules in 5132 ms. Remains 9363 /9383 variables (removed 20) and now considering 17282/17322 (removed 40) transitions.
// Phase 1: matrix 17282 rows 9363 cols
[2023-03-11 03:35:18] [INFO ] Computed 181 place invariants in 156 ms
[2023-03-11 03:35:24] [INFO ] Implicit Places using invariants in 6459 ms returned []
Implicit Place search using SMT only with invariants took 6483 ms to find 0 implicit places.
[2023-03-11 03:35:24] [INFO ] Invariant cache hit.
[2023-03-11 03:35:35] [INFO ] Dead Transitions using invariants and state equation in 10569 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9363/9383 places, 17282/17322 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22188 ms. Remains : 9363/9383 places, 17282/17322 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-090-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(LEQ s6815 s984)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 3357 ms.
Product exploration explored 100000 steps with 33333 reset in 3303 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 : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 69 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-090-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-090-LTLCardinality-12 finished in 29078 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))&&(F(p0) U p1)))'
Support contains 4 out of 9383 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 9383/9383 places, 17322/17322 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 9383 transition count 16692
Reduce places removed 630 places and 0 transitions.
Iterating post reduction 1 with 630 rules applied. Total rules applied 1260 place count 8753 transition count 16692
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 1280 place count 8733 transition count 16652
Iterating global reduction 2 with 20 rules applied. Total rules applied 1300 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 1480 place count 8643 transition count 16562
Applied a total of 1480 rules in 7231 ms. Remains 8643 /9383 variables (removed 740) and now considering 16562/17322 (removed 760) transitions.
// Phase 1: matrix 16562 rows 8643 cols
[2023-03-11 03:35:49] [INFO ] Computed 181 place invariants in 154 ms
[2023-03-11 03:35:55] [INFO ] Implicit Places using invariants in 6223 ms returned []
Implicit Place search using SMT only with invariants took 6225 ms to find 0 implicit places.
[2023-03-11 03:35:55] [INFO ] Invariant cache hit.
[2023-03-11 03:36:04] [INFO ] Dead Transitions using invariants and state equation in 9566 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 8643/9383 places, 16562/17322 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23034 ms. Remains : 8643/9383 places, 16562/17322 transitions.
Stuttering acceptance computed with spot in 94 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-090-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ s6997 s5082), p1:(GT s5969 s1991)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 794 steps with 0 reset in 16 ms.
FORMULA CANConstruction-PT-090-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLCardinality-13 finished in 23182 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(X(F(p0))))))'
Support contains 2 out of 9383 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 9383/9383 places, 17322/17322 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 9363 transition count 17282
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 9363 transition count 17282
Applied a total of 40 rules in 5353 ms. Remains 9363 /9383 variables (removed 20) and now considering 17282/17322 (removed 40) transitions.
// Phase 1: matrix 17282 rows 9363 cols
[2023-03-11 03:36:10] [INFO ] Computed 181 place invariants in 160 ms
[2023-03-11 03:36:16] [INFO ] Implicit Places using invariants in 6551 ms returned []
Implicit Place search using SMT only with invariants took 6553 ms to find 0 implicit places.
[2023-03-11 03:36:17] [INFO ] Invariant cache hit.
[2023-03-11 03:36:27] [INFO ] Dead Transitions using invariants and state equation in 10465 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 9363/9383 places, 17282/17322 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22374 ms. Remains : 9363/9383 places, 17282/17322 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-090-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}]], initial=4, aps=[p0:(GT s414 s5043)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 17981 steps with 89 reset in 215 ms.
FORMULA CANConstruction-PT-090-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-090-LTLCardinality-15 finished in 22735 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(G(G((G((X(p0) U p1))||p2)))))))'
Found a Lengthening insensitive property : CANConstruction-PT-090-LTLCardinality-06
Stuttering acceptance computed with spot in 187 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Support contains 6 out of 9383 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 9383/9383 places, 17322/17322 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 9383 transition count 16692
Reduce places removed 630 places and 0 transitions.
Iterating post reduction 1 with 630 rules applied. Total rules applied 1260 place count 8753 transition count 16692
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 1276 place count 8737 transition count 16660
Iterating global reduction 2 with 16 rules applied. Total rules applied 1292 place count 8737 transition count 16660
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 8647 transition count 16570
Applied a total of 1472 rules in 7168 ms. Remains 8647 /9383 variables (removed 736) and now considering 16570/17322 (removed 752) transitions.
// Phase 1: matrix 16570 rows 8647 cols
[2023-03-11 03:36:35] [INFO ] Computed 181 place invariants in 154 ms
[2023-03-11 03:36:41] [INFO ] Implicit Places using invariants in 6214 ms returned []
Implicit Place search using SMT only with invariants took 6228 ms to find 0 implicit places.
[2023-03-11 03:36:41] [INFO ] Invariant cache hit.
[2023-03-11 03:36:51] [INFO ] Dead Transitions using invariants and state equation in 10029 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 8647/9383 places, 16570/17322 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 23435 ms. Remains : 8647/9383 places, 16570/17322 transitions.
Running random walk in product with property : CANConstruction-PT-090-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p2), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}, { cond=(NOT p0), acceptance={0} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p2:(LEQ s5541 s3950), p1:(LEQ s4177 s4178), p0:(LEQ s1441 s7101)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 123 reset in 2010 ms.
Product exploration explored 100000 steps with 124 reset in 2296 ms.
Computed a total of 272 stabilizing places and 270 stable transitions
Computed a total of 272 stabilizing places and 270 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 180 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Incomplete random walk after 10000 steps, including 12 resets, run finished after 556 ms. (steps per millisecond=17 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) 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 4) 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 4) 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 4) seen :0
Running SMT prover for 4 properties.
[2023-03-11 03:36:57] [INFO ] Invariant cache hit.
[2023-03-11 03:36:58] [INFO ] After 1166ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-11 03:37:00] [INFO ] [Nat]Absence check using 91 positive place invariants in 244 ms returned sat
[2023-03-11 03:37:00] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 119 ms returned sat
[2023-03-11 03:37:10] [INFO ] After 9911ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-11 03:37:10] [INFO ] State equation strengthened by 16200 read => feed constraints.
[2023-03-11 03:37:14] [INFO ] After 3581ms SMT Verify possible using 16200 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-11 03:37:17] [INFO ] After 6212ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2655 ms.
[2023-03-11 03:37:19] [INFO ] After 21312ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 25 steps, including 0 resets, run visited all 4 properties in 4 ms. (steps per millisecond=6 )
Parikh walk visited 4 properties in 5 ms.
Knowledge obtained : [(AND p2 p1 p0), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (AND p0 (NOT p1))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 3 factoid took 286 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Support contains 6 out of 8647 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8647/8647 places, 16570/16570 transitions.
Applied a total of 0 rules in 2442 ms. Remains 8647 /8647 variables (removed 0) and now considering 16570/16570 (removed 0) transitions.
[2023-03-11 03:37:22] [INFO ] Invariant cache hit.
[2023-03-11 03:37:28] [INFO ] Implicit Places using invariants in 5984 ms returned []
Implicit Place search using SMT only with invariants took 5992 ms to find 0 implicit places.
[2023-03-11 03:37:28] [INFO ] Invariant cache hit.
[2023-03-11 03:37:38] [INFO ] Dead Transitions using invariants and state equation in 9748 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18197 ms. Remains : 8647/8647 places, 16570/16570 transitions.
Computed a total of 272 stabilizing places and 270 stable transitions
Computed a total of 272 stabilizing places and 270 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Incomplete random walk after 10000 steps, including 12 resets, run finished after 508 ms. (steps per millisecond=19 ) properties (out of 5) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-11 03:37:39] [INFO ] Invariant cache hit.
[2023-03-11 03:37:40] [INFO ] After 843ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-11 03:37:41] [INFO ] [Nat]Absence check using 91 positive place invariants in 207 ms returned sat
[2023-03-11 03:37:41] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 73 ms returned sat
[2023-03-11 03:37:49] [INFO ] After 8082ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-11 03:37:49] [INFO ] State equation strengthened by 16200 read => feed constraints.
[2023-03-11 03:37:52] [INFO ] After 2698ms SMT Verify possible using 16200 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-11 03:37:54] [INFO ] After 4181ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 1138 ms.
[2023-03-11 03:37:55] [INFO ] After 14822ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 1 properties in 17 ms.
Support contains 4 out of 8647 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8647/8647 places, 16570/16570 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 8645 transition count 16566
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 8645 transition count 16566
Free-agglomeration rule applied 174 times.
Iterating global reduction 0 with 174 rules applied. Total rules applied 178 place count 8645 transition count 16392
Reduce places removed 174 places and 0 transitions.
Iterating post reduction 0 with 174 rules applied. Total rules applied 352 place count 8471 transition count 16392
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 358 place count 8471 transition count 16392
Applied a total of 358 rules in 10165 ms. Remains 8471 /8647 variables (removed 176) and now considering 16392/16570 (removed 178) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10165 ms. Remains : 8471/8647 places, 16392/16570 transitions.
Incomplete random walk after 10000 steps, including 15 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 103295 steps, run timeout after 3001 ms. (steps per millisecond=34 ) properties seen :{}
Probabilistic random walk after 103295 steps, saw 91963 distinct states, run finished after 3001 ms. (steps per millisecond=34 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 16392 rows 8471 cols
[2023-03-11 03:38:08] [INFO ] Computed 181 place invariants in 149 ms
[2023-03-11 03:38:09] [INFO ] After 850ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:38:10] [INFO ] [Nat]Absence check using 91 positive place invariants in 173 ms returned sat
[2023-03-11 03:38:10] [INFO ] [Nat]Absence check using 91 positive and 90 generalized place invariants in 78 ms returned sat
[2023-03-11 03:38:18] [INFO ] After 7490ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:38:18] [INFO ] State equation strengthened by 16203 read => feed constraints.
[2023-03-11 03:38:20] [INFO ] After 2005ms SMT Verify possible using 16203 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-11 03:38:21] [INFO ] After 2884ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 598 ms.
[2023-03-11 03:38:21] [INFO ] After 12132ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 8471 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8471/8471 places, 16392/16392 transitions.
Applied a total of 0 rules in 2532 ms. Remains 8471 /8471 variables (removed 0) and now considering 16392/16392 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2532 ms. Remains : 8471/8471 places, 16392/16392 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 8471/8471 places, 16392/16392 transitions.
Applied a total of 0 rules in 2457 ms. Remains 8471 /8471 variables (removed 0) and now considering 16392/16392 (removed 0) transitions.
[2023-03-11 03:38:26] [INFO ] Invariant cache hit.
[2023-03-11 03:38:32] [INFO ] Implicit Places using invariants in 5959 ms returned []
Implicit Place search using SMT only with invariants took 5969 ms to find 0 implicit places.
[2023-03-11 03:38:32] [INFO ] Invariant cache hit.
[2023-03-11 03:38:42] [INFO ] Dead Transitions using invariants and state equation in 10119 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18562 ms. Remains : 8471/8471 places, 16392/16392 transitions.
Graph (trivial) has 16108 edges and 8471 vertex of which 8186 / 8471 are part of one of the 90 SCC in 4 ms
Free SCC test removed 8096 places
Drop transitions removed 16102 transitions
Reduce isomorphic transitions removed 16102 transitions.
Graph (complete) has 834 edges and 375 vertex of which 18 are kept as prefixes of interest. Removing 357 places using SCC suffix rule.0 ms
Discarding 357 places :
Also discarding 261 output transitions
Drop transitions removed 261 transitions
Drop transitions removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 0 with 11 rules applied. Total rules applied 13 place count 18 transition count 18
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 16 place count 15 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 16 place count 15 transition count 15
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 12 transition count 15
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 26 place count 12 transition count 15
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 30 place count 8 transition count 11
Iterating global reduction 2 with 4 rules applied. Total rules applied 34 place count 8 transition count 11
Applied a total of 34 rules in 24 ms. Remains 8 /8471 variables (removed 8463) and now considering 11/16392 (removed 16381) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 11 rows 8 cols
[2023-03-11 03:38:42] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-11 03:38:42] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 03:38:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-11 03:38:43] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 03:38:43] [INFO ] After 4ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-11 03:38:43] [INFO ] After 34ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p2 p1 p0), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT p2)), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 3 factoid took 172 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 6 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Product exploration explored 100000 steps with 124 reset in 2175 ms.
Product exploration explored 100000 steps with 124 reset in 2084 ms.
Applying partial POR strategy [false, false, false, true, false, true]
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), (NOT p1), true]
Support contains 6 out of 8647 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8647/8647 places, 16570/16570 transitions.
Applied a total of 0 rules in 2598 ms. Remains 8647 /8647 variables (removed 0) and now considering 16570/16570 (removed 0) transitions.
// Phase 1: matrix 16570 rows 8647 cols
[2023-03-11 03:38:50] [INFO ] Computed 181 place invariants in 151 ms
[2023-03-11 03:39:01] [INFO ] Dead Transitions using invariants and state equation in 10422 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 13021 ms. Remains : 8647/8647 places, 16570/16570 transitions.
Support contains 6 out of 8647 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8647/8647 places, 16570/16570 transitions.
Applied a total of 0 rules in 2297 ms. Remains 8647 /8647 variables (removed 0) and now considering 16570/16570 (removed 0) transitions.
[2023-03-11 03:39:03] [INFO ] Invariant cache hit.
[2023-03-11 03:39:09] [INFO ] Implicit Places using invariants in 6291 ms returned []
Implicit Place search using SMT only with invariants took 6305 ms to find 0 implicit places.
[2023-03-11 03:39:09] [INFO ] Invariant cache hit.
[2023-03-11 03:39:19] [INFO ] Dead Transitions using invariants and state equation in 9534 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18151 ms. Remains : 8647/8647 places, 16570/16570 transitions.
Treatment of property CANConstruction-PT-090-LTLCardinality-06 finished in 171801 ms.
[2023-03-11 03:39:20] [INFO ] Flatten gal took : 479 ms
[2023-03-11 03:39:20] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2023-03-11 03:39:20] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 9383 places, 17322 transitions and 67404 arcs took 75 ms.
Total runtime 912112 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT CANConstruction-PT-090
BK_EXAMINATION: LTLCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
LTLCardinality

BK_STOP 1678506070138

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/LTLCardinality.xml
lola: rewrite Frontend/Parser/formula_rewrite.k:436
lola: rewrite Frontend/Parser/formula_rewrite.k:521
lola: rewrite Frontend/Parser/formula_rewrite.k:349
lola: rewrite Frontend/Parser/formula_rewrite.k:352
lola: rewrite Frontend/Parser/formula_rewrite.k:352
lola: rewrite Frontend/Parser/formula_rewrite.k:349
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: NOTDEADLOCKFREE
lola: NOTDEADLOCKFREE
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

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

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

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

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

Time elapsed: 14 secs. Pages in use: 0
# running tasks: 0 of 4 Visible: 2
lola: LAUNCH task # 1 (type EXCL) for 0 CANConstruction-PT-090-LTLCardinality-01
lola: time limit : 1791 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 1/1791 1/32 CANConstruction-PT-090-LTLCardinality-01 5069 m, 1013 m/sec, 9811 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 6/1791 5/32 CANConstruction-PT-090-LTLCardinality-01 56214 m, 10229 m/sec, 121833 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 11/1791 8/32 CANConstruction-PT-090-LTLCardinality-01 107675 m, 10292 m/sec, 237099 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 16/1791 12/32 CANConstruction-PT-090-LTLCardinality-01 158229 m, 10110 m/sec, 351824 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 21/1791 15/32 CANConstruction-PT-090-LTLCardinality-01 208942 m, 10142 m/sec, 466919 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 26/1791 19/32 CANConstruction-PT-090-LTLCardinality-01 259104 m, 10032 m/sec, 581377 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 31/1791 22/32 CANConstruction-PT-090-LTLCardinality-01 308253 m, 9829 m/sec, 694692 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 36/1791 25/32 CANConstruction-PT-090-LTLCardinality-01 356866 m, 9722 m/sec, 809324 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 41/1791 29/32 CANConstruction-PT-090-LTLCardinality-01 407593 m, 10145 m/sec, 923995 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
1 LTL EXCL 46/1791 32/32 CANConstruction-PT-090-LTLCardinality-01 457497 m, 9980 m/sec, 1038517 t fired, .

Time elapsed: 64 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 1 (type EXCL) for CANConstruction-PT-090-LTLCardinality-01 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

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

Time elapsed: 69 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: LAUNCH task # 4 (type EXCL) for 3 CANConstruction-PT-090-LTLCardinality-06
lola: time limit : 3531 sec
lola: memory limit: 32 pages
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 5/3531 4/32 CANConstruction-PT-090-LTLCardinality-06 43951 m, 8790 m/sec, 111109 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 10/3531 7/32 CANConstruction-PT-090-LTLCardinality-06 87905 m, 8790 m/sec, 230366 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 15/3531 11/32 CANConstruction-PT-090-LTLCardinality-06 135595 m, 9538 m/sec, 348223 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 20/3531 15/32 CANConstruction-PT-090-LTLCardinality-06 191188 m, 11118 m/sec, 463593 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 25/3531 21/32 CANConstruction-PT-090-LTLCardinality-06 250607 m, 11883 m/sec, 577859 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 30/3531 26/32 CANConstruction-PT-090-LTLCardinality-06 307247 m, 11328 m/sec, 692582 t fired, .

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

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

TASK CATEGORY TYPE TIME/TLIMIT MEM PG/PGLIMIT FORMULA STATUS
4 LTL EXCL 35/3531 31/32 CANConstruction-PT-090-LTLCardinality-06 362450 m, 11040 m/sec, 807901 t fired, .

Time elapsed: 104 secs. Pages in use: 32
# running tasks: 1 of 4 Visible: 2
lola: CANCELED task # 4 (type EXCL) for CANConstruction-PT-090-LTLCardinality-06 (memory limit exceeded)
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY

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

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

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

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
CANConstruction-PT-090-LTLCardinality-01: LTL unknown AGGR
CANConstruction-PT-090-LTLCardinality-06: LTL unknown AGGR


Time elapsed: 109 secs. Pages in use: 32

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CANConstruction-PT-090"
export BK_EXAMINATION="LTLCardinality"
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 LTLCardinality"
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-167813692900683"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;