fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r037-tajo-167813690700676
Last Updated
May 14, 2023

About the Execution of ITS-Tools for CANConstruction-PT-080

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2237.008 374969.00 474835.00 1011.10 FTFFFFFTFFFTFFFF normal

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 10M
-rw-r--r-- 1 mcc users 11K Feb 25 22:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Feb 25 22:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 21:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 25 21:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Feb 25 15:40 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:40 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 15:40 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:40 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 25 22:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Feb 25 22:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 25 22:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Feb 25 22:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 15:40 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.0K Feb 25 15:40 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 9.5M Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678371257545

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=CANConstruction-PT-080
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-09 14:14:20] [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 14:14:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 14:14:21] [INFO ] Load time of PNML (sax parser for PT used): 655 ms
[2023-03-09 14:14:21] [INFO ] Transformed 13762 places.
[2023-03-09 14:14:21] [INFO ] Transformed 26240 transitions.
[2023-03-09 14:14:21] [INFO ] Parsed PT model containing 13762 places and 26240 transitions and 78400 arcs in 959 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 56 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CANConstruction-PT-080-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-080-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CANConstruction-PT-080-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 13762 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 13762/13762 places, 26240/26240 transitions.
Discarding 6229 places :
Symmetric choice reduction at 0 with 6229 rule applications. Total rules 6229 place count 7533 transition count 13782
Iterating global reduction 0 with 6229 rules applied. Total rules applied 12458 place count 7533 transition count 13782
Applied a total of 12458 rules in 4900 ms. Remains 7533 /13762 variables (removed 6229) and now considering 13782/26240 (removed 12458) transitions.
// Phase 1: matrix 13782 rows 7533 cols
[2023-03-09 14:14:27] [INFO ] Computed 161 place invariants in 367 ms
[2023-03-09 14:14:28] [INFO ] Implicit Places using invariants in 1501 ms returned []
Implicit Place search using SMT only with invariants took 1536 ms to find 0 implicit places.
[2023-03-09 14:14:28] [INFO ] Invariant cache hit.
[2023-03-09 14:14:41] [INFO ] Dead Transitions using invariants and state equation in 13623 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7533/13762 places, 13782/26240 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20087 ms. Remains : 7533/13762 places, 13782/26240 transitions.
Support contains 46 out of 7533 places after structural reductions.
[2023-03-09 14:14:43] [INFO ] Flatten gal took : 948 ms
[2023-03-09 14:14:44] [INFO ] Flatten gal took : 635 ms
[2023-03-09 14:14:45] [INFO ] Input system was already deterministic with 13782 transitions.
Incomplete random walk after 10000 steps, including 7 resets, run finished after 1079 ms. (steps per millisecond=9 ) properties (out of 30) seen :15
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) 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 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 15) 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 15) 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 15) seen :0
Running SMT prover for 15 properties.
[2023-03-09 14:14:46] [INFO ] Invariant cache hit.
[2023-03-09 14:14:50] [INFO ] [Real]Absence check using 81 positive place invariants in 238 ms returned sat
[2023-03-09 14:14:50] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 185 ms returned sat
[2023-03-09 14:15:03] [INFO ] After 11560ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:12
[2023-03-09 14:15:03] [INFO ] State equation strengthened by 12720 read => feed constraints.
[2023-03-09 14:15:06] [INFO ] After 3123ms SMT Verify possible using 12720 Read/Feed constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-09 14:15:06] [INFO ] After 20035ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-09 14:15:10] [INFO ] [Nat]Absence check using 81 positive place invariants in 279 ms returned sat
[2023-03-09 14:15:10] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 113 ms returned sat
[2023-03-09 14:15:30] [INFO ] After 17543ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
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.checkResults(DeadlockTester.java:797)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:644)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:350)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-09 14:15:32] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-09 14:15:32] [INFO ] After 25039ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:15
Fused 15 Parikh solutions to 13 different solutions.
Parikh walk visited 3 properties in 668 ms.
Support contains 19 out of 7533 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 7533/7533 places, 13782/13782 transitions.
Drop transitions removed 477 transitions
Trivial Post-agglo rules discarded 477 transitions
Performed 477 trivial Post agglomeration. Transition count delta: 477
Iterating post reduction 0 with 477 rules applied. Total rules applied 477 place count 7533 transition count 13305
Reduce places removed 477 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 478 rules applied. Total rules applied 955 place count 7056 transition count 13304
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 956 place count 7055 transition count 13304
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 956 place count 7055 transition count 13302
Deduced a syphon composed of 2 places in 7 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 960 place count 7053 transition count 13302
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 964 place count 7049 transition count 13294
Iterating global reduction 3 with 4 rules applied. Total rules applied 968 place count 7049 transition count 13294
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 18 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 1124 place count 6971 transition count 13216
Free-agglomeration rule applied 146 times.
Iterating global reduction 3 with 146 rules applied. Total rules applied 1270 place count 6971 transition count 13070
Reduce places removed 146 places and 0 transitions.
Iterating post reduction 3 with 146 rules applied. Total rules applied 1416 place count 6825 transition count 13070
Free-agglomeration rule (complex) applied 79 times.
Iterating global reduction 4 with 79 rules applied. Total rules applied 1495 place count 6825 transition count 12991
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 4 with 79 rules applied. Total rules applied 1574 place count 6746 transition count 12991
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 5 with 16 rules applied. Total rules applied 1590 place count 6746 transition count 12991
Applied a total of 1590 rules in 11891 ms. Remains 6746 /7533 variables (removed 787) and now considering 12991/13782 (removed 791) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11907 ms. Remains : 6746/7533 places, 12991/13782 transitions.
Incomplete random walk after 10000 steps, including 18 resets, run finished after 856 ms. (steps per millisecond=11 ) properties (out of 12) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 12991 rows 6746 cols
[2023-03-09 14:15:45] [INFO ] Computed 161 place invariants in 112 ms
[2023-03-09 14:15:47] [INFO ] [Real]Absence check using 81 positive place invariants in 159 ms returned sat
[2023-03-09 14:15:48] [INFO ] [Real]Absence check using 81 positive and 80 generalized place invariants in 80 ms returned sat
[2023-03-09 14:15:57] [INFO ] After 8878ms SMT Verify possible using state equation in real domain returned unsat :0 sat :3 real:4
[2023-03-09 14:15:57] [INFO ] State equation strengthened by 12807 read => feed constraints.
[2023-03-09 14:16:00] [INFO ] After 2665ms SMT Verify possible using 12807 Read/Feed constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-09 14:16:00] [INFO ] After 14695ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-09 14:16:02] [INFO ] [Nat]Absence check using 81 positive place invariants in 225 ms returned sat
[2023-03-09 14:16:02] [INFO ] [Nat]Absence check using 81 positive and 80 generalized place invariants in 61 ms returned sat
[2023-03-09 14:16:16] [INFO ] After 12842ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-09 14:16:21] [INFO ] After 4745ms SMT Verify possible using 12807 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-09 14:16:25] [INFO ] After 9181ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 5 ms.
[2023-03-09 14:16:25] [INFO ] After 25127ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 4 different solutions.
Finished Parikh walk after 55 steps, including 0 resets, run visited all 7 properties in 6 ms. (steps per millisecond=9 )
Parikh walk visited 7 properties in 6 ms.
FORMULA CANConstruction-PT-080-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 321 stabilizing places and 400 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 7533 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7533/7533 places, 13782/13782 transitions.
Drop transitions removed 559 transitions
Trivial Post-agglo rules discarded 559 transitions
Performed 559 trivial Post agglomeration. Transition count delta: 559
Iterating post reduction 0 with 559 rules applied. Total rules applied 559 place count 7533 transition count 13223
Reduce places removed 559 places and 0 transitions.
Iterating post reduction 1 with 559 rules applied. Total rules applied 1118 place count 6974 transition count 13223
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1129 place count 6963 transition count 13201
Iterating global reduction 2 with 11 rules applied. Total rules applied 1140 place count 6963 transition count 13201
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 6 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 1300 place count 6883 transition count 13121
Applied a total of 1300 rules in 5995 ms. Remains 6883 /7533 variables (removed 650) and now considering 13121/13782 (removed 661) transitions.
// Phase 1: matrix 13121 rows 6883 cols
[2023-03-09 14:16:32] [INFO ] Computed 161 place invariants in 141 ms
[2023-03-09 14:16:33] [INFO ] Implicit Places using invariants in 955 ms returned []
Implicit Place search using SMT only with invariants took 958 ms to find 0 implicit places.
[2023-03-09 14:16:33] [INFO ] Invariant cache hit.
[2023-03-09 14:16:43] [INFO ] Dead Transitions using invariants and state equation in 10299 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6883/7533 places, 13121/13782 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 17260 ms. Remains : 6883/7533 places, 13121/13782 transitions.
Stuttering acceptance computed with spot in 190 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-080-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s190 1) (GEQ s4939 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 721 steps with 0 reset in 49 ms.
FORMULA CANConstruction-PT-080-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-080-LTLFireability-00 finished in 17615 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 2 out of 7533 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7533/7533 places, 13782/13782 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 7522 transition count 13760
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 7522 transition count 13760
Applied a total of 22 rules in 4770 ms. Remains 7522 /7533 variables (removed 11) and now considering 13760/13782 (removed 22) transitions.
// Phase 1: matrix 13760 rows 7522 cols
[2023-03-09 14:16:48] [INFO ] Computed 161 place invariants in 132 ms
[2023-03-09 14:16:49] [INFO ] Implicit Places using invariants in 1029 ms returned []
Implicit Place search using SMT only with invariants took 1042 ms to find 0 implicit places.
[2023-03-09 14:16:49] [INFO ] Invariant cache hit.
[2023-03-09 14:17:04] [INFO ] Dead Transitions using invariants and state equation in 14839 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7522/7533 places, 13760/13782 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20662 ms. Remains : 7522/7533 places, 13760/13782 transitions.
Stuttering acceptance computed with spot in 458 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-080-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s25 1) (GEQ s734 1)), p1:(AND (GEQ s25 1) (GEQ s734 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 1147 steps with 0 reset in 39 ms.
FORMULA CANConstruction-PT-080-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-080-LTLFireability-02 finished in 21246 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G(F(p1))))))'
Support contains 3 out of 7533 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7533/7533 places, 13782/13782 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 7523 transition count 13762
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 7523 transition count 13762
Applied a total of 20 rules in 5392 ms. Remains 7523 /7533 variables (removed 10) and now considering 13762/13782 (removed 20) transitions.
// Phase 1: matrix 13762 rows 7523 cols
[2023-03-09 14:17:10] [INFO ] Computed 161 place invariants in 179 ms
[2023-03-09 14:17:11] [INFO ] Implicit Places using invariants in 1183 ms returned []
Implicit Place search using SMT only with invariants took 1185 ms to find 0 implicit places.
[2023-03-09 14:17:11] [INFO ] Invariant cache hit.
[2023-03-09 14:17:20] [INFO ] Dead Transitions using invariants and state equation in 8696 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7523/7533 places, 13762/13782 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15309 ms. Remains : 7523/7533 places, 13762/13782 transitions.
Stuttering acceptance computed with spot in 331 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-080-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s398 1) (GEQ s6998 1)), p0:(GEQ s3489 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 1597 steps with 0 reset in 45 ms.
FORMULA CANConstruction-PT-080-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-080-LTLFireability-03 finished in 15824 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((X(X(G(p0))) U p1)||G(G(X(p2)))||p0)))'
Support contains 6 out of 7533 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7533/7533 places, 13782/13782 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 7522 transition count 13760
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 7522 transition count 13760
Applied a total of 22 rules in 4542 ms. Remains 7522 /7533 variables (removed 11) and now considering 13760/13782 (removed 22) transitions.
// Phase 1: matrix 13760 rows 7522 cols
[2023-03-09 14:17:25] [INFO ] Computed 161 place invariants in 133 ms
[2023-03-09 14:17:31] [INFO ] Implicit Places using invariants in 5885 ms returned []
Implicit Place search using SMT only with invariants took 5891 ms to find 0 implicit places.
[2023-03-09 14:17:31] [INFO ] Invariant cache hit.
[2023-03-09 14:17:42] [INFO ] Dead Transitions using invariants and state equation in 10466 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7522/7533 places, 13760/13782 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 20916 ms. Remains : 7522/7533 places, 13760/13782 transitions.
Stuttering acceptance computed with spot in 372 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : CANConstruction-PT-080-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(OR p0 p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=p2, acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 2}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=4 dest: 2}, { cond=(AND p0 p2), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 5}, { cond=p2, acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s762 1) (GEQ s1492 1)), p1:(AND (GEQ s174 1) (GEQ s753 1)), p2:(OR (LT s580 1) (LT s865 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2197 steps with 1 reset in 107 ms.
FORMULA CANConstruction-PT-080-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-080-LTLFireability-04 finished in 21479 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(((p0||G(!p1)) U (p2&&(p0||G(!p1)))))))'
Support contains 4 out of 7533 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7533/7533 places, 13782/13782 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 7524 transition count 13764
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 7524 transition count 13764
Applied a total of 18 rules in 4650 ms. Remains 7524 /7533 variables (removed 9) and now considering 13764/13782 (removed 18) transitions.
// Phase 1: matrix 13764 rows 7524 cols
[2023-03-09 14:17:47] [INFO ] Computed 161 place invariants in 92 ms
[2023-03-09 14:17:58] [INFO ] Implicit Places using invariants in 11248 ms returned []
Implicit Place search using SMT only with invariants took 11265 ms to find 0 implicit places.
[2023-03-09 14:17:58] [INFO ] Invariant cache hit.
[2023-03-09 14:18:08] [INFO ] Dead Transitions using invariants and state equation in 10228 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7524/7533 places, 13764/13782 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26151 ms. Remains : 7524/7533 places, 13764/13782 transitions.
Stuttering acceptance computed with spot in 299 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), (OR (NOT p2) (AND (NOT p0) p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) p1)), true, p1]
Running random walk in product with property : CANConstruction-PT-080-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(OR (AND p0 (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 3}, { cond=(NOT p1), acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(GEQ s7324 1), p2:(GEQ s5234 1), p1:(AND (GEQ s530 1) (GEQ s532 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 951 steps with 0 reset in 15 ms.
FORMULA CANConstruction-PT-080-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-080-LTLFireability-05 finished in 26551 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 7533 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7533/7533 places, 13782/13782 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 7522 transition count 13760
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 7522 transition count 13760
Applied a total of 22 rules in 4437 ms. Remains 7522 /7533 variables (removed 11) and now considering 13760/13782 (removed 22) transitions.
// Phase 1: matrix 13760 rows 7522 cols
[2023-03-09 14:18:13] [INFO ] Computed 161 place invariants in 83 ms
[2023-03-09 14:18:14] [INFO ] Implicit Places using invariants in 974 ms returned []
Implicit Place search using SMT only with invariants took 978 ms to find 0 implicit places.
[2023-03-09 14:18:14] [INFO ] Invariant cache hit.
[2023-03-09 14:18:24] [INFO ] Dead Transitions using invariants and state equation in 10132 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7522/7533 places, 13760/13782 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15558 ms. Remains : 7522/7533 places, 13760/13782 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-080-LTLFireability-06 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 s832 1) (GEQ s1734 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 1 ms.
FORMULA CANConstruction-PT-080-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-080-LTLFireability-06 finished in 15762 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&(F(p1)||X(p2)))))'
Support contains 5 out of 7533 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7533/7533 places, 13782/13782 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 7523 transition count 13762
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 7523 transition count 13762
Applied a total of 20 rules in 4305 ms. Remains 7523 /7533 variables (removed 10) and now considering 13762/13782 (removed 20) transitions.
// Phase 1: matrix 13762 rows 7523 cols
[2023-03-09 14:18:29] [INFO ] Computed 161 place invariants in 135 ms
[2023-03-09 14:18:34] [INFO ] Implicit Places using invariants in 5582 ms returned []
Implicit Place search using SMT only with invariants took 5605 ms to find 0 implicit places.
[2023-03-09 14:18:34] [INFO ] Invariant cache hit.
[2023-03-09 14:18:44] [INFO ] Dead Transitions using invariants and state equation in 9608 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7523/7533 places, 13762/13782 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19530 ms. Remains : 7523/7533 places, 13762/13782 transitions.
Stuttering acceptance computed with spot in 353 ms :[(NOT p1), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), true, (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : CANConstruction-PT-080-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p1:(GEQ s3305 1), p0:(OR (LT s3305 1) (LT s0 1) (LT s268 1)), p2:(OR (LT s431 1) (LT s552 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]]
Product exploration explored 100000 steps with 33333 reset in 3808 ms.
Product exploration explored 100000 steps with 33333 reset in 3215 ms.
Computed a total of 321 stabilizing places and 400 stable transitions
Computed a total of 321 stabilizing places and 400 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (AND p0 (NOT p1))), (X p0), true, (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT (AND (NOT p1) (NOT p2)))))
Knowledge based reduction with 5 factoid took 324 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CANConstruction-PT-080-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CANConstruction-PT-080-LTLFireability-07 finished in 27453 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||G(p1)) U p2)&&G(p3))))'
Support contains 7 out of 7533 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7533/7533 places, 13782/13782 transitions.
Drop transitions removed 555 transitions
Trivial Post-agglo rules discarded 555 transitions
Performed 555 trivial Post agglomeration. Transition count delta: 555
Iterating post reduction 0 with 555 rules applied. Total rules applied 555 place count 7533 transition count 13227
Reduce places removed 555 places and 0 transitions.
Iterating post reduction 1 with 555 rules applied. Total rules applied 1110 place count 6978 transition count 13227
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 1110 place count 6978 transition count 13225
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 1114 place count 6976 transition count 13225
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1124 place count 6966 transition count 13205
Iterating global reduction 2 with 10 rules applied. Total rules applied 1134 place count 6966 transition count 13205
Performed 78 Post agglomeration using F-continuation condition.Transition count delta: 78
Deduced a syphon composed of 78 places in 3 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 2 with 156 rules applied. Total rules applied 1290 place count 6888 transition count 13127
Applied a total of 1290 rules in 7282 ms. Remains 6888 /7533 variables (removed 645) and now considering 13127/13782 (removed 655) transitions.
// Phase 1: matrix 13127 rows 6888 cols
[2023-03-09 14:18:59] [INFO ] Computed 161 place invariants in 115 ms
[2023-03-09 14:19:00] [INFO ] Implicit Places using invariants in 980 ms returned []
Implicit Place search using SMT only with invariants took 983 ms to find 0 implicit places.
[2023-03-09 14:19:00] [INFO ] Invariant cache hit.
[2023-03-09 14:19:08] [INFO ] Dead Transitions using invariants and state equation in 8065 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6888/7533 places, 13127/13782 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 16332 ms. Remains : 6888/7533 places, 13127/13782 transitions.
Stuttering acceptance computed with spot in 481 ms :[(OR (NOT p2) (NOT p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p2), (NOT p3), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p3))]
Running random walk in product with property : CANConstruction-PT-080-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p2) (NOT p0) (NOT p1)) (NOT p3)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1 p3), acceptance={1} source=0 dest: 1}, { cond=(OR (AND (NOT p2) p0 p3) (AND (NOT p2) p1 p3)), acceptance={0, 1} source=0 dest: 2}, { cond=(OR (AND p2 p3) (AND p0 p3) (AND p1 p3)), acceptance={0} source=0 dest: 3}], [{ cond=(OR (AND (NOT p2) (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p3))), acceptance={0, 1} source=1 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p0) p1) (AND p1 (NOT p3))), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1) p3), acceptance={0, 1} source=1 dest: 2}, { cond=(OR (AND p2 (NOT p1) p3) (AND p0 (NOT p1) p3)), acceptance={0} source=1 dest: 3}, { cond=(AND (NOT p2) p0 p1 p3), acceptance={1} source=1 dest: 4}, { cond=(OR (AND p2 p1 p3) (AND p0 p1 p3)), acceptance={} source=1 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={1} source=2 dest: 1}, { cond=(OR (AND (NOT p2) p0) (AND (NOT p2) p1)), acceptance={0, 1} source=2 dest: 2}], [{ cond=(NOT p3), acceptance={0, 1} source=3 dest: 0}, { cond=p3, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={0, 1} source=4 dest: 0}, { cond=(AND (NOT p2) (NOT p0) p1), acceptance={1} source=4 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p2) p0 p1), acceptance={1} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p3)), acceptance={0, 1} source=5 dest: 0}, { cond=(AND p1 (NOT p3)), acceptance={1} source=5 dest: 1}, { cond=(AND (NOT p1) p3), acceptance={0} source=5 dest: 3}, { cond=(AND p1 p3), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(AND (GEQ s306 1) (GEQ s1248 1)), p0:(GEQ s6630 1), p1:(AND (GEQ s47 1) (GEQ s464 1)), p3:(AND (GEQ s78 1) (GEQ s313 1) (GEQ s6630 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null, null, null][true, true, true, true, true, true]]
Stuttering criterion allowed to conclude after 626 steps with 0 reset in 21 ms.
FORMULA CANConstruction-PT-080-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-080-LTLFireability-08 finished in 16884 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 4 out of 7533 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7533/7533 places, 13782/13782 transitions.
Drop transitions removed 558 transitions
Trivial Post-agglo rules discarded 558 transitions
Performed 558 trivial Post agglomeration. Transition count delta: 558
Iterating post reduction 0 with 558 rules applied. Total rules applied 558 place count 7533 transition count 13224
Reduce places removed 558 places and 0 transitions.
Iterating post reduction 1 with 558 rules applied. Total rules applied 1116 place count 6975 transition count 13224
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1116 place count 6975 transition count 13223
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1118 place count 6974 transition count 13223
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 1127 place count 6965 transition count 13205
Iterating global reduction 2 with 9 rules applied. Total rules applied 1136 place count 6965 transition count 13205
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 3 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 1294 place count 6886 transition count 13126
Applied a total of 1294 rules in 5968 ms. Remains 6886 /7533 variables (removed 647) and now considering 13126/13782 (removed 656) transitions.
// Phase 1: matrix 13126 rows 6886 cols
[2023-03-09 14:19:15] [INFO ] Computed 161 place invariants in 133 ms
[2023-03-09 14:19:21] [INFO ] Implicit Places using invariants in 5901 ms returned []
Implicit Place search using SMT only with invariants took 5902 ms to find 0 implicit places.
[2023-03-09 14:19:21] [INFO ] Invariant cache hit.
[2023-03-09 14:19:29] [INFO ] Dead Transitions using invariants and state equation in 8350 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6886/7533 places, 13126/13782 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 20238 ms. Remains : 6886/7533 places, 13126/13782 transitions.
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-080-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(GEQ s1743 1), p1:(OR (LT s101 1) (LT s413 1) (GEQ s6854 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 686 steps with 0 reset in 24 ms.
FORMULA CANConstruction-PT-080-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-080-LTLFireability-09 finished in 20543 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||X(p0)))))'
Support contains 1 out of 7533 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 7533/7533 places, 13782/13782 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 7523 transition count 13762
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 7523 transition count 13762
Applied a total of 20 rules in 4212 ms. Remains 7523 /7533 variables (removed 10) and now considering 13762/13782 (removed 20) transitions.
// Phase 1: matrix 13762 rows 7523 cols
[2023-03-09 14:19:34] [INFO ] Computed 161 place invariants in 137 ms
[2023-03-09 14:19:35] [INFO ] Implicit Places using invariants in 1045 ms returned []
Implicit Place search using SMT only with invariants took 1059 ms to find 0 implicit places.
[2023-03-09 14:19:35] [INFO ] Invariant cache hit.
[2023-03-09 14:19:43] [INFO ] Dead Transitions using invariants and state equation in 8432 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 7523/7533 places, 13762/13782 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13709 ms. Remains : 7523/7533 places, 13762/13782 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CANConstruction-PT-080-LTLFireability-13 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 s5240 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 1669 steps with 0 reset in 35 ms.
FORMULA CANConstruction-PT-080-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-080-LTLFireability-13 finished in 13893 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 7533 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7533/7533 places, 13782/13782 transitions.
Drop transitions removed 558 transitions
Trivial Post-agglo rules discarded 558 transitions
Performed 558 trivial Post agglomeration. Transition count delta: 558
Iterating post reduction 0 with 558 rules applied. Total rules applied 558 place count 7533 transition count 13224
Reduce places removed 558 places and 0 transitions.
Iterating post reduction 1 with 558 rules applied. Total rules applied 1116 place count 6975 transition count 13224
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1116 place count 6975 transition count 13223
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1118 place count 6974 transition count 13223
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1129 place count 6963 transition count 13201
Iterating global reduction 2 with 11 rules applied. Total rules applied 1140 place count 6963 transition count 13201
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 5 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 1298 place count 6884 transition count 13122
Applied a total of 1298 rules in 6330 ms. Remains 6884 /7533 variables (removed 649) and now considering 13122/13782 (removed 660) transitions.
// Phase 1: matrix 13122 rows 6884 cols
[2023-03-09 14:19:50] [INFO ] Computed 161 place invariants in 131 ms
[2023-03-09 14:19:58] [INFO ] Implicit Places using invariants in 8676 ms returned []
Implicit Place search using SMT only with invariants took 8685 ms to find 0 implicit places.
[2023-03-09 14:19:58] [INFO ] Invariant cache hit.
[2023-03-09 14:20:07] [INFO ] Dead Transitions using invariants and state equation in 8888 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6884/7533 places, 13122/13782 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 23926 ms. Remains : 6884/7533 places, 13122/13782 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0)]
Running random walk in product with property : CANConstruction-PT-080-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s460 1) (GEQ s468 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 769 steps with 0 reset in 29 ms.
FORMULA CANConstruction-PT-080-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-080-LTLFireability-14 finished in 24094 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 7533 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7533/7533 places, 13782/13782 transitions.
Drop transitions removed 558 transitions
Trivial Post-agglo rules discarded 558 transitions
Performed 558 trivial Post agglomeration. Transition count delta: 558
Iterating post reduction 0 with 558 rules applied. Total rules applied 558 place count 7533 transition count 13224
Reduce places removed 558 places and 0 transitions.
Iterating post reduction 1 with 558 rules applied. Total rules applied 1116 place count 6975 transition count 13224
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 1116 place count 6975 transition count 13223
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 1118 place count 6974 transition count 13223
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 1128 place count 6964 transition count 13203
Iterating global reduction 2 with 10 rules applied. Total rules applied 1138 place count 6964 transition count 13203
Performed 79 Post agglomeration using F-continuation condition.Transition count delta: 79
Deduced a syphon composed of 79 places in 4 ms
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 2 with 158 rules applied. Total rules applied 1296 place count 6885 transition count 13124
Applied a total of 1296 rules in 6439 ms. Remains 6885 /7533 variables (removed 648) and now considering 13124/13782 (removed 658) transitions.
// Phase 1: matrix 13124 rows 6885 cols
[2023-03-09 14:20:14] [INFO ] Computed 161 place invariants in 120 ms
[2023-03-09 14:20:22] [INFO ] Implicit Places using invariants in 7966 ms returned []
Implicit Place search using SMT only with invariants took 7979 ms to find 0 implicit places.
[2023-03-09 14:20:22] [INFO ] Invariant cache hit.
[2023-03-09 14:20:31] [INFO ] Dead Transitions using invariants and state equation in 9587 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 6885/7533 places, 13124/13782 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 24025 ms. Remains : 6885/7533 places, 13124/13782 transitions.
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CANConstruction-PT-080-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s214 1) (GEQ s456 1)), p1:(GEQ s5071 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 722 steps with 0 reset in 22 ms.
FORMULA CANConstruction-PT-080-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CANConstruction-PT-080-LTLFireability-15 finished in 24389 ms.
All properties solved by simple procedures.
Total runtime 371752 ms.

BK_STOP 1678371632514

--------------------
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="CANConstruction-PT-080"
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 CANConstruction-PT-080, 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-167813690700676"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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