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-167813690800740.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-050, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r037-tajo-167813690800740
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.8K Feb 26 00:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 00:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 00:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 00:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 15:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K 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 19K Feb 25 15:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 26 01:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Feb 26 01:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 10K Feb 26 00:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 00:59 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 16M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678378142121

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CANInsertWithFailure-PT-050
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-09 16:09:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-09 16:09:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 16:09:05] [INFO ] Load time of PNML (sax parser for PT used): 655 ms
[2023-03-09 16:09:05] [INFO ] Transformed 5604 places.
[2023-03-09 16:09:05] [INFO ] Transformed 15300 transitions.
[2023-03-09 16:09:05] [INFO ] Parsed PT model containing 5604 places and 15300 transitions and 41000 arcs in 906 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA CANInsertWithFailure-PT-050-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 5604 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5604/5604 places, 15300/15300 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 5603 transition count 15300
Applied a total of 1 rules in 933 ms. Remains 5603 /5604 variables (removed 1) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2023-03-09 16:09:08] [INFO ] Computed 52 place invariants in 1678 ms
[2023-03-09 16:09:10] [INFO ] Implicit Places using invariants in 3228 ms returned []
Implicit Place search using SMT only with invariants took 3253 ms to find 0 implicit places.
[2023-03-09 16:09:10] [INFO ] Invariant cache hit.
[2023-03-09 16:09:18] [INFO ] Dead Transitions using invariants and state equation in 8567 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 5603/5604 places, 15300/15300 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12767 ms. Remains : 5603/5604 places, 15300/15300 transitions.
Support contains 46 out of 5603 places after structural reductions.
[2023-03-09 16:09:20] [INFO ] Flatten gal took : 983 ms
[2023-03-09 16:09:20] [INFO ] Flatten gal took : 361 ms
[2023-03-09 16:09:21] [INFO ] Input system was already deterministic with 15300 transitions.
Support contains 43 out of 5603 places (down from 46) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 586 ms. (steps per millisecond=17 ) properties (out of 32) seen :13
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 19) 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 19) 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 19) 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 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) 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 19) 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 19) 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 19) 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 19) 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 19) 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 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=333 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2023-03-09 16:09:22] [INFO ] Invariant cache hit.
[2023-03-09 16:09:24] [INFO ] [Real]Absence check using 50 positive place invariants in 82 ms returned sat
[2023-03-09 16:09:24] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 87 ms returned sat
[2023-03-09 16:09:47] [INFO ] After 21171ms SMT Verify possible using state equation in real domain returned unsat :0 sat :8 real:10
[2023-03-09 16:09:47] [INFO ] State equation strengthened by 4950 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 16:09:47] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 16:09:47] [INFO ] After 25226ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 19 Parikh solutions to 8 different solutions.
Parikh walk visited 1 properties in 533 ms.
Support contains 25 out of 5603 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 346 transitions
Trivial Post-agglo rules discarded 346 transitions
Performed 346 trivial Post agglomeration. Transition count delta: 346
Iterating post reduction 0 with 346 rules applied. Total rules applied 346 place count 5603 transition count 14954
Reduce places removed 346 places and 0 transitions.
Iterating post reduction 1 with 346 rules applied. Total rules applied 692 place count 5257 transition count 14954
Performed 2438 Post agglomeration using F-continuation condition.Transition count delta: 2438
Deduced a syphon composed of 2438 places in 21 ms
Reduce places removed 2438 places and 0 transitions.
Iterating global reduction 2 with 4876 rules applied. Total rules applied 5568 place count 2819 transition count 12516
Drop transitions removed 2340 transitions
Redundant transition composition rules discarded 2340 transitions
Iterating global reduction 2 with 2340 rules applied. Total rules applied 7908 place count 2819 transition count 10176
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 2 with 5 rules applied. Total rules applied 7913 place count 2819 transition count 10171
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 7918 place count 2814 transition count 10171
Partial Free-agglomeration rule applied 2542 times.
Drop transitions removed 2542 transitions
Iterating global reduction 3 with 2542 rules applied. Total rules applied 10460 place count 2814 transition count 10171
Applied a total of 10460 rules in 5060 ms. Remains 2814 /5603 variables (removed 2789) and now considering 10171/15300 (removed 5129) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5076 ms. Remains : 2814/5603 places, 10171/15300 transitions.
Incomplete random walk after 10000 steps, including 42 resets, run finished after 689 ms. (steps per millisecond=14 ) properties (out of 18) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 10171 rows 2814 cols
[2023-03-09 16:09:54] [INFO ] Computed 52 place invariants in 308 ms
[2023-03-09 16:09:55] [INFO ] [Real]Absence check using 50 positive place invariants in 39 ms returned sat
[2023-03-09 16:09:55] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 55 ms returned sat
[2023-03-09 16:10:02] [INFO ] After 7062ms SMT Verify possible using state equation in real domain returned unsat :0 sat :5 real:2
[2023-03-09 16:10:02] [INFO ] State equation strengthened by 9977 read => feed constraints.
[2023-03-09 16:10:06] [INFO ] After 3441ms SMT Verify possible using 9977 Read/Feed constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-09 16:10:06] [INFO ] After 11908ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-09 16:10:06] [INFO ] [Nat]Absence check using 50 positive place invariants in 52 ms returned sat
[2023-03-09 16:10:06] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 55 ms returned sat
[2023-03-09 16:10:12] [INFO ] After 5204ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-09 16:10:17] [INFO ] After 5043ms SMT Verify possible using 9977 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-09 16:10:21] [INFO ] After 9547ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 2397 ms.
[2023-03-09 16:10:24] [INFO ] After 18269ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 2 properties in 17 ms.
Support contains 9 out of 2814 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2814/2814 places, 10171/10171 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 16 place count 2806 transition count 10163
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 0 with 5 rules applied. Total rules applied 21 place count 2806 transition count 10163
Applied a total of 21 rules in 1400 ms. Remains 2806 /2814 variables (removed 8) and now considering 10163/10171 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1402 ms. Remains : 2806/2814 places, 10163/10171 transitions.
Incomplete random walk after 10000 steps, including 43 resets, run finished after 283 ms. (steps per millisecond=35 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 10163 rows 2806 cols
[2023-03-09 16:10:26] [INFO ] Computed 52 place invariants in 441 ms
[2023-03-09 16:10:27] [INFO ] [Real]Absence check using 50 positive place invariants in 28 ms returned sat
[2023-03-09 16:10:27] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 31 ms returned sat
[2023-03-09 16:10:31] [INFO ] After 3799ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4
[2023-03-09 16:10:31] [INFO ] State equation strengthened by 9998 read => feed constraints.
[2023-03-09 16:10:33] [INFO ] After 2886ms SMT Verify possible using 9998 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 16:10:34] [INFO ] After 7416ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-09 16:10:34] [INFO ] [Nat]Absence check using 50 positive place invariants in 47 ms returned sat
[2023-03-09 16:10:34] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 48 ms returned sat
[2023-03-09 16:10:39] [INFO ] After 4577ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-09 16:10:41] [INFO ] After 2523ms SMT Verify possible using 9998 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-09 16:10:44] [INFO ] After 4857ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1463 ms.
[2023-03-09 16:10:45] [INFO ] After 11754ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Finished Parikh walk after 42 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=21 )
Parikh walk visited 4 properties in 9 ms.
FORMULA CANInsertWithFailure-PT-050-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 202 stabilizing places and 350 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0)) U p0)))'
Support contains 1 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 663 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2023-03-09 16:10:48] [INFO ] Computed 52 place invariants in 1269 ms
[2023-03-09 16:10:49] [INFO ] Implicit Places using invariants in 2102 ms returned []
Implicit Place search using SMT only with invariants took 2104 ms to find 0 implicit places.
[2023-03-09 16:10:49] [INFO ] Invariant cache hit.
[2023-03-09 16:10:58] [INFO ] Dead Transitions using invariants and state equation in 9174 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11946 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Stuttering acceptance computed with spot in 224 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s2078 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1263 steps with 0 reset in 30 ms.
FORMULA CANInsertWithFailure-PT-050-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLFireability-00 finished in 12304 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (F(p1)&&(p2||X((X(G(p3)) U (p2&&X(G(p3)))))))))'
Support contains 5 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 471 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
[2023-03-09 16:10:59] [INFO ] Invariant cache hit.
[2023-03-09 16:11:00] [INFO ] Implicit Places using invariants in 1592 ms returned []
Implicit Place search using SMT only with invariants took 1593 ms to find 0 implicit places.
[2023-03-09 16:11:00] [INFO ] Invariant cache hit.
[2023-03-09 16:11:08] [INFO ] Dead Transitions using invariants and state equation in 7332 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9397 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Stuttering acceptance computed with spot in 316 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (OR (NOT p3) (NOT p2)), (OR (NOT p2) (AND (NOT p1) (NOT p3))), (NOT p3), true, (AND (NOT p1) (NOT p3))]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p0)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p2) p0), acceptance={0} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 6}], [{ cond=p3, acceptance={} source=4 dest: 4}, { cond=(NOT p3), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p1) p3), acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (GEQ s194 1) (GEQ s497 1)), p2:(GEQ s4940 1), p0:(GEQ s5158 1), p3:(GEQ s4592 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1636 steps with 1 reset in 26 ms.
FORMULA CANInsertWithFailure-PT-050-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLFireability-01 finished in 9815 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U (!X(F(p0)) U p1)))'
Support contains 3 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 349 transitions
Trivial Post-agglo rules discarded 349 transitions
Performed 349 trivial Post agglomeration. Transition count delta: 349
Iterating post reduction 0 with 349 rules applied. Total rules applied 349 place count 5603 transition count 14951
Reduce places removed 349 places and 0 transitions.
Iterating post reduction 1 with 349 rules applied. Total rules applied 698 place count 5254 transition count 14951
Performed 2449 Post agglomeration using F-continuation condition.Transition count delta: 2449
Deduced a syphon composed of 2449 places in 6 ms
Reduce places removed 2449 places and 0 transitions.
Iterating global reduction 2 with 4898 rules applied. Total rules applied 5596 place count 2805 transition count 12502
Drop transitions removed 2351 transitions
Redundant transition composition rules discarded 2351 transitions
Iterating global reduction 2 with 2351 rules applied. Total rules applied 7947 place count 2805 transition count 10151
Applied a total of 7947 rules in 3024 ms. Remains 2805 /5603 variables (removed 2798) and now considering 10151/15300 (removed 5149) transitions.
// Phase 1: matrix 10151 rows 2805 cols
[2023-03-09 16:11:11] [INFO ] Computed 52 place invariants in 357 ms
[2023-03-09 16:11:14] [INFO ] Implicit Places using invariants in 2545 ms returned []
Implicit Place search using SMT only with invariants took 2546 ms to find 0 implicit places.
[2023-03-09 16:11:14] [INFO ] Invariant cache hit.
[2023-03-09 16:11:19] [INFO ] Dead Transitions using invariants and state equation in 5548 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2805/5603 places, 10151/15300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11122 ms. Remains : 2805/5603 places, 10151/15300 transitions.
Stuttering acceptance computed with spot in 87 ms :[p0, true, (NOT p1), (OR (NOT p1) p0)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 0}, { cond=p0, acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(GEQ s598 1), p1:(AND (GEQ s101 1) (GEQ s2271 1))], 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 248 steps with 0 reset in 4 ms.
FORMULA CANInsertWithFailure-PT-050-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLFireability-02 finished in 11247 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)||X((F(p1)||G(p2)))))'
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 509 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2023-03-09 16:11:21] [INFO ] Computed 52 place invariants in 1191 ms
[2023-03-09 16:11:22] [INFO ] Implicit Places using invariants in 2300 ms returned []
Implicit Place search using SMT only with invariants took 2301 ms to find 0 implicit places.
[2023-03-09 16:11:22] [INFO ] Invariant cache hit.
[2023-03-09 16:11:30] [INFO ] Dead Transitions using invariants and state equation in 8159 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10973 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p1), (AND (NOT p1) (NOT p0) (NOT p2)), (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-050-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(AND (GEQ s483 1) (GEQ s684 1)), p0:(GEQ s4298 1), p2:(GEQ s3794 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1506 steps with 1 reset in 28 ms.
FORMULA CANInsertWithFailure-PT-050-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLFireability-03 finished in 11199 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 347 transitions
Trivial Post-agglo rules discarded 347 transitions
Performed 347 trivial Post agglomeration. Transition count delta: 347
Iterating post reduction 0 with 347 rules applied. Total rules applied 347 place count 5603 transition count 14953
Reduce places removed 347 places and 0 transitions.
Iterating post reduction 1 with 347 rules applied. Total rules applied 694 place count 5256 transition count 14953
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 694 place count 5256 transition count 14952
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 696 place count 5255 transition count 14952
Performed 2449 Post agglomeration using F-continuation condition.Transition count delta: 2449
Deduced a syphon composed of 2449 places in 8 ms
Reduce places removed 2449 places and 0 transitions.
Iterating global reduction 2 with 4898 rules applied. Total rules applied 5594 place count 2806 transition count 12503
Drop transitions removed 2352 transitions
Redundant transition composition rules discarded 2352 transitions
Iterating global reduction 2 with 2352 rules applied. Total rules applied 7946 place count 2806 transition count 10151
Applied a total of 7946 rules in 2738 ms. Remains 2806 /5603 variables (removed 2797) and now considering 10151/15300 (removed 5149) transitions.
// Phase 1: matrix 10151 rows 2806 cols
[2023-03-09 16:11:33] [INFO ] Computed 52 place invariants in 303 ms
[2023-03-09 16:11:35] [INFO ] Implicit Places using invariants in 2309 ms returned []
Implicit Place search using SMT only with invariants took 2311 ms to find 0 implicit places.
[2023-03-09 16:11:35] [INFO ] Invariant cache hit.
[2023-03-09 16:11:40] [INFO ] Dead Transitions using invariants and state equation in 4764 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2806/5603 places, 10151/15300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9816 ms. Remains : 2806/5603 places, 10151/15300 transitions.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (LT s17 1) (LT s2708 1)), p0:(AND (GEQ s108 1) (GEQ s236 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 391 reset in 1372 ms.
Stack based approach found an accepted trace after 66388 steps with 260 reset with depth 231 and stack size 231 in 1082 ms.
FORMULA CANInsertWithFailure-PT-050-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLFireability-04 finished in 12406 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)||(p0&&F((p1||G(p2)))))))'
Support contains 3 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 654 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2023-03-09 16:11:45] [INFO ] Computed 52 place invariants in 1249 ms
[2023-03-09 16:11:46] [INFO ] Implicit Places using invariants in 2139 ms returned []
Implicit Place search using SMT only with invariants took 2153 ms to find 0 implicit places.
[2023-03-09 16:11:46] [INFO ] Invariant cache hit.
[2023-03-09 16:11:53] [INFO ] Dead Transitions using invariants and state equation in 7692 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10515 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (NOT p0), true, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LT s5362 1), p1:(LT s3364 1), p2:(LT s1798 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 4736 ms.
Product exploration explored 100000 steps with 50000 reset in 4807 ms.
Computed a total of 202 stabilizing places and 350 stable transitions
Computed a total of 202 stabilizing places and 350 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X (NOT (AND p0 (NOT p1)))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 6 factoid took 149 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-050-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-050-LTLFireability-05 finished in 20523 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(X(X((p1||X(X(G(p2))))))))))'
Support contains 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 657 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
[2023-03-09 16:12:04] [INFO ] Invariant cache hit.
[2023-03-09 16:12:05] [INFO ] Implicit Places using invariants in 902 ms returned []
Implicit Place search using SMT only with invariants took 908 ms to find 0 implicit places.
[2023-03-09 16:12:05] [INFO ] Invariant cache hit.
[2023-03-09 16:12:13] [INFO ] Dead Transitions using invariants and state equation in 7780 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9363 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Stuttering acceptance computed with spot in 274 ms :[true, (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p2), acceptance={} source=3 dest: 0}, { cond=p2, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 7}], [{ cond=true, acceptance={} source=6 dest: 1}], [{ cond=true, acceptance={} source=7 dest: 2}]], initial=6, aps=[p0:(GEQ s1360 1), p1:(GEQ s2043 1), p2:(OR (LT s553 1) (LT s3915 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10954 steps with 8 reset in 142 ms.
FORMULA CANInsertWithFailure-PT-050-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLFireability-06 finished in 9824 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 4 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 624 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
[2023-03-09 16:12:14] [INFO ] Invariant cache hit.
[2023-03-09 16:12:15] [INFO ] Implicit Places using invariants in 913 ms returned []
Implicit Place search using SMT only with invariants took 927 ms to find 0 implicit places.
[2023-03-09 16:12:15] [INFO ] Invariant cache hit.
[2023-03-09 16:12:22] [INFO ] Dead Transitions using invariants and state equation in 7545 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9110 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Stuttering acceptance computed with spot in 60 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s3489 1) (GEQ s525 1) (GEQ s4303 1) (GEQ s2714 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CANInsertWithFailure-PT-050-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLFireability-07 finished in 9217 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 5603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 349 transitions
Trivial Post-agglo rules discarded 349 transitions
Performed 349 trivial Post agglomeration. Transition count delta: 349
Iterating post reduction 0 with 349 rules applied. Total rules applied 349 place count 5603 transition count 14951
Reduce places removed 349 places and 0 transitions.
Iterating post reduction 1 with 349 rules applied. Total rules applied 698 place count 5254 transition count 14951
Performed 2450 Post agglomeration using F-continuation condition.Transition count delta: 2450
Deduced a syphon composed of 2450 places in 4 ms
Reduce places removed 2450 places and 0 transitions.
Iterating global reduction 2 with 4900 rules applied. Total rules applied 5598 place count 2804 transition count 12501
Drop transitions removed 2352 transitions
Redundant transition composition rules discarded 2352 transitions
Iterating global reduction 2 with 2352 rules applied. Total rules applied 7950 place count 2804 transition count 10149
Applied a total of 7950 rules in 2003 ms. Remains 2804 /5603 variables (removed 2799) and now considering 10149/15300 (removed 5151) transitions.
// Phase 1: matrix 10149 rows 2804 cols
[2023-03-09 16:12:25] [INFO ] Computed 52 place invariants in 311 ms
[2023-03-09 16:12:26] [INFO ] Implicit Places using invariants in 2082 ms returned []
Implicit Place search using SMT only with invariants took 2084 ms to find 0 implicit places.
[2023-03-09 16:12:26] [INFO ] Invariant cache hit.
[2023-03-09 16:12:31] [INFO ] Dead Transitions using invariants and state equation in 4777 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2804/5603 places, 10149/15300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 8884 ms. Remains : 2804/5603 places, 10149/15300 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s95 1) (GEQ s1119 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 525 steps with 1 reset in 7 ms.
FORMULA CANInsertWithFailure-PT-050-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLFireability-09 finished in 8973 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 5603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 348 transitions
Trivial Post-agglo rules discarded 348 transitions
Performed 348 trivial Post agglomeration. Transition count delta: 348
Iterating post reduction 0 with 348 rules applied. Total rules applied 348 place count 5603 transition count 14952
Reduce places removed 348 places and 0 transitions.
Iterating post reduction 1 with 348 rules applied. Total rules applied 696 place count 5255 transition count 14952
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 696 place count 5255 transition count 14951
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 698 place count 5254 transition count 14951
Performed 2449 Post agglomeration using F-continuation condition.Transition count delta: 2449
Deduced a syphon composed of 2449 places in 4 ms
Reduce places removed 2449 places and 0 transitions.
Iterating global reduction 2 with 4898 rules applied. Total rules applied 5596 place count 2805 transition count 12502
Drop transitions removed 2352 transitions
Redundant transition composition rules discarded 2352 transitions
Iterating global reduction 2 with 2352 rules applied. Total rules applied 7948 place count 2805 transition count 10150
Applied a total of 7948 rules in 2162 ms. Remains 2805 /5603 variables (removed 2798) and now considering 10150/15300 (removed 5150) transitions.
// Phase 1: matrix 10150 rows 2805 cols
[2023-03-09 16:12:34] [INFO ] Computed 52 place invariants in 290 ms
[2023-03-09 16:12:36] [INFO ] Implicit Places using invariants in 2489 ms returned []
Implicit Place search using SMT only with invariants took 2491 ms to find 0 implicit places.
[2023-03-09 16:12:36] [INFO ] Invariant cache hit.
[2023-03-09 16:12:40] [INFO ] Dead Transitions using invariants and state equation in 4389 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2805/5603 places, 10150/15300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9046 ms. Remains : 2805/5603 places, 10150/15300 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s216 1) (GEQ s282 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 225 steps with 0 reset in 3 ms.
FORMULA CANInsertWithFailure-PT-050-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLFireability-10 finished in 9122 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 507 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
// Phase 1: matrix 15300 rows 5603 cols
[2023-03-09 16:12:42] [INFO ] Computed 52 place invariants in 1184 ms
[2023-03-09 16:12:43] [INFO ] Implicit Places using invariants in 2146 ms returned []
Implicit Place search using SMT only with invariants took 2148 ms to find 0 implicit places.
[2023-03-09 16:12:43] [INFO ] Invariant cache hit.
[2023-03-09 16:12:50] [INFO ] Dead Transitions using invariants and state equation in 6962 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9620 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s599 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 3211 steps with 12 reset in 32 ms.
FORMULA CANInsertWithFailure-PT-050-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANInsertWithFailure-PT-050-LTLFireability-12 finished in 9746 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||G((F(p1)&&F(G(p2)))))))))'
Support contains 3 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 461 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
[2023-03-09 16:12:51] [INFO ] Invariant cache hit.
[2023-03-09 16:12:51] [INFO ] Implicit Places using invariants in 811 ms returned []
Implicit Place search using SMT only with invariants took 825 ms to find 0 implicit places.
[2023-03-09 16:12:51] [INFO ] Invariant cache hit.
[2023-03-09 16:12:58] [INFO ] Dead Transitions using invariants and state equation in 6900 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8189 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Stuttering acceptance computed with spot in 161 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(LT s1696 1), p1:(LT s3682 1), p2:(GEQ s4739 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 3075 ms.
Product exploration explored 100000 steps with 33333 reset in 3272 ms.
Computed a total of 202 stabilizing places and 350 stable transitions
Computed a total of 202 stabilizing places and 350 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 4 factoid took 169 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-050-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-050-LTLFireability-13 finished in 14938 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((G(p1)||p0))))'
Support contains 3 out of 5603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Applied a total of 0 rules in 507 ms. Remains 5603 /5603 variables (removed 0) and now considering 15300/15300 (removed 0) transitions.
[2023-03-09 16:13:06] [INFO ] Invariant cache hit.
[2023-03-09 16:13:07] [INFO ] Implicit Places using invariants in 996 ms returned []
Implicit Place search using SMT only with invariants took 1003 ms to find 0 implicit places.
[2023-03-09 16:13:07] [INFO ] Invariant cache hit.
[2023-03-09 16:13:14] [INFO ] Dead Transitions using invariants and state equation in 7070 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8583 ms. Remains : 5603/5603 places, 15300/15300 transitions.
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(GEQ s5026 1), p0:(OR (LT s3245 1) (LT s2136 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 50000 reset in 4252 ms.
Product exploration explored 100000 steps with 50000 reset in 4486 ms.
Computed a total of 202 stabilizing places and 350 stable transitions
Computed a total of 202 stabilizing places and 350 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Property proved to be true thanks to knowledge :(AND (NOT p1) p0)
Knowledge based reduction with 5 factoid took 128 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANInsertWithFailure-PT-050-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANInsertWithFailure-PT-050-LTLFireability-14 finished in 17610 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&&(p0 U (p1||G(p0)))))))'
Support contains 1 out of 5603 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 5603/5603 places, 15300/15300 transitions.
Drop transitions removed 350 transitions
Trivial Post-agglo rules discarded 350 transitions
Performed 350 trivial Post agglomeration. Transition count delta: 350
Iterating post reduction 0 with 350 rules applied. Total rules applied 350 place count 5603 transition count 14950
Reduce places removed 350 places and 0 transitions.
Iterating post reduction 1 with 350 rules applied. Total rules applied 700 place count 5253 transition count 14950
Performed 2449 Post agglomeration using F-continuation condition.Transition count delta: 2449
Deduced a syphon composed of 2449 places in 4 ms
Reduce places removed 2449 places and 0 transitions.
Iterating global reduction 2 with 4898 rules applied. Total rules applied 5598 place count 2804 transition count 12501
Drop transitions removed 2351 transitions
Redundant transition composition rules discarded 2351 transitions
Iterating global reduction 2 with 2351 rules applied. Total rules applied 7949 place count 2804 transition count 10150
Applied a total of 7949 rules in 1950 ms. Remains 2804 /5603 variables (removed 2799) and now considering 10150/15300 (removed 5150) transitions.
// Phase 1: matrix 10150 rows 2804 cols
[2023-03-09 16:13:25] [INFO ] Computed 52 place invariants in 297 ms
[2023-03-09 16:13:27] [INFO ] Implicit Places using invariants in 2404 ms returned []
Implicit Place search using SMT only with invariants took 2421 ms to find 0 implicit places.
[2023-03-09 16:13:27] [INFO ] Invariant cache hit.
[2023-03-09 16:13:32] [INFO ] Dead Transitions using invariants and state equation in 4745 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2804/5603 places, 10150/15300 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9131 ms. Remains : 2804/5603 places, 10150/15300 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : CANInsertWithFailure-PT-050-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s1099 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 396 reset in 1352 ms.
Product exploration explored 100000 steps with 396 reset in 1257 ms.
Computed a total of 153 stabilizing places and 250 stable transitions
Computed a total of 153 stabilizing places and 250 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 39 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 84878 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 84878 steps, saw 31304 distinct states, run finished after 3002 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-09 16:13:38] [INFO ] Invariant cache hit.
[2023-03-09 16:13:38] [INFO ] [Real]Absence check using 50 positive place invariants in 26 ms returned sat
[2023-03-09 16:13:38] [INFO ] [Real]Absence check using 50 positive and 2 generalized place invariants in 36 ms returned sat
[2023-03-09 16:13:41] [INFO ] After 2420ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-09 16:13:41] [INFO ] State equation strengthened by 7447 read => feed constraints.
[2023-03-09 16:13:42] [INFO ] After 1004ms SMT Verify possible using 7447 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 16:13:42] [INFO ] After 3887ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-09 16:13:42] [INFO ] [Nat]Absence check using 50 positive place invariants in 20 ms returned sat
[2023-03-09 16:13:42] [INFO ] [Nat]Absence check using 50 positive and 2 generalized place invariants in 26 ms returned sat
[2023-03-09 16:13:44] [INFO ] After 2242ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-09 16:13:47] [INFO ] After 2436ms SMT Verify possible using 7447 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-09 16:13:47] [INFO ] After 2764ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 281 ms.
[2023-03-09 16:13:47] [INFO ] After 5661ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Finished Parikh walk after 4 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=2 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 23 ms :[(NOT p0)]
Support contains 1 out of 2804 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 2804/2804 places, 10150/10150 transitions.
Applied a total of 0 rules in 355 ms. Remains 2804 /2804 variables (removed 0) and now considering 10150/10150 (removed 0) transitions.
[2023-03-09 16:13:48] [INFO ] Invariant cache hit.
[2023-03-09 16:13:50] [INFO ] Implicit Places using invariants in 1882 ms returned []
Implicit Place search using SMT only with invariants took 1895 ms to find 0 implicit places.
[2023-03-09 16:13:50] [INFO ] Invariant cache hit.
[2023-03-09 16:13:54] [INFO ] Dead Transitions using invariants and state equation in 4384 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6650 ms. Remains : 2804/2804 places, 10150/10150 transitions.
Computed a total of 153 stabilizing places and 250 stable transitions
Computed a total of 153 stabilizing places and 250 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Finished random walk after 5841 steps, including 22 resets, run visited all 1 properties in 73 ms. (steps per millisecond=80 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 22 ms :[(NOT p0)]
Product exploration explored 100000 steps with 391 reset in 1173 ms.
Product exploration explored 100000 steps with 395 reset in 1441 ms.
Built C files in :
/tmp/ltsmin7806247256429196398
[2023-03-09 16:13:57] [INFO ] Too many transitions (10150) to apply POR reductions. Disabling POR matrices.
[2023-03-09 16:13:57] [INFO ] Built C files in 171ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7806247256429196398
Running compilation step : cd /tmp/ltsmin7806247256429196398;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7806247256429196398;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7806247256429196398;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 1 out of 2804 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2804/2804 places, 10150/10150 transitions.
Applied a total of 0 rules in 339 ms. Remains 2804 /2804 variables (removed 0) and now considering 10150/10150 (removed 0) transitions.
[2023-03-09 16:14:01] [INFO ] Invariant cache hit.
[2023-03-09 16:14:03] [INFO ] Implicit Places using invariants in 1894 ms returned []
Implicit Place search using SMT only with invariants took 1915 ms to find 0 implicit places.
[2023-03-09 16:14:03] [INFO ] Invariant cache hit.
[2023-03-09 16:14:07] [INFO ] Dead Transitions using invariants and state equation in 4446 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 6702 ms. Remains : 2804/2804 places, 10150/10150 transitions.
Built C files in :
/tmp/ltsmin4914927617396861152
[2023-03-09 16:14:07] [INFO ] Too many transitions (10150) to apply POR reductions. Disabling POR matrices.
[2023-03-09 16:14:07] [INFO ] Built C files in 84ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4914927617396861152
Running compilation step : cd /tmp/ltsmin4914927617396861152;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4914927617396861152;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4914927617396861152;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-09 16:14:11] [INFO ] Flatten gal took : 229 ms
[2023-03-09 16:14:12] [INFO ] Flatten gal took : 411 ms
[2023-03-09 16:14:12] [INFO ] Time to serialize gal into /tmp/LTL12564859100543433549.gal : 97 ms
[2023-03-09 16:14:12] [INFO ] Time to serialize properties into /tmp/LTL14241413888166605373.prop : 8 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12564859100543433549.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11835684995402378972.hoa' '-atoms' '/tmp/LTL14241413888166605373.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL14241413888166605373.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11835684995402378972.hoa
Detected timeout of ITS tools.
[2023-03-09 16:14:27] [INFO ] Flatten gal took : 312 ms
[2023-03-09 16:14:27] [INFO ] Flatten gal took : 164 ms
[2023-03-09 16:14:27] [INFO ] Time to serialize gal into /tmp/LTL10605505359670683170.gal : 47 ms
[2023-03-09 16:14:27] [INFO ] Time to serialize properties into /tmp/LTL3792593558733466383.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10605505359670683170.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3792593558733466383.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(("(Node15GiveAnswer46<1)")&&(("(Node15GiveAnswer46<1)")U(("(Node5requestsent37<1)")||(G("(Node15GiveAnswer46<1)"))))))))
Formula 0 simplified : GF(!"(Node15GiveAnswer46<1)" | (!"(Node15GiveAnswer46<1)" M !"(Node5requestsent37<1)"))
Detected timeout of ITS tools.
[2023-03-09 16:14:43] [INFO ] Flatten gal took : 218 ms
[2023-03-09 16:14:43] [INFO ] Applying decomposition
[2023-03-09 16:14:43] [INFO ] Flatten gal took : 160 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph8593624510555165957.txt' '-o' '/tmp/graph8593624510555165957.bin' '-w' '/tmp/graph8593624510555165957.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph8593624510555165957.bin' '-l' '-1' '-v' '-w' '/tmp/graph8593624510555165957.weights' '-q' '0' '-e' '0.001'
[2023-03-09 16:14:43] [INFO ] Decomposing Gal with order
[2023-03-09 16:14:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 16:14:45] [INFO ] Removed a total of 7512 redundant transitions.
[2023-03-09 16:14:46] [INFO ] Flatten gal took : 1812 ms
[2023-03-09 16:14:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 4901 labels/synchronizations in 820 ms.
[2023-03-09 16:14:47] [INFO ] Time to serialize gal into /tmp/LTL11084852577644995600.gal : 104 ms
[2023-03-09 16:14:47] [INFO ] Time to serialize properties into /tmp/LTL590780761194980351.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11084852577644995600.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL590780761194980351.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((F(G(("(u47.Node15GiveAnswer46<1)")&&(("(u47.Node15GiveAnswer46<1)")U(("(u6.Node5requestsent37<1)")||(G("(u47.Node15GiveAnswer46<1)"...163
Formula 0 simplified : GF(!"(u47.Node15GiveAnswer46<1)" | (!"(u47.Node15GiveAnswer46<1)" M !"(u6.Node5requestsent37<1)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15150828501526322607
[2023-03-09 16:15:02] [INFO ] Built C files in 94ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15150828501526322607
Running compilation step : cd /tmp/ltsmin15150828501526322607;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15150828501526322607;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15150828501526322607;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property CANInsertWithFailure-PT-050-LTLFireability-15 finished in 102464 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&&(p0 U (p1||G(p0)))))))'
[2023-03-09 16:15:06] [INFO ] Flatten gal took : 328 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11917749641768583439
[2023-03-09 16:15:06] [INFO ] Too many transitions (15300) to apply POR reductions. Disabling POR matrices.
[2023-03-09 16:15:06] [INFO ] Applying decomposition
[2023-03-09 16:15:06] [INFO ] Built C files in 207ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11917749641768583439
Running compilation step : cd /tmp/ltsmin11917749641768583439;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-09 16:15:06] [INFO ] Flatten gal took : 348 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph4181942273021735381.txt' '-o' '/tmp/graph4181942273021735381.bin' '-w' '/tmp/graph4181942273021735381.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4181942273021735381.bin' '-l' '-1' '-v' '-w' '/tmp/graph4181942273021735381.weights' '-q' '0' '-e' '0.001'
[2023-03-09 16:15:08] [INFO ] Decomposing Gal with order
[2023-03-09 16:15:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-09 16:15:10] [INFO ] Removed a total of 7528 redundant transitions.
[2023-03-09 16:15:10] [INFO ] Flatten gal took : 1326 ms
[2023-03-09 16:15:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 9705 labels/synchronizations in 1290 ms.
[2023-03-09 16:15:12] [INFO ] Time to serialize gal into /tmp/LTLFireability4775671461391697887.gal : 174 ms
[2023-03-09 16:15:12] [INFO ] Time to serialize properties into /tmp/LTLFireability2281247340071546648.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4775671461391697887.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability2281247340071546648.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(("(i61.u187.Node15GiveAnswer46<1)")&&(("(i61.u187.Node15GiveAnswer46<1)")U(("(i9.u23.Node5requestsent37<1)")||(G("(i61.u187.Nod...182
Formula 0 simplified : GF(!"(i61.u187.Node15GiveAnswer46<1)" | (!"(i61.u187.Node15GiveAnswer46<1)" M !"(i9.u23.Node5requestsent37<1)"))
Compilation finished in 111670 ms.
Running link step : cd /tmp/ltsmin11917749641768583439;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 120 ms.
Running LTSmin : cd /tmp/ltsmin11917749641768583439;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([](((LTLAPp0==true)&&((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true)))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-09 16:37:13] [INFO ] Flatten gal took : 615 ms
[2023-03-09 16:37:14] [INFO ] Time to serialize gal into /tmp/LTLFireability18600553844331728.gal : 159 ms
[2023-03-09 16:37:14] [INFO ] Time to serialize properties into /tmp/LTLFireability15162121168731815509.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability18600553844331728.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15162121168731815509.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...296
Read 1 LTL properties
Checking formula 0 : !((F(G(("(Node15GiveAnswer46<1)")&&(("(Node15GiveAnswer46<1)")U(("(Node5requestsent37<1)")||(G("(Node15GiveAnswer46<1)"))))))))
Formula 0 simplified : GF(!"(Node15GiveAnswer46<1)" | (!"(Node15GiveAnswer46<1)" M !"(Node5requestsent37<1)"))
Detected timeout of ITS tools.
[2023-03-09 16:59:15] [INFO ] Flatten gal took : 826 ms
[2023-03-09 16:59:17] [INFO ] Input system was already deterministic with 15300 transitions.
[2023-03-09 16:59:17] [INFO ] Transformed 5603 places.
[2023-03-09 16:59:17] [INFO ] Transformed 15300 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-09 16:59:39] [INFO ] Time to serialize gal into /tmp/LTLFireability16601101382342748738.gal : 99 ms
[2023-03-09 16:59:39] [INFO ] Time to serialize properties into /tmp/LTLFireability10398540814034609606.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16601101382342748738.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10398540814034609606.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(G(("(Node15GiveAnswer46<1)")&&(("(Node15GiveAnswer46<1)")U(("(Node5requestsent37<1)")||(G("(Node15GiveAnswer46<1)"))))))))
Formula 0 simplified : GF(!"(Node15GiveAnswer46<1)" | (!"(Node15GiveAnswer46<1)" M !"(Node5requestsent37<1)"))
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 10307728 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16019376 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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-050"
export BK_EXAMINATION="LTLFireability"
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-050, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r037-tajo-167813690800740"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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