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

About the Execution of ITS-Tools for Szymanski-PT-b02

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
4905.556 1613026.00 3312752.00 3153.90 TFFFFFFFFTFTFTFF normal

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.r485-tall-167912699400452.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 Szymanski-PT-b02, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r485-tall-167912699400452
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.1M
-rw-r--r-- 1 mcc users 7.6K Feb 26 16:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 26 16:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 26 16:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 16:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:19 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:19 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:19 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:19 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 16:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Feb 26 16:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 16:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Feb 26 16:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:19 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 17:19 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 3.7M 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 Szymanski-PT-b02-LTLFireability-00
FORMULA_NAME Szymanski-PT-b02-LTLFireability-01
FORMULA_NAME Szymanski-PT-b02-LTLFireability-02
FORMULA_NAME Szymanski-PT-b02-LTLFireability-03
FORMULA_NAME Szymanski-PT-b02-LTLFireability-04
FORMULA_NAME Szymanski-PT-b02-LTLFireability-05
FORMULA_NAME Szymanski-PT-b02-LTLFireability-06
FORMULA_NAME Szymanski-PT-b02-LTLFireability-07
FORMULA_NAME Szymanski-PT-b02-LTLFireability-08
FORMULA_NAME Szymanski-PT-b02-LTLFireability-09
FORMULA_NAME Szymanski-PT-b02-LTLFireability-10
FORMULA_NAME Szymanski-PT-b02-LTLFireability-11
FORMULA_NAME Szymanski-PT-b02-LTLFireability-12
FORMULA_NAME Szymanski-PT-b02-LTLFireability-13
FORMULA_NAME Szymanski-PT-b02-LTLFireability-14
FORMULA_NAME Szymanski-PT-b02-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679223628986

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-b02
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-19 11:00:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-19 11:00:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 11:00:30] [INFO ] Load time of PNML (sax parser for PT used): 367 ms
[2023-03-19 11:00:30] [INFO ] Transformed 568 places.
[2023-03-19 11:00:30] [INFO ] Transformed 8320 transitions.
[2023-03-19 11:00:30] [INFO ] Parsed PT model containing 568 places and 8320 transitions and 33408 arcs in 519 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 260 places in 18 ms
Reduce places removed 260 places and 256 transitions.
FORMULA Szymanski-PT-b02-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-b02-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 54 out of 308 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 308/308 places, 8064/8064 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 306 transition count 8064
Applied a total of 2 rules in 128 ms. Remains 306 /308 variables (removed 2) and now considering 8064/8064 (removed 0) transitions.
[2023-03-19 11:00:31] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2023-03-19 11:00:31] [INFO ] Computed 1 place invariants in 47 ms
[2023-03-19 11:00:31] [INFO ] Implicit Places using invariants in 567 ms returned []
[2023-03-19 11:00:31] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2023-03-19 11:00:31] [INFO ] Invariant cache hit.
[2023-03-19 11:00:32] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:00:35] [INFO ] Implicit Places using invariants and state equation in 3849 ms returned []
Implicit Place search using SMT with State Equation took 4443 ms to find 0 implicit places.
[2023-03-19 11:00:35] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2023-03-19 11:00:35] [INFO ] Invariant cache hit.
[2023-03-19 11:00:37] [INFO ] Dead Transitions using invariants and state equation in 2053 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 306/308 places, 8064/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6631 ms. Remains : 306/308 places, 8064/8064 transitions.
Support contains 54 out of 306 places after structural reductions.
[2023-03-19 11:00:38] [INFO ] Flatten gal took : 386 ms
[2023-03-19 11:00:38] [INFO ] Flatten gal took : 264 ms
[2023-03-19 11:00:39] [INFO ] Input system was already deterministic with 8064 transitions.
Support contains 52 out of 306 places (down from 54) after GAL structural reductions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 442 ms. (steps per millisecond=22 ) properties (out of 29) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 28) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 28) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 27) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 26) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 25) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 25) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 24) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 23) seen :0
Running SMT prover for 23 properties.
[2023-03-19 11:00:39] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2023-03-19 11:00:39] [INFO ] Invariant cache hit.
[2023-03-19 11:00:40] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 11:01:05] [INFO ] After 24660ms SMT Verify possible using state equation in real domain returned unsat :1 sat :4 real:17
[2023-03-19 11:01:05] [INFO ] State equation strengthened by 147 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 11:01:05] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 11:01:05] [INFO ] After 25045ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 23 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 84 ms.
Support contains 41 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Applied a total of 0 rules in 408 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 409 ms. Remains : 306/306 places, 8064/8064 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 22) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 21) seen :0
Interrupted probabilistic random walk after 107798 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :{6=1, 19=1}
Probabilistic random walk after 107798 steps, saw 38950 distinct states, run finished after 3002 ms. (steps per millisecond=35 ) properties seen :2
Running SMT prover for 19 properties.
[2023-03-19 11:01:09] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2023-03-19 11:01:09] [INFO ] Invariant cache hit.
[2023-03-19 11:01:09] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 11:01:34] [INFO ] After 24595ms SMT Verify possible using state equation in real domain returned unsat :0 sat :6 real:12
[2023-03-19 11:01:34] [INFO ] State equation strengthened by 147 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.checkAtomicPropositionsLogic(AtomicReducerSR.java:105)
at fr.lip6.move.gal.application.solver.logic.AtomicReducerSR.strongReductions(AtomicReducerSR.java:44)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.preSolveForLogic(LTLPropertySolver.java:176)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:71)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-19 11:01:34] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-19 11:01:34] [INFO ] After 25038ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Fused 19 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 53 ms.
Support contains 36 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Drop transitions removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Iterating post reduction 0 with 55 rules applied. Total rules applied 55 place count 306 transition count 8009
Applied a total of 55 rules in 372 ms. Remains 306 /306 variables (removed 0) and now considering 8009/8064 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 373 ms. Remains : 306/306 places, 8009/8064 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 265 ms. (steps per millisecond=37 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 18) seen :0
Interrupted probabilistic random walk after 108945 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 108945 steps, saw 39444 distinct states, run finished after 3002 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 18 properties.
[2023-03-19 11:01:38] [INFO ] Flow matrix only has 2678 transitions (discarded 5331 similar events)
// Phase 1: matrix 2678 rows 306 cols
[2023-03-19 11:01:38] [INFO ] Computed 1 place invariants in 26 ms
[2023-03-19 11:01:38] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 11:02:00] [INFO ] After 22335ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:17
[2023-03-19 11:02:00] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:02:02] [INFO ] After 1272ms SMT Verify possible using 147 Read/Feed constraints in real domain returned unsat :0 sat :0 real:18
[2023-03-19 11:02:02] [INFO ] After 23916ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-03-19 11:02:02] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 11:02:20] [INFO ] After 17931ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2023-03-19 11:02:27] [INFO ] After 6788ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2023-03-19 11:02:27] [INFO ] After 6789ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-19 11:02:27] [INFO ] After 25014ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Parikh walk visited 0 properties in 203 ms.
Support contains 34 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 8009/8009 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 306 transition count 8008
Applied a total of 1 rules in 202 ms. Remains 306 /306 variables (removed 0) and now considering 8008/8009 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 219 ms. Remains : 306/306 places, 8008/8009 transitions.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 12 stabilizing places and 2432 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' '!((G(p0)||F(G(p1))))'
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 787 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 11:02:28] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 11:02:28] [INFO ] Computed 1 place invariants in 20 ms
[2023-03-19 11:02:29] [INFO ] Implicit Places using invariants in 971 ms returned []
[2023-03-19 11:02:29] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:02:29] [INFO ] Invariant cache hit.
[2023-03-19 11:02:30] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:02:37] [INFO ] Implicit Places using invariants and state equation in 8023 ms returned []
Implicit Place search using SMT with State Equation took 9003 ms to find 0 implicit places.
[2023-03-19 11:02:38] [INFO ] Redundant transitions in 931 ms returned []
[2023-03-19 11:02:38] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:02:38] [INFO ] Invariant cache hit.
[2023-03-19 11:02:40] [INFO ] Dead Transitions using invariants and state equation in 1911 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12649 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 207 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Szymanski-PT-b02-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s100 1) (GEQ s295 1)), p1:(AND (GEQ s88 1) (GEQ s287 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 83 steps with 0 reset in 6 ms.
FORMULA Szymanski-PT-b02-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b02-LTLFireability-01 finished in 12955 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Support contains 6 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 264 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 11:02:40] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:02:40] [INFO ] Invariant cache hit.
[2023-03-19 11:02:41] [INFO ] Implicit Places using invariants in 403 ms returned []
[2023-03-19 11:02:41] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:02:41] [INFO ] Invariant cache hit.
[2023-03-19 11:02:41] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:02:48] [INFO ] Implicit Places using invariants and state equation in 7624 ms returned []
Implicit Place search using SMT with State Equation took 8039 ms to find 0 implicit places.
[2023-03-19 11:02:49] [INFO ] Redundant transitions in 900 ms returned []
[2023-03-19 11:02:49] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:02:49] [INFO ] Invariant cache hit.
[2023-03-19 11:02:51] [INFO ] Dead Transitions using invariants and state equation in 2083 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11295 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 48 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : Szymanski-PT-b02-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p1:(AND (OR (LT s27 1) (LT s295 1)) (OR (LT s47 1) (LT s290 1))), p0:(AND (GEQ s29 1) (GEQ s261 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 675 ms.
Product exploration explored 100000 steps with 0 reset in 592 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 273 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 123875 steps, run timeout after 3001 ms. (steps per millisecond=41 ) properties seen :{}
Probabilistic random walk after 123875 steps, saw 44747 distinct states, run finished after 3001 ms. (steps per millisecond=41 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-19 11:02:56] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:02:56] [INFO ] Invariant cache hit.
[2023-03-19 11:02:56] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 11:02:56] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 11:02:57] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 11:03:02] [INFO ] After 5721ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 11:03:02] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:03:20] [INFO ] After 18119ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-19 11:03:20] [INFO ] After 23931ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 25 ms.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 123 transitions
Reduce isomorphic transitions removed 123 transitions.
Iterating post reduction 0 with 123 rules applied. Total rules applied 123 place count 305 transition count 7813
Applied a total of 123 rules in 251 ms. Remains 305 /305 variables (removed 0) and now considering 7813/7936 (removed 123) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 252 ms. Remains : 305/305 places, 7813/7936 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 141458 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :{}
Probabilistic random walk after 141458 steps, saw 48675 distinct states, run finished after 3001 ms. (steps per millisecond=47 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-19 11:03:24] [INFO ] Flow matrix only has 2609 transitions (discarded 5204 similar events)
// Phase 1: matrix 2609 rows 305 cols
[2023-03-19 11:03:24] [INFO ] Computed 1 place invariants in 17 ms
[2023-03-19 11:03:24] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 11:03:24] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 11:03:24] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 11:03:27] [INFO ] After 3150ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 11:03:27] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:03:45] [INFO ] After 18098ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-19 11:03:45] [INFO ] After 21326ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 6 ms.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7813/7813 transitions.
Applied a total of 0 rules in 179 ms. Remains 305 /305 variables (removed 0) and now considering 7813/7813 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 305/305 places, 7813/7813 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7813/7813 transitions.
Applied a total of 0 rules in 180 ms. Remains 305 /305 variables (removed 0) and now considering 7813/7813 (removed 0) transitions.
[2023-03-19 11:03:46] [INFO ] Flow matrix only has 2609 transitions (discarded 5204 similar events)
[2023-03-19 11:03:46] [INFO ] Invariant cache hit.
[2023-03-19 11:03:46] [INFO ] Implicit Places using invariants in 398 ms returned []
[2023-03-19 11:03:46] [INFO ] Flow matrix only has 2609 transitions (discarded 5204 similar events)
[2023-03-19 11:03:46] [INFO ] Invariant cache hit.
[2023-03-19 11:03:47] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:03:53] [INFO ] Implicit Places using invariants and state equation in 6705 ms returned []
Implicit Place search using SMT with State Equation took 7105 ms to find 0 implicit places.
[2023-03-19 11:03:53] [INFO ] Redundant transitions in 641 ms returned []
[2023-03-19 11:03:53] [INFO ] Flow matrix only has 2609 transitions (discarded 5204 similar events)
[2023-03-19 11:03:53] [INFO ] Invariant cache hit.
[2023-03-19 11:03:55] [INFO ] Dead Transitions using invariants and state equation in 1832 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9775 ms. Remains : 305/305 places, 7813/7813 transitions.
Graph (trivial) has 4624 edges and 305 vertex of which 36 / 305 are part of one of the 2 SCC in 5 ms
Free SCC test removed 34 places
Drop transitions removed 3880 transitions
Ensure Unique test removed 1562 transitions
Reduce isomorphic transitions removed 5442 transitions.
Drop transitions removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 0 with 416 rules applied. Total rules applied 417 place count 271 transition count 1955
Applied a total of 417 rules in 193 ms. Remains 271 /305 variables (removed 34) and now considering 1955/7813 (removed 5858) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1955 rows 271 cols
[2023-03-19 11:03:55] [INFO ] Computed 1 place invariants in 15 ms
[2023-03-19 11:03:56] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 11:03:56] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 11:03:56] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 11:03:56] [INFO ] After 681ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 11:03:56] [INFO ] State equation strengthened by 504 read => feed constraints.
[2023-03-19 11:03:58] [INFO ] After 1728ms SMT Verify possible using 504 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 11:04:08] [INFO ] After 11401ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 12212 ms.
[2023-03-19 11:04:20] [INFO ] After 24362ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 174 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 186 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 11:04:20] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 11:04:20] [INFO ] Computed 1 place invariants in 20 ms
[2023-03-19 11:04:21] [INFO ] Implicit Places using invariants in 440 ms returned []
[2023-03-19 11:04:21] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:04:21] [INFO ] Invariant cache hit.
[2023-03-19 11:04:21] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:04:27] [INFO ] Implicit Places using invariants and state equation in 6386 ms returned []
Implicit Place search using SMT with State Equation took 6841 ms to find 0 implicit places.
[2023-03-19 11:04:28] [INFO ] Redundant transitions in 661 ms returned []
[2023-03-19 11:04:28] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:04:28] [INFO ] Invariant cache hit.
[2023-03-19 11:04:30] [INFO ] Dead Transitions using invariants and state equation in 2193 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9891 ms. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 244 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 113697 steps, run timeout after 3001 ms. (steps per millisecond=37 ) properties seen :{}
Probabilistic random walk after 113697 steps, saw 41634 distinct states, run finished after 3001 ms. (steps per millisecond=37 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-19 11:04:34] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:04:34] [INFO ] Invariant cache hit.
[2023-03-19 11:04:34] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 11:04:34] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 11:04:34] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 11:04:39] [INFO ] After 5757ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 11:04:39] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:04:58] [INFO ] After 18092ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :0
[2023-03-19 11:04:58] [INFO ] After 23940ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 25 ms.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 123 transitions
Reduce isomorphic transitions removed 123 transitions.
Iterating post reduction 0 with 123 rules applied. Total rules applied 123 place count 305 transition count 7813
Applied a total of 123 rules in 186 ms. Remains 305 /305 variables (removed 0) and now considering 7813/7936 (removed 123) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 186 ms. Remains : 305/305 places, 7813/7936 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 140975 steps, run timeout after 3001 ms. (steps per millisecond=46 ) properties seen :{}
Probabilistic random walk after 140975 steps, saw 48552 distinct states, run finished after 3001 ms. (steps per millisecond=46 ) properties seen :0
Running SMT prover for 2 properties.
[2023-03-19 11:05:01] [INFO ] Flow matrix only has 2609 transitions (discarded 5204 similar events)
// Phase 1: matrix 2609 rows 305 cols
[2023-03-19 11:05:01] [INFO ] Computed 1 place invariants in 17 ms
[2023-03-19 11:05:01] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 11:05:01] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 11:05:01] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 11:05:04] [INFO ] After 3403ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 11:05:04] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:05:22] [INFO ] After 17211ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 11:05:26] [INFO ] After 21531ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-19 11:05:26] [INFO ] After 25013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 8 ms.
Support contains 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7813/7813 transitions.
Applied a total of 0 rules in 180 ms. Remains 305 /305 variables (removed 0) and now considering 7813/7813 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 180 ms. Remains : 305/305 places, 7813/7813 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7813/7813 transitions.
Applied a total of 0 rules in 178 ms. Remains 305 /305 variables (removed 0) and now considering 7813/7813 (removed 0) transitions.
[2023-03-19 11:05:26] [INFO ] Flow matrix only has 2609 transitions (discarded 5204 similar events)
[2023-03-19 11:05:26] [INFO ] Invariant cache hit.
[2023-03-19 11:05:27] [INFO ] Implicit Places using invariants in 425 ms returned []
[2023-03-19 11:05:27] [INFO ] Flow matrix only has 2609 transitions (discarded 5204 similar events)
[2023-03-19 11:05:27] [INFO ] Invariant cache hit.
[2023-03-19 11:05:27] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:05:34] [INFO ] Implicit Places using invariants and state equation in 7454 ms returned []
Implicit Place search using SMT with State Equation took 7894 ms to find 0 implicit places.
[2023-03-19 11:05:35] [INFO ] Redundant transitions in 679 ms returned []
[2023-03-19 11:05:35] [INFO ] Flow matrix only has 2609 transitions (discarded 5204 similar events)
[2023-03-19 11:05:35] [INFO ] Invariant cache hit.
[2023-03-19 11:05:37] [INFO ] Dead Transitions using invariants and state equation in 2119 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10904 ms. Remains : 305/305 places, 7813/7813 transitions.
Graph (trivial) has 4624 edges and 305 vertex of which 36 / 305 are part of one of the 2 SCC in 1 ms
Free SCC test removed 34 places
Drop transitions removed 3880 transitions
Ensure Unique test removed 1562 transitions
Reduce isomorphic transitions removed 5442 transitions.
Drop transitions removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 0 with 416 rules applied. Total rules applied 417 place count 271 transition count 1955
Applied a total of 417 rules in 146 ms. Remains 271 /305 variables (removed 34) and now considering 1955/7813 (removed 5858) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 1955 rows 271 cols
[2023-03-19 11:05:37] [INFO ] Computed 1 place invariants in 8 ms
[2023-03-19 11:05:37] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 11:05:37] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 11:05:37] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 11:05:38] [INFO ] After 681ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 11:05:38] [INFO ] State equation strengthened by 504 read => feed constraints.
[2023-03-19 11:05:40] [INFO ] After 1699ms SMT Verify possible using 504 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-19 11:05:50] [INFO ] After 11926ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 15053 ms.
[2023-03-19 11:06:05] [INFO ] After 27729ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND (NOT p0) p1)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 197 ms. Reduced automaton from 1 states, 2 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 568 ms.
Product exploration explored 100000 steps with 0 reset in 527 ms.
Built C files in :
/tmp/ltsmin18253040451355316947
[2023-03-19 11:06:07] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2023-03-19 11:06:07] [INFO ] Built C files in 131ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18253040451355316947
Running compilation step : cd /tmp/ltsmin18253040451355316947;'/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/ltsmin18253040451355316947;'/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/ltsmin18253040451355316947;'/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 6 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 180 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 11:06:10] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 11:06:10] [INFO ] Computed 1 place invariants in 22 ms
[2023-03-19 11:06:10] [INFO ] Implicit Places using invariants in 412 ms returned []
[2023-03-19 11:06:10] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:06:10] [INFO ] Invariant cache hit.
[2023-03-19 11:06:11] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:06:17] [INFO ] Implicit Places using invariants and state equation in 6324 ms returned []
Implicit Place search using SMT with State Equation took 6772 ms to find 0 implicit places.
[2023-03-19 11:06:17] [INFO ] Redundant transitions in 652 ms returned []
[2023-03-19 11:06:17] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:06:17] [INFO ] Invariant cache hit.
[2023-03-19 11:06:19] [INFO ] Dead Transitions using invariants and state equation in 2124 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9738 ms. Remains : 305/305 places, 7936/7936 transitions.
Built C files in :
/tmp/ltsmin4502396864135392776
[2023-03-19 11:06:20] [INFO ] Too many transitions (7936) to apply POR reductions. Disabling POR matrices.
[2023-03-19 11:06:20] [INFO ] Built C files in 69ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4502396864135392776
Running compilation step : cd /tmp/ltsmin4502396864135392776;'/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/ltsmin4502396864135392776;'/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/ltsmin4502396864135392776;'/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 11:06:23] [INFO ] Flatten gal took : 235 ms
[2023-03-19 11:06:24] [INFO ] Flatten gal took : 360 ms
[2023-03-19 11:06:24] [INFO ] Time to serialize gal into /tmp/LTL11403865816011907242.gal : 87 ms
[2023-03-19 11:06:24] [INFO ] Time to serialize properties into /tmp/LTL13321233110576108101.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/LTL11403865816011907242.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6097461069326521783.hoa' '-atoms' '/tmp/LTL13321233110576108101.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/LTL13321233110576108101.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6097461069326521783.hoa
Detected timeout of ITS tools.
[2023-03-19 11:06:40] [INFO ] Flatten gal took : 216 ms
[2023-03-19 11:06:40] [INFO ] Flatten gal took : 191 ms
[2023-03-19 11:06:40] [INFO ] Time to serialize gal into /tmp/LTL18164375603940233431.gal : 74 ms
[2023-03-19 11:06:40] [INFO ] Time to serialize properties into /tmp/LTL13121343899239545619.ltl : 17 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/LTL18164375603940233431.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13121343899239545619.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...277
Read 1 LTL properties
Checking formula 0 : !((F((G("(((p27<1)||(l41<1))&&((p47<1)||(l36<1)))"))||("((p29>=1)&&(l5>=1))"))))
Formula 0 simplified : G(!"((p29>=1)&&(l5>=1))" & F!"(((p27<1)||(l41<1))&&((p47<1)||(l36<1)))")
Detected timeout of ITS tools.
[2023-03-19 11:06:55] [INFO ] Flatten gal took : 197 ms
[2023-03-19 11:06:55] [INFO ] Applying decomposition
[2023-03-19 11:06:55] [INFO ] Flatten gal took : 184 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/graph653590645864017434.txt' '-o' '/tmp/graph653590645864017434.bin' '-w' '/tmp/graph653590645864017434.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph653590645864017434.bin' '-l' '-1' '-v' '-w' '/tmp/graph653590645864017434.weights' '-q' '0' '-e' '0.001'
[2023-03-19 11:06:56] [INFO ] Decomposing Gal with order
[2023-03-19 11:06:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 11:06:57] [INFO ] Removed a total of 18365 redundant transitions.
[2023-03-19 11:06:57] [INFO ] Flatten gal took : 1297 ms
[2023-03-19 11:06:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 1049 labels/synchronizations in 479 ms.
[2023-03-19 11:06:58] [INFO ] Time to serialize gal into /tmp/LTL6610167435061954257.gal : 45 ms
[2023-03-19 11:06:58] [INFO ] Time to serialize properties into /tmp/LTL10167584231622420951.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6610167435061954257.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10167584231622420951.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...255
Read 1 LTL properties
Checking formula 0 : !((F((G("(((i6.i0.u7.p27<1)||(i7.u60.l41<1))&&((i1.i0.u16.p47<1)||(i7.u58.l36<1)))"))||("((i6.i1.u10.p29>=1)&&(i1.i1.u46.l5>=1))"))))
Formula 0 simplified : G(!"((i6.i1.u10.p29>=1)&&(i1.i1.u46.l5>=1))" & F!"(((i6.i0.u7.p27<1)||(i7.u60.l41<1))&&((i1.i0.u16.p47<1)||(i7.u58.l36<1)))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10541337238171007879
[2023-03-19 11:07:13] [INFO ] Built C files in 61ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10541337238171007879
Running compilation step : cd /tmp/ltsmin10541337238171007879;'/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/ltsmin10541337238171007879;'/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/ltsmin10541337238171007879;'/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 Szymanski-PT-b02-LTLFireability-02 finished in 276270 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((X(p1)&&p0)))'
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 43 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 11:07:16] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:07:16] [INFO ] Invariant cache hit.
[2023-03-19 11:07:17] [INFO ] Implicit Places using invariants in 476 ms returned []
[2023-03-19 11:07:17] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:07:17] [INFO ] Invariant cache hit.
[2023-03-19 11:07:17] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:07:24] [INFO ] Implicit Places using invariants and state equation in 6920 ms returned []
Implicit Place search using SMT with State Equation took 7417 ms to find 0 implicit places.
[2023-03-19 11:07:24] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:07:24] [INFO ] Invariant cache hit.
[2023-03-19 11:07:26] [INFO ] Dead Transitions using invariants and state equation in 2408 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9874 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 101 ms :[(OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : Szymanski-PT-b02-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s39 1) (GEQ s270 1)), p1:(OR (LT s25 1) (LT s302 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 118 steps with 0 reset in 1 ms.
FORMULA Szymanski-PT-b02-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b02-LTLFireability-03 finished in 9997 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p1)||p0))))'
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 46 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 11:07:26] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:07:26] [INFO ] Invariant cache hit.
[2023-03-19 11:07:27] [INFO ] Implicit Places using invariants in 432 ms returned []
[2023-03-19 11:07:27] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:07:27] [INFO ] Invariant cache hit.
[2023-03-19 11:07:27] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:07:34] [INFO ] Implicit Places using invariants and state equation in 7369 ms returned []
Implicit Place search using SMT with State Equation took 7831 ms to find 0 implicit places.
[2023-03-19 11:07:34] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:07:34] [INFO ] Invariant cache hit.
[2023-03-19 11:07:36] [INFO ] Dead Transitions using invariants and state equation in 2096 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9984 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 129 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Szymanski-PT-b02-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (GEQ s58 1) (GEQ s274 1)), p0:(OR (LT s16 1) (LT s275 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]]
Product exploration explored 100000 steps with 0 reset in 447 ms.
Product exploration explored 100000 steps with 0 reset in 429 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 359 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 121 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 110507 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 110507 steps, saw 40566 distinct states, run finished after 3001 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-19 11:07:41] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:07:41] [INFO ] Invariant cache hit.
[2023-03-19 11:07:41] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 11:07:43] [INFO ] After 1507ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-19 11:07:43] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 11:07:49] [INFO ] After 5830ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-19 11:07:49] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:08:08] [INFO ] After 19109ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :1 sat :0
[2023-03-19 11:08:08] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 9 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 125 transitions
Reduce isomorphic transitions removed 125 transitions.
Iterating post reduction 0 with 125 rules applied. Total rules applied 125 place count 305 transition count 7811
Applied a total of 125 rules in 195 ms. Remains 305 /305 variables (removed 0) and now considering 7811/7936 (removed 125) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 195 ms. Remains : 305/305 places, 7811/7936 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 162 ms. (steps per millisecond=61 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 86165 steps, run timeout after 3001 ms. (steps per millisecond=28 ) properties seen :{}
Probabilistic random walk after 86165 steps, saw 31936 distinct states, run finished after 3001 ms. (steps per millisecond=28 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-19 11:08:11] [INFO ] Flow matrix only has 2607 transitions (discarded 5204 similar events)
// Phase 1: matrix 2607 rows 305 cols
[2023-03-19 11:08:11] [INFO ] Computed 1 place invariants in 13 ms
[2023-03-19 11:08:11] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 11:08:13] [INFO ] After 1631ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 11:08:13] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 11:08:16] [INFO ] After 3245ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 11:08:16] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:08:38] [INFO ] After 21694ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 11:08:38] [INFO ] After 21695ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-19 11:08:38] [INFO ] After 25017ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 27 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7811/7811 transitions.
Applied a total of 0 rules in 184 ms. Remains 305 /305 variables (removed 0) and now considering 7811/7811 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 305/305 places, 7811/7811 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7811/7811 transitions.
Applied a total of 0 rules in 173 ms. Remains 305 /305 variables (removed 0) and now considering 7811/7811 (removed 0) transitions.
[2023-03-19 11:08:38] [INFO ] Flow matrix only has 2607 transitions (discarded 5204 similar events)
[2023-03-19 11:08:38] [INFO ] Invariant cache hit.
[2023-03-19 11:08:39] [INFO ] Implicit Places using invariants in 437 ms returned []
[2023-03-19 11:08:39] [INFO ] Flow matrix only has 2607 transitions (discarded 5204 similar events)
[2023-03-19 11:08:39] [INFO ] Invariant cache hit.
[2023-03-19 11:08:39] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:08:45] [INFO ] Implicit Places using invariants and state equation in 6287 ms returned []
Implicit Place search using SMT with State Equation took 6740 ms to find 0 implicit places.
[2023-03-19 11:08:46] [INFO ] Redundant transitions in 660 ms returned []
[2023-03-19 11:08:46] [INFO ] Flow matrix only has 2607 transitions (discarded 5204 similar events)
[2023-03-19 11:08:46] [INFO ] Invariant cache hit.
[2023-03-19 11:08:48] [INFO ] Dead Transitions using invariants and state equation in 1995 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9580 ms. Remains : 305/305 places, 7811/7811 transitions.
Graph (trivial) has 4872 edges and 305 vertex of which 35 / 305 are part of one of the 2 SCC in 1 ms
Free SCC test removed 33 places
Drop transitions removed 3744 transitions
Ensure Unique test removed 1697 transitions
Reduce isomorphic transitions removed 5441 transitions.
Drop transitions removed 320 transitions
Redundant transition composition rules discarded 320 transitions
Iterating global reduction 0 with 320 rules applied. Total rules applied 321 place count 272 transition count 2050
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 322 place count 272 transition count 2049
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 323 place count 271 transition count 2049
Drop transitions removed 112 transitions
Redundant transition composition rules discarded 112 transitions
Iterating global reduction 1 with 112 rules applied. Total rules applied 435 place count 271 transition count 1937
Applied a total of 435 rules in 211 ms. Remains 271 /305 variables (removed 34) and now considering 1937/7811 (removed 5874) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 1937 rows 271 cols
[2023-03-19 11:08:48] [INFO ] Computed 1 place invariants in 14 ms
[2023-03-19 11:08:48] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 11:08:49] [INFO ] After 636ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 11:08:49] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 11:08:49] [INFO ] After 660ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 11:08:49] [INFO ] State equation strengthened by 480 read => feed constraints.
[2023-03-19 11:08:52] [INFO ] After 2096ms SMT Verify possible using 480 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-19 11:08:55] [INFO ] After 5313ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 5337 ms.
[2023-03-19 11:09:00] [INFO ] After 11380ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 387 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 305 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 31 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 11:09:01] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 11:09:01] [INFO ] Computed 1 place invariants in 13 ms
[2023-03-19 11:09:01] [INFO ] Implicit Places using invariants in 412 ms returned []
[2023-03-19 11:09:01] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:09:01] [INFO ] Invariant cache hit.
[2023-03-19 11:09:02] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:09:08] [INFO ] Implicit Places using invariants and state equation in 6375 ms returned []
Implicit Place search using SMT with State Equation took 6804 ms to find 0 implicit places.
[2023-03-19 11:09:08] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:09:08] [INFO ] Invariant cache hit.
[2023-03-19 11:09:10] [INFO ] Dead Transitions using invariants and state equation in 2079 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8916 ms. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 137 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 146252 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 146252 steps, saw 50546 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 11:09:13] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:09:13] [INFO ] Invariant cache hit.
[2023-03-19 11:09:13] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 11:09:14] [INFO ] After 1449ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 11:09:14] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 11:09:17] [INFO ] After 2404ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 11:09:17] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:09:22] [INFO ] After 4806ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 11:09:31] [INFO ] After 13813ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-19 11:09:31] [INFO ] After 16282ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 305 transition count 7810
Applied a total of 126 rules in 209 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7936 (removed 126) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 211 ms. Remains : 305/305 places, 7810/7936 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 152248 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :{}
Probabilistic random walk after 152248 steps, saw 51706 distinct states, run finished after 3001 ms. (steps per millisecond=50 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 11:09:34] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2023-03-19 11:09:34] [INFO ] Computed 1 place invariants in 21 ms
[2023-03-19 11:09:34] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 11:09:36] [INFO ] After 2256ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 11:09:36] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 11:09:37] [INFO ] After 1150ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 11:09:37] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:09:40] [INFO ] After 2789ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 11:09:42] [INFO ] Deduced a trap composed of 138 places in 372 ms of which 2 ms to minimize.
[2023-03-19 11:09:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 501 ms
[2023-03-19 11:09:42] [INFO ] After 4812ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 659 ms.
[2023-03-19 11:09:43] [INFO ] After 6696ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 178 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 305/305 places, 7810/7810 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 172 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
[2023-03-19 11:09:43] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2023-03-19 11:09:43] [INFO ] Invariant cache hit.
[2023-03-19 11:09:44] [INFO ] Implicit Places using invariants in 416 ms returned []
[2023-03-19 11:09:44] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2023-03-19 11:09:44] [INFO ] Invariant cache hit.
[2023-03-19 11:09:44] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:09:50] [INFO ] Implicit Places using invariants and state equation in 6555 ms returned []
Implicit Place search using SMT with State Equation took 6978 ms to find 0 implicit places.
[2023-03-19 11:09:51] [INFO ] Redundant transitions in 672 ms returned []
[2023-03-19 11:09:51] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2023-03-19 11:09:51] [INFO ] Invariant cache hit.
[2023-03-19 11:09:53] [INFO ] Dead Transitions using invariants and state equation in 2039 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9872 ms. Remains : 305/305 places, 7810/7810 transitions.
Graph (trivial) has 5008 edges and 305 vertex of which 37 / 305 are part of one of the 2 SCC in 1 ms
Free SCC test removed 35 places
Drop transitions removed 4008 transitions
Ensure Unique test removed 1436 transitions
Reduce isomorphic transitions removed 5444 transitions.
Drop transitions removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 0 with 416 rules applied. Total rules applied 417 place count 270 transition count 1950
Applied a total of 417 rules in 122 ms. Remains 270 /305 variables (removed 35) and now considering 1950/7810 (removed 5860) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1950 rows 270 cols
[2023-03-19 11:09:53] [INFO ] Computed 1 place invariants in 15 ms
[2023-03-19 11:09:53] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 11:09:54] [INFO ] After 631ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 11:09:54] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 11:09:54] [INFO ] After 553ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 11:09:54] [INFO ] State equation strengthened by 504 read => feed constraints.
[2023-03-19 11:09:55] [INFO ] After 676ms SMT Verify possible using 504 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 11:09:55] [INFO ] After 781ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 52 ms.
[2023-03-19 11:09:55] [INFO ] After 1467ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 135 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 174 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 413 ms.
Product exploration explored 100000 steps with 0 reset in 433 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 210 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 11:09:58] [INFO ] Redundant transitions in 653 ms returned []
[2023-03-19 11:09:58] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 11:09:58] [INFO ] Computed 1 place invariants in 21 ms
[2023-03-19 11:10:00] [INFO ] Dead Transitions using invariants and state equation in 2044 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2917 ms. Remains : 305/305 places, 7936/7936 transitions.
Built C files in :
/tmp/ltsmin13540100838932421177
[2023-03-19 11:10:00] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13540100838932421177
Running compilation step : cd /tmp/ltsmin13540100838932421177;'/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/ltsmin13540100838932421177;'/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/ltsmin13540100838932421177;'/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 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 34 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 11:10:03] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:10:03] [INFO ] Invariant cache hit.
[2023-03-19 11:10:03] [INFO ] Implicit Places using invariants in 427 ms returned []
[2023-03-19 11:10:03] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:10:03] [INFO ] Invariant cache hit.
[2023-03-19 11:10:04] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:10:10] [INFO ] Implicit Places using invariants and state equation in 6678 ms returned []
Implicit Place search using SMT with State Equation took 7106 ms to find 0 implicit places.
[2023-03-19 11:10:10] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:10:10] [INFO ] Invariant cache hit.
[2023-03-19 11:10:12] [INFO ] Dead Transitions using invariants and state equation in 2040 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9181 ms. Remains : 305/305 places, 7936/7936 transitions.
Built C files in :
/tmp/ltsmin1461189356728454936
[2023-03-19 11:10:12] [INFO ] Built C files in 73ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1461189356728454936
Running compilation step : cd /tmp/ltsmin1461189356728454936;'/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/ltsmin1461189356728454936;'/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/ltsmin1461189356728454936;'/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 11:10:16] [INFO ] Flatten gal took : 210 ms
[2023-03-19 11:10:16] [INFO ] Flatten gal took : 212 ms
[2023-03-19 11:10:16] [INFO ] Time to serialize gal into /tmp/LTL3302772009612585744.gal : 29 ms
[2023-03-19 11:10:16] [INFO ] Time to serialize properties into /tmp/LTL8046785194390057287.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3302772009612585744.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17270568253521372873.hoa' '-atoms' '/tmp/LTL8046785194390057287.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...318
Loading property file /tmp/LTL8046785194390057287.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17270568253521372873.hoa
Detected timeout of ITS tools.
[2023-03-19 11:10:31] [INFO ] Flatten gal took : 228 ms
[2023-03-19 11:10:31] [INFO ] Flatten gal took : 190 ms
[2023-03-19 11:10:31] [INFO ] Time to serialize gal into /tmp/LTL13090824748990802579.gal : 26 ms
[2023-03-19 11:10:31] [INFO ] Time to serialize properties into /tmp/LTL10066923189987071855.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/LTL13090824748990802579.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10066923189987071855.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...277
Read 1 LTL properties
Checking formula 0 : !((X(G(("((p16<1)||(l19<1))")||(G("((p58>=1)&&(l18>=1))"))))))
Formula 0 simplified : XF(!"((p16<1)||(l19<1))" & F!"((p58>=1)&&(l18>=1))")
Detected timeout of ITS tools.
[2023-03-19 11:10:47] [INFO ] Flatten gal took : 176 ms
[2023-03-19 11:10:47] [INFO ] Applying decomposition
[2023-03-19 11:10:47] [INFO ] Flatten gal took : 197 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/graph5011055416522502023.txt' '-o' '/tmp/graph5011055416522502023.bin' '-w' '/tmp/graph5011055416522502023.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5011055416522502023.bin' '-l' '-1' '-v' '-w' '/tmp/graph5011055416522502023.weights' '-q' '0' '-e' '0.001'
[2023-03-19 11:10:47] [INFO ] Decomposing Gal with order
[2023-03-19 11:10:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 11:10:48] [INFO ] Removed a total of 17839 redundant transitions.
[2023-03-19 11:10:48] [INFO ] Flatten gal took : 456 ms
[2023-03-19 11:10:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 1054 labels/synchronizations in 298 ms.
[2023-03-19 11:10:48] [INFO ] Time to serialize gal into /tmp/LTL7903897491976607281.gal : 29 ms
[2023-03-19 11:10:48] [INFO ] Time to serialize properties into /tmp/LTL13389991824812516986.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7903897491976607281.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13389991824812516986.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...255
Read 1 LTL properties
Checking formula 0 : !((X(G(("((i4.u49.p16<1)||(i4.u50.l19<1))")||(G("((i7.u18.p58>=1)&&(i4.u50.l18>=1))"))))))
Formula 0 simplified : XF(!"((i4.u49.p16<1)||(i4.u50.l19<1))" & F!"((i7.u18.p58>=1)&&(i4.u50.l18>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3134503002320515526
[2023-03-19 11:11:03] [INFO ] Built C files in 88ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3134503002320515526
Running compilation step : cd /tmp/ltsmin3134503002320515526;'/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/ltsmin3134503002320515526;'/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/ltsmin3134503002320515526;'/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 Szymanski-PT-b02-LTLFireability-04 finished in 219953 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((G(p0)||G(F(p1))))))'
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 43 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 11:11:06] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:11:06] [INFO ] Invariant cache hit.
[2023-03-19 11:11:07] [INFO ] Implicit Places using invariants in 467 ms returned []
[2023-03-19 11:11:07] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:11:07] [INFO ] Invariant cache hit.
[2023-03-19 11:11:07] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:11:14] [INFO ] Implicit Places using invariants and state equation in 7207 ms returned []
Implicit Place search using SMT with State Equation took 7679 ms to find 0 implicit places.
[2023-03-19 11:11:14] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:11:14] [INFO ] Invariant cache hit.
[2023-03-19 11:11:16] [INFO ] Dead Transitions using invariants and state equation in 1889 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9613 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : Szymanski-PT-b02-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s58 1) (GEQ s300 1)), p1:(AND (GEQ s120 1) (GEQ s256 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 449 ms.
Stack based approach found an accepted trace after 58 steps with 0 reset with depth 59 and stack size 59 in 2 ms.
FORMULA Szymanski-PT-b02-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property Szymanski-PT-b02-LTLFireability-05 finished in 10290 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 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 216 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 11:11:17] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:11:17] [INFO ] Invariant cache hit.
[2023-03-19 11:11:17] [INFO ] Implicit Places using invariants in 428 ms returned []
[2023-03-19 11:11:17] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:11:17] [INFO ] Invariant cache hit.
[2023-03-19 11:11:18] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:11:24] [INFO ] Implicit Places using invariants and state equation in 6763 ms returned []
Implicit Place search using SMT with State Equation took 7204 ms to find 0 implicit places.
[2023-03-19 11:11:25] [INFO ] Redundant transitions in 654 ms returned []
[2023-03-19 11:11:25] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:11:25] [INFO ] Invariant cache hit.
[2023-03-19 11:11:27] [INFO ] Dead Transitions using invariants and state equation in 1879 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9966 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : Szymanski-PT-b02-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s87 1) (LT s274 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 564 ms.
Product exploration explored 100000 steps with 0 reset in 505 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 127 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 1) seen :0
Finished Best-First random walk after 339 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=169 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 195 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 11:11:28] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:11:28] [INFO ] Invariant cache hit.
[2023-03-19 11:11:29] [INFO ] Implicit Places using invariants in 448 ms returned []
[2023-03-19 11:11:29] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:11:29] [INFO ] Invariant cache hit.
[2023-03-19 11:11:29] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:11:36] [INFO ] Implicit Places using invariants and state equation in 7035 ms returned []
Implicit Place search using SMT with State Equation took 7486 ms to find 0 implicit places.
[2023-03-19 11:11:37] [INFO ] Redundant transitions in 638 ms returned []
[2023-03-19 11:11:37] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:11:37] [INFO ] Invariant cache hit.
[2023-03-19 11:11:39] [INFO ] Dead Transitions using invariants and state equation in 1995 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10333 ms. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Finished random walk after 3408 steps, including 1 resets, run visited all 1 properties in 29 ms. (steps per millisecond=117 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 482 ms.
Stack based approach found an accepted trace after 161 steps with 1 reset with depth 60 and stack size 59 in 2 ms.
FORMULA Szymanski-PT-b02-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Szymanski-PT-b02-LTLFireability-06 finished in 22842 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0)&&(p1||X(p2))))))'
Support contains 6 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Applied a total of 0 rules in 29 ms. Remains 306 /306 variables (removed 0) and now considering 8064/8064 (removed 0) transitions.
[2023-03-19 11:11:40] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
// Phase 1: matrix 2733 rows 306 cols
[2023-03-19 11:11:40] [INFO ] Computed 1 place invariants in 20 ms
[2023-03-19 11:11:40] [INFO ] Implicit Places using invariants in 429 ms returned []
[2023-03-19 11:11:40] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2023-03-19 11:11:40] [INFO ] Invariant cache hit.
[2023-03-19 11:11:40] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:11:45] [INFO ] Implicit Places using invariants and state equation in 5294 ms returned []
Implicit Place search using SMT with State Equation took 5726 ms to find 0 implicit places.
[2023-03-19 11:11:45] [INFO ] Flow matrix only has 2733 transitions (discarded 5331 similar events)
[2023-03-19 11:11:45] [INFO ] Invariant cache hit.
[2023-03-19 11:11:47] [INFO ] Dead Transitions using invariants and state equation in 2085 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7840 ms. Remains : 306/306 places, 8064/8064 transitions.
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), true]
Running random walk in product with property : Szymanski-PT-b02-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s305 1)), p1:(AND (GEQ s101 1) (GEQ s259 1)), p2:(AND (GEQ s15 1) (GEQ s302 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA Szymanski-PT-b02-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b02-LTLFireability-07 finished in 8078 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1)&&F(p2))))'
Support contains 5 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 42 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 11:11:48] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 11:11:48] [INFO ] Computed 1 place invariants in 23 ms
[2023-03-19 11:11:48] [INFO ] Implicit Places using invariants in 447 ms returned []
[2023-03-19 11:11:48] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:11:48] [INFO ] Invariant cache hit.
[2023-03-19 11:11:49] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:11:56] [INFO ] Implicit Places using invariants and state equation in 8339 ms returned []
Implicit Place search using SMT with State Equation took 8789 ms to find 0 implicit places.
[2023-03-19 11:11:56] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:11:56] [INFO ] Invariant cache hit.
[2023-03-19 11:11:58] [INFO ] Dead Transitions using invariants and state equation in 1985 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10817 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 216 ms :[(NOT p1), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : Szymanski-PT-b02-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 p2), acceptance={0} source=1 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 3}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(AND p0 p1 p2), acceptance={0} source=5 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={0} source=5 dest: 1}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=5 dest: 2}, { cond=(NOT p1), acceptance={0} source=5 dest: 3}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=5 dest: 5}]], initial=4, aps=[p1:(AND (GEQ s84 1) (GEQ s287 1)), p2:(AND (GEQ s101 1) (GEQ s267 1)), p0:(AND (GEQ s60 1) (GEQ s267 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Szymanski-PT-b02-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b02-LTLFireability-08 finished in 11068 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(!(p0 U p1))||X((!(p2 U p3)||F(!p2)))))'
Support contains 8 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 46 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 11:11:59] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:11:59] [INFO ] Invariant cache hit.
[2023-03-19 11:11:59] [INFO ] Implicit Places using invariants in 417 ms returned []
[2023-03-19 11:11:59] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:11:59] [INFO ] Invariant cache hit.
[2023-03-19 11:12:00] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:12:06] [INFO ] Implicit Places using invariants and state equation in 6361 ms returned []
Implicit Place search using SMT with State Equation took 6787 ms to find 0 implicit places.
[2023-03-19 11:12:06] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:12:06] [INFO ] Invariant cache hit.
[2023-03-19 11:12:08] [INFO ] Dead Transitions using invariants and state equation in 2034 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8871 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 220 ms :[p2, (AND p1 p2 p3), (AND p2 p3), (AND p1 p2 p3), (AND p1 p2)]
Running random walk in product with property : Szymanski-PT-b02-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p2, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND p2 p3), acceptance={} source=2 dest: 0}, { cond=(AND p2 (NOT p3)), acceptance={} source=2 dest: 2}], [{ cond=(AND p1 p2 p3), acceptance={} source=3 dest: 0}, { cond=(AND p1 p2 (NOT p3)), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) p2 p3), acceptance={} source=3 dest: 4}], [{ cond=(AND p1 p2), acceptance={} source=4 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=4 dest: 4}]], initial=1, aps=[p2:(AND (GEQ s17 1) (GEQ s257 1)), p3:(AND (GEQ s111 1) (GEQ s303 1)), p1:(AND (GEQ s114 1) (GEQ s276 1)), p0:(AND (GEQ s3 1) (GEQ s261 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 771 ms.
Product exploration explored 100000 steps with 50000 reset in 691 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p3) (NOT p1) (NOT p0)), (X (NOT (AND p0 (NOT p1) p2 p3))), (X (NOT (AND p0 (NOT p1) p2 (NOT p3)))), (X (NOT (AND p1 p2 (NOT p3)))), (X (NOT (AND p1 p2 p3))), (X (X (NOT p2))), (X (X (NOT (AND p0 (NOT p1) p2 p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2 (NOT p3))))), (X (X (NOT (AND p1 p2 (NOT p3))))), (X (X (NOT (AND p2 p3)))), (X (X (NOT (AND p1 p2 p3))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X (NOT p2)))
Knowledge based reduction with 14 factoid took 248 ms. Reduced automaton from 5 states, 10 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Szymanski-PT-b02-LTLFireability-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Szymanski-PT-b02-LTLFireability-09 finished in 10861 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 56 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 11:12:10] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:12:10] [INFO ] Invariant cache hit.
[2023-03-19 11:12:10] [INFO ] Implicit Places using invariants in 437 ms returned []
[2023-03-19 11:12:10] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:12:10] [INFO ] Invariant cache hit.
[2023-03-19 11:12:11] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:12:17] [INFO ] Implicit Places using invariants and state equation in 7047 ms returned []
Implicit Place search using SMT with State Equation took 7486 ms to find 0 implicit places.
[2023-03-19 11:12:17] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:12:17] [INFO ] Invariant cache hit.
[2023-03-19 11:12:19] [INFO ] Dead Transitions using invariants and state equation in 2046 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9589 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b02-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s93 1) (GEQ s297 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Szymanski-PT-b02-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Szymanski-PT-b02-LTLFireability-10 finished in 9705 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(!(((p0 U p1)&&!p0) U X(p0)))'
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 47 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 11:12:19] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:12:19] [INFO ] Invariant cache hit.
[2023-03-19 11:12:20] [INFO ] Implicit Places using invariants in 423 ms returned []
[2023-03-19 11:12:20] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:12:20] [INFO ] Invariant cache hit.
[2023-03-19 11:12:20] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:12:27] [INFO ] Implicit Places using invariants and state equation in 6976 ms returned []
Implicit Place search using SMT with State Equation took 7400 ms to find 0 implicit places.
[2023-03-19 11:12:27] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:12:27] [INFO ] Invariant cache hit.
[2023-03-19 11:12:29] [INFO ] Dead Transitions using invariants and state equation in 1890 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9337 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 110 ms :[p0, p0, true]
Running random walk in product with property : Szymanski-PT-b02-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s118 1) (GEQ s280 1)), p1:(AND (GEQ s22 1) (GEQ s296 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 681 ms.
Product exploration explored 100000 steps with 50000 reset in 665 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), true, (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT p0))
Knowledge based reduction with 6 factoid took 112 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Szymanski-PT-b02-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Szymanski-PT-b02-LTLFireability-11 finished in 10951 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 45 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 11:12:30] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:12:30] [INFO ] Invariant cache hit.
[2023-03-19 11:12:31] [INFO ] Implicit Places using invariants in 437 ms returned []
[2023-03-19 11:12:31] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:12:31] [INFO ] Invariant cache hit.
[2023-03-19 11:12:31] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:12:38] [INFO ] Implicit Places using invariants and state equation in 7700 ms returned []
Implicit Place search using SMT with State Equation took 8143 ms to find 0 implicit places.
[2023-03-19 11:12:38] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:12:38] [INFO ] Invariant cache hit.
[2023-03-19 11:12:40] [INFO ] Dead Transitions using invariants and state equation in 1934 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10123 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Szymanski-PT-b02-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s52 1) (LT s270 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]]
Product exploration explored 100000 steps with 0 reset in 490 ms.
Product exploration explored 100000 steps with 0 reset in 485 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 100 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 138 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Finished Best-First random walk after 325 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=108 )
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 28 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 11:12:42] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:12:42] [INFO ] Invariant cache hit.
[2023-03-19 11:12:43] [INFO ] Implicit Places using invariants in 447 ms returned []
[2023-03-19 11:12:43] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:12:43] [INFO ] Invariant cache hit.
[2023-03-19 11:12:43] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:12:49] [INFO ] Implicit Places using invariants and state equation in 6391 ms returned []
Implicit Place search using SMT with State Equation took 6840 ms to find 0 implicit places.
[2023-03-19 11:12:49] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:12:49] [INFO ] Invariant cache hit.
[2023-03-19 11:12:51] [INFO ] Dead Transitions using invariants and state equation in 1996 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8865 ms. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 88 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Finished Best-First random walk after 7067 steps, including 2 resets, run visited all 1 properties in 14 ms. (steps per millisecond=504 )
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 99 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 119 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 142 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 540 ms.
Product exploration explored 100000 steps with 0 reset in 471 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 182 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 11:12:54] [INFO ] Redundant transitions in 633 ms returned []
[2023-03-19 11:12:54] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:12:54] [INFO ] Invariant cache hit.
[2023-03-19 11:12:56] [INFO ] Dead Transitions using invariants and state equation in 2118 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2948 ms. Remains : 305/305 places, 7936/7936 transitions.
Built C files in :
/tmp/ltsmin17936926302604752211
[2023-03-19 11:12:56] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17936926302604752211
Running compilation step : cd /tmp/ltsmin17936926302604752211;'/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/ltsmin17936926302604752211;'/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/ltsmin17936926302604752211;'/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 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 24 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 11:12:59] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:12:59] [INFO ] Invariant cache hit.
[2023-03-19 11:13:00] [INFO ] Implicit Places using invariants in 399 ms returned []
[2023-03-19 11:13:00] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:13:00] [INFO ] Invariant cache hit.
[2023-03-19 11:13:00] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:13:07] [INFO ] Implicit Places using invariants and state equation in 7378 ms returned []
Implicit Place search using SMT with State Equation took 7800 ms to find 0 implicit places.
[2023-03-19 11:13:07] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:13:07] [INFO ] Invariant cache hit.
[2023-03-19 11:13:09] [INFO ] Dead Transitions using invariants and state equation in 2017 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9858 ms. Remains : 305/305 places, 7936/7936 transitions.
Built C files in :
/tmp/ltsmin8451755197649067231
[2023-03-19 11:13:09] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8451755197649067231
Running compilation step : cd /tmp/ltsmin8451755197649067231;'/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/ltsmin8451755197649067231;'/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/ltsmin8451755197649067231;'/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 11:13:12] [INFO ] Flatten gal took : 177 ms
[2023-03-19 11:13:12] [INFO ] Flatten gal took : 192 ms
[2023-03-19 11:13:13] [INFO ] Time to serialize gal into /tmp/LTL17344194664071287573.gal : 25 ms
[2023-03-19 11:13:13] [INFO ] Time to serialize properties into /tmp/LTL7179362721555423555.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17344194664071287573.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14892882683810196162.hoa' '-atoms' '/tmp/LTL7179362721555423555.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/LTL7179362721555423555.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14892882683810196162.hoa
Detected timeout of ITS tools.
[2023-03-19 11:13:28] [INFO ] Flatten gal took : 193 ms
[2023-03-19 11:13:28] [INFO ] Flatten gal took : 205 ms
[2023-03-19 11:13:28] [INFO ] Time to serialize gal into /tmp/LTL12537606514567036391.gal : 26 ms
[2023-03-19 11:13:28] [INFO ] Time to serialize properties into /tmp/LTL16798785882244562573.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/LTL12537606514567036391.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16798785882244562573.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...277
Read 1 LTL properties
Checking formula 0 : !((X(X(G("((p52<1)||(l14<1))")))))
Formula 0 simplified : XXF!"((p52<1)||(l14<1))"
Detected timeout of ITS tools.
[2023-03-19 11:13:43] [INFO ] Flatten gal took : 194 ms
[2023-03-19 11:13:43] [INFO ] Applying decomposition
[2023-03-19 11:13:44] [INFO ] Flatten gal took : 192 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/graph6598689385791952335.txt' '-o' '/tmp/graph6598689385791952335.bin' '-w' '/tmp/graph6598689385791952335.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6598689385791952335.bin' '-l' '-1' '-v' '-w' '/tmp/graph6598689385791952335.weights' '-q' '0' '-e' '0.001'
[2023-03-19 11:13:44] [INFO ] Decomposing Gal with order
[2023-03-19 11:13:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 11:13:44] [INFO ] Removed a total of 18142 redundant transitions.
[2023-03-19 11:13:45] [INFO ] Flatten gal took : 542 ms
[2023-03-19 11:13:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 1094 labels/synchronizations in 199 ms.
[2023-03-19 11:13:45] [INFO ] Time to serialize gal into /tmp/LTL9002300447421307950.gal : 54 ms
[2023-03-19 11:13:45] [INFO ] Time to serialize properties into /tmp/LTL6843042529480897043.ltl : 12 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/LTL9002300447421307950.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6843042529480897043.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X(G("((u50.p52<1)||(u50.l14<1))")))))
Formula 0 simplified : XXF!"((u50.p52<1)||(u50.l14<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin17088281376445426326
[2023-03-19 11:14:00] [INFO ] Built C files in 48ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17088281376445426326
Running compilation step : cd /tmp/ltsmin17088281376445426326;'/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/ltsmin17088281376445426326;'/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/ltsmin17088281376445426326;'/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 Szymanski-PT-b02-LTLFireability-14 finished in 92859 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 226 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 11:14:03] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:14:03] [INFO ] Invariant cache hit.
[2023-03-19 11:14:04] [INFO ] Implicit Places using invariants in 438 ms returned []
[2023-03-19 11:14:04] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:14:04] [INFO ] Invariant cache hit.
[2023-03-19 11:14:04] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:14:10] [INFO ] Implicit Places using invariants and state equation in 6038 ms returned []
Implicit Place search using SMT with State Equation took 6495 ms to find 0 implicit places.
[2023-03-19 11:14:10] [INFO ] Redundant transitions in 656 ms returned []
[2023-03-19 11:14:10] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:14:10] [INFO ] Invariant cache hit.
[2023-03-19 11:14:12] [INFO ] Dead Transitions using invariants and state equation in 2033 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 9422 ms. Remains : 305/306 places, 7936/8064 transitions.
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Szymanski-PT-b02-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s50 1) (LT s298 1)), p1:(AND (GEQ s43 1) (GEQ s294 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 488 ms.
Stack based approach found an accepted trace after 74 steps with 0 reset with depth 75 and stack size 75 in 1 ms.
FORMULA Szymanski-PT-b02-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Szymanski-PT-b02-LTLFireability-15 finished in 10064 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||G(p1))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p1)||p0))))'
Found a Lengthening insensitive property : Szymanski-PT-b02-LTLFireability-04
Stuttering acceptance computed with spot in 97 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 77 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 11:14:13] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:14:13] [INFO ] Invariant cache hit.
[2023-03-19 11:14:14] [INFO ] Implicit Places using invariants in 427 ms returned []
[2023-03-19 11:14:14] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:14:14] [INFO ] Invariant cache hit.
[2023-03-19 11:14:14] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:14:21] [INFO ] Implicit Places using invariants and state equation in 7399 ms returned []
Implicit Place search using SMT with State Equation took 7826 ms to find 0 implicit places.
[2023-03-19 11:14:21] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:14:21] [INFO ] Invariant cache hit.
[2023-03-19 11:14:23] [INFO ] Dead Transitions using invariants and state equation in 2115 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 10020 ms. Remains : 305/306 places, 7936/8064 transitions.
Running random walk in product with property : Szymanski-PT-b02-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (GEQ s58 1) (GEQ s274 1)), p0:(OR (LT s16 1) (LT s275 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, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 410 ms.
Product exploration explored 100000 steps with 0 reset in 426 ms.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 288 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 120735 steps, run timeout after 3001 ms. (steps per millisecond=40 ) properties seen :{}
Probabilistic random walk after 120735 steps, saw 43963 distinct states, run finished after 3001 ms. (steps per millisecond=40 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-19 11:14:28] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:14:28] [INFO ] Invariant cache hit.
[2023-03-19 11:14:28] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 11:14:29] [INFO ] After 1512ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-19 11:14:29] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 11:14:35] [INFO ] After 5747ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-19 11:14:35] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:14:54] [INFO ] After 19184ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :1 sat :0
[2023-03-19 11:14:54] [INFO ] After 25016ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 13 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 125 transitions
Reduce isomorphic transitions removed 125 transitions.
Iterating post reduction 0 with 125 rules applied. Total rules applied 125 place count 305 transition count 7811
Applied a total of 125 rules in 177 ms. Remains 305 /305 variables (removed 0) and now considering 7811/7936 (removed 125) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 305/305 places, 7811/7936 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 133362 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 133362 steps, saw 46306 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-19 11:14:58] [INFO ] Flow matrix only has 2607 transitions (discarded 5204 similar events)
// Phase 1: matrix 2607 rows 305 cols
[2023-03-19 11:14:58] [INFO ] Computed 1 place invariants in 15 ms
[2023-03-19 11:14:58] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 11:14:59] [INFO ] After 1589ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 11:14:59] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 11:15:03] [INFO ] After 3218ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 11:15:03] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:15:24] [INFO ] After 21720ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 11:15:24] [INFO ] After 21722ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1 ms.
[2023-03-19 11:15:24] [INFO ] After 25022ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 30 ms.
Support contains 4 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7811/7811 transitions.
Applied a total of 0 rules in 184 ms. Remains 305 /305 variables (removed 0) and now considering 7811/7811 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 184 ms. Remains : 305/305 places, 7811/7811 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7811/7811 transitions.
Applied a total of 0 rules in 175 ms. Remains 305 /305 variables (removed 0) and now considering 7811/7811 (removed 0) transitions.
[2023-03-19 11:15:25] [INFO ] Flow matrix only has 2607 transitions (discarded 5204 similar events)
[2023-03-19 11:15:25] [INFO ] Invariant cache hit.
[2023-03-19 11:15:25] [INFO ] Implicit Places using invariants in 441 ms returned []
[2023-03-19 11:15:25] [INFO ] Flow matrix only has 2607 transitions (discarded 5204 similar events)
[2023-03-19 11:15:25] [INFO ] Invariant cache hit.
[2023-03-19 11:15:26] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:15:33] [INFO ] Implicit Places using invariants and state equation in 7353 ms returned []
Implicit Place search using SMT with State Equation took 7806 ms to find 0 implicit places.
[2023-03-19 11:15:33] [INFO ] Redundant transitions in 629 ms returned []
[2023-03-19 11:15:33] [INFO ] Flow matrix only has 2607 transitions (discarded 5204 similar events)
[2023-03-19 11:15:33] [INFO ] Invariant cache hit.
[2023-03-19 11:15:35] [INFO ] Dead Transitions using invariants and state equation in 1947 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10571 ms. Remains : 305/305 places, 7811/7811 transitions.
Graph (trivial) has 4872 edges and 305 vertex of which 35 / 305 are part of one of the 2 SCC in 0 ms
Free SCC test removed 33 places
Drop transitions removed 3744 transitions
Ensure Unique test removed 1697 transitions
Reduce isomorphic transitions removed 5441 transitions.
Drop transitions removed 320 transitions
Redundant transition composition rules discarded 320 transitions
Iterating global reduction 0 with 320 rules applied. Total rules applied 321 place count 272 transition count 2050
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 322 place count 272 transition count 2049
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 323 place count 271 transition count 2049
Drop transitions removed 112 transitions
Redundant transition composition rules discarded 112 transitions
Iterating global reduction 1 with 112 rules applied. Total rules applied 435 place count 271 transition count 1937
Applied a total of 435 rules in 222 ms. Remains 271 /305 variables (removed 34) and now considering 1937/7811 (removed 5874) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 1937 rows 271 cols
[2023-03-19 11:15:35] [INFO ] Computed 1 place invariants in 17 ms
[2023-03-19 11:15:36] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 11:15:36] [INFO ] After 637ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 11:15:36] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 11:15:37] [INFO ] After 714ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 11:15:37] [INFO ] State equation strengthened by 480 read => feed constraints.
[2023-03-19 11:15:39] [INFO ] After 2228ms SMT Verify possible using 480 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-19 11:15:42] [INFO ] After 5515ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 5354 ms.
[2023-03-19 11:15:48] [INFO ] After 11666ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X p0), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 451 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 78 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 305 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 24 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 11:15:48] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 11:15:48] [INFO ] Computed 1 place invariants in 22 ms
[2023-03-19 11:15:49] [INFO ] Implicit Places using invariants in 452 ms returned []
[2023-03-19 11:15:49] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:15:49] [INFO ] Invariant cache hit.
[2023-03-19 11:15:49] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:15:56] [INFO ] Implicit Places using invariants and state equation in 6824 ms returned []
Implicit Place search using SMT with State Equation took 7278 ms to find 0 implicit places.
[2023-03-19 11:15:56] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:15:56] [INFO ] Invariant cache hit.
[2023-03-19 11:15:58] [INFO ] Dead Transitions using invariants and state equation in 2025 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9332 ms. Remains : 305/305 places, 7936/7936 transitions.
Computed a total of 11 stabilizing places and 2304 stable transitions
Computed a total of 11 stabilizing places and 2304 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 152 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 156546 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 156546 steps, saw 53340 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 11:16:01] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:16:01] [INFO ] Invariant cache hit.
[2023-03-19 11:16:01] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-19 11:16:03] [INFO ] After 1531ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 11:16:03] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 11:16:05] [INFO ] After 2371ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 11:16:05] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:16:10] [INFO ] After 4896ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 11:16:19] [INFO ] After 13906ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :0
[2023-03-19 11:16:19] [INFO ] After 16351ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Drop transitions removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 305 transition count 7810
Applied a total of 126 rules in 198 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7936 (removed 126) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 198 ms. Remains : 305/305 places, 7810/7936 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 154853 steps, run timeout after 3001 ms. (steps per millisecond=51 ) properties seen :{}
Probabilistic random walk after 154853 steps, saw 52552 distinct states, run finished after 3001 ms. (steps per millisecond=51 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-19 11:16:22] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
// Phase 1: matrix 2606 rows 305 cols
[2023-03-19 11:16:22] [INFO ] Computed 1 place invariants in 19 ms
[2023-03-19 11:16:22] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 11:16:24] [INFO ] After 2151ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 11:16:24] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 11:16:26] [INFO ] After 1153ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 11:16:26] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:16:29] [INFO ] After 2894ms SMT Verify possible using 147 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 11:16:30] [INFO ] Deduced a trap composed of 138 places in 364 ms of which 0 ms to minimize.
[2023-03-19 11:16:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 491 ms
[2023-03-19 11:16:31] [INFO ] After 4939ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 620 ms.
[2023-03-19 11:16:31] [INFO ] After 6780ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 188 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 188 ms. Remains : 305/305 places, 7810/7810 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 305/305 places, 7810/7810 transitions.
Applied a total of 0 rules in 190 ms. Remains 305 /305 variables (removed 0) and now considering 7810/7810 (removed 0) transitions.
[2023-03-19 11:16:32] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2023-03-19 11:16:32] [INFO ] Invariant cache hit.
[2023-03-19 11:16:32] [INFO ] Implicit Places using invariants in 427 ms returned []
[2023-03-19 11:16:32] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2023-03-19 11:16:32] [INFO ] Invariant cache hit.
[2023-03-19 11:16:33] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:16:40] [INFO ] Implicit Places using invariants and state equation in 7675 ms returned []
Implicit Place search using SMT with State Equation took 8103 ms to find 0 implicit places.
[2023-03-19 11:16:40] [INFO ] Redundant transitions in 655 ms returned []
[2023-03-19 11:16:40] [INFO ] Flow matrix only has 2606 transitions (discarded 5204 similar events)
[2023-03-19 11:16:40] [INFO ] Invariant cache hit.
[2023-03-19 11:16:42] [INFO ] Dead Transitions using invariants and state equation in 1957 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10918 ms. Remains : 305/305 places, 7810/7810 transitions.
Graph (trivial) has 5008 edges and 305 vertex of which 37 / 305 are part of one of the 2 SCC in 0 ms
Free SCC test removed 35 places
Drop transitions removed 4008 transitions
Ensure Unique test removed 1436 transitions
Reduce isomorphic transitions removed 5444 transitions.
Drop transitions removed 416 transitions
Redundant transition composition rules discarded 416 transitions
Iterating global reduction 0 with 416 rules applied. Total rules applied 417 place count 270 transition count 1950
Applied a total of 417 rules in 120 ms. Remains 270 /305 variables (removed 35) and now considering 1950/7810 (removed 5860) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 1950 rows 270 cols
[2023-03-19 11:16:42] [INFO ] Computed 1 place invariants in 16 ms
[2023-03-19 11:16:43] [INFO ] [Real]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 11:16:43] [INFO ] After 646ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-19 11:16:43] [INFO ] [Nat]Absence check using 0 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-19 11:16:44] [INFO ] After 543ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-19 11:16:44] [INFO ] State equation strengthened by 504 read => feed constraints.
[2023-03-19 11:16:44] [INFO ] After 630ms SMT Verify possible using 504 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-19 11:16:44] [INFO ] After 740ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 48 ms.
[2023-03-19 11:16:45] [INFO ] After 1403ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 146 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 75 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 94 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 511 ms.
Product exploration explored 100000 steps with 0 reset in 487 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Support contains 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 190 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 11:16:47] [INFO ] Redundant transitions in 667 ms returned []
[2023-03-19 11:16:47] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
// Phase 1: matrix 2732 rows 305 cols
[2023-03-19 11:16:47] [INFO ] Computed 1 place invariants in 23 ms
[2023-03-19 11:16:49] [INFO ] Dead Transitions using invariants and state equation in 2131 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3000 ms. Remains : 305/305 places, 7936/7936 transitions.
Built C files in :
/tmp/ltsmin14340220490678925541
[2023-03-19 11:16:49] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14340220490678925541
Running compilation step : cd /tmp/ltsmin14340220490678925541;'/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/ltsmin14340220490678925541;'/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/ltsmin14340220490678925541;'/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 2 out of 305 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 305/305 places, 7936/7936 transitions.
Applied a total of 0 rules in 29 ms. Remains 305 /305 variables (removed 0) and now considering 7936/7936 (removed 0) transitions.
[2023-03-19 11:16:52] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:16:52] [INFO ] Invariant cache hit.
[2023-03-19 11:16:53] [INFO ] Implicit Places using invariants in 436 ms returned []
[2023-03-19 11:16:53] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:16:53] [INFO ] Invariant cache hit.
[2023-03-19 11:16:53] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:17:00] [INFO ] Implicit Places using invariants and state equation in 7282 ms returned []
Implicit Place search using SMT with State Equation took 7720 ms to find 0 implicit places.
[2023-03-19 11:17:00] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:17:00] [INFO ] Invariant cache hit.
[2023-03-19 11:17:02] [INFO ] Dead Transitions using invariants and state equation in 2008 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9760 ms. Remains : 305/305 places, 7936/7936 transitions.
Built C files in :
/tmp/ltsmin7975241980466754237
[2023-03-19 11:17:02] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7975241980466754237
Running compilation step : cd /tmp/ltsmin7975241980466754237;'/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/ltsmin7975241980466754237;'/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/ltsmin7975241980466754237;'/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 11:17:05] [INFO ] Flatten gal took : 172 ms
[2023-03-19 11:17:05] [INFO ] Flatten gal took : 181 ms
[2023-03-19 11:17:05] [INFO ] Time to serialize gal into /tmp/LTL4767792485143103568.gal : 24 ms
[2023-03-19 11:17:06] [INFO ] Time to serialize properties into /tmp/LTL15736472117936136493.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/LTL4767792485143103568.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13239186062513271126.hoa' '-atoms' '/tmp/LTL15736472117936136493.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/LTL15736472117936136493.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13239186062513271126.hoa
Detected timeout of ITS tools.
[2023-03-19 11:17:21] [INFO ] Flatten gal took : 175 ms
[2023-03-19 11:17:21] [INFO ] Flatten gal took : 181 ms
[2023-03-19 11:17:21] [INFO ] Time to serialize gal into /tmp/LTL577618251586520227.gal : 23 ms
[2023-03-19 11:17:21] [INFO ] Time to serialize properties into /tmp/LTL4720118603646619626.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL577618251586520227.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4720118603646619626.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...274
Read 1 LTL properties
Checking formula 0 : !((X(G(("((p16<1)||(l19<1))")||(G("((p58>=1)&&(l18>=1))"))))))
Formula 0 simplified : XF(!"((p16<1)||(l19<1))" & F!"((p58>=1)&&(l18>=1))")
Detected timeout of ITS tools.
[2023-03-19 11:17:36] [INFO ] Flatten gal took : 168 ms
[2023-03-19 11:17:36] [INFO ] Applying decomposition
[2023-03-19 11:17:36] [INFO ] Flatten gal took : 177 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/graph7376867914969138399.txt' '-o' '/tmp/graph7376867914969138399.bin' '-w' '/tmp/graph7376867914969138399.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7376867914969138399.bin' '-l' '-1' '-v' '-w' '/tmp/graph7376867914969138399.weights' '-q' '0' '-e' '0.001'
[2023-03-19 11:17:37] [INFO ] Decomposing Gal with order
[2023-03-19 11:17:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 11:17:37] [INFO ] Removed a total of 18062 redundant transitions.
[2023-03-19 11:17:37] [INFO ] Flatten gal took : 305 ms
[2023-03-19 11:17:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 1101 labels/synchronizations in 192 ms.
[2023-03-19 11:17:37] [INFO ] Time to serialize gal into /tmp/LTL15186700333570443220.gal : 30 ms
[2023-03-19 11:17:37] [INFO ] Time to serialize properties into /tmp/LTL5662195049333539309.ltl : 2 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/LTL15186700333570443220.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5662195049333539309.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...255
Read 1 LTL properties
Checking formula 0 : !((X(G(("((i5.u50.p16<1)||(i5.u51.l19<1))")||(G("((i2.i1.u19.p58>=1)&&(i5.u51.l18>=1))"))))))
Formula 0 simplified : XF(!"((i5.u50.p16<1)||(i5.u51.l19<1))" & F!"((i2.i1.u19.p58>=1)&&(i5.u51.l18>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15082817748585218306
[2023-03-19 11:17:53] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15082817748585218306
Running compilation step : cd /tmp/ltsmin15082817748585218306;'/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/ltsmin15082817748585218306;'/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/ltsmin15082817748585218306;'/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 Szymanski-PT-b02-LTLFireability-04 finished in 222453 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Found a Lengthening insensitive property : Szymanski-PT-b02-LTLFireability-14
Stuttering acceptance computed with spot in 137 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 306 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 306/306 places, 8064/8064 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 305 transition count 7936
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 305 transition count 7936
Applied a total of 2 rules in 70 ms. Remains 305 /306 variables (removed 1) and now considering 7936/8064 (removed 128) transitions.
[2023-03-19 11:17:56] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:17:56] [INFO ] Invariant cache hit.
[2023-03-19 11:17:56] [INFO ] Implicit Places using invariants in 408 ms returned []
[2023-03-19 11:17:56] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:17:56] [INFO ] Invariant cache hit.
[2023-03-19 11:17:57] [INFO ] State equation strengthened by 147 read => feed constraints.
[2023-03-19 11:18:04] [INFO ] Implicit Places using invariants and state equation in 7384 ms returned []
Implicit Place search using SMT with State Equation took 7812 ms to find 0 implicit places.
[2023-03-19 11:18:04] [INFO ] Flow matrix only has 2732 transitions (discarded 5204 similar events)
[2023-03-19 11:18:04] [INFO ] Invariant cache hit.
[2023-03-19 11:18:06] [INFO ] Dead Transitions using invariants and state equation in 2018 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 305/306 places, 7936/8064 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 9901 ms. Remains : 305/306 places, 7936/8064 transitions.
Running random walk in product with property : Szymanski-PT-b02-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (LT s52 1) (LT s270 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, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 471 ms.
Entered a terminal (fully accepting) state of product in 187 steps with 0 reset in 2 ms.
Treatment of property Szymanski-PT-b02-LTLFireability-14 finished in 10618 ms.
FORMULA Szymanski-PT-b02-LTLFireability-14 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-19 11:18:06] [INFO ] Flatten gal took : 194 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5476260920984744471
[2023-03-19 11:18:07] [INFO ] Too many transitions (8064) to apply POR reductions. Disabling POR matrices.
[2023-03-19 11:18:07] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5476260920984744471
Running compilation step : cd /tmp/ltsmin5476260920984744471;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '360' '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 11:18:07] [INFO ] Applying decomposition
[2023-03-19 11:18:07] [INFO ] Flatten gal took : 194 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/graph10201482373740491543.txt' '-o' '/tmp/graph10201482373740491543.bin' '-w' '/tmp/graph10201482373740491543.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph10201482373740491543.bin' '-l' '-1' '-v' '-w' '/tmp/graph10201482373740491543.weights' '-q' '0' '-e' '0.001'
[2023-03-19 11:18:07] [INFO ] Decomposing Gal with order
[2023-03-19 11:18:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 11:18:08] [INFO ] Removed a total of 18316 redundant transitions.
[2023-03-19 11:18:08] [INFO ] Flatten gal took : 340 ms
[2023-03-19 11:18:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 1026 labels/synchronizations in 195 ms.
[2023-03-19 11:18:08] [INFO ] Time to serialize gal into /tmp/LTLFireability5951089920965355414.gal : 21 ms
[2023-03-19 11:18:08] [INFO ] Time to serialize properties into /tmp/LTLFireability17525224499158316806.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/LTLFireability5951089920965355414.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17525224499158316806.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...277
Read 2 LTL properties
Checking formula 0 : !((F(("((i2.u10.p29>=1)&&(i2.u46.l5>=1))")||(G("(((i2.u8.p27<1)||(i7.i1.u59.l41<1))&&((i1.i1.u16.p47<1)||(i1.i1.u57.l36<1)))")))))
Formula 0 simplified : G(!"((i2.u10.p29>=1)&&(i2.u46.l5>=1))" & F!"(((i2.u8.p27<1)||(i7.i1.u59.l41<1))&&((i1.i1.u16.p47<1)||(i1.i1.u57.l36<1)))")
Compilation finished in 31677 ms.
Running link step : cd /tmp/ltsmin5476260920984744471;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 87 ms.
Running LTSmin : cd /tmp/ltsmin5476260920984744471;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(((LTLAPp0==true)||[]((LTLAPp1==true))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t5, t7, t9, t13, t15, t18, t22, t23, t25, t29, t31, t33, t37, t38, t42, t44, t54, t58, t59, t...19363
Computing Next relation with stutter on 7125 deadlock states
2 unique states visited
2 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
15766 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,158.494,2067672,1,0,2.67243e+06,237806,52443,5.41945e+06,2644,2.5169e+06,16281509
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA Szymanski-PT-b02-LTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Checking formula 1 : !((X(G(("((i5.u49.p16<1)||(i5.u50.l19<1))")||(G("((i2.u18.p58>=1)&&(i5.u50.l18>=1))"))))))
Formula 1 simplified : XF(!"((i5.u49.p16<1)||(i5.u50.l19<1))" & F!"((i2.u18.p58>=1)&&(i5.u50.l18>=1))")
Computing Next relation with stutter on 7125 deadlock states
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
9903 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,257.529,2762172,1,0,3.53465e+06,357405,24348,7.77638e+06,1463,3.28564e+06,3336091
an accepting run exists (use option '-e' to print it)
Formula 1 is FALSE accepting run found.
FORMULA Szymanski-PT-b02-LTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
ITS tools runner thread asked to quit. Dying gracefully.
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1610651 ms.

BK_STOP 1679225242012

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is Szymanski-PT-b02, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r485-tall-167912699400452"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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