/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/pthread/stack_longer-2.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-13 23:47:49,010 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-13 23:47:49,063 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-13 23:47:49,068 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-13 23:47:49,068 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-13 23:47:49,091 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-13 23:47:49,092 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-13 23:47:49,092 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-13 23:47:49,092 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-13 23:47:49,092 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-13 23:47:49,092 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-13 23:47:49,092 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-13 23:47:49,092 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-13 23:47:49,092 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-13 23:47:49,093 INFO L153 SettingsManager]: * Use SBE=true [2025-04-13 23:47:49,093 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-13 23:47:49,093 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-13 23:47:49,093 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-13 23:47:49,093 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-13 23:47:49,093 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-13 23:47:49,093 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-13 23:47:49,093 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-13 23:47:49,093 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-13 23:47:49,093 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-13 23:47:49,093 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-13 23:47:49,093 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-13 23:47:49,093 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-13 23:47:49,093 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-13 23:47:49,093 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-13 23:47:49,093 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:47:49,094 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:47:49,094 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:47:49,094 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:47:49,094 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-13 23:47:49,094 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-13 23:47:49,094 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-13 23:47:49,094 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-13 23:47:49,094 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:47:49,094 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-13 23:47:49,094 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-13 23:47:49,094 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-13 23:47:49,094 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-13 23:47:49,094 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-13 23:47:49,094 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-13 23:47:49,094 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-13 23:47:49,094 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-13 23:47:49,094 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-13 23:47:49,095 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-13 23:47:49,324 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-13 23:47:49,329 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-13 23:47:49,334 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-13 23:47:49,334 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-13 23:47:49,335 INFO L274 PluginConnector]: CDTParser initialized [2025-04-13 23:47:49,337 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/stack_longer-2.i [2025-04-13 23:47:50,679 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2dd1525a/6fe04b01ce084405967c635c7c6de2d7/FLAGfc8d092f4 [2025-04-13 23:47:50,926 INFO L389 CDTParser]: Found 1 translation units. [2025-04-13 23:47:50,927 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longer-2.i [2025-04-13 23:47:50,939 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2dd1525a/6fe04b01ce084405967c635c7c6de2d7/FLAGfc8d092f4 [2025-04-13 23:47:51,677 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2dd1525a/6fe04b01ce084405967c635c7c6de2d7 [2025-04-13 23:47:51,679 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-13 23:47:51,680 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-13 23:47:51,681 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-13 23:47:51,681 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-13 23:47:51,684 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-13 23:47:51,684 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:47:51" (1/1) ... [2025-04-13 23:47:51,685 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9b569e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:47:51, skipping insertion in model container [2025-04-13 23:47:51,685 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 11:47:51" (1/1) ... [2025-04-13 23:47:51,714 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-13 23:47:51,957 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longer-2.i[41529,41542] [2025-04-13 23:47:51,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:47:52,000 INFO L200 MainTranslator]: Completed pre-run [2025-04-13 23:47:52,047 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread/stack_longer-2.i[41529,41542] [2025-04-13 23:47:52,057 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-13 23:47:52,122 INFO L204 MainTranslator]: Completed translation [2025-04-13 23:47:52,123 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:47:52 WrapperNode [2025-04-13 23:47:52,123 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-13 23:47:52,124 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-13 23:47:52,124 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-13 23:47:52,124 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-13 23:47:52,128 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:47:52" (1/1) ... [2025-04-13 23:47:52,149 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:47:52" (1/1) ... [2025-04-13 23:47:52,192 INFO L138 Inliner]: procedures = 277, calls = 430, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 539 [2025-04-13 23:47:52,192 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-13 23:47:52,193 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-13 23:47:52,193 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-13 23:47:52,193 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-13 23:47:52,201 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:47:52" (1/1) ... [2025-04-13 23:47:52,202 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:47:52" (1/1) ... [2025-04-13 23:47:52,210 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:47:52" (1/1) ... [2025-04-13 23:47:52,242 INFO L175 MemorySlicer]: Split 409 memory accesses to 3 slices as follows [2, 5, 402]. 98 percent of accesses are in the largest equivalence class. The 407 initializations are split as follows [2, 5, 400]. The 1 writes are split as follows [0, 0, 1]. [2025-04-13 23:47:52,242 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:47:52" (1/1) ... [2025-04-13 23:47:52,242 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:47:52" (1/1) ... [2025-04-13 23:47:52,263 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:47:52" (1/1) ... [2025-04-13 23:47:52,267 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:47:52" (1/1) ... [2025-04-13 23:47:52,268 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:47:52" (1/1) ... [2025-04-13 23:47:52,269 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:47:52" (1/1) ... [2025-04-13 23:47:52,279 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-13 23:47:52,280 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-13 23:47:52,280 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-13 23:47:52,280 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-13 23:47:52,281 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:47:52" (1/1) ... [2025-04-13 23:47:52,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-13 23:47:52,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:47:52,307 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-13 23:47:52,309 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-13 23:47:52,327 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-13 23:47:52,327 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-13 23:47:52,327 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-13 23:47:52,327 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-13 23:47:52,328 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-13 23:47:52,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-13 23:47:52,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-13 23:47:52,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-13 23:47:52,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-13 23:47:52,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-13 23:47:52,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-13 23:47:52,328 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-13 23:47:52,328 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-13 23:47:52,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-13 23:47:52,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-13 23:47:52,328 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-13 23:47:52,328 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-13 23:47:52,328 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-13 23:47:52,330 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-13 23:47:52,458 INFO L256 CfgBuilder]: Building ICFG [2025-04-13 23:47:52,460 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-13 23:47:53,114 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L985-1: pop_#res#1 := 0; [2025-04-13 23:47:53,115 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L983: havoc pop_#t~mem37#1; [2025-04-13 23:47:53,115 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L983-1: havoc pop_#t~ret36#1; [2025-04-13 23:47:53,116 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-13 23:47:53,116 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-13 23:47:53,116 INFO L318 CfgBuilder]: Performing block encoding [2025-04-13 23:47:56,500 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 23:47:56,501 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-13 23:47:56,505 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-13 23:47:56,505 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:47:56 BoogieIcfgContainer [2025-04-13 23:47:56,505 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-13 23:47:56,507 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-13 23:47:56,507 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-13 23:47:56,510 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-13 23:47:56,510 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 11:47:51" (1/3) ... [2025-04-13 23:47:56,511 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49013161 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:47:56, skipping insertion in model container [2025-04-13 23:47:56,511 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 11:47:52" (2/3) ... [2025-04-13 23:47:56,512 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@49013161 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 11:47:56, skipping insertion in model container [2025-04-13 23:47:56,512 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 13.04 11:47:56" (3/3) ... [2025-04-13 23:47:56,513 INFO L128 eAbstractionObserver]: Analyzing ICFG stack_longer-2.i [2025-04-13 23:47:56,524 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-13 23:47:56,525 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG stack_longer-2.i that has 3 procedures, 23 locations, 24 edges, 1 initial locations, 2 loop locations, and 2 error locations. [2025-04-13 23:47:56,525 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-13 23:47:56,590 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-13 23:47:56,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 29 places, 26 transitions, 66 flow [2025-04-13 23:47:56,651 INFO L116 PetriNetUnfolderBase]: 4/24 cut-off events. [2025-04-13 23:47:56,652 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-13 23:47:56,654 INFO L83 FinitePrefix]: Finished finitePrefix Result has 33 conditions, 24 events. 4/24 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 40 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 21. Up to 2 conditions per place. [2025-04-13 23:47:56,654 INFO L82 GeneralOperation]: Start removeDead. Operand has 29 places, 26 transitions, 66 flow [2025-04-13 23:47:56,657 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 25 places, 22 transitions, 53 flow [2025-04-13 23:47:56,665 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-13 23:47:56,678 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;@860540, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-13 23:47:56,678 INFO L341 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2025-04-13 23:47:56,699 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-13 23:47:56,699 INFO L116 PetriNetUnfolderBase]: 0/10 cut-off events. [2025-04-13 23:47:56,699 INFO L117 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2025-04-13 23:47:56,699 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:47:56,700 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-13 23:47:56,700 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:47:56,704 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:47:56,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1090105348, now seen corresponding path program 1 times [2025-04-13 23:47:56,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:47:56,712 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000462027] [2025-04-13 23:47:56,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:47:56,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:47:56,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-13 23:47:56,897 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-13 23:47:56,897 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:47:56,897 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:47:57,261 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-13 23:47:57,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:47:57,261 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000462027] [2025-04-13 23:47:57,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000462027] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:47:57,262 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:47:57,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-13 23:47:57,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922931979] [2025-04-13 23:47:57,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:47:57,269 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:47:57,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:47:57,288 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:47:57,288 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:47:57,290 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 23:47:57,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 22 transitions, 53 flow. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-13 23:47:57,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:47:57,292 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 23:47:57,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:47:57,473 INFO L116 PetriNetUnfolderBase]: 206/352 cut-off events. [2025-04-13 23:47:57,473 INFO L117 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-04-13 23:47:57,474 INFO L83 FinitePrefix]: Finished finitePrefix Result has 735 conditions, 352 events. 206/352 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1182 event pairs, 52 based on Foata normal form. 0/288 useless extension candidates. Maximal degree in co-relation 690. Up to 263 conditions per place. [2025-04-13 23:47:57,478 INFO L140 encePairwiseOnDemand]: 20/26 looper letters, 29 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2025-04-13 23:47:57,478 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 31 transitions, 136 flow [2025-04-13 23:47:57,479 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:47:57,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:47:57,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 42 transitions. [2025-04-13 23:47:57,488 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5384615384615384 [2025-04-13 23:47:57,489 INFO L175 Difference]: Start difference. First operand has 25 places, 22 transitions, 53 flow. Second operand 3 states and 42 transitions. [2025-04-13 23:47:57,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 31 transitions, 136 flow [2025-04-13 23:47:57,492 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 24 places, 31 transitions, 130 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-13 23:47:57,495 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 58 flow [2025-04-13 23:47:57,497 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=25, PETRI_TRANSITIONS=21} [2025-04-13 23:47:57,500 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 0 predicate places. [2025-04-13 23:47:57,500 INFO L485 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 58 flow [2025-04-13 23:47:57,500 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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-13 23:47:57,500 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:47:57,500 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:47:57,500 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-13 23:47:57,500 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:47:57,501 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:47:57,501 INFO L85 PathProgramCache]: Analyzing trace with hash -822168217, now seen corresponding path program 1 times [2025-04-13 23:47:57,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:47:57,502 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [657060825] [2025-04-13 23:47:57,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:47:57,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:47:57,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 23:47:57,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 23:47:57,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:47:57,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:47:57,809 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:47:57,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:47:57,809 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [657060825] [2025-04-13 23:47:57,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [657060825] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:47:57,809 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138488534] [2025-04-13 23:47:57,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:47:57,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:47:57,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:47:57,813 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-13 23:47:57,815 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-13 23:47:57,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-13 23:47:57,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-13 23:47:57,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:47:57,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:47:57,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 912 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-13 23:47:58,004 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:47:58,061 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 8 treesize of output 1 [2025-04-13 23:47:58,097 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:47:58,098 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:47:58,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:47:58,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138488534] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:47:58,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:47:58,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2, 2] total 6 [2025-04-13 23:47:58,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776272861] [2025-04-13 23:47:58,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:47:58,134 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-13 23:47:58,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:47:58,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-13 23:47:58,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2025-04-13 23:47:58,135 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 23:47:58,135 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 58 flow. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 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-13 23:47:58,135 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:47:58,135 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 23:47:58,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:47:58,490 INFO L116 PetriNetUnfolderBase]: 771/1322 cut-off events. [2025-04-13 23:47:58,490 INFO L117 PetriNetUnfolderBase]: For 92/92 co-relation queries the response was YES. [2025-04-13 23:47:58,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2901 conditions, 1322 events. 771/1322 cut-off events. For 92/92 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 5747 event pairs, 54 based on Foata normal form. 11/1141 useless extension candidates. Maximal degree in co-relation 2577. Up to 270 conditions per place. [2025-04-13 23:47:58,497 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 94 selfloop transitions, 17 changer transitions 2/113 dead transitions. [2025-04-13 23:47:58,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 113 transitions, 506 flow [2025-04-13 23:47:58,498 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-13 23:47:58,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2025-04-13 23:47:58,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 134 transitions. [2025-04-13 23:47:58,499 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.6442307692307693 [2025-04-13 23:47:58,499 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 58 flow. Second operand 8 states and 134 transitions. [2025-04-13 23:47:58,499 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 113 transitions, 506 flow [2025-04-13 23:47:58,500 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 31 places, 113 transitions, 504 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 23:47:58,501 INFO L231 Difference]: Finished difference. Result has 37 places, 38 transitions, 194 flow [2025-04-13 23:47:58,501 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=194, PETRI_PLACES=37, PETRI_TRANSITIONS=38} [2025-04-13 23:47:58,502 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 12 predicate places. [2025-04-13 23:47:58,502 INFO L485 AbstractCegarLoop]: Abstraction has has 37 places, 38 transitions, 194 flow [2025-04-13 23:47:58,502 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 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-13 23:47:58,502 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:47:58,502 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:47:58,510 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-13 23:47:58,702 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:47:58,703 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:47:58,703 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:47:58,703 INFO L85 PathProgramCache]: Analyzing trace with hash 247517618, now seen corresponding path program 1 times [2025-04-13 23:47:58,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:47:58,703 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1751331688] [2025-04-13 23:47:58,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:47:58,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:47:58,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-13 23:47:58,739 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-13 23:47:58,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:47:58,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:47:58,889 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-13 23:47:58,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:47:58,889 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1751331688] [2025-04-13 23:47:58,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1751331688] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:47:58,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:47:58,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-13 23:47:58,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195312249] [2025-04-13 23:47:58,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:47:58,890 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:47:58,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:47:58,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:47:58,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-13 23:47:58,890 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 23:47:58,891 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 38 transitions, 194 flow. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-13 23:47:58,891 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:47:58,891 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 23:47:58,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:47:59,048 INFO L116 PetriNetUnfolderBase]: 531/934 cut-off events. [2025-04-13 23:47:59,048 INFO L117 PetriNetUnfolderBase]: For 390/390 co-relation queries the response was YES. [2025-04-13 23:47:59,049 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2329 conditions, 934 events. 531/934 cut-off events. For 390/390 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3971 event pairs, 194 based on Foata normal form. 52/830 useless extension candidates. Maximal degree in co-relation 2011. Up to 505 conditions per place. [2025-04-13 23:47:59,053 INFO L140 encePairwiseOnDemand]: 22/26 looper letters, 43 selfloop transitions, 4 changer transitions 0/47 dead transitions. [2025-04-13 23:47:59,053 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 47 transitions, 303 flow [2025-04-13 23:47:59,053 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:47:59,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:47:59,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2025-04-13 23:47:59,054 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48717948717948717 [2025-04-13 23:47:59,054 INFO L175 Difference]: Start difference. First operand has 37 places, 38 transitions, 194 flow. Second operand 3 states and 38 transitions. [2025-04-13 23:47:59,054 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 47 transitions, 303 flow [2025-04-13 23:47:59,057 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 47 transitions, 283 flow, removed 10 selfloop flow, removed 0 redundant places. [2025-04-13 23:47:59,058 INFO L231 Difference]: Finished difference. Result has 39 places, 37 transitions, 174 flow [2025-04-13 23:47:59,058 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=174, PETRI_PLACES=39, PETRI_TRANSITIONS=37} [2025-04-13 23:47:59,058 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 14 predicate places. [2025-04-13 23:47:59,058 INFO L485 AbstractCegarLoop]: Abstraction has has 39 places, 37 transitions, 174 flow [2025-04-13 23:47:59,058 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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-13 23:47:59,059 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:47:59,059 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:47:59,059 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-13 23:47:59,059 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:47:59,059 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:47:59,059 INFO L85 PathProgramCache]: Analyzing trace with hash -920726516, now seen corresponding path program 1 times [2025-04-13 23:47:59,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:47:59,059 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065676869] [2025-04-13 23:47:59,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:47:59,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:47:59,072 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-13 23:47:59,226 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-13 23:47:59,227 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:47:59,227 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:47:59,852 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-13 23:47:59,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:47:59,852 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065676869] [2025-04-13 23:47:59,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065676869] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:47:59,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-13 23:47:59,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-13 23:47:59,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513266342] [2025-04-13 23:47:59,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:47:59,852 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:47:59,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:47:59,853 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:47:59,853 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-13 23:47:59,853 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 23:47:59,853 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 37 transitions, 174 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-13 23:47:59,853 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:47:59,853 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 23:47:59,853 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:00,020 INFO L116 PetriNetUnfolderBase]: 636/1120 cut-off events. [2025-04-13 23:48:00,020 INFO L117 PetriNetUnfolderBase]: For 437/437 co-relation queries the response was YES. [2025-04-13 23:48:00,022 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2875 conditions, 1120 events. 636/1120 cut-off events. For 437/437 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 4807 event pairs, 181 based on Foata normal form. 7/912 useless extension candidates. Maximal degree in co-relation 2509. Up to 816 conditions per place. [2025-04-13 23:48:00,026 INFO L140 encePairwiseOnDemand]: 23/26 looper letters, 57 selfloop transitions, 4 changer transitions 2/63 dead transitions. [2025-04-13 23:48:00,026 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 63 transitions, 385 flow [2025-04-13 23:48:00,026 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-13 23:48:00,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-13 23:48:00,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 55 transitions. [2025-04-13 23:48:00,027 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5288461538461539 [2025-04-13 23:48:00,027 INFO L175 Difference]: Start difference. First operand has 39 places, 37 transitions, 174 flow. Second operand 4 states and 55 transitions. [2025-04-13 23:48:00,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 63 transitions, 385 flow [2025-04-13 23:48:00,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 63 transitions, 374 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-13 23:48:00,033 INFO L231 Difference]: Finished difference. Result has 42 places, 39 transitions, 199 flow [2025-04-13 23:48:00,033 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=199, PETRI_PLACES=42, PETRI_TRANSITIONS=39} [2025-04-13 23:48:00,034 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 17 predicate places. [2025-04-13 23:48:00,034 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 39 transitions, 199 flow [2025-04-13 23:48:00,034 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 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-13 23:48:00,034 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:00,034 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:00,034 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-13 23:48:00,035 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:48:00,035 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:00,035 INFO L85 PathProgramCache]: Analyzing trace with hash -75518421, now seen corresponding path program 1 times [2025-04-13 23:48:00,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:00,035 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756428038] [2025-04-13 23:48:00,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:48:00,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:00,051 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 23:48:00,079 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 23:48:00,079 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:48:00,079 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:00,599 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:00,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:00,599 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756428038] [2025-04-13 23:48:00,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756428038] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:48:00,600 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621961231] [2025-04-13 23:48:00,600 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:48:00,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:00,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:48:00,601 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-13 23:48:00,603 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-13 23:48:00,668 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-13 23:48:00,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-13 23:48:00,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:48:00,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:00,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 954 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 23:48:00,763 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:48:00,791 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 25 treesize of output 1 [2025-04-13 23:48:00,828 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:48:00,829 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-13 23:48:00,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621961231] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-13 23:48:00,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-13 23:48:00,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2025-04-13 23:48:00,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951304019] [2025-04-13 23:48:00,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:48:00,829 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-13 23:48:00,829 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:00,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-13 23:48:00,830 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-13 23:48:00,830 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 23:48:00,830 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 199 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-13 23:48:00,830 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:00,830 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 23:48:00,830 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:00,972 INFO L116 PetriNetUnfolderBase]: 665/1175 cut-off events. [2025-04-13 23:48:00,973 INFO L117 PetriNetUnfolderBase]: For 589/589 co-relation queries the response was YES. [2025-04-13 23:48:01,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2891 conditions, 1175 events. 665/1175 cut-off events. For 589/589 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 5135 event pairs, 156 based on Foata normal form. 7/960 useless extension candidates. Maximal degree in co-relation 2528. Up to 669 conditions per place. [2025-04-13 23:48:01,033 INFO L140 encePairwiseOnDemand]: 23/26 looper letters, 41 selfloop transitions, 9 changer transitions 0/50 dead transitions. [2025-04-13 23:48:01,033 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 50 transitions, 321 flow [2025-04-13 23:48:01,033 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-13 23:48:01,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-13 23:48:01,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2025-04-13 23:48:01,034 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5256410256410257 [2025-04-13 23:48:01,034 INFO L175 Difference]: Start difference. First operand has 42 places, 39 transitions, 199 flow. Second operand 3 states and 41 transitions. [2025-04-13 23:48:01,034 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 50 transitions, 321 flow [2025-04-13 23:48:01,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 50 transitions, 310 flow, removed 1 selfloop flow, removed 4 redundant places. [2025-04-13 23:48:01,038 INFO L231 Difference]: Finished difference. Result has 42 places, 38 transitions, 220 flow [2025-04-13 23:48:01,038 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=170, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=220, PETRI_PLACES=42, PETRI_TRANSITIONS=38} [2025-04-13 23:48:01,038 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 17 predicate places. [2025-04-13 23:48:01,038 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 38 transitions, 220 flow [2025-04-13 23:48:01,038 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 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-13 23:48:01,038 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:01,038 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:01,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-13 23:48:01,239 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:01,239 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:48:01,241 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:01,241 INFO L85 PathProgramCache]: Analyzing trace with hash -1248919696, now seen corresponding path program 1 times [2025-04-13 23:48:01,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:01,241 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759112441] [2025-04-13 23:48:01,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:48:01,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:01,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 23:48:01,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 23:48:01,274 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:48:01,274 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:01,516 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:01,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:01,516 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1759112441] [2025-04-13 23:48:01,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1759112441] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:48:01,517 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044703512] [2025-04-13 23:48:01,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:48:01,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:01,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:48:01,519 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-13 23:48:01,520 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-13 23:48:01,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 23:48:01,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 23:48:01,683 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:48:01,683 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:01,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 975 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-13 23:48:01,693 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:48:01,705 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 8 treesize of output 1 [2025-04-13 23:48:01,733 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 8 treesize of output 1 [2025-04-13 23:48:01,879 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:01,879 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:48:01,993 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-13 23:48:01,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044703512] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-13 23:48:01,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-13 23:48:01,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 10 [2025-04-13 23:48:01,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014505404] [2025-04-13 23:48:01,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-13 23:48:01,994 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-13 23:48:01,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:01,994 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-13 23:48:01,994 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-04-13 23:48:01,995 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 23:48:01,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 38 transitions, 220 flow. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-13 23:48:01,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:01,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 23:48:01,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:02,194 INFO L116 PetriNetUnfolderBase]: 869/1538 cut-off events. [2025-04-13 23:48:02,195 INFO L117 PetriNetUnfolderBase]: For 1013/1013 co-relation queries the response was YES. [2025-04-13 23:48:02,197 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3902 conditions, 1538 events. 869/1538 cut-off events. For 1013/1013 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 7009 event pairs, 78 based on Foata normal form. 12/1274 useless extension candidates. Maximal degree in co-relation 3463. Up to 708 conditions per place. [2025-04-13 23:48:02,201 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 50 selfloop transitions, 23 changer transitions 0/73 dead transitions. [2025-04-13 23:48:02,201 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 73 transitions, 498 flow [2025-04-13 23:48:02,202 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-13 23:48:02,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-13 23:48:02,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 64 transitions. [2025-04-13 23:48:02,202 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49230769230769234 [2025-04-13 23:48:02,202 INFO L175 Difference]: Start difference. First operand has 42 places, 38 transitions, 220 flow. Second operand 5 states and 64 transitions. [2025-04-13 23:48:02,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 73 transitions, 498 flow [2025-04-13 23:48:02,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 73 transitions, 433 flow, removed 2 selfloop flow, removed 8 redundant places. [2025-04-13 23:48:02,206 INFO L231 Difference]: Finished difference. Result has 40 places, 48 transitions, 312 flow [2025-04-13 23:48:02,207 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=312, PETRI_PLACES=40, PETRI_TRANSITIONS=48} [2025-04-13 23:48:02,207 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 15 predicate places. [2025-04-13 23:48:02,207 INFO L485 AbstractCegarLoop]: Abstraction has has 40 places, 48 transitions, 312 flow [2025-04-13 23:48:02,207 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-13 23:48:02,207 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:02,207 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:02,215 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-13 23:48:02,408 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:02,408 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:48:02,408 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:02,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1132525042, now seen corresponding path program 1 times [2025-04-13 23:48:02,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:02,409 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632636527] [2025-04-13 23:48:02,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:48:02,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:02,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 23:48:02,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 23:48:02,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:48:02,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:03,164 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:03,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:03,164 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632636527] [2025-04-13 23:48:03,164 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632636527] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:48:03,164 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1041194576] [2025-04-13 23:48:03,164 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:48:03,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:03,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:48:03,166 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-13 23:48:03,167 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-13 23:48:03,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-04-13 23:48:03,330 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-04-13 23:48:03,331 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:48:03,331 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:03,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 972 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-13 23:48:03,339 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:48:03,366 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-13 23:48:03,408 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 34 treesize of output 14 [2025-04-13 23:48:03,508 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:03,508 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:48:03,781 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:03,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1041194576] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:48:03,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:48:03,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 12 [2025-04-13 23:48:03,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697844360] [2025-04-13 23:48:03,781 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:48:03,782 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-13 23:48:03,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:03,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-13 23:48:03,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-04-13 23:48:03,783 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 23:48:03,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 48 transitions, 312 flow. Second operand has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 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-13 23:48:03,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:03,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 23:48:03,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:04,261 INFO L116 PetriNetUnfolderBase]: 1342/2382 cut-off events. [2025-04-13 23:48:04,261 INFO L117 PetriNetUnfolderBase]: For 1604/1604 co-relation queries the response was YES. [2025-04-13 23:48:04,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6094 conditions, 2382 events. 1342/2382 cut-off events. For 1604/1604 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 11451 event pairs, 316 based on Foata normal form. 18/1951 useless extension candidates. Maximal degree in co-relation 5656. Up to 713 conditions per place. [2025-04-13 23:48:04,270 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 88 selfloop transitions, 36 changer transitions 8/132 dead transitions. [2025-04-13 23:48:04,270 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 132 transitions, 887 flow [2025-04-13 23:48:04,271 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-13 23:48:04,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2025-04-13 23:48:04,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 124 transitions. [2025-04-13 23:48:04,271 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5299145299145299 [2025-04-13 23:48:04,272 INFO L175 Difference]: Start difference. First operand has 40 places, 48 transitions, 312 flow. Second operand 9 states and 124 transitions. [2025-04-13 23:48:04,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 132 transitions, 887 flow [2025-04-13 23:48:04,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 132 transitions, 851 flow, removed 6 selfloop flow, removed 1 redundant places. [2025-04-13 23:48:04,276 INFO L231 Difference]: Finished difference. Result has 52 places, 63 transitions, 549 flow [2025-04-13 23:48:04,276 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=283, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=549, PETRI_PLACES=52, PETRI_TRANSITIONS=63} [2025-04-13 23:48:04,277 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 27 predicate places. [2025-04-13 23:48:04,277 INFO L485 AbstractCegarLoop]: Abstraction has has 52 places, 63 transitions, 549 flow [2025-04-13 23:48:04,277 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 6.384615384615385) internal successors, (83), 13 states have internal predecessors, (83), 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-13 23:48:04,277 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:04,277 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1] [2025-04-13 23:48:04,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-13 23:48:04,477 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:04,478 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:48:04,478 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:04,478 INFO L85 PathProgramCache]: Analyzing trace with hash -26981232, now seen corresponding path program 2 times [2025-04-13 23:48:04,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:04,478 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585702538] [2025-04-13 23:48:04,478 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:48:04,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:04,492 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:48:04,506 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:48:04,507 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:48:04,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:04,701 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:04,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:04,701 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585702538] [2025-04-13 23:48:04,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585702538] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:48:04,701 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75618544] [2025-04-13 23:48:04,701 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:48:04,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:04,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:48:04,703 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-13 23:48:04,705 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-13 23:48:04,777 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 21 statements into 2 equivalence classes. [2025-04-13 23:48:04,863 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 21 of 21 statements. [2025-04-13 23:48:04,863 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:48:04,863 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:04,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 987 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-04-13 23:48:04,872 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:48:04,879 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 8 treesize of output 1 [2025-04-13 23:48:04,903 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 8 treesize of output 1 [2025-04-13 23:48:04,920 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 8 treesize of output 1 [2025-04-13 23:48:04,940 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 8 treesize of output 1 [2025-04-13 23:48:04,956 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:04,956 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:48:05,020 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:05,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75618544] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:48:05,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:48:05,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2025-04-13 23:48:05,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064511892] [2025-04-13 23:48:05,020 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:48:05,020 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-13 23:48:05,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:05,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-13 23:48:05,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=146, Unknown=0, NotChecked=0, Total=240 [2025-04-13 23:48:05,021 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 23:48:05,021 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 63 transitions, 549 flow. Second operand has 16 states, 16 states have (on average 5.6875) internal successors, (91), 16 states have internal predecessors, (91), 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-13 23:48:05,021 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:05,021 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 23:48:05,021 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:06,232 INFO L116 PetriNetUnfolderBase]: 4070/7096 cut-off events. [2025-04-13 23:48:06,233 INFO L117 PetriNetUnfolderBase]: For 10193/10193 co-relation queries the response was YES. [2025-04-13 23:48:06,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19768 conditions, 7096 events. 4070/7096 cut-off events. For 10193/10193 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 37124 event pairs, 737 based on Foata normal form. 96/5868 useless extension candidates. Maximal degree in co-relation 18959. Up to 1300 conditions per place. [2025-04-13 23:48:06,271 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 288 selfloop transitions, 146 changer transitions 4/438 dead transitions. [2025-04-13 23:48:06,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 438 transitions, 3297 flow [2025-04-13 23:48:06,272 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-04-13 23:48:06,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2025-04-13 23:48:06,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 404 transitions. [2025-04-13 23:48:06,273 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5976331360946746 [2025-04-13 23:48:06,273 INFO L175 Difference]: Start difference. First operand has 52 places, 63 transitions, 549 flow. Second operand 26 states and 404 transitions. [2025-04-13 23:48:06,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 438 transitions, 3297 flow [2025-04-13 23:48:06,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 438 transitions, 3269 flow, removed 14 selfloop flow, removed 0 redundant places. [2025-04-13 23:48:06,301 INFO L231 Difference]: Finished difference. Result has 77 places, 181 transitions, 2073 flow [2025-04-13 23:48:06,301 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=543, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=2073, PETRI_PLACES=77, PETRI_TRANSITIONS=181} [2025-04-13 23:48:06,304 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 52 predicate places. [2025-04-13 23:48:06,304 INFO L485 AbstractCegarLoop]: Abstraction has has 77 places, 181 transitions, 2073 flow [2025-04-13 23:48:06,304 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.6875) internal successors, (91), 16 states have internal predecessors, (91), 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-13 23:48:06,304 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:06,304 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:06,313 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-13 23:48:06,504 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:06,505 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:48:06,505 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:06,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1189346130, now seen corresponding path program 2 times [2025-04-13 23:48:06,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:06,506 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508890238] [2025-04-13 23:48:06,506 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:48:06,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:06,525 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 23:48:06,599 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 23:48:06,599 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:48:06,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:07,889 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:07,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:07,889 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [508890238] [2025-04-13 23:48:07,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [508890238] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:48:07,889 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1707532439] [2025-04-13 23:48:07,889 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-13 23:48:07,889 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:07,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:48:07,891 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-13 23:48:07,894 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-13 23:48:07,977 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 27 statements into 2 equivalence classes. [2025-04-13 23:48:08,067 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-13 23:48:08,067 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-13 23:48:08,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:08,073 INFO L256 TraceCheckSpWp]: Trace formula consists of 1015 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-13 23:48:08,077 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:48:08,105 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-13 23:48:08,178 INFO L325 Elim1Store]: treesize reduction 34, result has 26.1 percent of original size [2025-04-13 23:48:08,178 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 19 [2025-04-13 23:48:08,253 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 50 treesize of output 19 [2025-04-13 23:48:08,630 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 2 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:08,630 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:48:09,109 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:09,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1707532439] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:48:09,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:48:09,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 18 [2025-04-13 23:48:09,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529143488] [2025-04-13 23:48:09,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:48:09,110 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-13 23:48:09,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:09,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-13 23:48:09,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=259, Unknown=0, NotChecked=0, Total=342 [2025-04-13 23:48:09,110 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 23:48:09,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 181 transitions, 2073 flow. Second operand has 19 states, 19 states have (on average 6.2631578947368425) internal successors, (119), 19 states have internal predecessors, (119), 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-13 23:48:09,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:09,111 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 23:48:09,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:11,507 INFO L116 PetriNetUnfolderBase]: 9281/16294 cut-off events. [2025-04-13 23:48:11,507 INFO L117 PetriNetUnfolderBase]: For 31193/31193 co-relation queries the response was YES. [2025-04-13 23:48:11,525 INFO L83 FinitePrefix]: Finished finitePrefix Result has 46397 conditions, 16294 events. 9281/16294 cut-off events. For 31193/31193 co-relation queries the response was YES. Maximal size of possible extension queue 253. Compared 100978 event pairs, 1837 based on Foata normal form. 205/13303 useless extension candidates. Maximal degree in co-relation 45576. Up to 3079 conditions per place. [2025-04-13 23:48:11,561 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 248 selfloop transitions, 311 changer transitions 14/573 dead transitions. [2025-04-13 23:48:11,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 573 transitions, 6060 flow [2025-04-13 23:48:11,562 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-13 23:48:11,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2025-04-13 23:48:11,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 310 transitions. [2025-04-13 23:48:11,563 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.47692307692307695 [2025-04-13 23:48:11,563 INFO L175 Difference]: Start difference. First operand has 77 places, 181 transitions, 2073 flow. Second operand 25 states and 310 transitions. [2025-04-13 23:48:11,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 573 transitions, 6060 flow [2025-04-13 23:48:11,615 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 573 transitions, 5371 flow, removed 307 selfloop flow, removed 4 redundant places. [2025-04-13 23:48:11,621 INFO L231 Difference]: Finished difference. Result has 105 places, 369 transitions, 4599 flow [2025-04-13 23:48:11,622 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=1634, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=173, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=4599, PETRI_PLACES=105, PETRI_TRANSITIONS=369} [2025-04-13 23:48:11,622 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 80 predicate places. [2025-04-13 23:48:11,622 INFO L485 AbstractCegarLoop]: Abstraction has has 105 places, 369 transitions, 4599 flow [2025-04-13 23:48:11,622 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.2631578947368425) internal successors, (119), 19 states have internal predecessors, (119), 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-13 23:48:11,622 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:11,622 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:11,631 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-13 23:48:11,823 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:11,823 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:48:11,823 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:11,823 INFO L85 PathProgramCache]: Analyzing trace with hash -486464946, now seen corresponding path program 3 times [2025-04-13 23:48:11,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:11,824 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619190215] [2025-04-13 23:48:11,824 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:48:11,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:11,841 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 4 equivalence classes. [2025-04-13 23:48:11,993 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 23:48:11,993 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 23:48:11,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:13,116 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 47 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:48:13,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:13,116 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [619190215] [2025-04-13 23:48:13,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [619190215] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:48:13,116 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815962965] [2025-04-13 23:48:13,116 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:48:13,116 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:13,116 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:48:13,118 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-13 23:48:13,120 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-13 23:48:13,208 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 35 statements into 4 equivalence classes. [2025-04-13 23:48:13,431 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 35 of 35 statements. [2025-04-13 23:48:13,431 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-13 23:48:13,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:13,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 1058 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-13 23:48:13,452 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:48:13,475 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-13 23:48:13,501 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-04-13 23:48:13,540 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-04-13 23:48:13,573 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 14 [2025-04-13 23:48:14,015 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:14,015 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:48:14,630 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 6 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:14,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815962965] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:48:14,630 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:48:14,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 20 [2025-04-13 23:48:14,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014732077] [2025-04-13 23:48:14,631 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:48:14,631 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 23:48:14,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:14,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 23:48:14,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2025-04-13 23:48:14,632 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 23:48:14,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 369 transitions, 4599 flow. Second operand has 21 states, 21 states have (on average 6.380952380952381) internal successors, (134), 21 states have internal predecessors, (134), 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-13 23:48:14,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:14,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 23:48:14,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:19,947 INFO L116 PetriNetUnfolderBase]: 23460/41308 cut-off events. [2025-04-13 23:48:19,948 INFO L117 PetriNetUnfolderBase]: For 91139/91139 co-relation queries the response was YES. [2025-04-13 23:48:20,073 INFO L83 FinitePrefix]: Finished finitePrefix Result has 119467 conditions, 41308 events. 23460/41308 cut-off events. For 91139/91139 co-relation queries the response was YES. Maximal size of possible extension queue 449. Compared 279698 event pairs, 5059 based on Foata normal form. 385/33407 useless extension candidates. Maximal degree in co-relation 118652. Up to 8293 conditions per place. [2025-04-13 23:48:20,338 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 285 selfloop transitions, 758 changer transitions 20/1063 dead transitions. [2025-04-13 23:48:20,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 1063 transitions, 14139 flow [2025-04-13 23:48:20,343 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-13 23:48:20,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2025-04-13 23:48:20,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 256 transitions. [2025-04-13 23:48:20,344 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5182186234817814 [2025-04-13 23:48:20,344 INFO L175 Difference]: Start difference. First operand has 105 places, 369 transitions, 4599 flow. Second operand 19 states and 256 transitions. [2025-04-13 23:48:20,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 1063 transitions, 14139 flow [2025-04-13 23:48:20,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 1063 transitions, 13264 flow, removed 193 selfloop flow, removed 5 redundant places. [2025-04-13 23:48:20,616 INFO L231 Difference]: Finished difference. Result has 128 places, 891 transitions, 13461 flow [2025-04-13 23:48:20,616 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=4209, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=365, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=284, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=13461, PETRI_PLACES=128, PETRI_TRANSITIONS=891} [2025-04-13 23:48:20,617 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 103 predicate places. [2025-04-13 23:48:20,617 INFO L485 AbstractCegarLoop]: Abstraction has has 128 places, 891 transitions, 13461 flow [2025-04-13 23:48:20,617 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.380952380952381) internal successors, (134), 21 states have internal predecessors, (134), 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-13 23:48:20,617 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:20,617 INFO L206 CegarLoopForPetriNet]: trace histogram [7, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:20,626 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-13 23:48:20,817 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:20,818 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:48:20,818 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:20,818 INFO L85 PathProgramCache]: Analyzing trace with hash 217622215, now seen corresponding path program 1 times [2025-04-13 23:48:20,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:20,819 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [521735500] [2025-04-13 23:48:20,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:48:20,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:20,836 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-13 23:48:20,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 23:48:20,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:48:20,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:21,348 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-13 23:48:21,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:21,349 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [521735500] [2025-04-13 23:48:21,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [521735500] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:48:21,349 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465894906] [2025-04-13 23:48:21,349 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-13 23:48:21,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:21,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:48:21,351 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-13 23:48:21,352 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-13 23:48:21,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-04-13 23:48:21,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-04-13 23:48:21,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-13 23:48:21,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:21,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 1093 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-13 23:48:21,532 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:48:21,544 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 8 treesize of output 1 [2025-04-13 23:48:21,558 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 8 treesize of output 1 [2025-04-13 23:48:21,570 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 8 treesize of output 1 [2025-04-13 23:48:21,585 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 8 treesize of output 1 [2025-04-13 23:48:21,600 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 8 treesize of output 1 [2025-04-13 23:48:21,787 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 33 treesize of output 21 [2025-04-13 23:48:21,795 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:21,795 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:48:21,900 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-04-13 23:48:21,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465894906] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:48:21,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:48:21,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 5] total 20 [2025-04-13 23:48:21,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942249967] [2025-04-13 23:48:21,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:48:21,901 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-04-13 23:48:21,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:21,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-04-13 23:48:21,902 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=293, Unknown=0, NotChecked=0, Total=420 [2025-04-13 23:48:21,902 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 23:48:21,902 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 128 places, 891 transitions, 13461 flow. Second operand has 21 states, 21 states have (on average 6.476190476190476) internal successors, (136), 21 states have internal predecessors, (136), 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-13 23:48:21,902 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:21,902 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 23:48:21,902 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:48:33,743 INFO L116 PetriNetUnfolderBase]: 39293/69457 cut-off events. [2025-04-13 23:48:33,743 INFO L117 PetriNetUnfolderBase]: For 233521/233521 co-relation queries the response was YES. [2025-04-13 23:48:34,042 INFO L83 FinitePrefix]: Finished finitePrefix Result has 210862 conditions, 69457 events. 39293/69457 cut-off events. For 233521/233521 co-relation queries the response was YES. Maximal size of possible extension queue 705. Compared 519989 event pairs, 9365 based on Foata normal form. 1080/56480 useless extension candidates. Maximal degree in co-relation 210009. Up to 13375 conditions per place. [2025-04-13 23:48:34,183 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 285 selfloop transitions, 1397 changer transitions 2/1684 dead transitions. [2025-04-13 23:48:34,183 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 1684 transitions, 26419 flow [2025-04-13 23:48:34,184 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-04-13 23:48:34,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2025-04-13 23:48:34,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 294 transitions. [2025-04-13 23:48:34,185 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5653846153846154 [2025-04-13 23:48:34,185 INFO L175 Difference]: Start difference. First operand has 128 places, 891 transitions, 13461 flow. Second operand 20 states and 294 transitions. [2025-04-13 23:48:34,185 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 1684 transitions, 26419 flow [2025-04-13 23:48:34,845 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 143 places, 1684 transitions, 26046 flow, removed 138 selfloop flow, removed 4 redundant places. [2025-04-13 23:48:34,864 INFO L231 Difference]: Finished difference. Result has 145 places, 1500 transitions, 25570 flow [2025-04-13 23:48:34,864 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=12889, PETRI_DIFFERENCE_MINUEND_PLACES=124, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=876, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=821, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=25570, PETRI_PLACES=145, PETRI_TRANSITIONS=1500} [2025-04-13 23:48:34,865 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 120 predicate places. [2025-04-13 23:48:34,865 INFO L485 AbstractCegarLoop]: Abstraction has has 145 places, 1500 transitions, 25570 flow [2025-04-13 23:48:34,865 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.476190476190476) internal successors, (136), 21 states have internal predecessors, (136), 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-13 23:48:34,865 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:48:34,865 INFO L206 CegarLoopForPetriNet]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1] [2025-04-13 23:48:34,872 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-13 23:48:35,066 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,SelfDestructingSolverStorable10 [2025-04-13 23:48:35,066 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:48:35,067 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:48:35,067 INFO L85 PathProgramCache]: Analyzing trace with hash 457302766, now seen corresponding path program 4 times [2025-04-13 23:48:35,067 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:48:35,067 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129837379] [2025-04-13 23:48:35,067 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:48:35,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:48:35,086 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-04-13 23:48:35,160 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 23:48:35,161 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:48:35,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:36,557 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-13 23:48:36,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:48:36,557 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129837379] [2025-04-13 23:48:36,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129837379] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:48:36,557 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303391153] [2025-04-13 23:48:36,557 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-13 23:48:36,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:48:36,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:48:36,559 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-13 23:48:36,560 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-13 23:48:36,663 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-04-13 23:48:36,778 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-04-13 23:48:36,779 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-13 23:48:36,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:48:36,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 1101 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-13 23:48:36,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:48:36,815 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-13 23:48:36,872 INFO L325 Elim1Store]: treesize reduction 34, result has 26.1 percent of original size [2025-04-13 23:48:36,873 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 19 [2025-04-13 23:48:36,948 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 48 treesize of output 19 [2025-04-13 23:48:37,012 INFO L325 Elim1Store]: treesize reduction 34, result has 26.1 percent of original size [2025-04-13 23:48:37,013 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 19 [2025-04-13 23:48:37,090 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 50 treesize of output 19 [2025-04-13 23:48:38,009 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 4 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:38,009 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:48:39,244 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 8 proven. 76 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:48:39,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303391153] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:48:39,245 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:48:39,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10, 10] total 27 [2025-04-13 23:48:39,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250893427] [2025-04-13 23:48:39,245 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:48:39,245 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-13 23:48:39,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:48:39,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-13 23:48:39,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=621, Unknown=0, NotChecked=0, Total=756 [2025-04-13 23:48:39,247 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 23:48:39,247 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 1500 transitions, 25570 flow. Second operand has 28 states, 28 states have (on average 6.607142857142857) internal successors, (185), 28 states have internal predecessors, (185), 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-13 23:48:39,247 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:48:39,247 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 23:48:39,247 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:49:14,649 INFO L116 PetriNetUnfolderBase]: 81099/143510 cut-off events. [2025-04-13 23:49:14,649 INFO L117 PetriNetUnfolderBase]: For 561826/561826 co-relation queries the response was YES. [2025-04-13 23:49:15,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 453887 conditions, 143510 events. 81099/143510 cut-off events. For 561826/561826 co-relation queries the response was YES. Maximal size of possible extension queue 1289. Compared 1185609 event pairs, 17284 based on Foata normal form. 254/114576 useless extension candidates. Maximal degree in co-relation 453014. Up to 27745 conditions per place. [2025-04-13 23:49:15,526 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 553 selfloop transitions, 3000 changer transitions 38/3591 dead transitions. [2025-04-13 23:49:15,527 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 206 places, 3591 transitions, 61071 flow [2025-04-13 23:49:15,527 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2025-04-13 23:49:15,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2025-04-13 23:49:15,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 754 transitions. [2025-04-13 23:49:15,529 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.46774193548387094 [2025-04-13 23:49:15,529 INFO L175 Difference]: Start difference. First operand has 145 places, 1500 transitions, 25570 flow. Second operand 62 states and 754 transitions. [2025-04-13 23:49:15,529 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 206 places, 3591 transitions, 61071 flow [2025-04-13 23:49:17,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 201 places, 3591 transitions, 59367 flow, removed 331 selfloop flow, removed 5 redundant places. [2025-04-13 23:49:17,792 INFO L231 Difference]: Finished difference. Result has 209 places, 3089 transitions, 58931 flow [2025-04-13 23:49:17,793 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=26, PETRI_DIFFERENCE_MINUEND_FLOW=24612, PETRI_DIFFERENCE_MINUEND_PLACES=140, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1492, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1434, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=62, PETRI_FLOW=58931, PETRI_PLACES=209, PETRI_TRANSITIONS=3089} [2025-04-13 23:49:17,794 INFO L279 CegarLoopForPetriNet]: 25 programPoint places, 184 predicate places. [2025-04-13 23:49:17,794 INFO L485 AbstractCegarLoop]: Abstraction has has 209 places, 3089 transitions, 58931 flow [2025-04-13 23:49:17,794 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 6.607142857142857) internal successors, (185), 28 states have internal predecessors, (185), 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-13 23:49:17,794 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-13 23:49:17,794 INFO L206 CegarLoopForPetriNet]: trace histogram [11, 10, 10, 10, 1, 1, 1, 1] [2025-04-13 23:49:17,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-13 23:49:17,994 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:49:17,995 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 4 more)] === [2025-04-13 23:49:17,995 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-13 23:49:17,995 INFO L85 PathProgramCache]: Analyzing trace with hash -207070622, now seen corresponding path program 3 times [2025-04-13 23:49:17,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-13 23:49:17,996 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096352841] [2025-04-13 23:49:17,996 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:49:17,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-13 23:49:18,014 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 11 equivalence classes. [2025-04-13 23:49:18,138 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 23:49:18,138 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-04-13 23:49:18,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:49:18,711 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:49:18,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-13 23:49:18,712 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096352841] [2025-04-13 23:49:18,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096352841] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-13 23:49:18,712 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987460282] [2025-04-13 23:49:18,712 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-13 23:49:18,712 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-13 23:49:18,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-13 23:49:18,714 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-13 23:49:18,714 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-13 23:49:18,832 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 45 statements into 11 equivalence classes. [2025-04-13 23:49:19,264 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) and asserted 45 of 45 statements. [2025-04-13 23:49:19,264 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2025-04-13 23:49:19,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-13 23:49:19,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 1137 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-04-13 23:49:19,276 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-13 23:49:19,288 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 8 treesize of output 1 [2025-04-13 23:49:19,311 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 8 treesize of output 1 [2025-04-13 23:49:19,335 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 8 treesize of output 1 [2025-04-13 23:49:19,361 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 8 treesize of output 1 [2025-04-13 23:49:19,383 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 8 treesize of output 1 [2025-04-13 23:49:19,411 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 8 treesize of output 1 [2025-04-13 23:49:19,435 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 8 treesize of output 1 [2025-04-13 23:49:19,463 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 8 treesize of output 1 [2025-04-13 23:49:19,488 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 8 treesize of output 1 [2025-04-13 23:49:19,513 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 8 treesize of output 1 [2025-04-13 23:49:19,535 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:49:19,535 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-13 23:49:19,692 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-13 23:49:19,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987460282] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-13 23:49:19,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-13 23:49:19,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2025-04-13 23:49:19,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809527001] [2025-04-13 23:49:19,693 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-13 23:49:19,693 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-04-13 23:49:19,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-13 23:49:19,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-04-13 23:49:19,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=430, Invalid=760, Unknown=0, NotChecked=0, Total=1190 [2025-04-13 23:49:19,695 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 26 [2025-04-13 23:49:19,695 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 209 places, 3089 transitions, 58931 flow. Second operand has 35 states, 35 states have (on average 5.857142857142857) internal successors, (205), 35 states have internal predecessors, (205), 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-13 23:49:19,695 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-13 23:49:19,695 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 26 [2025-04-13 23:49:19,695 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-13 23:52:12,857 INFO L116 PetriNetUnfolderBase]: 251327/439516 cut-off events. [2025-04-13 23:52:12,858 INFO L117 PetriNetUnfolderBase]: For 2399339/2399339 co-relation queries the response was YES. [2025-04-13 23:52:14,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1506886 conditions, 439516 events. 251327/439516 cut-off events. For 2399339/2399339 co-relation queries the response was YES. Maximal size of possible extension queue 2657. Compared 4063437 event pairs, 60648 based on Foata normal form. 3358/354679 useless extension candidates. Maximal degree in co-relation 1505260. Up to 83683 conditions per place. [2025-04-13 23:52:16,456 INFO L140 encePairwiseOnDemand]: 21/26 looper letters, 1283 selfloop transitions, 9654 changer transitions 22/10959 dead transitions. [2025-04-13 23:52:16,457 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 307 places, 10959 transitions, 215961 flow [2025-04-13 23:52:16,457 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2025-04-13 23:52:16,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2025-04-13 23:52:16,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 1519 transitions. [2025-04-13 23:52:16,461 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5901320901320901 [2025-04-13 23:52:16,462 INFO L175 Difference]: Start difference. First operand has 209 places, 3089 transitions, 58931 flow. Second operand 99 states and 1519 transitions. [2025-04-13 23:52:16,462 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 307 places, 10959 transitions, 215961 flow