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.r037-tajo-167813690800763.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 itstools
Input is CANInsertWithFailure-PT-080, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690800763
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 39M
-rw-r--r-- 1 mcc users 9.3K Feb 26 01:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K Feb 26 01:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 00:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 00:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Feb 25 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Feb 25 15:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 01:24 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 01:24 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 26 01:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 93K Feb 26 01:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:41 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 39M 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 CANInsertWithFailure-PT-080-LTLCardinality-00
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-01
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-02
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-03
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-04
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-05
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-06
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-07
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-08
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-09
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-10
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-11
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-12
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-13
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-14
FORMULA_NAME CANInsertWithFailure-PT-080-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678381762814

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=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-080
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-09 17:09:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 17:09:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 17:09:25] [INFO ] Load time of PNML (sax parser for PT used): 835 ms
[2023-03-09 17:09:25] [INFO ] Transformed 13764 places.
[2023-03-09 17:09:25] [INFO ] Transformed 38880 transitions.
[2023-03-09 17:09:25] [INFO ] Parsed PT model containing 13764 places and 38880 transitions and 104000 arcs in 1083 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 22 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 13764 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13764/13764 places, 38880/38880 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 13763 transition count 38880
Applied a total of 1 rules in 5044 ms. Remains 13763 /13764 variables (removed 1) and now considering 38880/38880 (removed 0) transitions.
// Phase 1: matrix 38880 rows 13763 cols
[2023-03-09 17:09:40] [INFO ] Computed 82 place invariants in 8588 ms
[2023-03-09 17:09:41] [INFO ] Implicit Places using invariants in 10059 ms returned []
Implicit Place search using SMT only with invariants took 10097 ms to find 0 implicit places.
[2023-03-09 17:09:41] [INFO ] Invariant cache hit.
[2023-03-09 17:09:42] [INFO ] Dead Transitions using invariants and state equation in 1360 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 13763/13764 places, 38880/38880 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16513 ms. Remains : 13763/13764 places, 38880/38880 transitions.
Support contains 41 out of 13763 places after structural reductions.
[2023-03-09 17:09:45] [INFO ] Flatten gal took : 1607 ms
[2023-03-09 17:09:46] [INFO ] Flatten gal took : 1258 ms
[2023-03-09 17:09:48] [INFO ] Input system was already deterministic with 38880 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 1261 ms. (steps per millisecond=7 ) properties (out of 30) seen :3
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 27) 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 27) 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 27) 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 27) 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 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) 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 27) seen :0
Running SMT prover for 27 properties.
[2023-03-09 17:09:50] [INFO ] Invariant cache hit.
[2023-03-09 17:09:57] [INFO ] [Real]Absence check using 80 positive place invariants in 235 ms returned sat
[2023-03-09 17:09:57] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 378 ms returned sat
[2023-03-09 17:09:58] [INFO ] After 8662ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:26
[2023-03-09 17:10:06] [INFO ] [Nat]Absence check using 80 positive place invariants in 203 ms returned sat
[2023-03-09 17:10:06] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 324 ms returned sat
[2023-03-09 17:10:23] [INFO ] After 11561ms SMT Verify possible using state equation in natural domain returned unsat :3 sat :24
[2023-03-09 17:10:24] [INFO ] State equation strengthened by 12720 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-09 17:10:24] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 17:10:24] [INFO ] After 25276ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0 real:26
Fused 27 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 33 out of 13763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions removed 556 transitions
Trivial Post-agglo rules discarded 556 transitions
Performed 556 trivial Post agglomeration. Transition count delta: 556
Iterating post reduction 0 with 556 rules applied. Total rules applied 556 place count 13763 transition count 38324
Reduce places removed 556 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 557 rules applied. Total rules applied 1113 place count 13207 transition count 38323
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1114 place count 13206 transition count 38323
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 1114 place count 13206 transition count 38322
Deduced a syphon composed of 1 places in 19 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 1116 place count 13205 transition count 38322
Performed 6300 Post agglomeration using F-continuation condition.Transition count delta: 6300
Deduced a syphon composed of 6300 places in 30 ms
Reduce places removed 6300 places and 0 transitions.
Iterating global reduction 3 with 12600 rules applied. Total rules applied 13716 place count 6905 transition count 32022
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 13717 place count 6905 transition count 32021
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 13718 place count 6904 transition count 32021
Partial Free-agglomeration rule applied 6470 times.
Drop transitions removed 6470 transitions
Iterating global reduction 4 with 6470 rules applied. Total rules applied 20188 place count 6904 transition count 32021
Partial Free-agglomeration rule applied 160 times.
Drop transitions removed 160 transitions
Iterating global reduction 4 with 160 rules applied. Total rules applied 20348 place count 6904 transition count 32021
Applied a total of 20348 rules in 17868 ms. Remains 6904 /13763 variables (removed 6859) and now considering 32021/38880 (removed 6859) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17870 ms. Remains : 6904/13763 places, 32021/38880 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 1028 ms. (steps per millisecond=9 ) properties (out of 24) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) 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 20) seen :0
Running SMT prover for 20 properties.
[2023-03-09 17:10:43] [INFO ] Flow matrix only has 32008 transitions (discarded 13 similar events)
// Phase 1: matrix 32008 rows 6904 cols
[2023-03-09 17:10:45] [INFO ] Computed 82 place invariants in 1905 ms
[2023-03-09 17:10:48] [INFO ] [Real]Absence check using 80 positive place invariants in 104 ms returned sat
[2023-03-09 17:10:48] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 128 ms returned sat
[2023-03-09 17:10:49] [INFO ] After 3883ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-09 17:10:52] [INFO ] [Nat]Absence check using 80 positive place invariants in 125 ms returned sat
[2023-03-09 17:10:52] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 133 ms returned sat
[2023-03-09 17:11:14] [INFO ] After 19088ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2023-03-09 17:11:14] [INFO ] State equation strengthened by 31536 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-09 17:11:14] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 17:11:14] [INFO ] After 25336ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:20
Fused 20 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 27 out of 6904 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6904/6904 places, 32021/32021 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 9 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 6902 transition count 32019
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 6902 transition count 32019
Applied a total of 8 rules in 6378 ms. Remains 6902 /6904 variables (removed 2) and now considering 32019/32021 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6379 ms. Remains : 6902/6904 places, 32019/32021 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 774 ms. (steps per millisecond=12 ) properties (out of 20) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) 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 16) seen :0
Running SMT prover for 16 properties.
[2023-03-09 17:11:21] [INFO ] Flow matrix only has 32010 transitions (discarded 9 similar events)
// Phase 1: matrix 32010 rows 6902 cols
[2023-03-09 17:11:23] [INFO ] Computed 82 place invariants in 1827 ms
[2023-03-09 17:11:26] [INFO ] [Real]Absence check using 80 positive place invariants in 108 ms returned sat
[2023-03-09 17:11:26] [INFO ] [Real]Absence check using 80 positive and 2 generalized place invariants in 128 ms returned sat
[2023-03-09 17:11:26] [INFO ] After 3486ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2023-03-09 17:11:29] [INFO ] [Nat]Absence check using 80 positive place invariants in 99 ms returned sat
[2023-03-09 17:11:29] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 125 ms returned sat
[2023-03-09 17:11:52] [INFO ] After 20192ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2023-03-09 17:11:52] [INFO ] State equation strengthened by 31548 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-09 17:11:52] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 17:11:52] [INFO ] After 25374ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:16
Fused 16 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 37 ms.
Support contains 20 out of 6902 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6902/6902 places, 32019/32019 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 9 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 6895 transition count 32012
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 6895 transition count 32012
Applied a total of 16 rules in 6302 ms. Remains 6895 /6902 variables (removed 7) and now considering 32012/32019 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6302 ms. Remains : 6895/6902 places, 32012/32019 transitions.
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 322 stabilizing places and 560 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(F(p1)))))'
Support contains 2 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3194 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
// Phase 1: matrix 38880 rows 13763 cols
[2023-03-09 17:12:11] [INFO ] Computed 82 place invariants in 9036 ms
[2023-03-09 17:12:12] [INFO ] Implicit Places using invariants in 10561 ms returned []
Implicit Place search using SMT only with invariants took 10567 ms to find 0 implicit places.
[2023-03-09 17:12:12] [INFO ] Invariant cache hit.
[2023-03-09 17:12:14] [INFO ] Dead Transitions using invariants and state equation in 1404 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15173 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 327 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GT 1 s12901), p1:(GT 1 s5406)], 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 50000 reset in 7862 ms.
Product exploration explored 100000 steps with 50000 reset in 7271 ms.
Computed a total of 322 stabilizing places and 560 stable transitions
Computed a total of 322 stabilizing places and 560 stable transitions
Knowledge obtained : [(AND p0 p1), (X p0), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-080-LTLCardinality-00 finished in 31112 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X((p0&&F(G(p0)))))))'
Support contains 1 out of 13763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 13763 transition count 38320
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 13203 transition count 38320
Performed 6320 Post agglomeration using F-continuation condition.Transition count delta: 6320
Deduced a syphon composed of 6320 places in 23 ms
Reduce places removed 6320 places and 0 transitions.
Iterating global reduction 2 with 12640 rules applied. Total rules applied 13760 place count 6883 transition count 32000
Applied a total of 13760 rules in 9215 ms. Remains 6883 /13763 variables (removed 6880) and now considering 32000/38880 (removed 6880) transitions.
[2023-03-09 17:12:39] [INFO ] Flow matrix only has 25838 transitions (discarded 6162 similar events)
// Phase 1: matrix 25838 rows 6883 cols
[2023-03-09 17:12:43] [INFO ] Computed 82 place invariants in 4199 ms
[2023-03-09 17:12:45] [INFO ] Implicit Places using invariants in 5983 ms returned []
Implicit Place search using SMT only with invariants took 5985 ms to find 0 implicit places.
[2023-03-09 17:12:45] [INFO ] Flow matrix only has 25838 transitions (discarded 6162 similar events)
[2023-03-09 17:12:45] [INFO ] Invariant cache hit.
[2023-03-09 17:13:02] [INFO ] Dead Transitions using invariants and state equation in 17130 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6883/13763 places, 32000/38880 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32335 ms. Remains : 6883/13763 places, 32000/38880 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(LEQ 1 s4270)], 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]]
Stuttering criterion allowed to conclude after 381 steps with 0 reset in 18 ms.
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLCardinality-02 finished in 32547 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&F(p1)))))'
Support contains 3 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3705 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
// Phase 1: matrix 38880 rows 13763 cols
[2023-03-09 17:13:14] [INFO ] Computed 82 place invariants in 8479 ms
[2023-03-09 17:13:16] [INFO ] Implicit Places using invariants in 9950 ms returned []
Implicit Place search using SMT only with invariants took 9952 ms to find 0 implicit places.
[2023-03-09 17:13:16] [INFO ] Invariant cache hit.
[2023-03-09 17:13:17] [INFO ] Dead Transitions using invariants and state equation in 1268 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14928 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 232 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(LEQ 3 s5688), p1:(LEQ s2668 s2593)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 4 ms.
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLCardinality-05 finished in 15322 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)))'
Support contains 2 out of 13763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 13763 transition count 38320
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 13203 transition count 38320
Performed 6319 Post agglomeration using F-continuation condition.Transition count delta: 6319
Deduced a syphon composed of 6319 places in 19 ms
Reduce places removed 6319 places and 0 transitions.
Iterating global reduction 2 with 12638 rules applied. Total rules applied 13758 place count 6884 transition count 32001
Applied a total of 13758 rules in 8350 ms. Remains 6884 /13763 variables (removed 6879) and now considering 32001/38880 (removed 6879) transitions.
[2023-03-09 17:13:26] [INFO ] Flow matrix only has 25840 transitions (discarded 6161 similar events)
// Phase 1: matrix 25840 rows 6884 cols
[2023-03-09 17:13:30] [INFO ] Computed 82 place invariants in 3744 ms
[2023-03-09 17:13:31] [INFO ] Implicit Places using invariants in 4601 ms returned []
Implicit Place search using SMT only with invariants took 4602 ms to find 0 implicit places.
[2023-03-09 17:13:31] [INFO ] Flow matrix only has 25840 transitions (discarded 6161 similar events)
[2023-03-09 17:13:31] [INFO ] Invariant cache hit.
[2023-03-09 17:13:48] [INFO ] Dead Transitions using invariants and state equation in 17719 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6884/13763 places, 32001/38880 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30687 ms. Remains : 6884/13763 places, 32001/38880 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(LEQ 1 s5434), p0:(LEQ 3 s3177)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 404 steps with 0 reset in 23 ms.
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLCardinality-06 finished in 31008 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 13763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions removed 558 transitions
Trivial Post-agglo rules discarded 558 transitions
Performed 558 trivial Post agglomeration. Transition count delta: 558
Iterating post reduction 0 with 558 rules applied. Total rules applied 558 place count 13763 transition count 38322
Reduce places removed 558 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 559 rules applied. Total rules applied 1117 place count 13205 transition count 38321
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1118 place count 13204 transition count 38321
Performed 6318 Post agglomeration using F-continuation condition.Transition count delta: 6318
Deduced a syphon composed of 6318 places in 15 ms
Reduce places removed 6318 places and 0 transitions.
Iterating global reduction 3 with 12636 rules applied. Total rules applied 13754 place count 6886 transition count 32003
Applied a total of 13754 rules in 8936 ms. Remains 6886 /13763 variables (removed 6877) and now considering 32003/38880 (removed 6877) transitions.
[2023-03-09 17:13:58] [INFO ] Flow matrix only has 25842 transitions (discarded 6161 similar events)
// Phase 1: matrix 25842 rows 6886 cols
[2023-03-09 17:14:01] [INFO ] Computed 82 place invariants in 3928 ms
[2023-03-09 17:14:02] [INFO ] Implicit Places using invariants in 4616 ms returned []
Implicit Place search using SMT only with invariants took 4619 ms to find 0 implicit places.
[2023-03-09 17:14:02] [INFO ] Flow matrix only has 25842 transitions (discarded 6161 similar events)
[2023-03-09 17:14:02] [INFO ] Invariant cache hit.
[2023-03-09 17:14:19] [INFO ] Dead Transitions using invariants and state equation in 17184 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6886/13763 places, 32003/38880 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30747 ms. Remains : 6886/13763 places, 32003/38880 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ s252 s5483)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 376 reset in 2987 ms.
Stack based approach found an accepted trace after 1173 steps with 4 reset with depth 376 and stack size 375 in 46 ms.
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLCardinality-07 finished in 33970 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&F(G((p1&&(p2 U p3)))))))'
Support contains 7 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3356 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
// Phase 1: matrix 38880 rows 13763 cols
[2023-03-09 17:14:34] [INFO ] Computed 82 place invariants in 8119 ms
[2023-03-09 17:14:36] [INFO ] Implicit Places using invariants in 9571 ms returned []
Implicit Place search using SMT only with invariants took 9576 ms to find 0 implicit places.
[2023-03-09 17:14:36] [INFO ] Invariant cache hit.
[2023-03-09 17:14:37] [INFO ] Dead Transitions using invariants and state equation in 1447 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14385 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 294 ms :[(OR (NOT p0) (NOT p1) (NOT p3)), (OR (NOT p0) (NOT p1) (NOT p3)), true, (OR (NOT p3) (NOT p1)), (NOT p3)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}, { cond=(AND p0 p1 (NOT p3) p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(OR (AND p1 p3) (AND p1 p2)), acceptance={} source=3 dest: 3}, { cond=(OR (NOT p1) (AND (NOT p3) (NOT p2))), acceptance={0} source=3 dest: 3}, { cond=(AND p1 (NOT p3) p2), acceptance={0} source=3 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p3) p2), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LEQ s4277 s4571), p1:(LEQ s8333 s835), p3:(LEQ 1 s9010), p2:(GT s3375 s7084)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1833 steps with 0 reset in 51 ms.
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLCardinality-08 finished in 14881 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))&&G(p1)))'
Support contains 4 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3504 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
[2023-03-09 17:14:41] [INFO ] Invariant cache hit.
[2023-03-09 17:14:42] [INFO ] Implicit Places using invariants in 1400 ms returned []
Implicit Place search using SMT only with invariants took 1401 ms to find 0 implicit places.
[2023-03-09 17:14:42] [INFO ] Invariant cache hit.
[2023-03-09 17:14:44] [INFO ] Dead Transitions using invariants and state equation in 1216 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6124 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), true, (OR (NOT p0) (NOT p1))]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p1 p0), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 1}, { cond=(NOT p1), acceptance={} source=3 dest: 2}]], initial=3, aps=[p1:(LEQ s4630 s13202), p0:(LEQ s283 s4850)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50 reset in 3586 ms.
Entered a terminal (fully accepting) state of product in 80875 steps with 40 reset in 2870 ms.
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLCardinality-09 finished in 12925 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(p0)||F(p1)||G(p2)))'
Support contains 3 out of 13763 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 13763 transition count 38320
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 13203 transition count 38320
Performed 6317 Post agglomeration using F-continuation condition.Transition count delta: 6317
Deduced a syphon composed of 6317 places in 15 ms
Reduce places removed 6317 places and 0 transitions.
Iterating global reduction 2 with 12634 rules applied. Total rules applied 13754 place count 6886 transition count 32003
Applied a total of 13754 rules in 9081 ms. Remains 6886 /13763 variables (removed 6877) and now considering 32003/38880 (removed 6877) transitions.
[2023-03-09 17:14:59] [INFO ] Flow matrix only has 25844 transitions (discarded 6159 similar events)
// Phase 1: matrix 25844 rows 6886 cols
[2023-03-09 17:15:04] [INFO ] Computed 82 place invariants in 4040 ms
[2023-03-09 17:15:04] [INFO ] Implicit Places using invariants in 4860 ms returned []
Implicit Place search using SMT only with invariants took 4863 ms to find 0 implicit places.
[2023-03-09 17:15:04] [INFO ] Flow matrix only has 25844 transitions (discarded 6159 similar events)
[2023-03-09 17:15:04] [INFO ] Invariant cache hit.
[2023-03-09 17:15:22] [INFO ] Dead Transitions using invariants and state equation in 17834 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6886/13763 places, 32003/38880 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31790 ms. Remains : 6886/13763 places, 32003/38880 transitions.
Stuttering acceptance computed with spot in 209 ms :[(NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(LEQ 1 s4917), p2:(LEQ 1 s6200), p0:(LEQ 2 s1573)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 441 steps with 0 reset in 18 ms.
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLCardinality-10 finished in 32110 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0&&X(F(p1))&&(p2 U (p3||G(p2))))||G((F(p1)&&(p2 U (p3||G(p2))))))))'
Support contains 5 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3348 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
// Phase 1: matrix 38880 rows 13763 cols
[2023-03-09 17:15:34] [INFO ] Computed 82 place invariants in 8217 ms
[2023-03-09 17:15:36] [INFO ] Implicit Places using invariants in 9789 ms returned []
Implicit Place search using SMT only with invariants took 9791 ms to find 0 implicit places.
[2023-03-09 17:15:36] [INFO ] Invariant cache hit.
[2023-03-09 17:15:37] [INFO ] Dead Transitions using invariants and state equation in 1370 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14516 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 619 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p2) (NOT p3)), (NOT p1), (NOT p1), (AND (NOT p3) (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p3)), (AND (NOT p3) (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) p3) (AND (NOT p0) p2)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={0, 1, 2} source=0 dest: 0}, { cond=(OR (AND (NOT p0) p3 (NOT p1)) (AND (NOT p0) p2 (NOT p1))), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0, 2} source=0 dest: 2}, { cond=(OR (AND p0 p3) (AND p0 p2)), acceptance={} source=0 dest: 3}, { cond=(OR (AND p0 p3 (NOT p1)) (AND p0 p2 (NOT p1))), acceptance={} source=0 dest: 4}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=0 dest: 5}, { cond=(AND p0 (NOT p3) p2), acceptance={1} source=0 dest: 6}, { cond=(AND p0 (NOT p3) p2), acceptance={2} source=0 dest: 8}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p3) (NOT p2) (NOT p1))), acceptance={0, 1, 2} source=1 dest: 1}, { cond=(OR (AND p0 p3 (NOT p1)) (AND p0 p2 (NOT p1))), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0, 1, 2} source=2 dest: 0}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0, 2} source=2 dest: 2}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=2 dest: 5}, { cond=(AND p0 (NOT p3) p2), acceptance={2} source=2 dest: 8}], [{ cond=(OR (AND p3 (NOT p1)) (AND p2 (NOT p1))), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=3 dest: 3}, { cond=(OR (AND p3 (NOT p1)) (AND p2 (NOT p1))), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={0, 2} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={0, 1, 2} source=4 dest: 4}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={0, 1, 2} source=5 dest: 3}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={0, 2} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0, 1, 2} source=6 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={1} source=6 dest: 6}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=6 dest: 7}, { cond=(AND (NOT p3) p2), acceptance={2} source=6 dest: 8}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=7 dest: 1}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={0, 1, 2} source=8 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={2} source=8 dest: 8}]], initial=0, aps=[p0:(GT 2 s9998), p3:(AND (GT 3 s1539) (GT 2 s4218)), p2:(GT 2 s4218), p1:(GT s2715 s221)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1829 steps with 0 reset in 76 ms.
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLCardinality-12 finished in 15380 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 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3587 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
[2023-03-09 17:15:41] [INFO ] Invariant cache hit.
[2023-03-09 17:15:43] [INFO ] Implicit Places using invariants in 1381 ms returned []
Implicit Place search using SMT only with invariants took 1383 ms to find 0 implicit places.
[2023-03-09 17:15:43] [INFO ] Invariant cache hit.
[2023-03-09 17:15:44] [INFO ] Dead Transitions using invariants and state equation in 1295 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6268 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s6990 s7553)], 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]]
Product exploration explored 100000 steps with 51 reset in 3405 ms.
Product exploration explored 100000 steps with 51 reset in 3345 ms.
Computed a total of 322 stabilizing places and 560 stable transitions
Computed a total of 322 stabilizing places and 560 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 215 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 5 resets, run finished after 362 ms. (steps per millisecond=27 ) 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 153244 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 153244 steps, saw 150307 distinct states, run finished after 3004 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 17:15:55] [INFO ] Invariant cache hit.
[2023-03-09 17:15:57] [INFO ] After 1684ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 17:15:59] [INFO ] [Nat]Absence check using 80 positive place invariants in 170 ms returned sat
[2023-03-09 17:15:59] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 269 ms returned sat
[2023-03-09 17:16:22] [INFO ] After 25011ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 13763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 13763 transition count 38320
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 13203 transition count 38320
Performed 6319 Post agglomeration using F-continuation condition.Transition count delta: 6319
Deduced a syphon composed of 6319 places in 30 ms
Reduce places removed 6319 places and 0 transitions.
Iterating global reduction 2 with 12638 rules applied. Total rules applied 13758 place count 6884 transition count 32001
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13759 place count 6884 transition count 32000
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13760 place count 6883 transition count 32000
Partial Free-agglomeration rule applied 6480 times.
Drop transitions removed 6480 transitions
Iterating global reduction 3 with 6480 rules applied. Total rules applied 20240 place count 6883 transition count 32000
Applied a total of 20240 rules in 12380 ms. Remains 6883 /13763 variables (removed 6880) and now considering 32000/38880 (removed 6880) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12382 ms. Remains : 6883/13763 places, 32000/38880 transitions.
Incomplete random walk after 10000 steps, including 20 resets, run finished after 411 ms. (steps per millisecond=24 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 76323 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 76323 steps, saw 64337 distinct states, run finished after 3002 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 17:16:38] [INFO ] Flow matrix only has 31999 transitions (discarded 1 similar events)
// Phase 1: matrix 31999 rows 6883 cols
[2023-03-09 17:16:40] [INFO ] Computed 82 place invariants in 2251 ms
[2023-03-09 17:16:41] [INFO ] After 869ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 17:16:42] [INFO ] [Nat]Absence check using 80 positive place invariants in 112 ms returned sat
[2023-03-09 17:16:42] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 136 ms returned sat
[2023-03-09 17:17:00] [INFO ] After 17673ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 17:17:00] [INFO ] State equation strengthened by 31756 read => feed constraints.
[2023-03-09 17:17:05] [INFO ] After 4350ms SMT Verify possible using 31756 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 17:17:06] [INFO ] After 5605ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 68 ms.
[2023-03-09 17:17:06] [INFO ] After 25036ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 6883 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6883/6883 places, 32000/32000 transitions.
Applied a total of 0 rules in 1915 ms. Remains 6883 /6883 variables (removed 0) and now considering 32000/32000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1915 ms. Remains : 6883/6883 places, 32000/32000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6883/6883 places, 32000/32000 transitions.
Applied a total of 0 rules in 1868 ms. Remains 6883 /6883 variables (removed 0) and now considering 32000/32000 (removed 0) transitions.
[2023-03-09 17:17:10] [INFO ] Flow matrix only has 31999 transitions (discarded 1 similar events)
[2023-03-09 17:17:10] [INFO ] Invariant cache hit.
[2023-03-09 17:17:10] [INFO ] Implicit Places using invariants in 761 ms returned []
Implicit Place search using SMT only with invariants took 763 ms to find 0 implicit places.
[2023-03-09 17:17:10] [INFO ] Flow matrix only has 31999 transitions (discarded 1 similar events)
[2023-03-09 17:17:10] [INFO ] Invariant cache hit.
[2023-03-09 17:17:27] [INFO ] Dead Transitions using invariants and state equation in 16718 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19358 ms. Remains : 6883/6883 places, 32000/32000 transitions.
Graph (trivial) has 31512 edges and 6883 vertex of which 6558 / 6883 are part of one of the 2 SCC in 21 ms
Free SCC test removed 6556 places
Drop transitions removed 25195 transitions
Ensure Unique test removed 6473 transitions
Reduce isomorphic transitions removed 31668 transitions.
Graph (complete) has 814 edges and 327 vertex of which 86 are kept as prefixes of interest. Removing 241 places using SCC suffix rule.1 ms
Discarding 241 places :
Also discarding 79 output transitions
Drop transitions removed 79 transitions
Drop transitions removed 161 transitions
Reduce isomorphic transitions removed 161 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 162 rules applied. Total rules applied 164 place count 86 transition count 91
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 165 place count 85 transition count 91
Discarding 78 places :
Symmetric choice reduction at 2 with 78 rule applications. Total rules 243 place count 7 transition count 13
Iterating global reduction 2 with 78 rules applied. Total rules applied 321 place count 7 transition count 13
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 323 place count 7 transition count 11
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 324 place count 7 transition count 10
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 326 place count 6 transition count 9
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 327 place count 5 transition count 8
Applied a total of 327 rules in 192 ms. Remains 5 /6883 variables (removed 6878) and now considering 8/32000 (removed 31992) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 8 rows 5 cols
[2023-03-09 17:17:27] [INFO ] Computed 0 place invariants in 0 ms
[2023-03-09 17:17:27] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 17:17:28] [INFO ] After 5ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 17:17:28] [INFO ] After 8ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-09 17:17:28] [INFO ] After 63ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 228 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 4238 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
// Phase 1: matrix 38880 rows 13763 cols
[2023-03-09 17:17:41] [INFO ] Computed 82 place invariants in 8722 ms
[2023-03-09 17:17:42] [INFO ] Implicit Places using invariants in 10205 ms returned []
Implicit Place search using SMT only with invariants took 10207 ms to find 0 implicit places.
[2023-03-09 17:17:43] [INFO ] Invariant cache hit.
[2023-03-09 17:17:44] [INFO ] Dead Transitions using invariants and state equation in 1323 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15774 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Computed a total of 322 stabilizing places and 560 stable transitions
Computed a total of 322 stabilizing places and 560 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 280 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 161987 steps, run timeout after 3001 ms. (steps per millisecond=53 ) properties seen :{}
Probabilistic random walk after 161987 steps, saw 158870 distinct states, run finished after 3002 ms. (steps per millisecond=53 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 17:17:48] [INFO ] Invariant cache hit.
[2023-03-09 17:17:50] [INFO ] After 1654ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 17:17:51] [INFO ] [Nat]Absence check using 80 positive place invariants in 151 ms returned sat
[2023-03-09 17:17:52] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 251 ms returned sat
[2023-03-09 17:18:15] [INFO ] After 25019ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 13763 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Drop transitions removed 560 transitions
Trivial Post-agglo rules discarded 560 transitions
Performed 560 trivial Post agglomeration. Transition count delta: 560
Iterating post reduction 0 with 560 rules applied. Total rules applied 560 place count 13763 transition count 38320
Reduce places removed 560 places and 0 transitions.
Iterating post reduction 1 with 560 rules applied. Total rules applied 1120 place count 13203 transition count 38320
Performed 6319 Post agglomeration using F-continuation condition.Transition count delta: 6319
Deduced a syphon composed of 6319 places in 17 ms
Reduce places removed 6319 places and 0 transitions.
Iterating global reduction 2 with 12638 rules applied. Total rules applied 13758 place count 6884 transition count 32001
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 13759 place count 6884 transition count 32000
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13760 place count 6883 transition count 32000
Partial Free-agglomeration rule applied 6480 times.
Drop transitions removed 6480 transitions
Iterating global reduction 3 with 6480 rules applied. Total rules applied 20240 place count 6883 transition count 32000
Applied a total of 20240 rules in 13669 ms. Remains 6883 /13763 variables (removed 6880) and now considering 32000/38880 (removed 6880) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13675 ms. Remains : 6883/13763 places, 32000/38880 transitions.
Incomplete random walk after 10000 steps, including 21 resets, run finished after 505 ms. (steps per millisecond=19 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 75640 steps, run timeout after 3001 ms. (steps per millisecond=25 ) properties seen :{}
Probabilistic random walk after 75640 steps, saw 64265 distinct states, run finished after 3001 ms. (steps per millisecond=25 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 17:18:32] [INFO ] Flow matrix only has 31999 transitions (discarded 1 similar events)
// Phase 1: matrix 31999 rows 6883 cols
[2023-03-09 17:18:34] [INFO ] Computed 82 place invariants in 2182 ms
[2023-03-09 17:18:35] [INFO ] After 809ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 17:18:36] [INFO ] [Nat]Absence check using 80 positive place invariants in 108 ms returned sat
[2023-03-09 17:18:36] [INFO ] [Nat]Absence check using 80 positive and 2 generalized place invariants in 120 ms returned sat
[2023-03-09 17:18:55] [INFO ] After 19141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 17:18:56] [INFO ] State equation strengthened by 31756 read => feed constraints.
[2023-03-09 17:19:00] [INFO ] After 4317ms SMT Verify possible using 31756 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-09 17:19:00] [INFO ] After 25032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 6883 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6883/6883 places, 32000/32000 transitions.
Applied a total of 0 rules in 2029 ms. Remains 6883 /6883 variables (removed 0) and now considering 32000/32000 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2031 ms. Remains : 6883/6883 places, 32000/32000 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6883/6883 places, 32000/32000 transitions.
Applied a total of 0 rules in 1951 ms. Remains 6883 /6883 variables (removed 0) and now considering 32000/32000 (removed 0) transitions.
[2023-03-09 17:19:04] [INFO ] Flow matrix only has 31999 transitions (discarded 1 similar events)
[2023-03-09 17:19:04] [INFO ] Invariant cache hit.
[2023-03-09 17:19:13] [INFO ] Implicit Places using invariants in 8975 ms returned []
Implicit Place search using SMT only with invariants took 8984 ms to find 0 implicit places.
[2023-03-09 17:19:13] [INFO ] Flow matrix only has 31999 transitions (discarded 1 similar events)
[2023-03-09 17:19:13] [INFO ] Invariant cache hit.
[2023-03-09 17:19:32] [INFO ] Dead Transitions using invariants and state equation in 19265 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30209 ms. Remains : 6883/6883 places, 32000/32000 transitions.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 222 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 508 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 50 reset in 2685 ms.
Entered a terminal (fully accepting) state of product in 68530 steps with 34 reset in 2298 ms.
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLCardinality-13 finished in 240477 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0) U (p1||X(p2)))))'
Support contains 4 out of 13763 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13763/13763 places, 38880/38880 transitions.
Applied a total of 0 rules in 3713 ms. Remains 13763 /13763 variables (removed 0) and now considering 38880/38880 (removed 0) transitions.
// Phase 1: matrix 38880 rows 13763 cols
[2023-03-09 17:19:51] [INFO ] Computed 82 place invariants in 8461 ms
[2023-03-09 17:19:52] [INFO ] Implicit Places using invariants in 10280 ms returned []
Implicit Place search using SMT only with invariants took 10301 ms to find 0 implicit places.
[2023-03-09 17:19:52] [INFO ] Invariant cache hit.
[2023-03-09 17:19:55] [INFO ] Dead Transitions using invariants and state equation in 2260 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 16285 ms. Remains : 13763/13763 places, 38880/38880 transitions.
Stuttering acceptance computed with spot in 269 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-080-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(LEQ 3 s10188), p0:(LEQ s4134 s2448), p2:(LEQ 2 s9325)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1685 steps with 0 reset in 61 ms.
FORMULA CANInsertWithFailure-PT-080-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-080-LTLCardinality-14 finished in 16731 ms.
All properties solved by simple procedures.
Total runtime 630818 ms.

BK_STOP 1678382395812

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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:
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="CANInsertWithFailure-PT-080"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is CANInsertWithFailure-PT-080, 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 r037-tajo-167813690800763"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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