Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r389-oct2-167903713700523.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ShieldPPPs-PT-100B, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r389-oct2-167903713700523
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 7.3K Feb 26 02:08 CTLCardinality.txt
-rw-r--r-- 1 mcc users 80K Feb 26 02:08 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 02:07 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 26 02:07 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 02:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 02:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 02:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 02:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 1.8M Mar 5 18:23 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 ShieldPPPs-PT-100B-LTLCardinality-00
FORMULA_NAME ShieldPPPs-PT-100B-LTLCardinality-01
FORMULA_NAME ShieldPPPs-PT-100B-LTLCardinality-02
FORMULA_NAME ShieldPPPs-PT-100B-LTLCardinality-03
FORMULA_NAME ShieldPPPs-PT-100B-LTLCardinality-04
FORMULA_NAME ShieldPPPs-PT-100B-LTLCardinality-05
FORMULA_NAME ShieldPPPs-PT-100B-LTLCardinality-06
FORMULA_NAME ShieldPPPs-PT-100B-LTLCardinality-07
FORMULA_NAME ShieldPPPs-PT-100B-LTLCardinality-08
FORMULA_NAME ShieldPPPs-PT-100B-LTLCardinality-09
FORMULA_NAME ShieldPPPs-PT-100B-LTLCardinality-10
FORMULA_NAME ShieldPPPs-PT-100B-LTLCardinality-11
FORMULA_NAME ShieldPPPs-PT-100B-LTLCardinality-12
FORMULA_NAME ShieldPPPs-PT-100B-LTLCardinality-13
FORMULA_NAME ShieldPPPs-PT-100B-LTLCardinality-14
FORMULA_NAME ShieldPPPs-PT-100B-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679211427121

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-100B
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202303021504
[2023-03-19 07:37:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 07:37:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 07:37:09] [INFO ] Load time of PNML (sax parser for PT used): 232 ms
[2023-03-19 07:37:09] [INFO ] Transformed 6803 places.
[2023-03-19 07:37:09] [INFO ] Transformed 6303 transitions.
[2023-03-19 07:37:09] [INFO ] Found NUPN structural information;
[2023-03-19 07:37:09] [INFO ] Parsed PT model containing 6803 places and 6303 transitions and 17406 arcs in 789 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ShieldPPPs-PT-100B-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-100B-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 6803 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6803/6803 places, 6303/6303 transitions.
Discarding 695 places :
Symmetric choice reduction at 0 with 695 rule applications. Total rules 695 place count 6108 transition count 5608
Iterating global reduction 0 with 695 rules applied. Total rules applied 1390 place count 6108 transition count 5608
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1391 place count 6107 transition count 5607
Iterating global reduction 0 with 1 rules applied. Total rules applied 1392 place count 6107 transition count 5607
Applied a total of 1392 rules in 3025 ms. Remains 6107 /6803 variables (removed 696) and now considering 5607/6303 (removed 696) transitions.
// Phase 1: matrix 5607 rows 6107 cols
[2023-03-19 07:37:13] [INFO ] Computed 1101 place invariants in 62 ms
[2023-03-19 07:37:14] [INFO ] Implicit Places using invariants in 941 ms returned []
[2023-03-19 07:37:14] [INFO ] Invariant cache hit.
[2023-03-19 07:37:17] [INFO ] Implicit Places using invariants and state equation in 3236 ms returned []
Implicit Place search using SMT with State Equation took 4212 ms to find 0 implicit places.
[2023-03-19 07:37:17] [INFO ] Invariant cache hit.
[2023-03-19 07:37:22] [INFO ] Dead Transitions using invariants and state equation in 5419 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6107/6803 places, 5607/6303 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12663 ms. Remains : 6107/6803 places, 5607/6303 transitions.
Support contains 32 out of 6107 places after structural reductions.
[2023-03-19 07:37:23] [INFO ] Flatten gal took : 346 ms
[2023-03-19 07:37:23] [INFO ] Flatten gal took : 213 ms
[2023-03-19 07:37:24] [INFO ] Input system was already deterministic with 5607 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 465 ms. (steps per millisecond=21 ) properties (out of 14) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 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 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 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 45 ms. (steps per millisecond=222 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-19 07:37:24] [INFO ] Invariant cache hit.
[2023-03-19 07:37:26] [INFO ] After 1695ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-19 07:37:29] [INFO ] [Nat]Absence check using 1101 positive place invariants in 984 ms returned sat
[2023-03-19 07:37:36] [INFO ] After 6765ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-19 07:37:39] [INFO ] Deduced a trap composed of 19 places in 2985 ms of which 5 ms to minimize.
[2023-03-19 07:37:42] [INFO ] Deduced a trap composed of 30 places in 2855 ms of which 4 ms to minimize.
[2023-03-19 07:37:45] [INFO ] Deduced a trap composed of 23 places in 2731 ms of which 19 ms to minimize.
[2023-03-19 07:37:48] [INFO ] Deduced a trap composed of 21 places in 2671 ms of which 4 ms to minimize.
[2023-03-19 07:37:51] [INFO ] Deduced a trap composed of 23 places in 2609 ms of which 12 ms to minimize.
[2023-03-19 07:37:51] [INFO ] Trap strengthening (SAT) tested/added 5/5 trap constraints in 15027 ms
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.refineResultsWithTraps(DeadlockTester.java:769)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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-19 07:37:51] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 07:37:51] [INFO ] After 25032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:7
Parikh walk visited 0 properties in 2010 ms.
Support contains 22 out of 6107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6107/6107 places, 5607/5607 transitions.
Drop transitions removed 692 transitions
Trivial Post-agglo rules discarded 692 transitions
Performed 692 trivial Post agglomeration. Transition count delta: 692
Iterating post reduction 0 with 692 rules applied. Total rules applied 692 place count 6107 transition count 4915
Reduce places removed 692 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 695 rules applied. Total rules applied 1387 place count 5415 transition count 4912
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 1390 place count 5412 transition count 4912
Performed 497 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 497 Pre rules applied. Total rules applied 1390 place count 5412 transition count 4415
Deduced a syphon composed of 497 places in 27 ms
Reduce places removed 497 places and 0 transitions.
Iterating global reduction 3 with 994 rules applied. Total rules applied 2384 place count 4915 transition count 4415
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 2386 place count 4913 transition count 4413
Iterating global reduction 3 with 2 rules applied. Total rules applied 2388 place count 4913 transition count 4413
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 2388 place count 4913 transition count 4412
Deduced a syphon composed of 1 places in 20 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2390 place count 4912 transition count 4412
Performed 1789 Post agglomeration using F-continuation condition.Transition count delta: 1789
Deduced a syphon composed of 1789 places in 11 ms
Reduce places removed 1789 places and 0 transitions.
Iterating global reduction 3 with 3578 rules applied. Total rules applied 5968 place count 3123 transition count 2623
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 888 times.
Drop transitions removed 888 transitions
Iterating global reduction 3 with 888 rules applied. Total rules applied 6856 place count 3123 transition count 2623
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6857 place count 3122 transition count 2622
Applied a total of 6857 rules in 2406 ms. Remains 3122 /6107 variables (removed 2985) and now considering 2622/5607 (removed 2985) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2406 ms. Remains : 3122/6107 places, 2622/5607 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 7) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 115 ms. (steps per millisecond=86 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2622 rows 3122 cols
[2023-03-19 07:37:57] [INFO ] Computed 1101 place invariants in 130 ms
[2023-03-19 07:37:58] [INFO ] [Real]Absence check using 1057 positive place invariants in 335 ms returned sat
[2023-03-19 07:37:58] [INFO ] [Real]Absence check using 1057 positive and 44 generalized place invariants in 13 ms returned sat
[2023-03-19 07:37:58] [INFO ] After 985ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 07:37:59] [INFO ] [Nat]Absence check using 1057 positive place invariants in 314 ms returned sat
[2023-03-19 07:37:59] [INFO ] [Nat]Absence check using 1057 positive and 44 generalized place invariants in 10 ms returned sat
[2023-03-19 07:38:01] [INFO ] After 2327ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 07:38:02] [INFO ] Deduced a trap composed of 7 places in 584 ms of which 1 ms to minimize.
[2023-03-19 07:38:03] [INFO ] Deduced a trap composed of 4 places in 450 ms of which 1 ms to minimize.
[2023-03-19 07:38:03] [INFO ] Deduced a trap composed of 4 places in 441 ms of which 1 ms to minimize.
[2023-03-19 07:38:04] [INFO ] Deduced a trap composed of 8 places in 410 ms of which 1 ms to minimize.
[2023-03-19 07:38:04] [INFO ] Deduced a trap composed of 4 places in 425 ms of which 1 ms to minimize.
[2023-03-19 07:38:05] [INFO ] Deduced a trap composed of 6 places in 350 ms of which 1 ms to minimize.
[2023-03-19 07:38:05] [INFO ] Deduced a trap composed of 8 places in 420 ms of which 3 ms to minimize.
[2023-03-19 07:38:06] [INFO ] Deduced a trap composed of 5 places in 520 ms of which 1 ms to minimize.
[2023-03-19 07:38:06] [INFO ] Deduced a trap composed of 4 places in 332 ms of which 1 ms to minimize.
[2023-03-19 07:38:07] [INFO ] Deduced a trap composed of 6 places in 331 ms of which 1 ms to minimize.
[2023-03-19 07:38:07] [INFO ] Deduced a trap composed of 6 places in 398 ms of which 0 ms to minimize.
[2023-03-19 07:38:08] [INFO ] Deduced a trap composed of 9 places in 326 ms of which 0 ms to minimize.
[2023-03-19 07:38:08] [INFO ] Deduced a trap composed of 5 places in 378 ms of which 1 ms to minimize.
[2023-03-19 07:38:09] [INFO ] Deduced a trap composed of 6 places in 409 ms of which 0 ms to minimize.
[2023-03-19 07:38:09] [INFO ] Deduced a trap composed of 6 places in 392 ms of which 1 ms to minimize.
[2023-03-19 07:38:10] [INFO ] Deduced a trap composed of 6 places in 336 ms of which 0 ms to minimize.
[2023-03-19 07:38:10] [INFO ] Deduced a trap composed of 4 places in 315 ms of which 1 ms to minimize.
[2023-03-19 07:38:10] [INFO ] Deduced a trap composed of 4 places in 311 ms of which 0 ms to minimize.
[2023-03-19 07:38:11] [INFO ] Deduced a trap composed of 6 places in 328 ms of which 1 ms to minimize.
[2023-03-19 07:38:11] [INFO ] Deduced a trap composed of 6 places in 300 ms of which 1 ms to minimize.
[2023-03-19 07:38:12] [INFO ] Deduced a trap composed of 6 places in 355 ms of which 2 ms to minimize.
[2023-03-19 07:38:12] [INFO ] Deduced a trap composed of 5 places in 354 ms of which 1 ms to minimize.
[2023-03-19 07:38:13] [INFO ] Deduced a trap composed of 5 places in 343 ms of which 2 ms to minimize.
[2023-03-19 07:38:13] [INFO ] Deduced a trap composed of 5 places in 347 ms of which 1 ms to minimize.
[2023-03-19 07:38:14] [INFO ] Deduced a trap composed of 7 places in 310 ms of which 1 ms to minimize.
[2023-03-19 07:38:14] [INFO ] Deduced a trap composed of 5 places in 290 ms of which 1 ms to minimize.
[2023-03-19 07:38:14] [INFO ] Deduced a trap composed of 6 places in 372 ms of which 1 ms to minimize.
[2023-03-19 07:38:15] [INFO ] Deduced a trap composed of 9 places in 296 ms of which 0 ms to minimize.
[2023-03-19 07:38:15] [INFO ] Deduced a trap composed of 7 places in 321 ms of which 1 ms to minimize.
[2023-03-19 07:38:16] [INFO ] Deduced a trap composed of 9 places in 308 ms of which 1 ms to minimize.
[2023-03-19 07:38:16] [INFO ] Deduced a trap composed of 6 places in 317 ms of which 0 ms to minimize.
[2023-03-19 07:38:16] [INFO ] Deduced a trap composed of 6 places in 272 ms of which 1 ms to minimize.
[2023-03-19 07:38:17] [INFO ] Deduced a trap composed of 4 places in 308 ms of which 0 ms to minimize.
[2023-03-19 07:38:17] [INFO ] Deduced a trap composed of 6 places in 293 ms of which 0 ms to minimize.
[2023-03-19 07:38:17] [INFO ] Deduced a trap composed of 6 places in 255 ms of which 1 ms to minimize.
[2023-03-19 07:38:18] [INFO ] Deduced a trap composed of 6 places in 286 ms of which 0 ms to minimize.
[2023-03-19 07:38:18] [INFO ] Deduced a trap composed of 4 places in 282 ms of which 2 ms to minimize.
[2023-03-19 07:38:19] [INFO ] Deduced a trap composed of 9 places in 286 ms of which 0 ms to minimize.
[2023-03-19 07:38:19] [INFO ] Deduced a trap composed of 6 places in 322 ms of which 1 ms to minimize.
[2023-03-19 07:38:19] [INFO ] Deduced a trap composed of 6 places in 302 ms of which 0 ms to minimize.
[2023-03-19 07:38:20] [INFO ] Deduced a trap composed of 6 places in 352 ms of which 1 ms to minimize.
[2023-03-19 07:38:20] [INFO ] Deduced a trap composed of 4 places in 349 ms of which 1 ms to minimize.
[2023-03-19 07:38:21] [INFO ] Deduced a trap composed of 4 places in 279 ms of which 1 ms to minimize.
[2023-03-19 07:38:21] [INFO ] Deduced a trap composed of 9 places in 245 ms of which 1 ms to minimize.
[2023-03-19 07:38:22] [INFO ] Deduced a trap composed of 6 places in 277 ms of which 1 ms to minimize.
[2023-03-19 07:38:22] [INFO ] Deduced a trap composed of 9 places in 250 ms of which 0 ms to minimize.
[2023-03-19 07:38:22] [INFO ] Deduced a trap composed of 8 places in 256 ms of which 1 ms to minimize.
[2023-03-19 07:38:23] [INFO ] Deduced a trap composed of 4 places in 271 ms of which 1 ms to minimize.
[2023-03-19 07:38:25] [INFO ] Deduced a trap composed of 3 places in 2720 ms of which 7 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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-19 07:38:25] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 07:38:25] [INFO ] After 27746ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:4
Parikh walk visited 0 properties in 459 ms.
Support contains 12 out of 3122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3122/3122 places, 2622/2622 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 3122 transition count 2620
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 3120 transition count 2620
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 4 place count 3120 transition count 2617
Deduced a syphon composed of 3 places in 6 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 10 place count 3117 transition count 2617
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 6 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 22 place count 3111 transition count 2611
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 3111 transition count 2611
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 25 place count 3110 transition count 2610
Applied a total of 25 rules in 762 ms. Remains 3110 /3122 variables (removed 12) and now considering 2610/2622 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 762 ms. Remains : 3110/3122 places, 2610/2622 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 328 ms. (steps per millisecond=30 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 63036 steps, run timeout after 3001 ms. (steps per millisecond=21 ) properties seen :{}
Probabilistic random walk after 63036 steps, saw 58482 distinct states, run finished after 3003 ms. (steps per millisecond=20 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 2610 rows 3110 cols
[2023-03-19 07:38:30] [INFO ] Computed 1101 place invariants in 27 ms
[2023-03-19 07:38:31] [INFO ] [Real]Absence check using 1050 positive place invariants in 252 ms returned sat
[2023-03-19 07:38:31] [INFO ] [Real]Absence check using 1050 positive and 51 generalized place invariants in 25 ms returned sat
[2023-03-19 07:38:31] [INFO ] After 821ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 07:38:32] [INFO ] [Nat]Absence check using 1050 positive place invariants in 308 ms returned sat
[2023-03-19 07:38:32] [INFO ] [Nat]Absence check using 1050 positive and 51 generalized place invariants in 24 ms returned sat
[2023-03-19 07:38:35] [INFO ] After 2364ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 07:38:35] [INFO ] Deduced a trap composed of 3 places in 424 ms of which 1 ms to minimize.
[2023-03-19 07:38:36] [INFO ] Deduced a trap composed of 6 places in 372 ms of which 1 ms to minimize.
[2023-03-19 07:38:36] [INFO ] Deduced a trap composed of 4 places in 380 ms of which 1 ms to minimize.
[2023-03-19 07:38:37] [INFO ] Deduced a trap composed of 6 places in 345 ms of which 1 ms to minimize.
[2023-03-19 07:38:37] [INFO ] Deduced a trap composed of 5 places in 342 ms of which 1 ms to minimize.
[2023-03-19 07:38:38] [INFO ] Deduced a trap composed of 6 places in 406 ms of which 1 ms to minimize.
[2023-03-19 07:38:38] [INFO ] Deduced a trap composed of 6 places in 369 ms of which 1 ms to minimize.
[2023-03-19 07:38:39] [INFO ] Deduced a trap composed of 6 places in 386 ms of which 1 ms to minimize.
[2023-03-19 07:38:39] [INFO ] Deduced a trap composed of 4 places in 379 ms of which 14 ms to minimize.
[2023-03-19 07:38:40] [INFO ] Deduced a trap composed of 6 places in 379 ms of which 1 ms to minimize.
[2023-03-19 07:38:40] [INFO ] Deduced a trap composed of 6 places in 332 ms of which 2 ms to minimize.
[2023-03-19 07:38:41] [INFO ] Deduced a trap composed of 6 places in 372 ms of which 2 ms to minimize.
[2023-03-19 07:38:41] [INFO ] Deduced a trap composed of 5 places in 307 ms of which 1 ms to minimize.
[2023-03-19 07:38:41] [INFO ] Deduced a trap composed of 16 places in 305 ms of which 1 ms to minimize.
[2023-03-19 07:38:42] [INFO ] Deduced a trap composed of 8 places in 168 ms of which 1 ms to minimize.
[2023-03-19 07:38:42] [INFO ] Deduced a trap composed of 6 places in 251 ms of which 2 ms to minimize.
[2023-03-19 07:38:42] [INFO ] Deduced a trap composed of 5 places in 244 ms of which 0 ms to minimize.
[2023-03-19 07:38:43] [INFO ] Deduced a trap composed of 4 places in 228 ms of which 1 ms to minimize.
[2023-03-19 07:38:43] [INFO ] Deduced a trap composed of 6 places in 222 ms of which 0 ms to minimize.
[2023-03-19 07:38:43] [INFO ] Deduced a trap composed of 8 places in 256 ms of which 0 ms to minimize.
[2023-03-19 07:38:44] [INFO ] Deduced a trap composed of 6 places in 215 ms of which 0 ms to minimize.
[2023-03-19 07:38:44] [INFO ] Deduced a trap composed of 6 places in 215 ms of which 0 ms to minimize.
[2023-03-19 07:38:44] [INFO ] Deduced a trap composed of 6 places in 213 ms of which 0 ms to minimize.
[2023-03-19 07:38:45] [INFO ] Deduced a trap composed of 5 places in 221 ms of which 0 ms to minimize.
[2023-03-19 07:38:45] [INFO ] Deduced a trap composed of 6 places in 194 ms of which 1 ms to minimize.
[2023-03-19 07:38:45] [INFO ] Deduced a trap composed of 6 places in 186 ms of which 0 ms to minimize.
[2023-03-19 07:38:46] [INFO ] Deduced a trap composed of 9 places in 221 ms of which 1 ms to minimize.
[2023-03-19 07:38:46] [INFO ] Deduced a trap composed of 9 places in 266 ms of which 1 ms to minimize.
[2023-03-19 07:38:46] [INFO ] Deduced a trap composed of 6 places in 154 ms of which 0 ms to minimize.
[2023-03-19 07:38:46] [INFO ] Deduced a trap composed of 6 places in 182 ms of which 2 ms to minimize.
[2023-03-19 07:38:47] [INFO ] Deduced a trap composed of 5 places in 196 ms of which 1 ms to minimize.
[2023-03-19 07:38:47] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 0 ms to minimize.
[2023-03-19 07:38:47] [INFO ] Deduced a trap composed of 6 places in 155 ms of which 0 ms to minimize.
[2023-03-19 07:38:47] [INFO ] Deduced a trap composed of 15 places in 188 ms of which 0 ms to minimize.
[2023-03-19 07:38:48] [INFO ] Deduced a trap composed of 16 places in 263 ms of which 1 ms to minimize.
[2023-03-19 07:38:48] [INFO ] Deduced a trap composed of 17 places in 195 ms of which 1 ms to minimize.
[2023-03-19 07:38:48] [INFO ] Deduced a trap composed of 29 places in 156 ms of which 0 ms to minimize.
[2023-03-19 07:38:49] [INFO ] Trap strengthening (SAT) tested/added 38/37 trap constraints in 13693 ms
[2023-03-19 07:38:49] [INFO ] Deduced a trap composed of 7 places in 154 ms of which 0 ms to minimize.
[2023-03-19 07:38:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 324 ms
[2023-03-19 07:38:49] [INFO ] After 16983ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 576 ms.
[2023-03-19 07:38:50] [INFO ] After 18723ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 546 ms.
Support contains 12 out of 3110 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3110/3110 places, 2610/2610 transitions.
Applied a total of 0 rules in 187 ms. Remains 3110 /3110 variables (removed 0) and now considering 2610/2610 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 187 ms. Remains : 3110/3110 places, 2610/2610 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 3110/3110 places, 2610/2610 transitions.
Applied a total of 0 rules in 238 ms. Remains 3110 /3110 variables (removed 0) and now considering 2610/2610 (removed 0) transitions.
[2023-03-19 07:38:51] [INFO ] Invariant cache hit.
[2023-03-19 07:38:54] [INFO ] Implicit Places using invariants in 2870 ms returned []
[2023-03-19 07:38:54] [INFO ] Invariant cache hit.
[2023-03-19 07:39:00] [INFO ] Implicit Places using invariants and state equation in 5699 ms returned []
Implicit Place search using SMT with State Equation took 8571 ms to find 0 implicit places.
[2023-03-19 07:39:00] [INFO ] Redundant transitions in 246 ms returned []
[2023-03-19 07:39:00] [INFO ] Invariant cache hit.
[2023-03-19 07:39:02] [INFO ] Dead Transitions using invariants and state equation in 2081 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11154 ms. Remains : 3110/3110 places, 2610/2610 transitions.
Applied a total of 0 rules in 187 ms. Remains 3110 /3110 variables (removed 0) and now considering 2610/2610 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-19 07:39:02] [INFO ] Invariant cache hit.
[2023-03-19 07:39:03] [INFO ] [Real]Absence check using 1050 positive place invariants in 256 ms returned sat
[2023-03-19 07:39:03] [INFO ] [Real]Absence check using 1050 positive and 51 generalized place invariants in 27 ms returned sat
[2023-03-19 07:39:03] [INFO ] After 931ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 07:39:04] [INFO ] [Nat]Absence check using 1050 positive place invariants in 289 ms returned sat
[2023-03-19 07:39:04] [INFO ] [Nat]Absence check using 1050 positive and 51 generalized place invariants in 27 ms returned sat
[2023-03-19 07:39:07] [INFO ] After 2305ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 07:39:07] [INFO ] Deduced a trap composed of 4 places in 384 ms of which 0 ms to minimize.
[2023-03-19 07:39:08] [INFO ] Deduced a trap composed of 6 places in 313 ms of which 0 ms to minimize.
[2023-03-19 07:39:08] [INFO ] Deduced a trap composed of 5 places in 345 ms of which 2 ms to minimize.
[2023-03-19 07:39:08] [INFO ] Deduced a trap composed of 6 places in 324 ms of which 1 ms to minimize.
[2023-03-19 07:39:09] [INFO ] Deduced a trap composed of 4 places in 259 ms of which 0 ms to minimize.
[2023-03-19 07:39:09] [INFO ] Deduced a trap composed of 5 places in 312 ms of which 1 ms to minimize.
[2023-03-19 07:39:10] [INFO ] Deduced a trap composed of 4 places in 347 ms of which 0 ms to minimize.
[2023-03-19 07:39:10] [INFO ] Deduced a trap composed of 4 places in 409 ms of which 1 ms to minimize.
[2023-03-19 07:39:11] [INFO ] Deduced a trap composed of 4 places in 348 ms of which 1 ms to minimize.
[2023-03-19 07:39:11] [INFO ] Deduced a trap composed of 6 places in 353 ms of which 1 ms to minimize.
[2023-03-19 07:39:11] [INFO ] Deduced a trap composed of 6 places in 293 ms of which 0 ms to minimize.
[2023-03-19 07:39:12] [INFO ] Deduced a trap composed of 6 places in 266 ms of which 0 ms to minimize.
[2023-03-19 07:39:12] [INFO ] Deduced a trap composed of 4 places in 294 ms of which 1 ms to minimize.
[2023-03-19 07:39:13] [INFO ] Deduced a trap composed of 4 places in 319 ms of which 2 ms to minimize.
[2023-03-19 07:39:13] [INFO ] Deduced a trap composed of 4 places in 277 ms of which 0 ms to minimize.
[2023-03-19 07:39:14] [INFO ] Deduced a trap composed of 12 places in 324 ms of which 0 ms to minimize.
[2023-03-19 07:39:14] [INFO ] Deduced a trap composed of 4 places in 243 ms of which 1 ms to minimize.
[2023-03-19 07:39:14] [INFO ] Deduced a trap composed of 6 places in 236 ms of which 1 ms to minimize.
[2023-03-19 07:39:15] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 1 ms to minimize.
[2023-03-19 07:39:15] [INFO ] Deduced a trap composed of 4 places in 292 ms of which 1 ms to minimize.
[2023-03-19 07:39:15] [INFO ] Deduced a trap composed of 5 places in 380 ms of which 1 ms to minimize.
[2023-03-19 07:39:16] [INFO ] Deduced a trap composed of 9 places in 242 ms of which 1 ms to minimize.
[2023-03-19 07:39:16] [INFO ] Deduced a trap composed of 5 places in 205 ms of which 0 ms to minimize.
[2023-03-19 07:39:17] [INFO ] Deduced a trap composed of 6 places in 298 ms of which 2 ms to minimize.
[2023-03-19 07:39:17] [INFO ] Deduced a trap composed of 11 places in 227 ms of which 0 ms to minimize.
[2023-03-19 07:39:17] [INFO ] Deduced a trap composed of 6 places in 269 ms of which 1 ms to minimize.
[2023-03-19 07:39:18] [INFO ] Deduced a trap composed of 6 places in 311 ms of which 1 ms to minimize.
[2023-03-19 07:39:18] [INFO ] Deduced a trap composed of 6 places in 236 ms of which 1 ms to minimize.
[2023-03-19 07:39:18] [INFO ] Deduced a trap composed of 5 places in 232 ms of which 2 ms to minimize.
[2023-03-19 07:39:19] [INFO ] Deduced a trap composed of 4 places in 257 ms of which 1 ms to minimize.
[2023-03-19 07:39:19] [INFO ] Deduced a trap composed of 6 places in 256 ms of which 0 ms to minimize.
[2023-03-19 07:39:20] [INFO ] Deduced a trap composed of 6 places in 223 ms of which 1 ms to minimize.
[2023-03-19 07:39:20] [INFO ] Deduced a trap composed of 6 places in 244 ms of which 1 ms to minimize.
[2023-03-19 07:39:20] [INFO ] Deduced a trap composed of 9 places in 231 ms of which 1 ms to minimize.
[2023-03-19 07:39:21] [INFO ] Deduced a trap composed of 6 places in 223 ms of which 1 ms to minimize.
[2023-03-19 07:39:21] [INFO ] Deduced a trap composed of 6 places in 293 ms of which 0 ms to minimize.
[2023-03-19 07:39:21] [INFO ] Deduced a trap composed of 5 places in 177 ms of which 1 ms to minimize.
[2023-03-19 07:39:22] [INFO ] Deduced a trap composed of 6 places in 237 ms of which 1 ms to minimize.
[2023-03-19 07:39:22] [INFO ] Deduced a trap composed of 4 places in 225 ms of which 0 ms to minimize.
[2023-03-19 07:39:22] [INFO ] Deduced a trap composed of 9 places in 197 ms of which 1 ms to minimize.
[2023-03-19 07:39:23] [INFO ] Deduced a trap composed of 6 places in 195 ms of which 1 ms to minimize.
[2023-03-19 07:39:23] [INFO ] Deduced a trap composed of 6 places in 217 ms of which 1 ms to minimize.
[2023-03-19 07:39:23] [INFO ] Deduced a trap composed of 6 places in 233 ms of which 1 ms to minimize.
[2023-03-19 07:39:24] [INFO ] Deduced a trap composed of 8 places in 204 ms of which 1 ms to minimize.
[2023-03-19 07:39:24] [INFO ] Deduced a trap composed of 6 places in 211 ms of which 1 ms to minimize.
[2023-03-19 07:39:24] [INFO ] Deduced a trap composed of 9 places in 241 ms of which 1 ms to minimize.
[2023-03-19 07:39:25] [INFO ] Deduced a trap composed of 6 places in 220 ms of which 0 ms to minimize.
[2023-03-19 07:39:25] [INFO ] Deduced a trap composed of 15 places in 243 ms of which 1 ms to minimize.
[2023-03-19 07:39:25] [INFO ] Deduced a trap composed of 6 places in 212 ms of which 1 ms to minimize.
[2023-03-19 07:39:26] [INFO ] Deduced a trap composed of 9 places in 315 ms of which 0 ms to minimize.
[2023-03-19 07:39:26] [INFO ] Deduced a trap composed of 4 places in 198 ms of which 1 ms to minimize.
[2023-03-19 07:39:27] [INFO ] Deduced a trap composed of 21 places in 222 ms of which 0 ms to minimize.
[2023-03-19 07:39:27] [INFO ] Trap strengthening (SAT) tested/added 53/52 trap constraints in 20046 ms
[2023-03-19 07:39:27] [INFO ] Deduced a trap composed of 5 places in 185 ms of which 1 ms to minimize.
[2023-03-19 07:39:27] [INFO ] Deduced a trap composed of 6 places in 163 ms of which 0 ms to minimize.
[2023-03-19 07:39:28] [INFO ] Deduced a trap composed of 10 places in 241 ms of which 3 ms to minimize.
[2023-03-19 07:39:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1131 ms
[2023-03-19 07:39:29] [INFO ] Deduced a trap composed of 5 places in 167 ms of which 1 ms to minimize.
[2023-03-19 07:39:29] [INFO ] Deduced a trap composed of 6 places in 198 ms of which 0 ms to minimize.
[2023-03-19 07:39:29] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 789 ms
[2023-03-19 07:39:29] [INFO ] After 24876ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 663 ms.
[2023-03-19 07:39:30] [INFO ] After 26783ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
FORMULA ShieldPPPs-PT-100B-LTLCardinality-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 1204 stabilizing places and 1204 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(F(!(X(p0) U X(p1)))))&&X(F(X(X(p0))))))'
Support contains 4 out of 6107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6107/6107 places, 5607/5607 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 6103 transition count 5603
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 6103 transition count 5603
Applied a total of 8 rules in 1694 ms. Remains 6103 /6107 variables (removed 4) and now considering 5603/5607 (removed 4) transitions.
// Phase 1: matrix 5603 rows 6103 cols
[2023-03-19 07:39:32] [INFO ] Computed 1101 place invariants in 54 ms
[2023-03-19 07:39:35] [INFO ] Implicit Places using invariants in 2851 ms returned []
[2023-03-19 07:39:35] [INFO ] Invariant cache hit.
[2023-03-19 07:39:36] [INFO ] Implicit Places using invariants and state equation in 679 ms returned []
Implicit Place search using SMT with State Equation took 3532 ms to find 0 implicit places.
[2023-03-19 07:39:36] [INFO ] Invariant cache hit.
[2023-03-19 07:39:41] [INFO ] Dead Transitions using invariants and state equation in 5133 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6103/6107 places, 5603/5607 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10366 ms. Remains : 6103/6107 places, 5603/5607 transitions.
Stuttering acceptance computed with spot in 622 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1, (NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 4}, { cond=true, acceptance={} source=3 dest: 5}, { cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=p1, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(OR (EQ s4572 0) (EQ s4033 1)), p0:(OR (EQ s4805 0) (EQ s323 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]]
Product exploration explored 100000 steps with 20 reset in 1539 ms.
Product exploration explored 100000 steps with 19 reset in 1765 ms.
Computed a total of 1200 stabilizing places and 1200 stable transitions
Computed a total of 1200 stabilizing places and 1200 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 160 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 470 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 273 ms. (steps per millisecond=36 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 135408 steps, run timeout after 3001 ms. (steps per millisecond=45 ) properties seen :{}
Probabilistic random walk after 135408 steps, saw 133346 distinct states, run finished after 3001 ms. (steps per millisecond=45 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-19 07:39:49] [INFO ] Invariant cache hit.
[2023-03-19 07:39:50] [INFO ] After 864ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 07:39:51] [INFO ] [Nat]Absence check using 1101 positive place invariants in 729 ms returned sat
[2023-03-19 07:39:57] [INFO ] After 5477ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 07:40:00] [INFO ] Deduced a trap composed of 54 places in 2707 ms of which 4 ms to minimize.
[2023-03-19 07:40:03] [INFO ] Deduced a trap composed of 21 places in 2697 ms of which 5 ms to minimize.
[2023-03-19 07:40:06] [INFO ] Deduced a trap composed of 23 places in 2740 ms of which 3 ms to minimize.
[2023-03-19 07:40:09] [INFO ] Deduced a trap composed of 26 places in 2642 ms of which 4 ms to minimize.
[2023-03-19 07:40:12] [INFO ] Deduced a trap composed of 37 places in 2438 ms of which 3 ms to minimize.
[2023-03-19 07:40:15] [INFO ] Deduced a trap composed of 35 places in 2482 ms of which 5 ms to minimize.
[2023-03-19 07:40:17] [INFO ] Deduced a trap composed of 21 places in 2547 ms of which 3 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
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-19 07:40:17] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 07:40:17] [INFO ] After 27574ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 419 ms.
Support contains 4 out of 6103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6103/6103 places, 5603/5603 transitions.
Drop transitions removed 701 transitions
Trivial Post-agglo rules discarded 701 transitions
Performed 701 trivial Post agglomeration. Transition count delta: 701
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 6103 transition count 4902
Reduce places removed 701 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 702 rules applied. Total rules applied 1403 place count 5402 transition count 4901
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1404 place count 5401 transition count 4901
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 499 Pre rules applied. Total rules applied 1404 place count 5401 transition count 4402
Deduced a syphon composed of 499 places in 25 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 3 with 998 rules applied. Total rules applied 2402 place count 4902 transition count 4402
Performed 1797 Post agglomeration using F-continuation condition.Transition count delta: 1797
Deduced a syphon composed of 1797 places in 8 ms
Reduce places removed 1797 places and 0 transitions.
Iterating global reduction 3 with 3594 rules applied. Total rules applied 5996 place count 3105 transition count 2605
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 896 times.
Drop transitions removed 896 transitions
Iterating global reduction 3 with 896 rules applied. Total rules applied 6892 place count 3105 transition count 2605
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6893 place count 3104 transition count 2604
Applied a total of 6893 rules in 1628 ms. Remains 3104 /6103 variables (removed 2999) and now considering 2604/5603 (removed 2999) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1628 ms. Remains : 3104/6103 places, 2604/5603 transitions.
Finished random walk after 1280 steps, including 0 resets, run visited all 3 properties in 38 ms. (steps per millisecond=33 )
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p1) p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 2093 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 375 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1, (NOT p0)]
Stuttering acceptance computed with spot in 459 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1, (NOT p0)]
[2023-03-19 07:40:22] [INFO ] Invariant cache hit.
[2023-03-19 07:40:36] [INFO ] [Real]Absence check using 1101 positive place invariants in 7489 ms returned sat
[2023-03-19 07:40:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 07:40:38] [INFO ] [Real]Absence check using state equation in 1239 ms returned unknown
Could not prove EG p1
Support contains 4 out of 6103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6103/6103 places, 5603/5603 transitions.
Applied a total of 0 rules in 986 ms. Remains 6103 /6103 variables (removed 0) and now considering 5603/5603 (removed 0) transitions.
[2023-03-19 07:40:39] [INFO ] Invariant cache hit.
[2023-03-19 07:40:41] [INFO ] Implicit Places using invariants in 2678 ms returned []
[2023-03-19 07:40:41] [INFO ] Invariant cache hit.
[2023-03-19 07:40:44] [INFO ] Implicit Places using invariants and state equation in 2785 ms returned []
Implicit Place search using SMT with State Equation took 5465 ms to find 0 implicit places.
[2023-03-19 07:40:44] [INFO ] Invariant cache hit.
[2023-03-19 07:40:49] [INFO ] Dead Transitions using invariants and state equation in 4850 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11307 ms. Remains : 6103/6103 places, 5603/5603 transitions.
Computed a total of 1200 stabilizing places and 1200 stable transitions
Computed a total of 1200 stabilizing places and 1200 stable transitions
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 162 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 492 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1, (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 226 ms. (steps per millisecond=44 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 174974 steps, run timeout after 3001 ms. (steps per millisecond=58 ) properties seen :{}
Probabilistic random walk after 174974 steps, saw 172343 distinct states, run finished after 3001 ms. (steps per millisecond=58 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-19 07:40:53] [INFO ] Invariant cache hit.
[2023-03-19 07:40:54] [INFO ] After 830ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 07:40:55] [INFO ] [Nat]Absence check using 1101 positive place invariants in 660 ms returned sat
[2023-03-19 07:41:01] [INFO ] After 5309ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 07:41:04] [INFO ] Deduced a trap composed of 54 places in 2399 ms of which 3 ms to minimize.
[2023-03-19 07:41:06] [INFO ] Deduced a trap composed of 21 places in 2398 ms of which 4 ms to minimize.
[2023-03-19 07:41:09] [INFO ] Deduced a trap composed of 23 places in 2531 ms of which 4 ms to minimize.
[2023-03-19 07:41:12] [INFO ] Deduced a trap composed of 26 places in 2586 ms of which 5 ms to minimize.
[2023-03-19 07:41:15] [INFO ] Deduced a trap composed of 37 places in 2539 ms of which 4 ms to minimize.
[2023-03-19 07:41:17] [INFO ] Deduced a trap composed of 35 places in 2571 ms of which 3 ms to minimize.
[2023-03-19 07:41:20] [INFO ] Deduced a trap composed of 21 places in 2555 ms of which 4 ms to minimize.
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.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineResultsWithTraps(DeadlockTester.java:736)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:656)
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.ltl.LTLPropertySolver.addInvarianceKnowledge(LTLPropertySolver.java:701)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:568)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
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-19 07:41:20] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 07:41:20] [INFO ] After 26317ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0 real:3
Parikh walk visited 0 properties in 460 ms.
Support contains 4 out of 6103 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 6103/6103 places, 5603/5603 transitions.
Drop transitions removed 701 transitions
Trivial Post-agglo rules discarded 701 transitions
Performed 701 trivial Post agglomeration. Transition count delta: 701
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 6103 transition count 4902
Reduce places removed 701 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 702 rules applied. Total rules applied 1403 place count 5402 transition count 4901
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1404 place count 5401 transition count 4901
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 499 Pre rules applied. Total rules applied 1404 place count 5401 transition count 4402
Deduced a syphon composed of 499 places in 28 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 3 with 998 rules applied. Total rules applied 2402 place count 4902 transition count 4402
Performed 1797 Post agglomeration using F-continuation condition.Transition count delta: 1797
Deduced a syphon composed of 1797 places in 6 ms
Reduce places removed 1797 places and 0 transitions.
Iterating global reduction 3 with 3594 rules applied. Total rules applied 5996 place count 3105 transition count 2605
Renaming transitions due to excessive name length > 1024 char.
Partial Free-agglomeration rule applied 896 times.
Drop transitions removed 896 transitions
Iterating global reduction 3 with 896 rules applied. Total rules applied 6892 place count 3105 transition count 2605
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 6893 place count 3104 transition count 2604
Applied a total of 6893 rules in 1567 ms. Remains 3104 /6103 variables (removed 2999) and now considering 2604/5603 (removed 2999) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1567 ms. Remains : 3104/6103 places, 2604/5603 transitions.
Finished random walk after 960 steps, including 0 resets, run visited all 3 properties in 26 ms. (steps per millisecond=36 )
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(F (NOT p1)), (F (AND (NOT p1) p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 227 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 392 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1, (NOT p0)]
Stuttering acceptance computed with spot in 427 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1, (NOT p0)]
[2023-03-19 07:41:23] [INFO ] Invariant cache hit.
[2023-03-19 07:41:37] [INFO ] [Real]Absence check using 1101 positive place invariants in 7219 ms returned sat
[2023-03-19 07:41:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-19 07:41:38] [INFO ] [Real]Absence check using state equation in 1609 ms returned unknown
Could not prove EG p1
Stuttering acceptance computed with spot in 457 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1, (NOT p0)]
Product exploration explored 100000 steps with 20 reset in 1451 ms.
Product exploration explored 100000 steps with 19 reset in 1649 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 401 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1, (NOT p0)]
Support contains 4 out of 6103 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6103/6103 places, 5603/5603 transitions.
Performed 701 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 6103 transition count 5603
Performed 200 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 200 Pre rules applied. Total rules applied 701 place count 6103 transition count 5604
Deduced a syphon composed of 901 places in 25 ms
Iterating global reduction 1 with 200 rules applied. Total rules applied 901 place count 6103 transition count 5604
Performed 2097 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2998 places in 11 ms
Iterating global reduction 1 with 2097 rules applied. Total rules applied 2998 place count 6103 transition count 5604
Renaming transitions due to excessive name length > 1024 char.
Discarding 702 places :
Symmetric choice reduction at 1 with 702 rule applications. Total rules 3700 place count 5401 transition count 4902
Deduced a syphon composed of 2296 places in 12 ms
Iterating global reduction 1 with 702 rules applied. Total rules applied 4402 place count 5401 transition count 4902
Deduced a syphon composed of 2296 places in 10 ms
Applied a total of 4402 rules in 5671 ms. Remains 5401 /6103 variables (removed 702) and now considering 4902/5603 (removed 701) transitions.
[2023-03-19 07:41:48] [INFO ] Redundant transitions in 217 ms returned []
// Phase 1: matrix 4902 rows 5401 cols
[2023-03-19 07:41:49] [INFO ] Computed 1101 place invariants in 187 ms
[2023-03-19 07:41:53] [INFO ] Dead Transitions using invariants and state equation in 4171 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 5401/6103 places, 4902/5603 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10083 ms. Remains : 5401/6103 places, 4902/5603 transitions.
Built C files in :
/tmp/ltsmin17756233050466395387
[2023-03-19 07:41:53] [INFO ] Built C files in 96ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17756233050466395387
Running compilation step : cd /tmp/ltsmin17756233050466395387;'/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/ltsmin17756233050466395387;'/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/ltsmin17756233050466395387;'/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 4 out of 6103 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6103/6103 places, 5603/5603 transitions.
Applied a total of 0 rules in 900 ms. Remains 6103 /6103 variables (removed 0) and now considering 5603/5603 (removed 0) transitions.
// Phase 1: matrix 5603 rows 6103 cols
[2023-03-19 07:41:57] [INFO ] Computed 1101 place invariants in 34 ms
[2023-03-19 07:42:00] [INFO ] Implicit Places using invariants in 2855 ms returned []
[2023-03-19 07:42:00] [INFO ] Invariant cache hit.
[2023-03-19 07:42:03] [INFO ] Implicit Places using invariants and state equation in 2939 ms returned []
Implicit Place search using SMT with State Equation took 5796 ms to find 0 implicit places.
[2023-03-19 07:42:03] [INFO ] Invariant cache hit.
[2023-03-19 07:42:08] [INFO ] Dead Transitions using invariants and state equation in 5367 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12067 ms. Remains : 6103/6103 places, 5603/5603 transitions.
Built C files in :
/tmp/ltsmin8454117848845928856
[2023-03-19 07:42:08] [INFO ] Built C files in 85ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8454117848845928856
Running compilation step : cd /tmp/ltsmin8454117848845928856;'/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/ltsmin8454117848845928856;'/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/ltsmin8454117848845928856;'/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-19 07:42:12] [INFO ] Flatten gal took : 164 ms
[2023-03-19 07:42:12] [INFO ] Flatten gal took : 152 ms
[2023-03-19 07:42:12] [INFO ] Time to serialize gal into /tmp/LTL10299934216597185461.gal : 33 ms
[2023-03-19 07:42:12] [INFO ] Time to serialize properties into /tmp/LTL5885589876654980108.prop : 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/LTL10299934216597185461.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10447789396025477405.hoa' '-atoms' '/tmp/LTL5885589876654980108.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...319
Loading property file /tmp/LTL5885589876654980108.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10447789396025477405.hoa
Detected timeout of ITS tools.
[2023-03-19 07:42:27] [INFO ] Flatten gal took : 167 ms
[2023-03-19 07:42:27] [INFO ] Flatten gal took : 163 ms
[2023-03-19 07:42:27] [INFO ] Time to serialize gal into /tmp/LTL13772950506734434212.gal : 25 ms
[2023-03-19 07:42:27] [INFO ] Time to serialize properties into /tmp/LTL9622554147412823652.ltl : 4 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/LTL13772950506734434212.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9622554147412823652.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(F(!((X("((p5350==0)||(p346==1))"))U(X("((p5089==0)||(p4487==1))")))))))&&(X(F(X(X("((p5350==0)||(p346==1))")))))))
Formula 0 simplified : XXX(FG("((p5350==0)||(p346==1))" U "((p5089==0)||(p4487==1))") | G!"((p5350==0)||(p346==1))")
Detected timeout of ITS tools.
[2023-03-19 07:42:43] [INFO ] Flatten gal took : 156 ms
[2023-03-19 07:42:43] [INFO ] Applying decomposition
[2023-03-19 07:42:43] [INFO ] Flatten gal took : 139 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/graph697717924835430795.txt' '-o' '/tmp/graph697717924835430795.bin' '-w' '/tmp/graph697717924835430795.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph697717924835430795.bin' '-l' '-1' '-v' '-w' '/tmp/graph697717924835430795.weights' '-q' '0' '-e' '0.001'
[2023-03-19 07:42:43] [INFO ] Decomposing Gal with order
[2023-03-19 07:42:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 07:42:45] [INFO ] Removed a total of 900 redundant transitions.
[2023-03-19 07:42:45] [INFO ] Flatten gal took : 342 ms
[2023-03-19 07:42:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 25 ms.
[2023-03-19 07:42:46] [INFO ] Time to serialize gal into /tmp/LTL12269348237527279673.gal : 54 ms
[2023-03-19 07:42:46] [INFO ] Time to serialize properties into /tmp/LTL13822127812525198066.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/LTL12269348237527279673.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13822127812525198066.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...256
Read 1 LTL properties
Checking formula 0 : !(((F(G(F(!((X("((i50.i0.i1.i0.u1895.p5350==0)||(i3.u133.p346==1))"))U(X("((i47.i1.i4.i0.u1804.p5089==0)||(i42.u1591.p4487==1))"))))))...226
Formula 0 simplified : XXX(FG("((i50.i0.i1.i0.u1895.p5350==0)||(i3.u133.p346==1))" U "((i47.i1.i4.i0.u1804.p5089==0)||(i42.u1591.p4487==1))") | G!"((i50.i0...199
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4504079086836766550
[2023-03-19 07:43:01] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4504079086836766550
Running compilation step : cd /tmp/ltsmin4504079086836766550;'/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/ltsmin4504079086836766550;'/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/ltsmin4504079086836766550;'/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 ShieldPPPs-PT-100B-LTLCardinality-01 finished in 213391 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((!(X((X(G(p0))||p1)) U (!p0 U p2))||p3)))'
Support contains 6 out of 6107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6107/6107 places, 5607/5607 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 6104 transition count 5604
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 6104 transition count 5604
Applied a total of 6 rules in 1697 ms. Remains 6104 /6107 variables (removed 3) and now considering 5604/5607 (removed 3) transitions.
// Phase 1: matrix 5604 rows 6104 cols
[2023-03-19 07:43:05] [INFO ] Computed 1101 place invariants in 43 ms
[2023-03-19 07:43:08] [INFO ] Implicit Places using invariants in 3027 ms returned []
[2023-03-19 07:43:08] [INFO ] Invariant cache hit.
[2023-03-19 07:43:11] [INFO ] Implicit Places using invariants and state equation in 3057 ms returned []
Implicit Place search using SMT with State Equation took 6086 ms to find 0 implicit places.
[2023-03-19 07:43:12] [INFO ] Invariant cache hit.
[2023-03-19 07:43:17] [INFO ] Dead Transitions using invariants and state equation in 5073 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6104/6107 places, 5604/5607 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12859 ms. Remains : 6104/6107 places, 5604/5607 transitions.
Stuttering acceptance computed with spot in 427 ms :[(AND p2 (NOT p3)), (AND p2 (NOT p3)), true, p2, (OR (AND p1 p2) (AND p0 p2)), p0, (AND p0 p2)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p3) p2), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p3) (NOT p0) (NOT p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 3}], [{ cond=(AND p2 p1), acceptance={} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=4 dest: 3}, { cond=(AND (NOT p2) p1), acceptance={} source=4 dest: 4}, { cond=(AND p2 (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=4 dest: 6}], [{ cond=p0, acceptance={0} source=5 dest: 5}], [{ cond=(AND p0 p2), acceptance={} source=6 dest: 5}, { cond=(AND p0 (NOT p2)), acceptance={} source=6 dest: 6}]], initial=0, aps=[p3:(AND (EQ s5153 0) (EQ s3596 1)), p2:(OR (EQ s1483 0) (EQ s979 1)), p0:(EQ s1884 1), p1:(EQ s5854 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-100B-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLCardinality-05 finished in 13393 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 U (p1||G(!p0))))))'
Support contains 6 out of 6107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6107/6107 places, 5607/5607 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 699 transitions
Trivial Post-agglo rules discarded 699 transitions
Performed 699 trivial Post agglomeration. Transition count delta: 699
Iterating post reduction 0 with 699 rules applied. Total rules applied 699 place count 6106 transition count 4907
Reduce places removed 699 places and 0 transitions.
Iterating post reduction 1 with 699 rules applied. Total rules applied 1398 place count 5407 transition count 4907
Performed 497 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 497 Pre rules applied. Total rules applied 1398 place count 5407 transition count 4410
Deduced a syphon composed of 497 places in 22 ms
Reduce places removed 497 places and 0 transitions.
Iterating global reduction 2 with 994 rules applied. Total rules applied 2392 place count 4910 transition count 4410
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 2397 place count 4905 transition count 4405
Iterating global reduction 2 with 5 rules applied. Total rules applied 2402 place count 4905 transition count 4405
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 2402 place count 4905 transition count 4402
Deduced a syphon composed of 3 places in 19 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 2408 place count 4902 transition count 4402
Performed 1792 Post agglomeration using F-continuation condition.Transition count delta: 1792
Deduced a syphon composed of 1792 places in 6 ms
Reduce places removed 1792 places and 0 transitions.
Iterating global reduction 2 with 3584 rules applied. Total rules applied 5992 place count 3110 transition count 2610
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5994 place count 3108 transition count 2608
Applied a total of 5994 rules in 1897 ms. Remains 3108 /6107 variables (removed 2999) and now considering 2608/5607 (removed 2999) transitions.
// Phase 1: matrix 2608 rows 3108 cols
[2023-03-19 07:43:19] [INFO ] Computed 1101 place invariants in 12 ms
[2023-03-19 07:43:21] [INFO ] Implicit Places using invariants in 2453 ms returned []
[2023-03-19 07:43:21] [INFO ] Invariant cache hit.
[2023-03-19 07:43:24] [INFO ] Implicit Places using invariants and state equation in 2621 ms returned []
Implicit Place search using SMT with State Equation took 5076 ms to find 0 implicit places.
[2023-03-19 07:43:24] [INFO ] Redundant transitions in 169 ms returned []
[2023-03-19 07:43:24] [INFO ] Invariant cache hit.
[2023-03-19 07:43:27] [INFO ] Dead Transitions using invariants and state equation in 2492 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3108/6107 places, 2608/5607 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9642 ms. Remains : 3108/6107 places, 2608/5607 transitions.
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLCardinality-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (OR (EQ s2180 0) (EQ s1178 1))) (NOT (OR (EQ s2703 0) (EQ s2205 1))) (OR (EQ s2047 0) (EQ s1038 1))), p0:(OR (EQ s2703 0) (EQ s2205 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 15340 steps with 4 reset in 284 ms.
FORMULA ShieldPPPs-PT-100B-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLCardinality-08 finished in 10065 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)))'
Support contains 3 out of 6107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6107/6107 places, 5607/5607 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 699 transitions
Trivial Post-agglo rules discarded 699 transitions
Performed 699 trivial Post agglomeration. Transition count delta: 699
Iterating post reduction 0 with 699 rules applied. Total rules applied 699 place count 6106 transition count 4907
Reduce places removed 699 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 700 rules applied. Total rules applied 1399 place count 5407 transition count 4906
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1400 place count 5406 transition count 4906
Performed 501 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 501 Pre rules applied. Total rules applied 1400 place count 5406 transition count 4405
Deduced a syphon composed of 501 places in 25 ms
Reduce places removed 501 places and 0 transitions.
Iterating global reduction 3 with 1002 rules applied. Total rules applied 2402 place count 4905 transition count 4405
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 2406 place count 4901 transition count 4401
Iterating global reduction 3 with 4 rules applied. Total rules applied 2410 place count 4901 transition count 4401
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 2410 place count 4901 transition count 4399
Deduced a syphon composed of 2 places in 20 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 2414 place count 4899 transition count 4399
Performed 1794 Post agglomeration using F-continuation condition.Transition count delta: 1794
Deduced a syphon composed of 1794 places in 8 ms
Reduce places removed 1794 places and 0 transitions.
Iterating global reduction 3 with 3588 rules applied. Total rules applied 6002 place count 3105 transition count 2605
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6004 place count 3103 transition count 2603
Applied a total of 6004 rules in 2197 ms. Remains 3103 /6107 variables (removed 3004) and now considering 2603/5607 (removed 3004) transitions.
// Phase 1: matrix 2603 rows 3103 cols
[2023-03-19 07:43:29] [INFO ] Computed 1101 place invariants in 11 ms
[2023-03-19 07:43:32] [INFO ] Implicit Places using invariants in 2599 ms returned []
[2023-03-19 07:43:32] [INFO ] Invariant cache hit.
[2023-03-19 07:43:35] [INFO ] Implicit Places using invariants and state equation in 2842 ms returned []
Implicit Place search using SMT with State Equation took 5445 ms to find 0 implicit places.
[2023-03-19 07:43:35] [INFO ] Redundant transitions in 98 ms returned []
[2023-03-19 07:43:35] [INFO ] Invariant cache hit.
[2023-03-19 07:43:37] [INFO ] Dead Transitions using invariants and state equation in 2259 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3103/6107 places, 2603/5607 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10018 ms. Remains : 3103/6107 places, 2603/5607 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLCardinality-11 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 (EQ s693 1) (OR (EQ s2235 0) (EQ s2714 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 6495 steps with 0 reset in 226 ms.
FORMULA ShieldPPPs-PT-100B-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLCardinality-11 finished in 10347 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p1))&&p0)))'
Support contains 8 out of 6107 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 6107/6107 places, 5607/5607 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 6102 transition count 5602
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 6102 transition count 5602
Applied a total of 10 rules in 1648 ms. Remains 6102 /6107 variables (removed 5) and now considering 5602/5607 (removed 5) transitions.
// Phase 1: matrix 5602 rows 6102 cols
[2023-03-19 07:43:39] [INFO ] Computed 1101 place invariants in 40 ms
[2023-03-19 07:43:42] [INFO ] Implicit Places using invariants in 2721 ms returned []
[2023-03-19 07:43:42] [INFO ] Invariant cache hit.
[2023-03-19 07:43:45] [INFO ] Implicit Places using invariants and state equation in 2692 ms returned []
Implicit Place search using SMT with State Equation took 5425 ms to find 0 implicit places.
[2023-03-19 07:43:45] [INFO ] Invariant cache hit.
[2023-03-19 07:43:49] [INFO ] Dead Transitions using invariants and state equation in 4855 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 6102/6107 places, 5602/5607 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11931 ms. Remains : 6102/6107 places, 5602/5607 transitions.
Stuttering acceptance computed with spot in 173 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLCardinality-14 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: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(AND (EQ s2844 0) (EQ s2599 1) (OR (AND (EQ s3342 0) (EQ s5626 1)) (AND (EQ s2334 0) (EQ s677 1)))), p1:(AND (EQ s1752 0) (EQ s2775 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, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ShieldPPPs-PT-100B-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLCardinality-14 finished in 12194 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)&&F(p1)))'
Support contains 3 out of 6107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6107/6107 places, 5607/5607 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 701 transitions
Trivial Post-agglo rules discarded 701 transitions
Performed 701 trivial Post agglomeration. Transition count delta: 701
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 6106 transition count 4905
Reduce places removed 701 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 702 rules applied. Total rules applied 1403 place count 5405 transition count 4904
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1404 place count 5404 transition count 4904
Performed 500 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 500 Pre rules applied. Total rules applied 1404 place count 5404 transition count 4404
Deduced a syphon composed of 500 places in 21 ms
Reduce places removed 500 places and 0 transitions.
Iterating global reduction 3 with 1000 rules applied. Total rules applied 2404 place count 4904 transition count 4404
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 2408 place count 4900 transition count 4400
Iterating global reduction 3 with 4 rules applied. Total rules applied 2412 place count 4900 transition count 4400
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 2412 place count 4900 transition count 4398
Deduced a syphon composed of 2 places in 21 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 2416 place count 4898 transition count 4398
Performed 1795 Post agglomeration using F-continuation condition.Transition count delta: 1795
Deduced a syphon composed of 1795 places in 6 ms
Reduce places removed 1795 places and 0 transitions.
Iterating global reduction 3 with 3590 rules applied. Total rules applied 6006 place count 3103 transition count 2603
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6008 place count 3101 transition count 2601
Applied a total of 6008 rules in 1904 ms. Remains 3101 /6107 variables (removed 3006) and now considering 2601/5607 (removed 3006) transitions.
// Phase 1: matrix 2601 rows 3101 cols
[2023-03-19 07:43:52] [INFO ] Computed 1101 place invariants in 10 ms
[2023-03-19 07:43:54] [INFO ] Implicit Places using invariants in 2517 ms returned []
[2023-03-19 07:43:54] [INFO ] Invariant cache hit.
[2023-03-19 07:43:59] [INFO ] Implicit Places using invariants and state equation in 4716 ms returned []
Implicit Place search using SMT with State Equation took 7235 ms to find 0 implicit places.
[2023-03-19 07:43:59] [INFO ] Redundant transitions in 65 ms returned []
[2023-03-19 07:43:59] [INFO ] Invariant cache hit.
[2023-03-19 07:44:01] [INFO ] Dead Transitions using invariants and state equation in 2197 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 3101/6107 places, 2601/5607 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11413 ms. Remains : 3101/6107 places, 2601/5607 transitions.
Stuttering acceptance computed with spot in 188 ms :[(NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ShieldPPPs-PT-100B-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=2, aps=[p1:(EQ s1674 1), p0:(OR (EQ s1532 0) (EQ s2354 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, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 9779 steps with 1 reset in 200 ms.
FORMULA ShieldPPPs-PT-100B-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldPPPs-PT-100B-LTLCardinality-15 finished in 11847 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(F(!(X(p0) U X(p1)))))&&X(F(X(X(p0))))))'
Found a Shortening insensitive property : ShieldPPPs-PT-100B-LTLCardinality-01
Stuttering acceptance computed with spot in 439 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), (OR (NOT p0) p1), p1, p1, (NOT p0)]
Support contains 4 out of 6107 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 6107/6107 places, 5607/5607 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 701 transitions
Trivial Post-agglo rules discarded 701 transitions
Performed 701 trivial Post agglomeration. Transition count delta: 701
Iterating post reduction 0 with 701 rules applied. Total rules applied 701 place count 6106 transition count 4905
Reduce places removed 701 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 702 rules applied. Total rules applied 1403 place count 5405 transition count 4904
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1404 place count 5404 transition count 4904
Performed 499 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 499 Pre rules applied. Total rules applied 1404 place count 5404 transition count 4405
Deduced a syphon composed of 499 places in 20 ms
Reduce places removed 499 places and 0 transitions.
Iterating global reduction 3 with 998 rules applied. Total rules applied 2402 place count 4905 transition count 4405
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 2406 place count 4901 transition count 4401
Iterating global reduction 3 with 4 rules applied. Total rules applied 2410 place count 4901 transition count 4401
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 2410 place count 4901 transition count 4398
Deduced a syphon composed of 3 places in 46 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 2416 place count 4898 transition count 4398
Performed 1792 Post agglomeration using F-continuation condition.Transition count delta: 1792
Deduced a syphon composed of 1792 places in 6 ms
Reduce places removed 1792 places and 0 transitions.
Iterating global reduction 3 with 3584 rules applied. Total rules applied 6000 place count 3106 transition count 2606
Renaming transitions due to excessive name length > 1024 char.
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6002 place count 3104 transition count 2604
Applied a total of 6002 rules in 2083 ms. Remains 3104 /6107 variables (removed 3003) and now considering 2604/5607 (removed 3003) transitions.
// Phase 1: matrix 2604 rows 3104 cols
[2023-03-19 07:44:04] [INFO ] Computed 1101 place invariants in 8 ms
[2023-03-19 07:44:07] [INFO ] Implicit Places using invariants in 2636 ms returned []
[2023-03-19 07:44:07] [INFO ] Invariant cache hit.
[2023-03-19 07:44:12] [INFO ] Implicit Places using invariants and state equation in 4739 ms returned []
Implicit Place search using SMT with State Equation took 7378 ms to find 0 implicit places.
[2023-03-19 07:44:12] [INFO ] Invariant cache hit.
[2023-03-19 07:44:13] [INFO ] Dead Transitions using invariants and state equation in 1480 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 3104/6107 places, 2604/5607 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 10942 ms. Remains : 3104/6107 places, 2604/5607 transitions.
Running random walk in product with property : ShieldPPPs-PT-100B-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 4}, { cond=true, acceptance={} source=3 dest: 5}, { cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}, { cond=p1, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 4}, { cond=true, acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(OR (EQ s2312 0) (EQ s2033 1)), p0:(OR (EQ s2432 0) (EQ s117 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 64 reset in 1528 ms.
Stuttering criterion allowed to conclude after 80915 steps with 47 reset in 1785 ms.
Treatment of property ShieldPPPs-PT-100B-LTLCardinality-01 finished in 14853 ms.
Length sensitive decision was in the wrong direction : Shortening insensitive + false
[2023-03-19 07:44:17] [INFO ] Flatten gal took : 144 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin6675294227645214175
[2023-03-19 07:44:17] [INFO ] Too many transitions (5607) to apply POR reductions. Disabling POR matrices.
[2023-03-19 07:44:17] [INFO ] Applying decomposition
[2023-03-19 07:44:17] [INFO ] Built C files in 107ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6675294227645214175
Running compilation step : cd /tmp/ltsmin6675294227645214175;'/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-19 07:44:17] [INFO ] Flatten gal took : 139 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/graph3010064843777568251.txt' '-o' '/tmp/graph3010064843777568251.bin' '-w' '/tmp/graph3010064843777568251.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph3010064843777568251.bin' '-l' '-1' '-v' '-w' '/tmp/graph3010064843777568251.weights' '-q' '0' '-e' '0.001'
[2023-03-19 07:44:17] [INFO ] Decomposing Gal with order
[2023-03-19 07:44:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 07:44:19] [INFO ] Removed a total of 900 redundant transitions.
[2023-03-19 07:44:19] [INFO ] Flatten gal took : 255 ms
[2023-03-19 07:44:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 21 ms.
[2023-03-19 07:44:19] [INFO ] Time to serialize gal into /tmp/LTLCardinality8552872373641404520.gal : 50 ms
[2023-03-19 07:44:19] [INFO ] Time to serialize properties into /tmp/LTLCardinality9149863117757730532.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/LTLCardinality8552872373641404520.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9149863117757730532.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(F(!((X("((i51.u1890.p5350==0)||(i3.u134.p346==1))"))U(X("((i49.u1799.p5089==0)||(i43.u1587.p4487==1))")))))))&&(X(F(X(X("((i51...199
Formula 0 simplified : XXX(FG("((i51.u1890.p5350==0)||(i3.u134.p346==1))" U "((i49.u1799.p5089==0)||(i43.u1587.p4487==1))") | G!"((i51.u1890.p5350==0)||(i3...172
Compilation finished in 20978 ms.
Running link step : cd /tmp/ltsmin6675294227645214175;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 138 ms.
Running LTSmin : cd /tmp/ltsmin6675294227645214175;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(<>([](<>(!(X((LTLAPp0==true)) U X((LTLAPp1==true))))))&&X(<>(X(X((LTLAPp0==true))))))' '--buchi-type=spotba'
LTSmin run took 159257 ms.
FORMULA ShieldPPPs-PT-100B-LTLCardinality-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 608690 ms.

BK_STOP 1679212037931

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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 LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ShieldPPPs-PT-100B"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is ShieldPPPs-PT-100B, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r389-oct2-167903713700523"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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