/root/.sdkman/candidates/java/21.0.5-tem/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata ./data -tc ../benchexec/../../../trunk/examples/toolchains/AutomizerCInline_IcfgBuilder.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis PETRI_NET --preprocessor.replace.while.statements.and.if-then-else.statements false -i ../../../trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 01:32:46,222 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 01:32:46,270 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-14 01:32:46,275 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 01:32:46,276 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 01:32:46,298 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 01:32:46,298 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 01:32:46,298 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 01:32:46,298 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 01:32:46,298 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 01:32:46,298 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 01:32:46,299 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 01:32:46,299 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 01:32:46,299 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 01:32:46,299 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 01:32:46,299 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 01:32:46,299 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 01:32:46,299 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 01:32:46,299 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 01:32:46,299 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 01:32:46,299 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 01:32:46,299 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 01:32:46,301 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 01:32:46,301 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 01:32:46,301 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 01:32:46,301 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 01:32:46,301 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 01:32:46,301 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 01:32:46,301 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 01:32:46,301 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:32:46,301 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:32:46,301 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:32:46,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:32:46,302 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 01:32:46,302 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:32:46,302 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:32:46,302 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:32:46,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:32:46,302 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 01:32:46,302 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 01:32:46,302 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 01:32:46,302 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 01:32:46,302 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 01:32:46,302 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 01:32:46,302 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 01:32:46,302 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 01:32:46,302 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 01:32:46,302 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 01:32:46,525 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 01:32:46,532 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 01:32:46,534 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 01:32:46,535 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 01:32:46,537 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 01:32:46,538 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2025-04-14 01:32:47,843 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5440f9d62/4657229bbdcc4965b13340ee388e2d19/FLAG718fd2952 [2025-04-14 01:32:47,854 ERROR L? ?]: Error during toolchain job processing: java.lang.NullPointerException: Cannot invoke "String.equalsIgnoreCase(String)" because "kindStr" is null at org.eclipse.cdt.internal.core.model.PathEntry.kindFromString(PathEntry.java:80) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.decodePathEntry(DefaultPathEntryStore.java:127) at org.eclipse.cdt.internal.core.model.DefaultPathEntryStore.getRawPathEntries(DefaultPathEntryStore.java:97) at org.eclipse.cdt.internal.core.model.PathEntryStoreProxy.getRawPathEntries(PathEntryStoreProxy.java:102) at org.eclipse.cdt.internal.core.model.PathEntryManager.getRawPathEntries(PathEntryManager.java:666) at org.eclipse.cdt.core.model.CoreModel.getRawPathEntries(CoreModel.java:937) at org.eclipse.cdt.core.model.CoreModel.oldIsScannerInformationEmpty(CoreModel.java:1307) at org.eclipse.cdt.core.model.CoreModel.isScannerInformationEmpty(CoreModel.java:1252) at org.eclipse.cdt.internal.core.pdom.indexer.ProjectIndexerInputAdapter.isFileBuildConfigured(ProjectIndexerInputAdapter.java:267) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.isRequiredInIndex(AbstractIndexerTask.java:748) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.extractFiles(AbstractIndexerTask.java:667) at org.eclipse.cdt.internal.core.pdom.AbstractIndexerTask.runTask(AbstractIndexerTask.java:558) at org.eclipse.cdt.internal.core.pdom.indexer.PDOMIndexerTask.run(PDOMIndexerTask.java:164) at org.eclipse.cdt.internal.core.pdom.PDOMIndexerJob.run(PDOMIndexerJob.java:160) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2025-04-14 01:32:48,026 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 01:32:48,027 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c [2025-04-14 01:32:48,035 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5440f9d62/4657229bbdcc4965b13340ee388e2d19/FLAG718fd2952 [2025-04-14 01:32:48,843 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5440f9d62/4657229bbdcc4965b13340ee388e2d19 [2025-04-14 01:32:48,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 01:32:48,848 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 01:32:48,849 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 01:32:48,849 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 01:32:48,853 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 01:32:48,853 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:32:48" (1/1) ... [2025-04-14 01:32:48,854 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36adc07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:32:48, skipping insertion in model container [2025-04-14 01:32:48,854 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:32:48" (1/1) ... [2025-04-14 01:32:48,867 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 01:32:49,051 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c[3146,3159] [2025-04-14 01:32:49,063 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:32:49,075 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 01:32:49,114 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/popl20-send-receive.wvr.c[3146,3159] [2025-04-14 01:32:49,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:32:49,145 INFO L204 MainTranslator]: Completed translation [2025-04-14 01:32:49,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:32:49 WrapperNode [2025-04-14 01:32:49,146 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 01:32:49,146 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 01:32:49,147 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 01:32:49,147 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 01:32:49,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:32:49" (1/1) ... [2025-04-14 01:32:49,159 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:32:49" (1/1) ... [2025-04-14 01:32:49,187 INFO L138 Inliner]: procedures = 24, calls = 37, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 139 [2025-04-14 01:32:49,188 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 01:32:49,188 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 01:32:49,188 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 01:32:49,188 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 01:32:49,194 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:32:49" (1/1) ... [2025-04-14 01:32:49,194 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:32:49" (1/1) ... [2025-04-14 01:32:49,196 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:32:49" (1/1) ... [2025-04-14 01:32:49,220 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 1 writes are split as follows [0, 1]. [2025-04-14 01:32:49,221 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:32:49" (1/1) ... [2025-04-14 01:32:49,221 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:32:49" (1/1) ... [2025-04-14 01:32:49,225 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:32:49" (1/1) ... [2025-04-14 01:32:49,226 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:32:49" (1/1) ... [2025-04-14 01:32:49,230 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:32:49" (1/1) ... [2025-04-14 01:32:49,231 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:32:49" (1/1) ... [2025-04-14 01:32:49,234 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 01:32:49,238 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 01:32:49,238 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 01:32:49,238 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 01:32:49,239 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:32:49" (1/1) ... [2025-04-14 01:32:49,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:32:49,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:32:49,275 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-14 01:32:49,281 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-14 01:32:49,303 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 01:32:49,303 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2025-04-14 01:32:49,303 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2025-04-14 01:32:49,303 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2025-04-14 01:32:49,303 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2025-04-14 01:32:49,303 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2025-04-14 01:32:49,303 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2025-04-14 01:32:49,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 01:32:49,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 01:32:49,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 01:32:49,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 01:32:49,304 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 01:32:49,304 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 01:32:49,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 01:32:49,304 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 01:32:49,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 01:32:49,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 01:32:49,304 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 01:32:49,305 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 01:32:49,387 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 01:32:49,389 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 01:32:49,588 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 01:32:49,588 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 01:32:49,588 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 01:32:49,754 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 01:32:49,754 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:32:49 BoogieIcfgContainer [2025-04-14 01:32:49,754 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 01:32:49,756 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 01:32:49,756 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 01:32:49,761 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 01:32:49,761 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 01:32:48" (1/3) ... [2025-04-14 01:32:49,762 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d859361 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:32:49, skipping insertion in model container [2025-04-14 01:32:49,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:32:49" (2/3) ... [2025-04-14 01:32:49,762 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d859361 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:32:49, skipping insertion in model container [2025-04-14 01:32:49,762 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:32:49" (3/3) ... [2025-04-14 01:32:49,763 INFO L128 eAbstractionObserver]: Analyzing ICFG popl20-send-receive.wvr.c [2025-04-14 01:32:49,773 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 01:32:49,774 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG popl20-send-receive.wvr.c that has 4 procedures, 32 locations, 32 edges, 1 initial locations, 3 loop locations, and 1 error locations. [2025-04-14 01:32:49,774 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 01:32:49,822 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2025-04-14 01:32:49,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 41 places, 35 transitions, 91 flow [2025-04-14 01:32:49,892 INFO L116 PetriNetUnfolderBase]: 4/32 cut-off events. [2025-04-14 01:32:49,896 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 01:32:49,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 45 conditions, 32 events. 4/32 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 51 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 27. Up to 2 conditions per place. [2025-04-14 01:32:49,898 INFO L82 GeneralOperation]: Start removeDead. Operand has 41 places, 35 transitions, 91 flow [2025-04-14 01:32:49,900 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 37 places, 31 transitions, 80 flow [2025-04-14 01:32:49,906 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 01:32:49,915 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7dd493e7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 01:32:49,916 INFO L341 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2025-04-14 01:32:49,930 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 01:32:49,930 INFO L116 PetriNetUnfolderBase]: 4/30 cut-off events. [2025-04-14 01:32:49,930 INFO L117 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2025-04-14 01:32:49,930 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:32:49,931 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:32:49,931 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:32:49,936 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:32:49,936 INFO L85 PathProgramCache]: Analyzing trace with hash -329824089, now seen corresponding path program 1 times [2025-04-14 01:32:49,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:32:49,942 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1717819363] [2025-04-14 01:32:49,942 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:32:49,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:32:49,999 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-04-14 01:32:50,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-04-14 01:32:50,039 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:32:50,039 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:32:50,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:32:50,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:32:50,401 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1717819363] [2025-04-14 01:32:50,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1717819363] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:32:50,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:32:50,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:32:50,404 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943394545] [2025-04-14 01:32:50,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:32:50,408 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:32:50,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:32:50,428 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:32:50,428 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:32:50,442 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2025-04-14 01:32:50,444 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 31 transitions, 80 flow. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:32:50,445 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:32:50,445 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2025-04-14 01:32:50,445 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:32:50,800 INFO L116 PetriNetUnfolderBase]: 722/1184 cut-off events. [2025-04-14 01:32:50,800 INFO L117 PetriNetUnfolderBase]: For 46/46 co-relation queries the response was YES. [2025-04-14 01:32:50,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2329 conditions, 1184 events. 722/1184 cut-off events. For 46/46 co-relation queries the response was YES. Maximal size of possible extension queue 69. Compared 5416 event pairs, 78 based on Foata normal form. 116/1204 useless extension candidates. Maximal degree in co-relation 2258. Up to 404 conditions per place. [2025-04-14 01:32:50,811 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 60 selfloop transitions, 4 changer transitions 5/74 dead transitions. [2025-04-14 01:32:50,811 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 74 transitions, 316 flow [2025-04-14 01:32:50,812 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:32:50,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:32:50,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 111 transitions. [2025-04-14 01:32:50,822 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6342857142857142 [2025-04-14 01:32:50,823 INFO L175 Difference]: Start difference. First operand has 37 places, 31 transitions, 80 flow. Second operand 5 states and 111 transitions. [2025-04-14 01:32:50,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 74 transitions, 316 flow [2025-04-14 01:32:50,827 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 35 places, 74 transitions, 296 flow, removed 0 selfloop flow, removed 6 redundant places. [2025-04-14 01:32:50,830 INFO L231 Difference]: Finished difference. Result has 37 places, 32 transitions, 88 flow [2025-04-14 01:32:50,831 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=88, PETRI_PLACES=37, PETRI_TRANSITIONS=32} [2025-04-14 01:32:50,834 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 0 predicate places. [2025-04-14 01:32:50,834 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 88 flow [2025-04-14 01:32:50,834 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:32:50,835 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:32:50,835 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:32:50,835 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 01:32:50,835 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:32:50,836 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:32:50,836 INFO L85 PathProgramCache]: Analyzing trace with hash -327673669, now seen corresponding path program 1 times [2025-04-14 01:32:50,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:32:50,836 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172332986] [2025-04-14 01:32:50,836 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:32:50,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:32:50,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-14 01:32:50,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-14 01:32:50,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:32:50,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:32:50,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:32:50,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:32:50,926 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172332986] [2025-04-14 01:32:50,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172332986] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:32:50,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:32:50,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 01:32:50,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519922732] [2025-04-14 01:32:50,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:32:50,926 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:32:50,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:32:50,927 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:32:50,927 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:32:50,927 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2025-04-14 01:32:50,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 88 flow. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:32:50,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:32:50,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2025-04-14 01:32:50,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:32:51,014 INFO L116 PetriNetUnfolderBase]: 398/642 cut-off events. [2025-04-14 01:32:51,014 INFO L117 PetriNetUnfolderBase]: For 372/372 co-relation queries the response was YES. [2025-04-14 01:32:51,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1494 conditions, 642 events. 398/642 cut-off events. For 372/372 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2260 event pairs, 179 based on Foata normal form. 25/590 useless extension candidates. Maximal degree in co-relation 536. Up to 496 conditions per place. [2025-04-14 01:32:51,019 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 32 selfloop transitions, 3 changer transitions 1/41 dead transitions. [2025-04-14 01:32:51,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 41 transitions, 182 flow [2025-04-14 01:32:51,020 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:32:51,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:32:51,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 60 transitions. [2025-04-14 01:32:51,021 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5714285714285714 [2025-04-14 01:32:51,021 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 88 flow. Second operand 3 states and 60 transitions. [2025-04-14 01:32:51,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 41 transitions, 182 flow [2025-04-14 01:32:51,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 41 transitions, 177 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 01:32:51,023 INFO L231 Difference]: Finished difference. Result has 38 places, 34 transitions, 103 flow [2025-04-14 01:32:51,023 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=38, PETRI_TRANSITIONS=34} [2025-04-14 01:32:51,023 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 1 predicate places. [2025-04-14 01:32:51,023 INFO L485 AbstractCegarLoop]: Abstraction has has 38 places, 34 transitions, 103 flow [2025-04-14 01:32:51,024 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:32:51,024 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:32:51,025 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:32:51,025 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 01:32:51,025 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:32:51,025 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:32:51,025 INFO L85 PathProgramCache]: Analyzing trace with hash -990882102, now seen corresponding path program 1 times [2025-04-14 01:32:51,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:32:51,025 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748268827] [2025-04-14 01:32:51,025 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:32:51,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:32:51,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-04-14 01:32:51,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-04-14 01:32:51,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:32:51,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:32:51,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:32:51,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:32:51,161 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748268827] [2025-04-14 01:32:51,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748268827] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:32:51,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:32:51,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:32:51,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852770748] [2025-04-14 01:32:51,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:32:51,162 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:32:51,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:32:51,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:32:51,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:32:51,162 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2025-04-14 01:32:51,162 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 34 transitions, 103 flow. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:32:51,162 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:32:51,162 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2025-04-14 01:32:51,162 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:32:51,259 INFO L116 PetriNetUnfolderBase]: 433/723 cut-off events. [2025-04-14 01:32:51,259 INFO L117 PetriNetUnfolderBase]: For 302/302 co-relation queries the response was YES. [2025-04-14 01:32:51,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1770 conditions, 723 events. 433/723 cut-off events. For 302/302 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2767 event pairs, 324 based on Foata normal form. 0/645 useless extension candidates. Maximal degree in co-relation 767. Up to 606 conditions per place. [2025-04-14 01:32:51,263 INFO L140 encePairwiseOnDemand]: 30/35 looper letters, 28 selfloop transitions, 2 changer transitions 11/46 dead transitions. [2025-04-14 01:32:51,263 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 46 transitions, 214 flow [2025-04-14 01:32:51,263 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:32:51,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:32:51,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 72 transitions. [2025-04-14 01:32:51,264 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5142857142857142 [2025-04-14 01:32:51,264 INFO L175 Difference]: Start difference. First operand has 38 places, 34 transitions, 103 flow. Second operand 4 states and 72 transitions. [2025-04-14 01:32:51,264 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 46 transitions, 214 flow [2025-04-14 01:32:51,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 46 transitions, 211 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:32:51,265 INFO L231 Difference]: Finished difference. Result has 42 places, 35 transitions, 116 flow [2025-04-14 01:32:51,265 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=116, PETRI_PLACES=42, PETRI_TRANSITIONS=35} [2025-04-14 01:32:51,266 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 5 predicate places. [2025-04-14 01:32:51,266 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 35 transitions, 116 flow [2025-04-14 01:32:51,266 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:32:51,266 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:32:51,266 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:32:51,266 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 01:32:51,266 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:32:51,266 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:32:51,266 INFO L85 PathProgramCache]: Analyzing trace with hash 899105165, now seen corresponding path program 1 times [2025-04-14 01:32:51,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:32:51,267 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602884100] [2025-04-14 01:32:51,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:32:51,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:32:51,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 01:32:51,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 01:32:51,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:32:51,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:32:51,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:32:51,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:32:51,434 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602884100] [2025-04-14 01:32:51,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602884100] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:32:51,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:32:51,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:32:51,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234612871] [2025-04-14 01:32:51,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:32:51,434 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:32:51,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:32:51,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:32:51,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:32:51,435 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2025-04-14 01:32:51,435 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 35 transitions, 116 flow. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:32:51,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:32:51,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2025-04-14 01:32:51,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:32:51,536 INFO L116 PetriNetUnfolderBase]: 356/571 cut-off events. [2025-04-14 01:32:51,536 INFO L117 PetriNetUnfolderBase]: For 270/270 co-relation queries the response was YES. [2025-04-14 01:32:51,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1484 conditions, 571 events. 356/571 cut-off events. For 270/270 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1901 event pairs, 65 based on Foata normal form. 24/556 useless extension candidates. Maximal degree in co-relation 1468. Up to 262 conditions per place. [2025-04-14 01:32:51,539 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 39 selfloop transitions, 3 changer transitions 0/47 dead transitions. [2025-04-14 01:32:51,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 47 transitions, 237 flow [2025-04-14 01:32:51,539 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:32:51,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:32:51,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 71 transitions. [2025-04-14 01:32:51,540 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5071428571428571 [2025-04-14 01:32:51,540 INFO L175 Difference]: Start difference. First operand has 42 places, 35 transitions, 116 flow. Second operand 4 states and 71 transitions. [2025-04-14 01:32:51,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 47 transitions, 237 flow [2025-04-14 01:32:51,541 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 42 places, 47 transitions, 225 flow, removed 5 selfloop flow, removed 2 redundant places. [2025-04-14 01:32:51,541 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 118 flow [2025-04-14 01:32:51,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=118, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2025-04-14 01:32:51,542 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 6 predicate places. [2025-04-14 01:32:51,542 INFO L485 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 118 flow [2025-04-14 01:32:51,542 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:32:51,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:32:51,542 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:32:51,542 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 01:32:51,542 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:32:51,543 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:32:51,543 INFO L85 PathProgramCache]: Analyzing trace with hash 279866061, now seen corresponding path program 2 times [2025-04-14 01:32:51,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:32:51,543 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729335663] [2025-04-14 01:32:51,543 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:32:51,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:32:51,553 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-14 01:32:51,566 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 01:32:51,566 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:32:51,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:32:51,681 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:32:51,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:32:51,681 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729335663] [2025-04-14 01:32:51,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729335663] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:32:51,681 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155480482] [2025-04-14 01:32:51,681 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:32:51,681 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:32:51,681 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:32:51,683 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:32:51,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-14 01:32:51,728 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-04-14 01:32:51,749 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 01:32:51,749 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:32:51,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:32:51,751 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-04-14 01:32:51,753 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:32:51,986 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:32:51,986 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:32:52,109 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:32:52,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155480482] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:32:52,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:32:52,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 5, 5] total 10 [2025-04-14 01:32:52,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210016584] [2025-04-14 01:32:52,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:32:52,110 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-14 01:32:52,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:32:52,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-14 01:32:52,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-04-14 01:32:52,120 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-04-14 01:32:52,121 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 118 flow. Second operand has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:32:52,121 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:32:52,121 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-04-14 01:32:52,121 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:32:52,657 INFO L116 PetriNetUnfolderBase]: 1086/1664 cut-off events. [2025-04-14 01:32:52,657 INFO L117 PetriNetUnfolderBase]: For 648/648 co-relation queries the response was YES. [2025-04-14 01:32:52,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3953 conditions, 1664 events. 1086/1664 cut-off events. For 648/648 co-relation queries the response was YES. Maximal size of possible extension queue 101. Compared 6896 event pairs, 39 based on Foata normal form. 116/1659 useless extension candidates. Maximal degree in co-relation 3932. Up to 338 conditions per place. [2025-04-14 01:32:52,665 INFO L140 encePairwiseOnDemand]: 24/35 looper letters, 90 selfloop transitions, 20 changer transitions 33/147 dead transitions. [2025-04-14 01:32:52,666 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 147 transitions, 707 flow [2025-04-14 01:32:52,666 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 01:32:52,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-14 01:32:52,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 265 transitions. [2025-04-14 01:32:52,669 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.44537815126050423 [2025-04-14 01:32:52,669 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 118 flow. Second operand 17 states and 265 transitions. [2025-04-14 01:32:52,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 147 transitions, 707 flow [2025-04-14 01:32:52,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 147 transitions, 699 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-14 01:32:52,673 INFO L231 Difference]: Finished difference. Result has 67 places, 52 transitions, 276 flow [2025-04-14 01:32:52,673 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=276, PETRI_PLACES=67, PETRI_TRANSITIONS=52} [2025-04-14 01:32:52,675 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 30 predicate places. [2025-04-14 01:32:52,675 INFO L485 AbstractCegarLoop]: Abstraction has has 67 places, 52 transitions, 276 flow [2025-04-14 01:32:52,676 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 13.5) internal successors, (135), 10 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:32:52,676 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:32:52,676 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:32:52,684 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-14 01:32:52,882 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:32:52,882 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:32:52,882 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:32:52,883 INFO L85 PathProgramCache]: Analyzing trace with hash -730931011, now seen corresponding path program 3 times [2025-04-14 01:32:52,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:32:52,883 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196806247] [2025-04-14 01:32:52,883 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:32:52,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:32:52,890 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 29 statements into 2 equivalence classes. [2025-04-14 01:32:52,913 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) and asserted 28 of 29 statements. [2025-04-14 01:32:52,913 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2025-04-14 01:32:52,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:32:53,148 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:32:53,148 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:32:53,148 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196806247] [2025-04-14 01:32:53,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196806247] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:32:53,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:32:53,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-04-14 01:32:53,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [748830408] [2025-04-14 01:32:53,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:32:53,149 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-14 01:32:53,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:32:53,149 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-14 01:32:53,149 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-14 01:32:53,149 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2025-04-14 01:32:53,150 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 52 transitions, 276 flow. Second operand has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:32:53,150 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:32:53,150 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2025-04-14 01:32:53,150 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:32:53,468 INFO L116 PetriNetUnfolderBase]: 1377/2190 cut-off events. [2025-04-14 01:32:53,468 INFO L117 PetriNetUnfolderBase]: For 6790/6830 co-relation queries the response was YES. [2025-04-14 01:32:53,473 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8367 conditions, 2190 events. 1377/2190 cut-off events. For 6790/6830 co-relation queries the response was YES. Maximal size of possible extension queue 133. Compared 10562 event pairs, 305 based on Foata normal form. 56/2045 useless extension candidates. Maximal degree in co-relation 8335. Up to 646 conditions per place. [2025-04-14 01:32:53,478 INFO L140 encePairwiseOnDemand]: 28/35 looper letters, 75 selfloop transitions, 8 changer transitions 35/123 dead transitions. [2025-04-14 01:32:53,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 123 transitions, 940 flow [2025-04-14 01:32:53,479 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:32:53,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:32:53,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 131 transitions. [2025-04-14 01:32:53,479 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5346938775510204 [2025-04-14 01:32:53,479 INFO L175 Difference]: Start difference. First operand has 67 places, 52 transitions, 276 flow. Second operand 7 states and 131 transitions. [2025-04-14 01:32:53,479 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 123 transitions, 940 flow [2025-04-14 01:32:53,494 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 123 transitions, 887 flow, removed 26 selfloop flow, removed 4 redundant places. [2025-04-14 01:32:53,495 INFO L231 Difference]: Finished difference. Result has 69 places, 54 transitions, 302 flow [2025-04-14 01:32:53,495 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=259, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=302, PETRI_PLACES=69, PETRI_TRANSITIONS=54} [2025-04-14 01:32:53,497 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 32 predicate places. [2025-04-14 01:32:53,497 INFO L485 AbstractCegarLoop]: Abstraction has has 69 places, 54 transitions, 302 flow [2025-04-14 01:32:53,497 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 11.428571428571429) internal successors, (80), 7 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:32:53,497 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:32:53,497 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:32:53,498 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 01:32:53,498 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:32:53,498 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:32:53,498 INFO L85 PathProgramCache]: Analyzing trace with hash 1109851187, now seen corresponding path program 1 times [2025-04-14 01:32:53,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:32:53,498 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800206577] [2025-04-14 01:32:53,498 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:32:53,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:32:53,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-04-14 01:32:53,515 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-04-14 01:32:53,515 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:32:53,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:32:53,558 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:32:53,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:32:53,558 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800206577] [2025-04-14 01:32:53,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800206577] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:32:53,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:32:53,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:32:53,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310834066] [2025-04-14 01:32:53,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:32:53,559 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:32:53,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:32:53,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:32:53,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:32:53,561 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-04-14 01:32:53,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 54 transitions, 302 flow. Second operand has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:32:53,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:32:53,561 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-04-14 01:32:53,561 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:32:53,693 INFO L116 PetriNetUnfolderBase]: 894/1407 cut-off events. [2025-04-14 01:32:53,693 INFO L117 PetriNetUnfolderBase]: For 3050/3090 co-relation queries the response was YES. [2025-04-14 01:32:53,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5118 conditions, 1407 events. 894/1407 cut-off events. For 3050/3090 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 5956 event pairs, 368 based on Foata normal form. 0/1302 useless extension candidates. Maximal degree in co-relation 5085. Up to 1213 conditions per place. [2025-04-14 01:32:53,700 INFO L140 encePairwiseOnDemand]: 32/35 looper letters, 62 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2025-04-14 01:32:53,700 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 68 transitions, 510 flow [2025-04-14 01:32:53,700 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:32:53,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:32:53,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 62 transitions. [2025-04-14 01:32:53,701 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5904761904761905 [2025-04-14 01:32:53,701 INFO L175 Difference]: Start difference. First operand has 69 places, 54 transitions, 302 flow. Second operand 3 states and 62 transitions. [2025-04-14 01:32:53,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 68 transitions, 510 flow [2025-04-14 01:32:53,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 68 transitions, 485 flow, removed 3 selfloop flow, removed 6 redundant places. [2025-04-14 01:32:53,705 INFO L231 Difference]: Finished difference. Result has 66 places, 53 transitions, 280 flow [2025-04-14 01:32:53,705 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=280, PETRI_PLACES=66, PETRI_TRANSITIONS=53} [2025-04-14 01:32:53,706 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 29 predicate places. [2025-04-14 01:32:53,706 INFO L485 AbstractCegarLoop]: Abstraction has has 66 places, 53 transitions, 280 flow [2025-04-14 01:32:53,706 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.333333333333334) internal successors, (46), 3 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:32:53,706 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:32:53,706 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:32:53,706 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 01:32:53,706 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:32:53,707 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:32:53,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1563776221, now seen corresponding path program 4 times [2025-04-14 01:32:53,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:32:53,707 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1739612747] [2025-04-14 01:32:53,707 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:32:53,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:32:53,712 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 32 statements into 2 equivalence classes. [2025-04-14 01:32:53,720 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-04-14 01:32:53,721 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:32:53,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:32:53,770 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:32:53,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:32:53,770 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1739612747] [2025-04-14 01:32:53,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1739612747] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:32:53,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:32:53,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:32:53,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945259111] [2025-04-14 01:32:53,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:32:53,770 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:32:53,770 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:32:53,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:32:53,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:32:53,771 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2025-04-14 01:32:53,771 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 53 transitions, 280 flow. Second operand has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:32:53,771 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:32:53,771 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2025-04-14 01:32:53,771 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:32:54,013 INFO L116 PetriNetUnfolderBase]: 1775/2901 cut-off events. [2025-04-14 01:32:54,013 INFO L117 PetriNetUnfolderBase]: For 8509/8629 co-relation queries the response was YES. [2025-04-14 01:32:54,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10848 conditions, 2901 events. 1775/2901 cut-off events. For 8509/8629 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 14730 event pairs, 630 based on Foata normal form. 72/2838 useless extension candidates. Maximal degree in co-relation 10818. Up to 1094 conditions per place. [2025-04-14 01:32:54,031 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 104 selfloop transitions, 9 changer transitions 0/119 dead transitions. [2025-04-14 01:32:54,031 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 119 transitions, 887 flow [2025-04-14 01:32:54,031 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:32:54,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:32:54,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2025-04-14 01:32:54,032 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6714285714285714 [2025-04-14 01:32:54,032 INFO L175 Difference]: Start difference. First operand has 66 places, 53 transitions, 280 flow. Second operand 4 states and 94 transitions. [2025-04-14 01:32:54,032 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 119 transitions, 887 flow [2025-04-14 01:32:54,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 119 transitions, 885 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:32:54,040 INFO L231 Difference]: Finished difference. Result has 70 places, 60 transitions, 362 flow [2025-04-14 01:32:54,040 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=278, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=362, PETRI_PLACES=70, PETRI_TRANSITIONS=60} [2025-04-14 01:32:54,041 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 33 predicate places. [2025-04-14 01:32:54,041 INFO L485 AbstractCegarLoop]: Abstraction has has 70 places, 60 transitions, 362 flow [2025-04-14 01:32:54,041 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.5) internal successors, (58), 4 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:32:54,041 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:32:54,041 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:32:54,041 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 01:32:54,041 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:32:54,041 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:32:54,041 INFO L85 PathProgramCache]: Analyzing trace with hash -292127856, now seen corresponding path program 5 times [2025-04-14 01:32:54,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:32:54,042 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829247433] [2025-04-14 01:32:54,042 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:32:54,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:32:54,054 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-14 01:32:54,062 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-14 01:32:54,062 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:32:54,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:32:54,168 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:32:54,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:32:54,168 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829247433] [2025-04-14 01:32:54,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829247433] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:32:54,168 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830548744] [2025-04-14 01:32:54,168 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:32:54,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:32:54,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:32:54,170 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:32:54,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-14 01:32:54,210 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-04-14 01:32:54,231 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-04-14 01:32:54,231 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:32:54,231 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:32:54,232 INFO L256 TraceCheckSpWp]: Trace formula consists of 209 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-04-14 01:32:54,234 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:32:54,304 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:32:54,305 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:32:54,377 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:32:54,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830548744] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:32:54,377 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:32:54,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 14 [2025-04-14 01:32:54,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193273434] [2025-04-14 01:32:54,377 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:32:54,378 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-04-14 01:32:54,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:32:54,378 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-04-14 01:32:54,378 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-04-14 01:32:54,378 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2025-04-14 01:32:54,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 60 transitions, 362 flow. Second operand has 15 states, 15 states have (on average 10.933333333333334) internal successors, (164), 15 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:32:54,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:32:54,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2025-04-14 01:32:54,379 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:32:54,728 INFO L116 PetriNetUnfolderBase]: 1854/3047 cut-off events. [2025-04-14 01:32:54,728 INFO L117 PetriNetUnfolderBase]: For 11433/11577 co-relation queries the response was YES. [2025-04-14 01:32:54,735 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12481 conditions, 3047 events. 1854/3047 cut-off events. For 11433/11577 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 15461 event pairs, 1203 based on Foata normal form. 40/2947 useless extension candidates. Maximal degree in co-relation 11822. Up to 2690 conditions per place. [2025-04-14 01:32:54,750 INFO L140 encePairwiseOnDemand]: 29/35 looper letters, 52 selfloop transitions, 3 changer transitions 26/87 dead transitions. [2025-04-14 01:32:54,750 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 87 transitions, 646 flow [2025-04-14 01:32:54,751 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-14 01:32:54,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2025-04-14 01:32:54,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2025-04-14 01:32:54,751 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4448979591836735 [2025-04-14 01:32:54,751 INFO L175 Difference]: Start difference. First operand has 70 places, 60 transitions, 362 flow. Second operand 7 states and 109 transitions. [2025-04-14 01:32:54,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 87 transitions, 646 flow [2025-04-14 01:32:54,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 87 transitions, 638 flow, removed 4 selfloop flow, removed 0 redundant places. [2025-04-14 01:32:54,761 INFO L231 Difference]: Finished difference. Result has 80 places, 61 transitions, 380 flow [2025-04-14 01:32:54,761 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=356, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=380, PETRI_PLACES=80, PETRI_TRANSITIONS=61} [2025-04-14 01:32:54,762 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 43 predicate places. [2025-04-14 01:32:54,762 INFO L485 AbstractCegarLoop]: Abstraction has has 80 places, 61 transitions, 380 flow [2025-04-14 01:32:54,762 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 10.933333333333334) internal successors, (164), 15 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:32:54,762 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:32:54,762 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:32:54,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-04-14 01:32:54,967 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-04-14 01:32:54,967 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:32:54,967 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:32:54,967 INFO L85 PathProgramCache]: Analyzing trace with hash 1310909633, now seen corresponding path program 6 times [2025-04-14 01:32:54,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:32:54,968 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632977744] [2025-04-14 01:32:54,968 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:32:54,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:32:54,974 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 37 statements into 2 equivalence classes. [2025-04-14 01:32:54,982 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-14 01:32:54,982 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 2 check-sat command(s) [2025-04-14 01:32:54,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:32:55,079 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:32:55,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:32:55,080 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632977744] [2025-04-14 01:32:55,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632977744] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:32:55,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:32:55,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 01:32:55,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642338773] [2025-04-14 01:32:55,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:32:55,080 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 01:32:55,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:32:55,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 01:32:55,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 01:32:55,086 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-04-14 01:32:55,086 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 61 transitions, 380 flow. Second operand has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:32:55,086 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:32:55,086 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-04-14 01:32:55,086 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:32:55,451 INFO L116 PetriNetUnfolderBase]: 2858/4666 cut-off events. [2025-04-14 01:32:55,452 INFO L117 PetriNetUnfolderBase]: For 21626/21938 co-relation queries the response was YES. [2025-04-14 01:32:55,461 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18508 conditions, 4666 events. 2858/4666 cut-off events. For 21626/21938 co-relation queries the response was YES. Maximal size of possible extension queue 161. Compared 24893 event pairs, 823 based on Foata normal form. 212/4773 useless extension candidates. Maximal degree in co-relation 18469. Up to 2259 conditions per place. [2025-04-14 01:32:55,475 INFO L140 encePairwiseOnDemand]: 31/35 looper letters, 86 selfloop transitions, 4 changer transitions 0/94 dead transitions. [2025-04-14 01:32:55,475 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 94 transitions, 755 flow [2025-04-14 01:32:55,476 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 01:32:55,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 01:32:55,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 76 transitions. [2025-04-14 01:32:55,476 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5428571428571428 [2025-04-14 01:32:55,476 INFO L175 Difference]: Start difference. First operand has 80 places, 61 transitions, 380 flow. Second operand 4 states and 76 transitions. [2025-04-14 01:32:55,476 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 94 transitions, 755 flow [2025-04-14 01:32:55,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 94 transitions, 739 flow, removed 6 selfloop flow, removed 5 redundant places. [2025-04-14 01:32:55,488 INFO L231 Difference]: Finished difference. Result has 77 places, 62 transitions, 399 flow [2025-04-14 01:32:55,488 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=364, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=399, PETRI_PLACES=77, PETRI_TRANSITIONS=62} [2025-04-14 01:32:55,488 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 40 predicate places. [2025-04-14 01:32:55,488 INFO L485 AbstractCegarLoop]: Abstraction has has 77 places, 62 transitions, 399 flow [2025-04-14 01:32:55,488 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.25) internal successors, (57), 4 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:32:55,488 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:32:55,488 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:32:55,488 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-04-14 01:32:55,488 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:32:55,489 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:32:55,489 INFO L85 PathProgramCache]: Analyzing trace with hash -210560971, now seen corresponding path program 1 times [2025-04-14 01:32:55,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:32:55,489 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828110604] [2025-04-14 01:32:55,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:32:55,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:32:55,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-14 01:32:55,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-14 01:32:55,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:32:55,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:32:56,453 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:32:56,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:32:56,454 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828110604] [2025-04-14 01:32:56,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828110604] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:32:56,454 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [681963473] [2025-04-14 01:32:56,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:32:56,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:32:56,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:32:56,456 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:32:56,458 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-14 01:32:56,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-04-14 01:32:56,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-04-14 01:32:56,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:32:56,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:32:56,530 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-14 01:32:56,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:32:56,996 INFO L325 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2025-04-14 01:32:56,997 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 17 [2025-04-14 01:32:57,063 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:32:57,063 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:32:57,377 INFO L325 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2025-04-14 01:32:57,377 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 74 treesize of output 60 [2025-04-14 01:32:58,088 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:32:58,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [681963473] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:32:58,089 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:32:58,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 38 [2025-04-14 01:32:58,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618830091] [2025-04-14 01:32:58,089 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:32:58,089 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-04-14 01:32:58,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:32:58,090 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-04-14 01:32:58,090 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=1301, Unknown=0, NotChecked=0, Total=1482 [2025-04-14 01:32:58,109 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2025-04-14 01:32:58,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 62 transitions, 399 flow. Second operand has 39 states, 39 states have (on average 8.307692307692308) internal successors, (324), 39 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:32:58,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:32:58,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2025-04-14 01:32:58,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:33:12,166 INFO L116 PetriNetUnfolderBase]: 31271/49889 cut-off events. [2025-04-14 01:33:12,167 INFO L117 PetriNetUnfolderBase]: For 192102/192102 co-relation queries the response was YES. [2025-04-14 01:33:12,334 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199793 conditions, 49889 events. 31271/49889 cut-off events. For 192102/192102 co-relation queries the response was YES. Maximal size of possible extension queue 1083. Compared 358708 event pairs, 2067 based on Foata normal form. 1844/51731 useless extension candidates. Maximal degree in co-relation 177611. Up to 7897 conditions per place. [2025-04-14 01:33:12,468 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 1156 selfloop transitions, 499 changer transitions 337/1995 dead transitions. [2025-04-14 01:33:12,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 222 places, 1995 transitions, 16867 flow [2025-04-14 01:33:12,469 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2025-04-14 01:33:12,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2025-04-14 01:33:12,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 2316 transitions. [2025-04-14 01:33:12,477 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4532289628180039 [2025-04-14 01:33:12,477 INFO L175 Difference]: Start difference. First operand has 77 places, 62 transitions, 399 flow. Second operand 146 states and 2316 transitions. [2025-04-14 01:33:12,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 222 places, 1995 transitions, 16867 flow [2025-04-14 01:33:12,731 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 221 places, 1995 transitions, 16613 flow, removed 125 selfloop flow, removed 1 redundant places. [2025-04-14 01:33:12,744 INFO L231 Difference]: Finished difference. Result has 289 places, 648 transitions, 6967 flow [2025-04-14 01:33:12,744 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=394, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=146, PETRI_FLOW=6967, PETRI_PLACES=289, PETRI_TRANSITIONS=648} [2025-04-14 01:33:12,745 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 252 predicate places. [2025-04-14 01:33:12,745 INFO L485 AbstractCegarLoop]: Abstraction has has 289 places, 648 transitions, 6967 flow [2025-04-14 01:33:12,746 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 8.307692307692308) internal successors, (324), 39 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:33:12,747 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:33:12,747 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:33:12,752 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-14 01:33:12,951 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:33:12,951 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:33:12,951 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:33:12,951 INFO L85 PathProgramCache]: Analyzing trace with hash 2110290535, now seen corresponding path program 2 times [2025-04-14 01:33:12,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:33:12,951 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20966125] [2025-04-14 01:33:12,951 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:33:12,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:33:12,957 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-14 01:33:12,983 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-14 01:33:12,983 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:33:12,983 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:13,591 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:33:13,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:33:13,591 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20966125] [2025-04-14 01:33:13,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20966125] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:33:13,591 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2124213879] [2025-04-14 01:33:13,591 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:33:13,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:33:13,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:33:13,593 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:33:13,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-14 01:33:13,635 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-04-14 01:33:13,654 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-14 01:33:13,655 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:33:13,655 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:13,656 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-14 01:33:13,658 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:33:13,714 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-14 01:33:14,057 INFO L325 Elim1Store]: treesize reduction 16, result has 15.8 percent of original size [2025-04-14 01:33:14,057 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 17 [2025-04-14 01:33:14,089 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:33:14,089 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:33:15,146 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 116 treesize of output 104 [2025-04-14 01:33:15,175 INFO L325 Elim1Store]: treesize reduction 16, result has 64.4 percent of original size [2025-04-14 01:33:15,175 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 232 treesize of output 196 [2025-04-14 01:33:15,897 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:33:15,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2124213879] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:33:15,897 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:33:15,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 40 [2025-04-14 01:33:15,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554015232] [2025-04-14 01:33:15,898 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:33:15,898 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-14 01:33:15,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:33:15,898 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-14 01:33:15,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=264, Invalid=1376, Unknown=0, NotChecked=0, Total=1640 [2025-04-14 01:33:15,931 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2025-04-14 01:33:15,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 289 places, 648 transitions, 6967 flow. Second operand has 41 states, 41 states have (on average 8.24390243902439) internal successors, (338), 41 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:33:15,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:33:15,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2025-04-14 01:33:15,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:33:28,878 INFO L116 PetriNetUnfolderBase]: 31809/51366 cut-off events. [2025-04-14 01:33:28,878 INFO L117 PetriNetUnfolderBase]: For 3347869/3347869 co-relation queries the response was YES. [2025-04-14 01:33:29,708 INFO L83 FinitePrefix]: Finished finitePrefix Result has 346122 conditions, 51366 events. 31809/51366 cut-off events. For 3347869/3347869 co-relation queries the response was YES. Maximal size of possible extension queue 1325. Compared 382686 event pairs, 3867 based on Foata normal form. 828/52192 useless extension candidates. Maximal degree in co-relation 337668. Up to 11135 conditions per place. [2025-04-14 01:33:29,886 INFO L140 encePairwiseOnDemand]: 20/35 looper letters, 707 selfloop transitions, 692 changer transitions 217/1619 dead transitions. [2025-04-14 01:33:29,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 360 places, 1619 transitions, 20600 flow [2025-04-14 01:33:29,887 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2025-04-14 01:33:29,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2025-04-14 01:33:29,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 973 transitions. [2025-04-14 01:33:29,889 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3861111111111111 [2025-04-14 01:33:29,889 INFO L175 Difference]: Start difference. First operand has 289 places, 648 transitions, 6967 flow. Second operand 72 states and 973 transitions. [2025-04-14 01:33:29,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 360 places, 1619 transitions, 20600 flow [2025-04-14 01:33:54,607 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 346 places, 1619 transitions, 17119 flow, removed 1686 selfloop flow, removed 14 redundant places. [2025-04-14 01:33:54,622 INFO L231 Difference]: Finished difference. Result has 368 places, 984 transitions, 10567 flow [2025-04-14 01:33:54,622 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=5505, PETRI_DIFFERENCE_MINUEND_PLACES=275, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=644, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=365, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=217, PETRI_DIFFERENCE_SUBTRAHEND_STATES=72, PETRI_FLOW=10567, PETRI_PLACES=368, PETRI_TRANSITIONS=984} [2025-04-14 01:33:54,623 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 331 predicate places. [2025-04-14 01:33:54,623 INFO L485 AbstractCegarLoop]: Abstraction has has 368 places, 984 transitions, 10567 flow [2025-04-14 01:33:54,623 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 8.24390243902439) internal successors, (338), 41 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:33:54,623 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:33:54,623 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:33:54,629 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-14 01:33:54,824 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:33:54,824 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:33:54,825 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:33:54,825 INFO L85 PathProgramCache]: Analyzing trace with hash -841136693, now seen corresponding path program 3 times [2025-04-14 01:33:54,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:33:54,825 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723304895] [2025-04-14 01:33:54,825 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:33:54,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:33:54,834 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 2 equivalence classes. [2025-04-14 01:33:54,859 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-14 01:33:54,859 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:33:54,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:55,510 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:33:55,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:33:55,510 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723304895] [2025-04-14 01:33:55,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723304895] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:33:55,510 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835917379] [2025-04-14 01:33:55,510 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:33:55,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:33:55,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:33:55,512 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:33:55,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-14 01:33:55,556 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 37 statements into 2 equivalence classes. [2025-04-14 01:33:55,581 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-04-14 01:33:55,581 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:33:55,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:33:55,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-04-14 01:33:55,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:33:55,667 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:33:56,099 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:33:56,099 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:33:56,708 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 117 treesize of output 105 [2025-04-14 01:33:56,732 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:33:56,733 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 237 treesize of output 208 [2025-04-14 01:33:57,169 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:33:57,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835917379] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:33:57,170 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:33:57,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15, 15] total 40 [2025-04-14 01:33:57,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958790350] [2025-04-14 01:33:57,170 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:33:57,170 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-04-14 01:33:57,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:33:57,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-04-14 01:33:57,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=1373, Unknown=0, NotChecked=0, Total=1640 [2025-04-14 01:33:57,189 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2025-04-14 01:33:57,190 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 368 places, 984 transitions, 10567 flow. Second operand has 41 states, 41 states have (on average 8.24390243902439) internal successors, (338), 41 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:33:57,190 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:33:57,190 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2025-04-14 01:33:57,190 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:34:09,314 INFO L116 PetriNetUnfolderBase]: 29956/48427 cut-off events. [2025-04-14 01:34:09,315 INFO L117 PetriNetUnfolderBase]: For 2816506/2816506 co-relation queries the response was YES. [2025-04-14 01:34:10,309 INFO L83 FinitePrefix]: Finished finitePrefix Result has 299374 conditions, 48427 events. 29956/48427 cut-off events. For 2816506/2816506 co-relation queries the response was YES. Maximal size of possible extension queue 1005. Compared 350228 event pairs, 4701 based on Foata normal form. 1620/50043 useless extension candidates. Maximal degree in co-relation 298950. Up to 11989 conditions per place. [2025-04-14 01:34:10,471 INFO L140 encePairwiseOnDemand]: 20/35 looper letters, 620 selfloop transitions, 543 changer transitions 445/1611 dead transitions. [2025-04-14 01:34:10,471 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 409 places, 1611 transitions, 19607 flow [2025-04-14 01:34:10,472 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2025-04-14 01:34:10,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2025-04-14 01:34:10,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 933 transitions. [2025-04-14 01:34:10,474 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.38081632653061226 [2025-04-14 01:34:10,474 INFO L175 Difference]: Start difference. First operand has 368 places, 984 transitions, 10567 flow. Second operand 70 states and 933 transitions. [2025-04-14 01:34:10,474 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 409 places, 1611 transitions, 19607 flow [2025-04-14 01:34:25,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 371 places, 1611 transitions, 18888 flow, removed 244 selfloop flow, removed 38 redundant places. [2025-04-14 01:34:25,729 INFO L231 Difference]: Finished difference. Result has 390 places, 837 transitions, 10271 flow [2025-04-14 01:34:25,729 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=8305, PETRI_DIFFERENCE_MINUEND_PLACES=302, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=818, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=491, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=70, PETRI_FLOW=10271, PETRI_PLACES=390, PETRI_TRANSITIONS=837} [2025-04-14 01:34:25,729 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 353 predicate places. [2025-04-14 01:34:25,730 INFO L485 AbstractCegarLoop]: Abstraction has has 390 places, 837 transitions, 10271 flow [2025-04-14 01:34:25,730 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 8.24390243902439) internal successors, (338), 41 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:34:25,730 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:34:25,730 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:34:25,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-14 01:34:25,930 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-04-14 01:34:25,930 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:34:25,931 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:34:25,931 INFO L85 PathProgramCache]: Analyzing trace with hash 284198838, now seen corresponding path program 4 times [2025-04-14 01:34:25,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:34:25,931 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086793159] [2025-04-14 01:34:25,931 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:34:25,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:34:25,937 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-04-14 01:34:25,947 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 01:34:25,947 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:34:25,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:34:26,215 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 01:34:26,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:34:26,215 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086793159] [2025-04-14 01:34:26,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086793159] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:34:26,215 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892316825] [2025-04-14 01:34:26,215 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:34:26,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:34:26,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:34:26,219 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:34:26,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-14 01:34:26,261 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-04-14 01:34:26,283 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-04-14 01:34:26,283 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:34:26,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:34:26,285 INFO L256 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-04-14 01:34:26,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:34:26,540 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-14 01:34:26,540 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:34:26,711 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:34:26,712 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 60 [2025-04-14 01:34:26,955 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-14 01:34:26,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892316825] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:34:26,956 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:34:26,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 14, 12] total 31 [2025-04-14 01:34:26,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335132466] [2025-04-14 01:34:26,956 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:34:26,956 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-04-14 01:34:26,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:34:26,957 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-04-14 01:34:26,957 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=810, Unknown=0, NotChecked=0, Total=992 [2025-04-14 01:34:26,962 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2025-04-14 01:34:26,962 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 390 places, 837 transitions, 10271 flow. Second operand has 32 states, 32 states have (on average 8.9375) internal successors, (286), 32 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:34:26,962 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:34:26,962 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2025-04-14 01:34:26,962 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:34:36,358 INFO L116 PetriNetUnfolderBase]: 28331/46324 cut-off events. [2025-04-14 01:34:36,358 INFO L117 PetriNetUnfolderBase]: For 1708257/1708257 co-relation queries the response was YES. [2025-04-14 01:34:37,451 INFO L83 FinitePrefix]: Finished finitePrefix Result has 284454 conditions, 46324 events. 28331/46324 cut-off events. For 1708257/1708257 co-relation queries the response was YES. Maximal size of possible extension queue 992. Compared 339104 event pairs, 1304 based on Foata normal form. 420/46743 useless extension candidates. Maximal degree in co-relation 282087. Up to 8405 conditions per place. [2025-04-14 01:34:37,708 INFO L140 encePairwiseOnDemand]: 20/35 looper letters, 661 selfloop transitions, 699 changer transitions 67/1430 dead transitions. [2025-04-14 01:34:37,708 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 414 places, 1430 transitions, 19227 flow [2025-04-14 01:34:37,708 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-04-14 01:34:37,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2025-04-14 01:34:37,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 576 transitions. [2025-04-14 01:34:37,710 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.39183673469387753 [2025-04-14 01:34:37,710 INFO L175 Difference]: Start difference. First operand has 390 places, 837 transitions, 10271 flow. Second operand 42 states and 576 transitions. [2025-04-14 01:34:37,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 414 places, 1430 transitions, 19227 flow [2025-04-14 01:34:44,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 364 places, 1430 transitions, 17343 flow, removed 312 selfloop flow, removed 50 redundant places. [2025-04-14 01:34:44,869 INFO L231 Difference]: Finished difference. Result has 375 places, 1060 transitions, 13304 flow [2025-04-14 01:34:44,869 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=8830, PETRI_DIFFERENCE_MINUEND_PLACES=323, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=837, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=485, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=303, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=13304, PETRI_PLACES=375, PETRI_TRANSITIONS=1060} [2025-04-14 01:34:44,870 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 338 predicate places. [2025-04-14 01:34:44,870 INFO L485 AbstractCegarLoop]: Abstraction has has 375 places, 1060 transitions, 13304 flow [2025-04-14 01:34:44,870 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 8.9375) internal successors, (286), 32 states have internal predecessors, (286), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:34:44,870 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:34:44,870 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:34:44,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-14 01:34:45,075 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:34:45,075 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:34:45,076 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:34:45,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1223908401, now seen corresponding path program 5 times [2025-04-14 01:34:45,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:34:45,076 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122413474] [2025-04-14 01:34:45,076 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:34:45,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:34:45,082 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-14 01:34:45,092 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 01:34:45,092 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:34:45,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:34:45,146 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-14 01:34:45,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:34:45,146 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122413474] [2025-04-14 01:34:45,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122413474] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:34:45,146 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343424493] [2025-04-14 01:34:45,146 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-04-14 01:34:45,146 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:34:45,146 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:34:45,148 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:34:45,150 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-14 01:34:45,195 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 40 statements into 2 equivalence classes. [2025-04-14 01:34:45,221 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 40 of 40 statements. [2025-04-14 01:34:45,221 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:34:45,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:34:45,223 INFO L256 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-14 01:34:45,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:34:45,356 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:34:45,356 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:34:45,522 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-04-14 01:34:45,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343424493] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:34:45,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:34:45,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 8, 8] total 18 [2025-04-14 01:34:45,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287186802] [2025-04-14 01:34:45,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:34:45,523 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-14 01:34:45,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:34:45,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-14 01:34:45,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2025-04-14 01:34:45,523 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 8 out of 35 [2025-04-14 01:34:45,524 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 375 places, 1060 transitions, 13304 flow. Second operand has 19 states, 19 states have (on average 12.052631578947368) internal successors, (229), 19 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:34:45,524 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:34:45,524 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 8 of 35 [2025-04-14 01:34:45,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:34:48,605 INFO L116 PetriNetUnfolderBase]: 7775/14088 cut-off events. [2025-04-14 01:34:48,605 INFO L117 PetriNetUnfolderBase]: For 542659/542943 co-relation queries the response was YES. [2025-04-14 01:34:48,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 95472 conditions, 14088 events. 7775/14088 cut-off events. For 542659/542943 co-relation queries the response was YES. Maximal size of possible extension queue 409. Compared 100523 event pairs, 2366 based on Foata normal form. 360/14235 useless extension candidates. Maximal degree in co-relation 95380. Up to 3179 conditions per place. [2025-04-14 01:34:48,743 INFO L140 encePairwiseOnDemand]: 27/35 looper letters, 292 selfloop transitions, 137 changer transitions 101/557 dead transitions. [2025-04-14 01:34:48,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 286 places, 557 transitions, 8581 flow [2025-04-14 01:34:48,744 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-14 01:34:48,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2025-04-14 01:34:48,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 274 transitions. [2025-04-14 01:34:48,744 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48928571428571427 [2025-04-14 01:34:48,744 INFO L175 Difference]: Start difference. First operand has 375 places, 1060 transitions, 13304 flow. Second operand 16 states and 274 transitions. [2025-04-14 01:34:48,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 286 places, 557 transitions, 8581 flow [2025-04-14 01:34:49,961 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 245 places, 557 transitions, 7087 flow, removed 507 selfloop flow, removed 41 redundant places. [2025-04-14 01:34:49,967 INFO L231 Difference]: Finished difference. Result has 249 places, 324 transitions, 4204 flow [2025-04-14 01:34:49,967 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=3565, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=313, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=87, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=208, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=4204, PETRI_PLACES=249, PETRI_TRANSITIONS=324} [2025-04-14 01:34:49,968 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 212 predicate places. [2025-04-14 01:34:49,968 INFO L485 AbstractCegarLoop]: Abstraction has has 249 places, 324 transitions, 4204 flow [2025-04-14 01:34:49,968 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 12.052631578947368) internal successors, (229), 19 states have internal predecessors, (229), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:34:49,968 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:34:49,968 INFO L206 CegarLoopForPetriNet]: trace histogram [6, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:34:49,974 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-14 01:34:50,168 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:34:50,169 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:34:50,169 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:34:50,169 INFO L85 PathProgramCache]: Analyzing trace with hash 934852899, now seen corresponding path program 6 times [2025-04-14 01:34:50,169 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:34:50,169 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540313018] [2025-04-14 01:34:50,169 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:34:50,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:34:50,179 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 41 statements into 4 equivalence classes. [2025-04-14 01:34:50,213 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 39 of 41 statements. [2025-04-14 01:34:50,213 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 01:34:50,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:34:50,659 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-14 01:34:50,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:34:50,659 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540313018] [2025-04-14 01:34:50,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540313018] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:34:50,659 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147422595] [2025-04-14 01:34:50,659 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-04-14 01:34:50,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:34:50,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:34:50,665 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:34:50,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-14 01:34:50,743 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 41 statements into 4 equivalence classes. [2025-04-14 01:34:50,778 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 39 of 41 statements. [2025-04-14 01:34:50,778 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-04-14 01:34:50,778 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:34:50,780 INFO L256 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-14 01:34:50,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:34:51,091 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-14 01:34:51,091 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:34:51,473 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:34:51,473 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 60 [2025-04-14 01:34:51,761 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-04-14 01:34:51,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147422595] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:34:51,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:34:51,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 26 [2025-04-14 01:34:51,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365248054] [2025-04-14 01:34:51,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:34:51,762 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-14 01:34:51,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:34:51,763 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-14 01:34:51,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=590, Unknown=0, NotChecked=0, Total=702 [2025-04-14 01:34:51,783 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-04-14 01:34:51,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 324 transitions, 4204 flow. Second operand has 27 states, 27 states have (on average 10.148148148148149) internal successors, (274), 27 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:34:51,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:34:51,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-04-14 01:34:51,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:34:55,170 INFO L116 PetriNetUnfolderBase]: 11020/18959 cut-off events. [2025-04-14 01:34:55,170 INFO L117 PetriNetUnfolderBase]: For 215576/215754 co-relation queries the response was YES. [2025-04-14 01:34:55,321 INFO L83 FinitePrefix]: Finished finitePrefix Result has 101843 conditions, 18959 events. 11020/18959 cut-off events. For 215576/215754 co-relation queries the response was YES. Maximal size of possible extension queue 546. Compared 132804 event pairs, 1105 based on Foata normal form. 562/19402 useless extension candidates. Maximal degree in co-relation 101775. Up to 3361 conditions per place. [2025-04-14 01:34:55,381 INFO L140 encePairwiseOnDemand]: 23/35 looper letters, 320 selfloop transitions, 132 changer transitions 143/621 dead transitions. [2025-04-14 01:34:55,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 223 places, 621 transitions, 8780 flow [2025-04-14 01:34:55,381 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-04-14 01:34:55,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2025-04-14 01:34:55,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 344 transitions. [2025-04-14 01:34:55,382 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.46802721088435373 [2025-04-14 01:34:55,382 INFO L175 Difference]: Start difference. First operand has 249 places, 324 transitions, 4204 flow. Second operand 21 states and 344 transitions. [2025-04-14 01:34:55,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 223 places, 621 transitions, 8780 flow [2025-04-14 01:34:56,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 199 places, 621 transitions, 8015 flow, removed 260 selfloop flow, removed 24 redundant places. [2025-04-14 01:34:56,306 INFO L231 Difference]: Finished difference. Result has 205 places, 355 transitions, 4724 flow [2025-04-14 01:34:56,306 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=3807, PETRI_DIFFERENCE_MINUEND_PLACES=179, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=324, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=101, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=196, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=4724, PETRI_PLACES=205, PETRI_TRANSITIONS=355} [2025-04-14 01:34:56,306 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 168 predicate places. [2025-04-14 01:34:56,306 INFO L485 AbstractCegarLoop]: Abstraction has has 205 places, 355 transitions, 4724 flow [2025-04-14 01:34:56,306 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 10.148148148148149) internal successors, (274), 27 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:34:56,306 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:34:56,307 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:34:56,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-14 01:34:56,507 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-04-14 01:34:56,507 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:34:56,508 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:34:56,508 INFO L85 PathProgramCache]: Analyzing trace with hash 653160561, now seen corresponding path program 7 times [2025-04-14 01:34:56,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:34:56,508 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808228727] [2025-04-14 01:34:56,508 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:34:56,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:34:56,514 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-14 01:34:56,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-14 01:34:56,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:34:56,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:34:57,343 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 1 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:34:57,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:34:57,343 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808228727] [2025-04-14 01:34:57,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808228727] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:34:57,343 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1028910800] [2025-04-14 01:34:57,343 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-04-14 01:34:57,343 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:34:57,343 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:34:57,345 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:34:57,347 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-14 01:34:57,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-04-14 01:34:57,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-04-14 01:34:57,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:34:57,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:34:57,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 46 conjuncts are in the unsatisfiable core [2025-04-14 01:34:57,410 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:34:57,893 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:34:57,893 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:34:58,336 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:34:58,336 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 108 treesize of output 114 [2025-04-14 01:34:58,704 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:34:58,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1028910800] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:34:58,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:34:58,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 48 [2025-04-14 01:34:58,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117971751] [2025-04-14 01:34:58,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:34:58,705 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-04-14 01:34:58,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:34:58,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-04-14 01:34:58,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=304, Invalid=2048, Unknown=0, NotChecked=0, Total=2352 [2025-04-14 01:34:58,723 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2025-04-14 01:34:58,724 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 205 places, 355 transitions, 4724 flow. Second operand has 49 states, 49 states have (on average 8.448979591836734) internal successors, (414), 49 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:34:58,724 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:34:58,724 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2025-04-14 01:34:58,724 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:35:14,618 INFO L116 PetriNetUnfolderBase]: 41664/67666 cut-off events. [2025-04-14 01:35:14,619 INFO L117 PetriNetUnfolderBase]: For 589410/589410 co-relation queries the response was YES. [2025-04-14 01:35:15,343 INFO L83 FinitePrefix]: Finished finitePrefix Result has 354892 conditions, 67666 events. 41664/67666 cut-off events. For 589410/589410 co-relation queries the response was YES. Maximal size of possible extension queue 1361. Compared 514610 event pairs, 4525 based on Foata normal form. 3588/71253 useless extension candidates. Maximal degree in co-relation 354834. Up to 10641 conditions per place. [2025-04-14 01:35:15,531 INFO L140 encePairwiseOnDemand]: 19/35 looper letters, 1025 selfloop transitions, 838 changer transitions 581/2447 dead transitions. [2025-04-14 01:35:15,531 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 335 places, 2447 transitions, 32637 flow [2025-04-14 01:35:15,531 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2025-04-14 01:35:15,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2025-04-14 01:35:15,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 1904 transitions. [2025-04-14 01:35:15,534 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.40902255639097745 [2025-04-14 01:35:15,534 INFO L175 Difference]: Start difference. First operand has 205 places, 355 transitions, 4724 flow. Second operand 133 states and 1904 transitions. [2025-04-14 01:35:15,534 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 335 places, 2447 transitions, 32637 flow [2025-04-14 01:35:25,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 319 places, 2447 transitions, 31355 flow, removed 398 selfloop flow, removed 16 redundant places. [2025-04-14 01:35:25,911 INFO L231 Difference]: Finished difference. Result has 388 places, 1035 transitions, 17515 flow [2025-04-14 01:35:25,911 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=4407, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=228, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=133, PETRI_FLOW=17515, PETRI_PLACES=388, PETRI_TRANSITIONS=1035} [2025-04-14 01:35:25,911 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 351 predicate places. [2025-04-14 01:35:25,911 INFO L485 AbstractCegarLoop]: Abstraction has has 388 places, 1035 transitions, 17515 flow [2025-04-14 01:35:25,912 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 8.448979591836734) internal successors, (414), 49 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:35:25,912 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:35:25,912 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:35:25,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-14 01:35:26,112 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-04-14 01:35:26,113 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:35:26,113 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:35:26,113 INFO L85 PathProgramCache]: Analyzing trace with hash 2119823093, now seen corresponding path program 8 times [2025-04-14 01:35:26,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:35:26,113 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [100414989] [2025-04-14 01:35:26,114 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:35:26,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:35:26,119 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-14 01:35:26,128 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-14 01:35:26,128 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:35:26,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:35:26,776 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:35:26,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:35:26,776 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [100414989] [2025-04-14 01:35:26,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [100414989] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:35:26,777 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [882062685] [2025-04-14 01:35:26,777 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:35:26,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:35:26,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:35:26,778 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:35:26,780 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-14 01:35:26,821 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-14 01:35:26,845 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-14 01:35:26,845 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:35:26,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:35:26,847 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-04-14 01:35:26,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:35:26,937 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2025-04-14 01:35:27,492 INFO L325 Elim1Store]: treesize reduction 58, result has 10.8 percent of original size [2025-04-14 01:35:27,492 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 60 treesize of output 24 [2025-04-14 01:35:27,529 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:35:27,529 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:35:35,941 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 182 [2025-04-14 01:35:36,166 INFO L325 Elim1Store]: treesize reduction 20, result has 91.0 percent of original size [2025-04-14 01:35:36,167 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 528 treesize of output 564 [2025-04-14 01:35:58,700 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 01:35:58,848 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 01:36:10,435 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 01:36:19,172 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 01:36:19,766 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 01:36:23,823 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 01:36:25,598 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 01:36:29,007 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 01:36:29,770 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 01:36:31,077 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 01:36:32,088 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 01:36:39,558 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 01:36:41,374 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 01:36:44,524 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 01:36:45,080 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 01:36:47,441 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 01:36:48,271 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 01:36:54,310 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 01:36:56,802 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 01:37:00,053 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 01:37:01,411 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 01:37:05,317 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 01:37:06,118 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 01:37:30,985 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 01:38:00,846 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 01:38:22,303 WARN L656 sPolynomialRelations]: Constructing 64(two to the power of 6 dual juncts. [2025-04-14 01:41:23,968 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 17 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:41:23,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [882062685] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:41:23,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:41:23,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 16] total 45 [2025-04-14 01:41:23,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600758040] [2025-04-14 01:41:23,969 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:41:23,969 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-04-14 01:41:23,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:41:23,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-04-14 01:41:23,970 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=1724, Unknown=5, NotChecked=0, Total=2070 [2025-04-14 01:41:23,971 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 35 [2025-04-14 01:41:23,972 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 388 places, 1035 transitions, 17515 flow. Second operand has 46 states, 46 states have (on average 9.326086956521738) internal successors, (429), 46 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:41:23,972 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:41:23,972 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 35 [2025-04-14 01:41:23,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:41:26,562 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:41:28,816 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:41:36,200 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:41:46,998 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:41:48,019 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:41:54,089 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:42:00,056 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:42:07,523 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:42:14,353 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:42:21,481 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:42:22,730 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:42:37,321 INFO L116 PetriNetUnfolderBase]: 30913/53723 cut-off events. [2025-04-14 01:42:37,321 INFO L117 PetriNetUnfolderBase]: For 1678358/1678738 co-relation queries the response was YES. [2025-04-14 01:42:38,522 INFO L83 FinitePrefix]: Finished finitePrefix Result has 377923 conditions, 53723 events. 30913/53723 cut-off events. For 1678358/1678738 co-relation queries the response was YES. Maximal size of possible extension queue 1233. Compared 444199 event pairs, 6022 based on Foata normal form. 1976/55448 useless extension candidates. Maximal degree in co-relation 377801. Up to 15215 conditions per place. [2025-04-14 01:42:38,693 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 934 selfloop transitions, 269 changer transitions 470/1699 dead transitions. [2025-04-14 01:42:38,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 429 places, 1699 transitions, 30331 flow [2025-04-14 01:42:38,694 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-14 01:42:38,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2025-04-14 01:42:38,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 684 transitions. [2025-04-14 01:42:38,695 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4248447204968944 [2025-04-14 01:42:38,695 INFO L175 Difference]: Start difference. First operand has 388 places, 1035 transitions, 17515 flow. Second operand 46 states and 684 transitions. [2025-04-14 01:42:38,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 429 places, 1699 transitions, 30331 flow [2025-04-14 01:42:58,221 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 407 places, 1699 transitions, 26936 flow, removed 1434 selfloop flow, removed 22 redundant places. [2025-04-14 01:42:58,239 INFO L231 Difference]: Finished difference. Result has 418 places, 1017 transitions, 16029 flow [2025-04-14 01:42:58,239 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=14565, PETRI_DIFFERENCE_MINUEND_PLACES=362, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=986, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=210, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=744, PETRI_DIFFERENCE_SUBTRAHEND_STATES=46, PETRI_FLOW=16029, PETRI_PLACES=418, PETRI_TRANSITIONS=1017} [2025-04-14 01:42:58,240 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 381 predicate places. [2025-04-14 01:42:58,240 INFO L485 AbstractCegarLoop]: Abstraction has has 418 places, 1017 transitions, 16029 flow [2025-04-14 01:42:58,240 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 9.326086956521738) internal successors, (429), 46 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:42:58,240 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:42:58,240 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:42:58,246 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-14 01:42:58,440 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-14 01:42:58,441 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:42:58,441 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:42:58,441 INFO L85 PathProgramCache]: Analyzing trace with hash -880274203, now seen corresponding path program 9 times [2025-04-14 01:42:58,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:42:58,442 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808325257] [2025-04-14 01:42:58,442 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:42:58,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:42:58,449 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 3 equivalence classes. [2025-04-14 01:42:58,470 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 45 of 45 statements. [2025-04-14 01:42:58,470 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-14 01:42:58,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:42:59,211 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:42:59,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:42:59,211 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808325257] [2025-04-14 01:42:59,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808325257] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:42:59,211 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [112475598] [2025-04-14 01:42:59,211 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:42:59,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:42:59,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:42:59,214 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:42:59,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-14 01:42:59,255 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 3 equivalence classes. [2025-04-14 01:42:59,275 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 45 of 45 statements. [2025-04-14 01:42:59,275 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-14 01:42:59,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:42:59,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-04-14 01:42:59,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:43:00,095 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:43:00,096 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:43:00,097 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-14 01:43:00,098 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:43:00,100 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:43:00,100 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 41 treesize of output 18 [2025-04-14 01:43:00,144 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:43:00,145 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:43:01,277 INFO L325 Elim1Store]: treesize reduction 18, result has 89.3 percent of original size [2025-04-14 01:43:01,277 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 134 treesize of output 209 [2025-04-14 01:43:04,544 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:43:04,544 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [112475598] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:43:04,544 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-14 01:43:04,544 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19, 19] total 49 [2025-04-14 01:43:04,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923059154] [2025-04-14 01:43:04,545 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-14 01:43:04,545 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-04-14 01:43:04,545 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:43:04,545 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-04-14 01:43:04,546 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=420, Invalid=2030, Unknown=0, NotChecked=0, Total=2450 [2025-04-14 01:43:04,552 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 35 [2025-04-14 01:43:04,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 418 places, 1017 transitions, 16029 flow. Second operand has 50 states, 50 states have (on average 8.32) internal successors, (416), 50 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:43:04,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:43:04,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 35 [2025-04-14 01:43:04,552 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:43:11,843 WARN L532 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-04-14 01:44:09,035 INFO L116 PetriNetUnfolderBase]: 78286/129061 cut-off events. [2025-04-14 01:44:09,035 INFO L117 PetriNetUnfolderBase]: For 3795115/3795115 co-relation queries the response was YES. [2025-04-14 01:44:12,641 INFO L83 FinitePrefix]: Finished finitePrefix Result has 884826 conditions, 129061 events. 78286/129061 cut-off events. For 3795115/3795115 co-relation queries the response was YES. Maximal size of possible extension queue 2720. Compared 1090228 event pairs, 6772 based on Foata normal form. 4820/133880 useless extension candidates. Maximal degree in co-relation 884698. Up to 19411 conditions per place. [2025-04-14 01:44:13,199 INFO L140 encePairwiseOnDemand]: 22/35 looper letters, 1741 selfloop transitions, 1860 changer transitions 1342/4946 dead transitions. [2025-04-14 01:44:13,199 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 591 places, 4946 transitions, 87040 flow [2025-04-14 01:44:13,199 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 190 states. [2025-04-14 01:44:13,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2025-04-14 01:44:13,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 2869 transitions. [2025-04-14 01:44:13,203 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43142857142857144 [2025-04-14 01:44:13,203 INFO L175 Difference]: Start difference. First operand has 418 places, 1017 transitions, 16029 flow. Second operand 190 states and 2869 transitions. [2025-04-14 01:44:13,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 591 places, 4946 transitions, 87040 flow [2025-04-14 01:45:40,864 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 559 places, 4946 transitions, 82688 flow, removed 1304 selfloop flow, removed 32 redundant places. [2025-04-14 01:45:40,906 INFO L231 Difference]: Finished difference. Result has 643 places, 2211 transitions, 42890 flow [2025-04-14 01:45:40,907 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=35, PETRI_DIFFERENCE_MINUEND_FLOW=14421, PETRI_DIFFERENCE_MINUEND_PLACES=370, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=967, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=682, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=190, PETRI_FLOW=42890, PETRI_PLACES=643, PETRI_TRANSITIONS=2211} [2025-04-14 01:45:40,907 INFO L279 CegarLoopForPetriNet]: 37 programPoint places, 606 predicate places. [2025-04-14 01:45:40,907 INFO L485 AbstractCegarLoop]: Abstraction has has 643 places, 2211 transitions, 42890 flow [2025-04-14 01:45:40,908 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 8.32) internal successors, (416), 50 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:45:40,908 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:45:40,908 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:45:40,914 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-14 01:45:41,108 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:45:41,108 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2025-04-14 01:45:41,112 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:45:41,112 INFO L85 PathProgramCache]: Analyzing trace with hash 953729371, now seen corresponding path program 10 times [2025-04-14 01:45:41,112 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:45:41,112 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63234439] [2025-04-14 01:45:41,112 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:45:41,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:45:41,118 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-04-14 01:45:41,132 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-14 01:45:41,132 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:45:41,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:45:41,850 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 1 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:45:41,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:45:41,851 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63234439] [2025-04-14 01:45:41,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63234439] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:45:41,851 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1907988530] [2025-04-14 01:45:41,851 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:45:41,851 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:45:41,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:45:41,853 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:45:41,853 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-14 01:45:41,899 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 45 statements into 2 equivalence classes. [2025-04-14 01:45:41,920 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-14 01:45:41,920 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:45:41,920 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:45:41,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-04-14 01:45:41,928 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:45:41,999 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-14 01:45:42,499 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-14 01:45:42,500 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-14 01:45:42,501 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:45:42,502 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 43 treesize of output 18 [2025-04-14 01:45:42,548 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 0 proven. 23 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:45:42,549 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:45:44,376 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 198 treesize of output 180 [2025-04-14 01:45:44,481 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:45:44,481 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 556 treesize of output 540 Received shutdown request... [2025-04-14 01:46:06,884 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 4 remaining) [2025-04-14 01:46:06,891 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-14 01:46:06,911 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 01:46:06,915 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 01:46:07,085 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:46:07,086 WARN L610 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 46 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-4-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-20-3-1 context. [2025-04-14 01:46:07,087 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 4 remaining) [2025-04-14 01:46:07,088 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 4 remaining) [2025-04-14 01:46:07,088 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 4 remaining) [2025-04-14 01:46:07,088 INFO L422 BasicCegarLoop]: Path program histogram: [10, 6, 1, 1, 1, 1] [2025-04-14 01:46:07,091 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 01:46:07,091 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 01:46:07,096 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 01:46:07 BasicIcfg [2025-04-14 01:46:07,096 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 01:46:07,096 INFO L158 Benchmark]: Toolchain (without parser) took 798248.42ms. Allocated memory was 142.6MB in the beginning and 5.1GB in the end (delta: 5.0GB). Free memory was 99.1MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 5.4GB. Max. memory is 8.0GB. [2025-04-14 01:46:07,096 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 159.4MB. Free memory is still 88.2MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:46:07,097 INFO L158 Benchmark]: CACSL2BoogieTranslator took 296.93ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 83.9MB in the end (delta: 14.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2025-04-14 01:46:07,097 INFO L158 Benchmark]: Boogie Procedure Inliner took 41.16ms. Allocated memory is still 142.6MB. Free memory was 83.9MB in the beginning and 81.9MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 01:46:07,097 INFO L158 Benchmark]: Boogie Preprocessor took 46.09ms. Allocated memory is still 142.6MB. Free memory was 81.9MB in the beginning and 79.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:46:07,097 INFO L158 Benchmark]: IcfgBuilder took 516.94ms. Allocated memory is still 142.6MB. Free memory was 79.7MB in the beginning and 34.1MB in the end (delta: 45.5MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. [2025-04-14 01:46:07,097 INFO L158 Benchmark]: TraceAbstraction took 797340.16ms. Allocated memory was 142.6MB in the beginning and 5.1GB in the end (delta: 5.0GB). Free memory was 33.6MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 5.3GB. Max. memory is 8.0GB. [2025-04-14 01:46:07,098 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 159.4MB. Free memory is still 88.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 296.93ms. Allocated memory is still 142.6MB. Free memory was 98.6MB in the beginning and 83.9MB in the end (delta: 14.7MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 41.16ms. Allocated memory is still 142.6MB. Free memory was 83.9MB in the beginning and 81.9MB in the end (delta: 2.0MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 46.09ms. Allocated memory is still 142.6MB. Free memory was 81.9MB in the beginning and 79.7MB in the end (delta: 2.2MB). There was no memory consumed. Max. memory is 8.0GB. * IcfgBuilder took 516.94ms. Allocated memory is still 142.6MB. Free memory was 79.7MB in the beginning and 34.1MB in the end (delta: 45.5MB). Peak memory consumption was 46.1MB. Max. memory is 8.0GB. * TraceAbstraction took 797340.16ms. Allocated memory was 142.6MB in the beginning and 5.1GB in the end (delta: 5.0GB). Free memory was 33.6MB in the beginning and 1.4GB in the end (delta: -1.4GB). Peak memory consumption was 5.3GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 117]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 46 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-4-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-20-3-1 context. - TimeoutResultAtElement [Line: 110]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 46 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-4-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-20-3-1 context. - TimeoutResultAtElement [Line: 112]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 46 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-4-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-20-3-1 context. - TimeoutResultAtElement [Line: 111]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 46 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while PolyPacSimplificationTermWalker was simplifying a ∨-4-1 term,while PolyPacSimplificationTermWalker was simplifying 4 xjuncts wrt. a ∧-20-3-1 context. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 53 locations, 59 edges, 4 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 797.2s, OverallIterations: 20, TraceHistogramMax: 6, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 389.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 40 mSolverCounterUnknown, 9719 SdHoareTripleChecker+Valid, 65.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 9707 mSDsluCounter, 2058 SdHoareTripleChecker+Invalid, 63.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2006 mSDsCounter, 1292 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24223 IncrementalHoareTripleChecker+Invalid, 25555 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1292 mSolverCounterUnsat, 52 mSDtfsCounter, 24223 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1687 GetRequests, 633 SyntacticMatches, 1 SemanticMatches, 1053 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52614 ImplicationChecksByTransitivity, 70.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42890occurred in iteration=19, InterpolantAutomatonStates: 794, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 378.0s InterpolantComputationTime, 1089 NumberOfCodeBlocks, 1084 NumberOfCodeBlocksAsserted, 54 NumberOfCheckSat, 1478 ConstructedInterpolants, 65 QuantifiedInterpolants, 29589 SizeOfPredicates, 118 NumberOfNonLiveVariables, 2487 ConjunctsInSsa, 367 ConjunctsInUnsatCore, 41 InterpolantComputations, 8 PerfectInterpolantSequences, 135/433 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown