/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-deagle/circular_buffer_ok.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 01:44:53,174 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 01:44:53,222 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2025-04-14 01:44:53,228 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 01:44:53,228 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 01:44:53,255 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 01:44:53,256 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 01:44:53,256 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 01:44:53,256 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 01:44:53,256 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 01:44:53,256 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 01:44:53,256 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 01:44:53,257 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 01:44:53,257 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 01:44:53,257 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 01:44:53,257 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 01:44:53,257 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 01:44:53,257 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 01:44:53,257 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 01:44:53,257 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 01:44:53,257 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 01:44:53,257 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 01:44:53,257 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 01:44:53,257 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 01:44:53,257 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 01:44:53,257 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 01:44:53,258 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 01:44:53,258 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 01:44:53,258 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 01:44:53,258 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:44:53,258 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:44:53,258 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:44:53,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:44:53,258 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 01:44:53,258 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 01:44:53,258 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 01:44:53,258 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 01:44:53,258 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:44:53,258 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 01:44:53,259 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 01:44:53,259 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 01:44:53,260 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 01:44:53,260 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 01:44:53,260 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 01:44:53,260 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 01:44:53,260 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 01:44:53,260 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 01:44:53,260 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Automaton type used in concurrency analysis -> PETRI_NET Applying setting for plugin de.uni_freiburg.informatik.ultimate.boogie.preprocessor: Replace while statements and if-then-else statements -> false [2025-04-14 01:44:53,481 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 01:44:53,488 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 01:44:53,490 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 01:44:53,490 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 01:44:53,491 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 01:44:53,491 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i [2025-04-14 01:44:54,733 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac51c31bb/4c9437b4a577414eb514d76d9ff9a482/FLAGa569d52e1 [2025-04-14 01:44:54,995 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 01:44:54,995 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-deagle/circular_buffer_ok.i [2025-04-14 01:44:55,009 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac51c31bb/4c9437b4a577414eb514d76d9ff9a482/FLAGa569d52e1 [2025-04-14 01:44:55,733 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac51c31bb/4c9437b4a577414eb514d76d9ff9a482 [2025-04-14 01:44:55,735 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 01:44:55,736 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 01:44:55,737 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 01:44:55,737 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 01:44:55,740 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 01:44:55,741 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:44:55" (1/1) ... [2025-04-14 01:44:55,742 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@457c5cb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:44:55, skipping insertion in model container [2025-04-14 01:44:55,742 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 01:44:55" (1/1) ... [2025-04-14 01:44:55,763 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 01:44:55,987 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-deagle/circular_buffer_ok.i[30451,30464] [2025-04-14 01:44:55,995 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-deagle/circular_buffer_ok.i[30681,30694] [2025-04-14 01:44:55,998 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-deagle/circular_buffer_ok.i[30979,30992] [2025-04-14 01:44:56,008 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:44:56,032 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 01:44:56,077 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-deagle/circular_buffer_ok.i[30451,30464] [2025-04-14 01:44:56,079 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-deagle/circular_buffer_ok.i[30681,30694] [2025-04-14 01:44:56,080 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-deagle/circular_buffer_ok.i[30979,30992] [2025-04-14 01:44:56,082 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 01:44:56,108 INFO L204 MainTranslator]: Completed translation [2025-04-14 01:44:56,109 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:44:56 WrapperNode [2025-04-14 01:44:56,109 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 01:44:56,110 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 01:44:56,110 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 01:44:56,110 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 01:44:56,114 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:44:56" (1/1) ... [2025-04-14 01:44:56,126 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:44:56" (1/1) ... [2025-04-14 01:44:56,142 INFO L138 Inliner]: procedures = 168, calls = 38, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 139 [2025-04-14 01:44:56,142 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 01:44:56,142 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 01:44:56,142 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 01:44:56,142 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 01:44:56,148 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:44:56" (1/1) ... [2025-04-14 01:44:56,148 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:44:56" (1/1) ... [2025-04-14 01:44:56,150 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:44:56" (1/1) ... [2025-04-14 01:44:56,162 INFO L175 MemorySlicer]: Split 23 memory accesses to 4 slices as follows [2, 1, 12, 8]. 52 percent of accesses are in the largest equivalence class. The 21 initializations are split as follows [2, 1, 10, 8]. The 1 writes are split as follows [0, 0, 1, 0]. [2025-04-14 01:44:56,162 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:44:56" (1/1) ... [2025-04-14 01:44:56,162 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:44:56" (1/1) ... [2025-04-14 01:44:56,167 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:44:56" (1/1) ... [2025-04-14 01:44:56,167 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:44:56" (1/1) ... [2025-04-14 01:44:56,168 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:44:56" (1/1) ... [2025-04-14 01:44:56,169 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:44:56" (1/1) ... [2025-04-14 01:44:56,172 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 01:44:56,172 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 01:44:56,172 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 01:44:56,172 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 01:44:56,173 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:44:56" (1/1) ... [2025-04-14 01:44:56,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 01:44:56,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:44:56,199 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-14 01:44:56,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-14 01:44:56,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 01:44:56,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 01:44:56,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-14 01:44:56,214 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-04-14 01:44:56,214 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-14 01:44:56,214 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-14 01:44:56,214 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-14 01:44:56,214 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-14 01:44:56,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 01:44:56,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 01:44:56,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-14 01:44:56,214 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-04-14 01:44:56,214 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-14 01:44:56,215 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 01:44:56,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-14 01:44:56,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-14 01:44:56,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-04-14 01:44:56,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-04-14 01:44:56,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 01:44:56,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 01:44:56,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-14 01:44:56,215 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-04-14 01:44:56,215 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-14 01:44:56,215 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 01:44:56,215 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 01:44:56,216 WARN L225 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-14 01:44:56,345 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 01:44:56,347 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 01:44:56,542 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L699: havoc removeLogElement_#t~mem2#1; [2025-04-14 01:44:56,543 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 01:44:56,544 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 01:44:56,544 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 01:44:56,839 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 01:44:56,840 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 01:44:56,842 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 01:44:56,842 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:44:56 BoogieIcfgContainer [2025-04-14 01:44:56,842 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 01:44:56,844 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 01:44:56,844 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 01:44:56,847 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 01:44:56,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 01:44:55" (1/3) ... [2025-04-14 01:44:56,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44dc8972 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:44:56, skipping insertion in model container [2025-04-14 01:44:56,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 01:44:56" (2/3) ... [2025-04-14 01:44:56,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@44dc8972 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 01:44:56, skipping insertion in model container [2025-04-14 01:44:56,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 01:44:56" (3/3) ... [2025-04-14 01:44:56,848 INFO L128 eAbstractionObserver]: Analyzing ICFG circular_buffer_ok.i [2025-04-14 01:44:56,857 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 01:44:56,858 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG circular_buffer_ok.i that has 3 procedures, 24 locations, 25 edges, 1 initial locations, 2 loop locations, and 3 error locations. [2025-04-14 01:44:56,859 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 01:44:56,905 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-14 01:44:56,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 30 places, 27 transitions, 68 flow [2025-04-14 01:44:56,971 INFO L116 PetriNetUnfolderBase]: 4/25 cut-off events. [2025-04-14 01:44:56,975 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 01:44:56,978 INFO L83 FinitePrefix]: Finished finitePrefix Result has 34 conditions, 25 events. 4/25 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 44 event pairs, 0 based on Foata normal form. 0/18 useless extension candidates. Maximal degree in co-relation 22. Up to 2 conditions per place. [2025-04-14 01:44:56,978 INFO L82 GeneralOperation]: Start removeDead. Operand has 30 places, 27 transitions, 68 flow [2025-04-14 01:44:56,980 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 26 places, 23 transitions, 55 flow [2025-04-14 01:44:56,988 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 01:44:56,998 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;@643b682c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 01:44:56,998 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-04-14 01:44:57,003 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 01:44:57,003 INFO L116 PetriNetUnfolderBase]: 0/7 cut-off events. [2025-04-14 01:44:57,003 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 01:44:57,003 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:44:57,005 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-14 01:44:57,005 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-14 01:44:57,009 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:44:57,009 INFO L85 PathProgramCache]: Analyzing trace with hash 334387147, now seen corresponding path program 1 times [2025-04-14 01:44:57,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:44:57,014 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1506331447] [2025-04-14 01:44:57,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:44:57,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:44:57,080 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-14 01:44:57,133 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-14 01:44:57,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:44:57,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:44:57,394 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:44:57,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:44:57,395 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1506331447] [2025-04-14 01:44:57,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1506331447] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:44:57,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:44:57,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 01:44:57,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646804129] [2025-04-14 01:44:57,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:44:57,404 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-14 01:44:57,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:44:57,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-14 01:44:57,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-14 01:44:57,424 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-14 01:44:57,425 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 23 transitions, 55 flow. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:44:57,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:44:57,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-14 01:44:57,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:44:57,537 INFO L116 PetriNetUnfolderBase]: 169/289 cut-off events. [2025-04-14 01:44:57,537 INFO L117 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2025-04-14 01:44:57,540 INFO L83 FinitePrefix]: Finished finitePrefix Result has 605 conditions, 289 events. 169/289 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 881 event pairs, 138 based on Foata normal form. 0/227 useless extension candidates. Maximal degree in co-relation 560. Up to 290 conditions per place. [2025-04-14 01:44:57,542 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 20 selfloop transitions, 0 changer transitions 0/20 dead transitions. [2025-04-14 01:44:57,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 26 places, 20 transitions, 89 flow [2025-04-14 01:44:57,544 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 01:44:57,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-14 01:44:57,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 27 transitions. [2025-04-14 01:44:57,551 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-14 01:44:57,552 INFO L175 Difference]: Start difference. First operand has 26 places, 23 transitions, 55 flow. Second operand 2 states and 27 transitions. [2025-04-14 01:44:57,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 26 places, 20 transitions, 89 flow [2025-04-14 01:44:57,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 23 places, 20 transitions, 84 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-14 01:44:57,558 INFO L231 Difference]: Finished difference. Result has 23 places, 20 transitions, 44 flow [2025-04-14 01:44:57,560 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=44, PETRI_PLACES=23, PETRI_TRANSITIONS=20} [2025-04-14 01:44:57,563 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, -3 predicate places. [2025-04-14 01:44:57,563 INFO L485 AbstractCegarLoop]: Abstraction has has 23 places, 20 transitions, 44 flow [2025-04-14 01:44:57,564 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:44:57,564 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:44:57,564 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-14 01:44:57,564 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 01:44:57,564 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-14 01:44:57,564 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:44:57,565 INFO L85 PathProgramCache]: Analyzing trace with hash 334387148, now seen corresponding path program 1 times [2025-04-14 01:44:57,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:44:57,565 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633477101] [2025-04-14 01:44:57,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:44:57,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:44:57,591 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-14 01:44:57,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-14 01:44:57,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:44:57,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:44:57,765 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:44:57,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:44:57,765 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633477101] [2025-04-14 01:44:57,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633477101] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:44:57,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:44:57,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 01:44:57,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135076150] [2025-04-14 01:44:57,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:44:57,766 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:44:57,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:44:57,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:44:57,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:44:57,767 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-14 01:44:57,767 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 23 places, 20 transitions, 44 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-14 01:44:57,767 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:44:57,767 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-14 01:44:57,767 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:44:57,903 INFO L116 PetriNetUnfolderBase]: 215/367 cut-off events. [2025-04-14 01:44:57,904 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 01:44:57,904 INFO L83 FinitePrefix]: Finished finitePrefix Result has 756 conditions, 367 events. 215/367 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1245 event pairs, 48 based on Foata normal form. 0/297 useless extension candidates. Maximal degree in co-relation 753. Up to 265 conditions per place. [2025-04-14 01:44:57,907 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 30 selfloop transitions, 2 changer transitions 0/32 dead transitions. [2025-04-14 01:44:57,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 25 places, 32 transitions, 134 flow [2025-04-14 01:44:57,909 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:44:57,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:44:57,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 39 transitions. [2025-04-14 01:44:57,909 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2025-04-14 01:44:57,909 INFO L175 Difference]: Start difference. First operand has 23 places, 20 transitions, 44 flow. Second operand 3 states and 39 transitions. [2025-04-14 01:44:57,910 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 25 places, 32 transitions, 134 flow [2025-04-14 01:44:57,910 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 32 transitions, 134 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 01:44:57,912 INFO L231 Difference]: Finished difference. Result has 26 places, 21 transitions, 56 flow [2025-04-14 01:44:57,912 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=23, 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=56, PETRI_PLACES=26, PETRI_TRANSITIONS=21} [2025-04-14 01:44:57,913 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 0 predicate places. [2025-04-14 01:44:57,913 INFO L485 AbstractCegarLoop]: Abstraction has has 26 places, 21 transitions, 56 flow [2025-04-14 01:44:57,913 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-14 01:44:57,913 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:44:57,913 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:44:57,913 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 01:44:57,913 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-14 01:44:57,914 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:44:57,914 INFO L85 PathProgramCache]: Analyzing trace with hash -778775745, now seen corresponding path program 1 times [2025-04-14 01:44:57,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:44:57,914 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809908471] [2025-04-14 01:44:57,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:44:57,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:44:57,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-14 01:44:57,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-14 01:44:57,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:44:57,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:44:58,003 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:44:58,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:44:58,003 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809908471] [2025-04-14 01:44:58,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809908471] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:44:58,003 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:44:58,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-04-14 01:44:58,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659269604] [2025-04-14 01:44:58,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:44:58,004 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:44:58,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:44:58,004 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:44:58,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:44:58,004 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-14 01:44:58,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 21 transitions, 56 flow. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:44:58,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:44:58,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-14 01:44:58,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:44:58,101 INFO L116 PetriNetUnfolderBase]: 206/352 cut-off events. [2025-04-14 01:44:58,101 INFO L117 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2025-04-14 01:44:58,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 789 conditions, 352 events. 206/352 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1185 event pairs, 52 based on Foata normal form. 0/288 useless extension candidates. Maximal degree in co-relation 784. Up to 263 conditions per place. [2025-04-14 01:44:58,106 INFO L140 encePairwiseOnDemand]: 24/27 looper letters, 29 selfloop transitions, 2 changer transitions 0/31 dead transitions. [2025-04-14 01:44:58,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 31 transitions, 140 flow [2025-04-14 01:44:58,107 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:44:58,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:44:58,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2025-04-14 01:44:58,108 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4691358024691358 [2025-04-14 01:44:58,108 INFO L175 Difference]: Start difference. First operand has 26 places, 21 transitions, 56 flow. Second operand 3 states and 38 transitions. [2025-04-14 01:44:58,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 31 transitions, 140 flow [2025-04-14 01:44:58,108 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 31 transitions, 138 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:44:58,109 INFO L231 Difference]: Finished difference. Result has 28 places, 21 transitions, 62 flow [2025-04-14 01:44:58,109 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=62, PETRI_PLACES=28, PETRI_TRANSITIONS=21} [2025-04-14 01:44:58,109 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 2 predicate places. [2025-04-14 01:44:58,109 INFO L485 AbstractCegarLoop]: Abstraction has has 28 places, 21 transitions, 62 flow [2025-04-14 01:44:58,110 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:44:58,110 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:44:58,110 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:44:58,110 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 01:44:58,110 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-14 01:44:58,110 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:44:58,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1121426384, now seen corresponding path program 1 times [2025-04-14 01:44:58,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:44:58,110 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969346557] [2025-04-14 01:44:58,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:44:58,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:44:58,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-14 01:44:58,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-14 01:44:58,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:44:58,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:44:58,344 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-14 01:44:58,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:44:58,344 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969346557] [2025-04-14 01:44:58,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969346557] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:44:58,344 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391443273] [2025-04-14 01:44:58,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:44:58,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:44:58,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:44:58,348 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:44:58,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-14 01:44:58,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-14 01:44:58,440 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-14 01:44:58,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:44:58,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:44:58,442 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-14 01:44:58,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:44:58,557 WARN L195 Elim1Store]: Array PQE input equivalent to false [2025-04-14 01:44:58,583 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-14 01:44:58,583 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:44:58,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:44:58,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391443273] provided 1 perfect and 1 imperfect interpolant sequences [2025-04-14 01:44:58,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:44:58,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3, 3] total 8 [2025-04-14 01:44:58,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635920090] [2025-04-14 01:44:58,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:44:58,940 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:44:58,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:44:58,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:44:58,941 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-04-14 01:44:58,941 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-14 01:44:58,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 28 places, 21 transitions, 62 flow. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:44:58,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:44:58,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-14 01:44:58,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:44:59,058 INFO L116 PetriNetUnfolderBase]: 315/535 cut-off events. [2025-04-14 01:44:59,058 INFO L117 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2025-04-14 01:44:59,059 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1213 conditions, 535 events. 315/535 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2008 event pairs, 106 based on Foata normal form. 0/465 useless extension candidates. Maximal degree in co-relation 1207. Up to 273 conditions per place. [2025-04-14 01:44:59,061 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 31 selfloop transitions, 4 changer transitions 1/36 dead transitions. [2025-04-14 01:44:59,061 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 36 transitions, 174 flow [2025-04-14 01:44:59,062 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:44:59,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:44:59,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 41 transitions. [2025-04-14 01:44:59,062 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5061728395061729 [2025-04-14 01:44:59,062 INFO L175 Difference]: Start difference. First operand has 28 places, 21 transitions, 62 flow. Second operand 3 states and 41 transitions. [2025-04-14 01:44:59,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 36 transitions, 174 flow [2025-04-14 01:44:59,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 36 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 01:44:59,064 INFO L231 Difference]: Finished difference. Result has 30 places, 24 transitions, 93 flow [2025-04-14 01:44:59,064 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=30, PETRI_TRANSITIONS=24} [2025-04-14 01:44:59,064 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 4 predicate places. [2025-04-14 01:44:59,064 INFO L485 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 93 flow [2025-04-14 01:44:59,064 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:44:59,064 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:44:59,064 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:44:59,074 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-14 01:44:59,265 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:44:59,265 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-14 01:44:59,266 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:44:59,266 INFO L85 PathProgramCache]: Analyzing trace with hash -1935443619, now seen corresponding path program 1 times [2025-04-14 01:44:59,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:44:59,267 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389082280] [2025-04-14 01:44:59,267 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:44:59,267 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:44:59,278 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-04-14 01:44:59,283 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-04-14 01:44:59,283 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:44:59,283 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:44:59,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:44:59,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:44:59,338 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389082280] [2025-04-14 01:44:59,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389082280] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:44:59,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:44:59,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:44:59,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120765088] [2025-04-14 01:44:59,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:44:59,338 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:44:59,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:44:59,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:44:59,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 01:44:59,339 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-14 01:44:59,340 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 93 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-14 01:44:59,340 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:44:59,340 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-14 01:44:59,340 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:44:59,420 INFO L116 PetriNetUnfolderBase]: 214/385 cut-off events. [2025-04-14 01:44:59,420 INFO L117 PetriNetUnfolderBase]: For 77/77 co-relation queries the response was YES. [2025-04-14 01:44:59,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 936 conditions, 385 events. 214/385 cut-off events. For 77/77 co-relation queries the response was YES. Maximal size of possible extension queue 24. Compared 1420 event pairs, 75 based on Foata normal form. 28/359 useless extension candidates. Maximal degree in co-relation 929. Up to 223 conditions per place. [2025-04-14 01:44:59,422 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 30 selfloop transitions, 4 changer transitions 0/34 dead transitions. [2025-04-14 01:44:59,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 34 transitions, 184 flow [2025-04-14 01:44:59,422 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:44:59,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:44:59,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 38 transitions. [2025-04-14 01:44:59,423 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4691358024691358 [2025-04-14 01:44:59,423 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 93 flow. Second operand 3 states and 38 transitions. [2025-04-14 01:44:59,424 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 34 transitions, 184 flow [2025-04-14 01:44:59,426 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 34 transitions, 176 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 01:44:59,427 INFO L231 Difference]: Finished difference. Result has 30 places, 24 transitions, 93 flow [2025-04-14 01:44:59,427 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=85, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=93, PETRI_PLACES=30, PETRI_TRANSITIONS=24} [2025-04-14 01:44:59,427 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 4 predicate places. [2025-04-14 01:44:59,427 INFO L485 AbstractCegarLoop]: Abstraction has has 30 places, 24 transitions, 93 flow [2025-04-14 01:44:59,428 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-14 01:44:59,428 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:44:59,428 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:44:59,428 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 01:44:59,428 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-14 01:44:59,428 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:44:59,428 INFO L85 PathProgramCache]: Analyzing trace with hash 127124064, now seen corresponding path program 1 times [2025-04-14 01:44:59,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:44:59,428 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325157136] [2025-04-14 01:44:59,428 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:44:59,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:44:59,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-14 01:44:59,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-14 01:44:59,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:44:59,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-14 01:44:59,475 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1059488271] [2025-04-14 01:44:59,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:44:59,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:44:59,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:44:59,477 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:44:59,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-14 01:44:59,538 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-14 01:44:59,577 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-14 01:44:59,578 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:44:59,578 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:44:59,582 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-04-14 01:44:59,584 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:44:59,687 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 19 treesize of output 11 [2025-04-14 01:44:59,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:44:59,723 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 01:44:59,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:44:59,724 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325157136] [2025-04-14 01:44:59,724 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-14 01:44:59,724 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1059488271] [2025-04-14 01:44:59,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1059488271] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:44:59,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:44:59,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:44:59,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098788223] [2025-04-14 01:44:59,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:44:59,725 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:44:59,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:44:59,725 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:44:59,725 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:44:59,725 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-14 01:44:59,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 24 transitions, 93 flow. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:44:59,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:44:59,725 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-14 01:44:59,725 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:44:59,890 INFO L116 PetriNetUnfolderBase]: 292/524 cut-off events. [2025-04-14 01:44:59,890 INFO L117 PetriNetUnfolderBase]: For 81/81 co-relation queries the response was YES. [2025-04-14 01:44:59,891 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1325 conditions, 524 events. 292/524 cut-off events. For 81/81 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2027 event pairs, 41 based on Foata normal form. 7/448 useless extension candidates. Maximal degree in co-relation 1318. Up to 294 conditions per place. [2025-04-14 01:44:59,893 INFO L140 encePairwiseOnDemand]: 22/27 looper letters, 50 selfloop transitions, 6 changer transitions 3/59 dead transitions. [2025-04-14 01:44:59,893 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 59 transitions, 318 flow [2025-04-14 01:44:59,893 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:44:59,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:44:59,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2025-04-14 01:44:59,895 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.48148148148148145 [2025-04-14 01:44:59,895 INFO L175 Difference]: Start difference. First operand has 30 places, 24 transitions, 93 flow. Second operand 5 states and 65 transitions. [2025-04-14 01:44:59,895 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 59 transitions, 318 flow [2025-04-14 01:44:59,896 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 59 transitions, 306 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:44:59,897 INFO L231 Difference]: Finished difference. Result has 34 places, 26 transitions, 121 flow [2025-04-14 01:44:59,897 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=29, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=121, PETRI_PLACES=34, PETRI_TRANSITIONS=26} [2025-04-14 01:44:59,897 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 8 predicate places. [2025-04-14 01:44:59,897 INFO L485 AbstractCegarLoop]: Abstraction has has 34 places, 26 transitions, 121 flow [2025-04-14 01:44:59,897 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:44:59,897 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:44:59,897 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:44:59,904 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-14 01:45:00,098 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-04-14 01:45:00,098 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-14 01:45:00,099 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:45:00,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1424886366, now seen corresponding path program 1 times [2025-04-14 01:45:00,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:45:00,099 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1363279693] [2025-04-14 01:45:00,099 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:45:00,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:45:00,107 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-14 01:45:00,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:45:00,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:45:00,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-14 01:45:00,185 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1790313822] [2025-04-14 01:45:00,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:45:00,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:45:00,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:45:00,191 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:45:00,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-14 01:45:00,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-14 01:45:00,334 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:45:00,334 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:45:00,334 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:45:00,341 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-04-14 01:45:00,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:45:00,414 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-14 01:45:00,424 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-14 01:45:00,428 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 11 treesize of output 7 [2025-04-14 01:45:00,548 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-14 01:45:00,548 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:45:01,039 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2025-04-14 01:45:01,065 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2025-04-14 01:45:02,725 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 291 treesize of output 279 [2025-04-14 01:45:02,785 INFO L325 Elim1Store]: treesize reduction 185, result has 29.1 percent of original size [2025-04-14 01:45:02,785 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 13 case distinctions, treesize of input 279 treesize of output 463 [2025-04-14 01:45:05,599 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:45:05,600 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 724 treesize of output 651 [2025-04-14 01:45:07,618 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-14 01:45:07,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:45:07,618 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1363279693] [2025-04-14 01:45:07,618 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-14 01:45:07,618 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790313822] [2025-04-14 01:45:07,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790313822] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:45:07,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:45:07,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2025-04-14 01:45:07,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339057088] [2025-04-14 01:45:07,619 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-14 01:45:07,619 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-04-14 01:45:07,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:45:07,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-04-14 01:45:07,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-04-14 01:45:07,620 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-14 01:45:07,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 26 transitions, 121 flow. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:45:07,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:45:07,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-14 01:45:07,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:45:08,976 INFO L116 PetriNetUnfolderBase]: 522/918 cut-off events. [2025-04-14 01:45:08,976 INFO L117 PetriNetUnfolderBase]: For 417/417 co-relation queries the response was YES. [2025-04-14 01:45:08,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2353 conditions, 918 events. 522/918 cut-off events. For 417/417 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 3918 event pairs, 31 based on Foata normal form. 18/787 useless extension candidates. Maximal degree in co-relation 2344. Up to 257 conditions per place. [2025-04-14 01:45:08,979 INFO L140 encePairwiseOnDemand]: 19/27 looper letters, 95 selfloop transitions, 28 changer transitions 8/131 dead transitions. [2025-04-14 01:45:08,979 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 131 transitions, 714 flow [2025-04-14 01:45:08,980 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-04-14 01:45:08,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2025-04-14 01:45:08,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 158 transitions. [2025-04-14 01:45:08,980 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.45014245014245013 [2025-04-14 01:45:08,980 INFO L175 Difference]: Start difference. First operand has 34 places, 26 transitions, 121 flow. Second operand 13 states and 158 transitions. [2025-04-14 01:45:08,981 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 131 transitions, 714 flow [2025-04-14 01:45:08,982 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 131 transitions, 701 flow, removed 2 selfloop flow, removed 3 redundant places. [2025-04-14 01:45:08,984 INFO L231 Difference]: Finished difference. Result has 49 places, 50 transitions, 340 flow [2025-04-14 01:45:08,984 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=340, PETRI_PLACES=49, PETRI_TRANSITIONS=50} [2025-04-14 01:45:08,984 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 23 predicate places. [2025-04-14 01:45:08,984 INFO L485 AbstractCegarLoop]: Abstraction has has 49 places, 50 transitions, 340 flow [2025-04-14 01:45:08,984 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:45:08,984 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:45:08,984 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:45:08,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-04-14 01:45:09,185 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:45:09,185 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-14 01:45:09,185 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:45:09,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1549830494, now seen corresponding path program 1 times [2025-04-14 01:45:09,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:45:09,186 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1279990462] [2025-04-14 01:45:09,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:45:09,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:45:09,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-14 01:45:09,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-14 01:45:09,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:45:09,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:45:09,378 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:45:09,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:45:09,378 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1279990462] [2025-04-14 01:45:09,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1279990462] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:45:09,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 01:45:09,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 01:45:09,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413845271] [2025-04-14 01:45:09,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:45:09,379 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 01:45:09,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:45:09,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 01:45:09,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-04-14 01:45:09,380 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-14 01:45:09,380 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 50 transitions, 340 flow. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:45:09,380 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:45:09,380 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-14 01:45:09,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:45:09,526 INFO L116 PetriNetUnfolderBase]: 503/893 cut-off events. [2025-04-14 01:45:09,527 INFO L117 PetriNetUnfolderBase]: For 1058/1058 co-relation queries the response was YES. [2025-04-14 01:45:09,530 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2733 conditions, 893 events. 503/893 cut-off events. For 1058/1058 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3855 event pairs, 113 based on Foata normal form. 0/806 useless extension candidates. Maximal degree in co-relation 2718. Up to 796 conditions per place. [2025-04-14 01:45:09,533 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 59 selfloop transitions, 4 changer transitions 3/66 dead transitions. [2025-04-14 01:45:09,533 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 66 transitions, 505 flow [2025-04-14 01:45:09,534 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 01:45:09,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 01:45:09,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 50 transitions. [2025-04-14 01:45:09,535 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.37037037037037035 [2025-04-14 01:45:09,535 INFO L175 Difference]: Start difference. First operand has 49 places, 50 transitions, 340 flow. Second operand 5 states and 50 transitions. [2025-04-14 01:45:09,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 66 transitions, 505 flow [2025-04-14 01:45:09,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 66 transitions, 459 flow, removed 20 selfloop flow, removed 2 redundant places. [2025-04-14 01:45:09,541 INFO L231 Difference]: Finished difference. Result has 49 places, 46 transitions, 274 flow [2025-04-14 01:45:09,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=268, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=274, PETRI_PLACES=49, PETRI_TRANSITIONS=46} [2025-04-14 01:45:09,544 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 23 predicate places. [2025-04-14 01:45:09,544 INFO L485 AbstractCegarLoop]: Abstraction has has 49 places, 46 transitions, 274 flow [2025-04-14 01:45:09,544 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:45:09,544 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:45:09,544 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:45:09,544 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 01:45:09,544 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-14 01:45:09,545 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:45:09,545 INFO L85 PathProgramCache]: Analyzing trace with hash 800118123, now seen corresponding path program 1 times [2025-04-14 01:45:09,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:45:09,545 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1741436387] [2025-04-14 01:45:09,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:45:09,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:45:09,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-14 01:45:09,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 01:45:09,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:45:09,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:45:09,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:45:09,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:45:09,721 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1741436387] [2025-04-14 01:45:09,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1741436387] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-14 01:45:09,721 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1045853865] [2025-04-14 01:45:09,721 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 01:45:09,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:45:09,721 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:45:09,725 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:45:09,727 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-14 01:45:09,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-04-14 01:45:09,814 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-04-14 01:45:09,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 01:45:09,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:45:09,816 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-14 01:45:09,817 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:45:09,859 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:45:09,859 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-14 01:45:09,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1045853865] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 01:45:09,859 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-14 01:45:09,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 5 [2025-04-14 01:45:09,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483489698] [2025-04-14 01:45:09,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 01:45:09,860 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 01:45:09,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:45:09,860 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 01:45:09,860 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-14 01:45:09,860 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-14 01:45:09,861 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 46 transitions, 274 flow. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:45:09,861 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:45:09,861 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-14 01:45:09,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:45:10,016 INFO L116 PetriNetUnfolderBase]: 373/679 cut-off events. [2025-04-14 01:45:10,016 INFO L117 PetriNetUnfolderBase]: For 731/731 co-relation queries the response was YES. [2025-04-14 01:45:10,017 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2032 conditions, 679 events. 373/679 cut-off events. For 731/731 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2719 event pairs, 118 based on Foata normal form. 7/678 useless extension candidates. Maximal degree in co-relation 2017. Up to 411 conditions per place. [2025-04-14 01:45:10,020 INFO L140 encePairwiseOnDemand]: 23/27 looper letters, 37 selfloop transitions, 14 changer transitions 3/54 dead transitions. [2025-04-14 01:45:10,020 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 54 transitions, 405 flow [2025-04-14 01:45:10,020 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 01:45:10,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 01:45:10,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 37 transitions. [2025-04-14 01:45:10,022 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4567901234567901 [2025-04-14 01:45:10,022 INFO L175 Difference]: Start difference. First operand has 49 places, 46 transitions, 274 flow. Second operand 3 states and 37 transitions. [2025-04-14 01:45:10,022 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 54 transitions, 405 flow [2025-04-14 01:45:10,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 54 transitions, 399 flow, removed 0 selfloop flow, removed 3 redundant places. [2025-04-14 01:45:10,025 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 296 flow [2025-04-14 01:45:10,025 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=296, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2025-04-14 01:45:10,026 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 22 predicate places. [2025-04-14 01:45:10,026 INFO L485 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 296 flow [2025-04-14 01:45:10,026 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:45:10,026 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:45:10,026 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:45:10,033 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-14 01:45:10,226 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:45:10,227 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-14 01:45:10,227 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:45:10,227 INFO L85 PathProgramCache]: Analyzing trace with hash 36171617, now seen corresponding path program 2 times [2025-04-14 01:45:10,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:45:10,227 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710637626] [2025-04-14 01:45:10,227 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:45:10,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:45:10,238 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-14 01:45:10,324 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:45:10,324 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:45:10,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-14 01:45:10,325 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [247749844] [2025-04-14 01:45:10,325 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-14 01:45:10,325 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:45:10,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:45:10,327 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:45:10,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-14 01:45:10,389 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 2 equivalence classes. [2025-04-14 01:45:10,538 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-04-14 01:45:10,538 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-14 01:45:10,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:45:10,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-04-14 01:45:10,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:45:10,653 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-14 01:45:10,663 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-14 01:45:10,667 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-14 01:45:10,836 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 19 treesize of output 18 [2025-04-14 01:45:10,881 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-14 01:45:10,882 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:45:28,937 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 1 [2025-04-14 01:45:28,998 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-14 01:45:29,014 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-14 01:45:29,022 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-14 01:45:29,063 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-14 01:45:29,068 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-14 01:45:29,099 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-14 01:45:29,104 WARN L195 Elim1Store]: Array PQE input equivalent to true [2025-04-14 01:45:29,164 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 716 treesize of output 688 [2025-04-14 01:45:29,190 INFO L325 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2025-04-14 01:45:29,191 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 758 treesize of output 643 [2025-04-14 01:45:30,514 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2025-04-14 01:45:30,577 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2025-04-14 01:45:30,634 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2025-04-14 01:45:30,775 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2025-04-14 01:45:30,788 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2025-04-14 01:45:30,796 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2025-04-14 01:45:40,779 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-14 01:45:40,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:45:40,780 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710637626] [2025-04-14 01:45:40,780 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-14 01:45:40,780 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [247749844] [2025-04-14 01:45:40,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [247749844] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:45:40,780 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:45:40,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2025-04-14 01:45:40,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075986519] [2025-04-14 01:45:40,780 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-14 01:45:40,780 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-04-14 01:45:40,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:45:40,781 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-04-14 01:45:40,781 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2025-04-14 01:45:40,781 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-14 01:45:40,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 296 flow. Second operand has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:45:40,781 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:45:40,781 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-14 01:45:40,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:45:49,403 WARN L286 SmtUtils]: Spent 8.35s on a formula simplification. DAG size of input: 351 DAG size of output: 169 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:46:17,364 WARN L286 SmtUtils]: Spent 12.54s on a formula simplification. DAG size of input: 296 DAG size of output: 177 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:46:18,350 INFO L116 PetriNetUnfolderBase]: 628/1138 cut-off events. [2025-04-14 01:46:18,350 INFO L117 PetriNetUnfolderBase]: For 1821/1821 co-relation queries the response was YES. [2025-04-14 01:46:18,352 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3538 conditions, 1138 events. 628/1138 cut-off events. For 1821/1821 co-relation queries the response was YES. Maximal size of possible extension queue 56. Compared 5162 event pairs, 42 based on Foata normal form. 24/1162 useless extension candidates. Maximal degree in co-relation 3522. Up to 222 conditions per place. [2025-04-14 01:46:18,354 INFO L140 encePairwiseOnDemand]: 20/27 looper letters, 119 selfloop transitions, 44 changer transitions 13/176 dead transitions. [2025-04-14 01:46:18,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 176 transitions, 1228 flow [2025-04-14 01:46:18,357 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-04-14 01:46:18,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2025-04-14 01:46:18,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 189 transitions. [2025-04-14 01:46:18,358 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.4117647058823529 [2025-04-14 01:46:18,358 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 296 flow. Second operand 17 states and 189 transitions. [2025-04-14 01:46:18,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 176 transitions, 1228 flow [2025-04-14 01:46:18,364 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 176 transitions, 1202 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 01:46:18,368 INFO L231 Difference]: Finished difference. Result has 72 places, 70 transitions, 668 flow [2025-04-14 01:46:18,368 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=668, PETRI_PLACES=72, PETRI_TRANSITIONS=70} [2025-04-14 01:46:18,368 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 46 predicate places. [2025-04-14 01:46:18,368 INFO L485 AbstractCegarLoop]: Abstraction has has 72 places, 70 transitions, 668 flow [2025-04-14 01:46:18,368 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:46:18,368 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:46:18,369 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:46:18,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-14 01:46:18,569 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-14 01:46:18,569 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-14 01:46:18,569 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:46:18,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1506122855, now seen corresponding path program 3 times [2025-04-14 01:46:18,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:46:18,570 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957135449] [2025-04-14 01:46:18,570 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:46:18,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:46:18,579 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:46:18,758 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:46:18,759 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:46:18,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-14 01:46:18,762 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [348051354] [2025-04-14 01:46:18,763 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-14 01:46:18,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:46:18,763 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:46:18,764 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:46:18,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-14 01:46:18,832 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 23 statements into 2 equivalence classes. [2025-04-14 01:46:19,079 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 23 of 23 statements. [2025-04-14 01:46:19,080 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-04-14 01:46:19,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:46:19,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-04-14 01:46:19,086 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:46:19,191 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-14 01:46:19,199 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-14 01:46:19,204 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-14 01:46:19,411 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 19 treesize of output 18 [2025-04-14 01:46:19,456 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:46:19,457 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:46:39,285 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2025-04-14 01:46:39,327 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 3 [2025-04-14 01:46:39,415 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-14 01:46:39,416 INFO L172 IndexEqualityManager]: detected equality via solver [2025-04-14 01:46:39,417 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 906 treesize of output 791 [2025-04-14 01:46:54,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 9 treesize of output 1 [2025-04-14 01:46:54,763 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2025-04-14 01:46:54,789 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2025-04-14 01:46:54,850 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2025-04-14 01:46:54,992 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2025-04-14 01:46:55,001 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 32 [2025-04-14 01:46:55,066 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 5 [2025-04-14 01:46:55,151 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 716 treesize of output 688 [2025-04-14 01:46:55,178 INFO L325 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2025-04-14 01:46:55,178 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 758 treesize of output 643 [2025-04-14 01:47:03,603 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:47:03,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 01:47:03,603 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957135449] [2025-04-14 01:47:03,603 WARN L301 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-04-14 01:47:03,603 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348051354] [2025-04-14 01:47:03,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348051354] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-14 01:47:03,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-14 01:47:03,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 15 [2025-04-14 01:47:03,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54144667] [2025-04-14 01:47:03,604 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-14 01:47:03,604 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-04-14 01:47:03,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 01:47:03,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-04-14 01:47:03,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2025-04-14 01:47:03,605 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 27 [2025-04-14 01:47:03,605 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 70 transitions, 668 flow. Second operand has 17 states, 17 states have (on average 4.705882352941177) internal successors, (80), 17 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:47:03,605 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 01:47:03,605 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 27 [2025-04-14 01:47:03,605 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 01:47:19,771 WARN L286 SmtUtils]: Spent 15.62s on a formula simplification. DAG size of input: 492 DAG size of output: 190 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:47:30,051 WARN L286 SmtUtils]: Spent 9.94s on a formula simplification. DAG size of input: 320 DAG size of output: 215 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:47:48,164 WARN L286 SmtUtils]: Spent 16.07s on a formula simplification. DAG size of input: 434 DAG size of output: 197 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:47:57,564 WARN L286 SmtUtils]: Spent 7.81s on a formula simplification. DAG size of input: 247 DAG size of output: 200 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:48:04,250 WARN L286 SmtUtils]: Spent 5.96s on a formula simplification. DAG size of input: 336 DAG size of output: 284 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:48:29,668 WARN L286 SmtUtils]: Spent 17.81s on a formula simplification. DAG size of input: 342 DAG size of output: 196 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:48:36,226 WARN L286 SmtUtils]: Spent 6.29s on a formula simplification. DAG size of input: 216 DAG size of output: 180 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:49:00,890 WARN L286 SmtUtils]: Spent 17.21s on a formula simplification. DAG size of input: 373 DAG size of output: 206 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:49:13,252 WARN L286 SmtUtils]: Spent 10.99s on a formula simplification. DAG size of input: 315 DAG size of output: 203 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:49:24,427 WARN L286 SmtUtils]: Spent 10.62s on a formula simplification. DAG size of input: 245 DAG size of output: 170 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:49:32,252 WARN L286 SmtUtils]: Spent 7.14s on a formula simplification. DAG size of input: 223 DAG size of output: 182 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:49:33,707 INFO L116 PetriNetUnfolderBase]: 1518/2748 cut-off events. [2025-04-14 01:49:33,707 INFO L117 PetriNetUnfolderBase]: For 13482/13482 co-relation queries the response was YES. [2025-04-14 01:49:33,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10448 conditions, 2748 events. 1518/2748 cut-off events. For 13482/13482 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 14292 event pairs, 84 based on Foata normal form. 52/2800 useless extension candidates. Maximal degree in co-relation 10423. Up to 553 conditions per place. [2025-04-14 01:49:33,718 INFO L140 encePairwiseOnDemand]: 20/27 looper letters, 202 selfloop transitions, 121 changer transitions 33/356 dead transitions. [2025-04-14 01:49:33,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 356 transitions, 3291 flow [2025-04-14 01:49:33,719 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-14 01:49:33,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2025-04-14 01:49:33,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 337 transitions. [2025-04-14 01:49:33,720 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.43039591315453385 [2025-04-14 01:49:33,720 INFO L175 Difference]: Start difference. First operand has 72 places, 70 transitions, 668 flow. Second operand 29 states and 337 transitions. [2025-04-14 01:49:33,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 356 transitions, 3291 flow [2025-04-14 01:49:33,747 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 356 transitions, 3092 flow, removed 93 selfloop flow, removed 4 redundant places. [2025-04-14 01:49:33,751 INFO L231 Difference]: Finished difference. Result has 116 places, 161 transitions, 2001 flow [2025-04-14 01:49:33,751 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=27, PETRI_DIFFERENCE_MINUEND_FLOW=585, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=43, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=2001, PETRI_PLACES=116, PETRI_TRANSITIONS=161} [2025-04-14 01:49:33,752 INFO L279 CegarLoopForPetriNet]: 26 programPoint places, 90 predicate places. [2025-04-14 01:49:33,752 INFO L485 AbstractCegarLoop]: Abstraction has has 116 places, 161 transitions, 2001 flow [2025-04-14 01:49:33,752 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.705882352941177) internal successors, (80), 17 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 01:49:33,752 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 01:49:33,752 INFO L206 CegarLoopForPetriNet]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:49:33,760 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-14 01:49:33,955 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:49:33,956 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 6 more)] === [2025-04-14 01:49:33,956 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 01:49:33,956 INFO L85 PathProgramCache]: Analyzing trace with hash 2031668240, now seen corresponding path program 4 times [2025-04-14 01:49:33,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 01:49:33,956 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311785131] [2025-04-14 01:49:33,956 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:49:33,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 01:49:33,965 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-14 01:49:34,045 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:49:34,045 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:49:34,045 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-14 01:49:34,047 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1595147202] [2025-04-14 01:49:34,047 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-04-14 01:49:34,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 01:49:34,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 01:49:34,048 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-14 01:49:34,050 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-14 01:49:34,118 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-04-14 01:49:34,666 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-04-14 01:49:34,667 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-04-14 01:49:34,667 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 01:49:34,668 INFO L256 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 36 conjuncts are in the unsatisfiable core [2025-04-14 01:49:34,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-14 01:49:34,764 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-14 01:49:34,769 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:49:34,769 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 21 [2025-04-14 01:49:34,781 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-14 01:49:34,984 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:49:34,985 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 24 [2025-04-14 01:49:34,990 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-14 01:49:34,993 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-14 01:49:35,184 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-14 01:49:35,185 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2025-04-14 01:49:35,228 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-14 01:49:35,228 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-14 01:50:33,790 WARN L286 SmtUtils]: Spent 25.68s on a formula simplification. DAG size of input: 359 DAG size of output: 352 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:51:42,401 WARN L286 SmtUtils]: Spent 23.03s on a formula simplification. DAG size of input: 434 DAG size of output: 431 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:52:16,229 WARN L286 SmtUtils]: Spent 18.01s on a formula simplification that was a NOOP. DAG size: 435 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:53:18,849 WARN L286 SmtUtils]: Spent 8.06s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 01:53:30,871 WARN L286 SmtUtils]: Spent 12.02s on a formula simplification. DAG size of input: 18 DAG size of output: 12 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 01:53:38,917 WARN L286 SmtUtils]: Spent 8.05s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 01:55:26,421 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 01:55:38,536 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-04-14 01:58:48,651 WARN L286 SmtUtils]: Spent 2.77m on a formula simplification. DAG size of input: 823 DAG size of output: 814 (called from [L 386] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-04-14 01:59:24,697 WARN L286 SmtUtils]: Spent 8.02s on a formula simplification that was a NOOP. DAG size: 14 (called from [L 726] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) Received shutdown request... [2025-04-14 01:59:26,849 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 01:59:26,868 WARN L340 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Timeout while monitored process is still running, waiting 1000 ms for graceful end [2025-04-14 01:59:27,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-14 01:59:28,051 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-04-14 01:59:28,252 FATAL L548 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Could not destroy process within 200 ms, abandoning it [2025-04-14 01:59:28,343 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2025-04-14 01:59:28,343 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-14 01:59:28,343 WARN L610 AbstractCegarLoop]: Verification canceled: while CegarLoopForPetriNet was analyzing trace of length 28 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while executing Executor. [2025-04-14 01:59:28,344 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 8 remaining) [2025-04-14 01:59:28,344 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (5 of 8 remaining) [2025-04-14 01:59:28,344 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2025-04-14 01:59:28,344 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2025-04-14 01:59:28,344 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2025-04-14 01:59:28,344 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err1ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2025-04-14 01:59:28,344 INFO L790 garLoopResultBuilder]: Registering result TIMEOUT for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 8 remaining) [2025-04-14 01:59:28,345 INFO L422 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 01:59:28,347 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 01:59:28,347 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 01:59:28,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 01:59:28 BasicIcfg [2025-04-14 01:59:28,349 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 01:59:28,350 INFO L158 Benchmark]: Toolchain (without parser) took 872614.04ms. Allocated memory was 125.8MB in the beginning and 981.5MB in the end (delta: 855.6MB). Free memory was 86.2MB in the beginning and 615.5MB in the end (delta: -529.3MB). Peak memory consumption was 623.7MB. Max. memory is 8.0GB. [2025-04-14 01:59:28,350 INFO L158 Benchmark]: CDTParser took 1.55ms. Allocated memory is still 163.6MB. Free memory is still 91.1MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:59:28,350 INFO L158 Benchmark]: CACSL2BoogieTranslator took 372.37ms. Allocated memory is still 125.8MB. Free memory was 86.2MB in the beginning and 62.0MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. [2025-04-14 01:59:28,350 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.42ms. Allocated memory is still 125.8MB. Free memory was 62.0MB in the beginning and 59.5MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 01:59:28,350 INFO L158 Benchmark]: Boogie Preprocessor took 29.58ms. Allocated memory is still 125.8MB. Free memory was 59.5MB in the beginning and 57.3MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 01:59:28,350 INFO L158 Benchmark]: IcfgBuilder took 670.17ms. Allocated memory is still 125.8MB. Free memory was 57.3MB in the beginning and 39.4MB in the end (delta: 17.9MB). Peak memory consumption was 44.3MB. Max. memory is 8.0GB. [2025-04-14 01:59:28,350 INFO L158 Benchmark]: TraceAbstraction took 871505.38ms. Allocated memory was 125.8MB in the beginning and 981.5MB in the end (delta: 855.6MB). Free memory was 38.8MB in the beginning and 615.5MB in the end (delta: -576.8MB). Peak memory consumption was 575.2MB. Max. memory is 8.0GB. [2025-04-14 01:59:28,351 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.55ms. Allocated memory is still 163.6MB. Free memory is still 91.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 372.37ms. Allocated memory is still 125.8MB. Free memory was 86.2MB in the beginning and 62.0MB in the end (delta: 24.3MB). Peak memory consumption was 25.2MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 32.42ms. Allocated memory is still 125.8MB. Free memory was 62.0MB in the beginning and 59.5MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 29.58ms. Allocated memory is still 125.8MB. Free memory was 59.5MB in the beginning and 57.3MB in the end (delta: 2.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 670.17ms. Allocated memory is still 125.8MB. Free memory was 57.3MB in the beginning and 39.4MB in the end (delta: 17.9MB). Peak memory consumption was 44.3MB. Max. memory is 8.0GB. * TraceAbstraction took 871505.38ms. Allocated memory was 125.8MB in the beginning and 981.5MB in the end (delta: 855.6MB). Free memory was 38.8MB in the beginning and 615.5MB in the end (delta: -576.8MB). Peak memory consumption was 575.2MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 749]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 28 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: 764]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 28 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: 763]: Timeout (TraceAbstraction) Unable to prove that petrification did provide enough thread instances (tool internal message) Cancelled while CegarLoopForPetriNet was analyzing trace of length 28 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: 714]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 28 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - TimeoutResultAtElement [Line: 731]: Timeout (TraceAbstraction) Unable to prove that a call to reach_error is unreachable Cancelled while CegarLoopForPetriNet was analyzing trace of length 28 with TraceHistMax 3,while TraceCheckSpWp was constructing backward predicates,while executing Executor. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 41 locations, 48 edges, 8 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 871.4s, OverallIterations: 12, TraceHistogramMax: 3, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 190.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 878 SdHoareTripleChecker+Valid, 13.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 878 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 12.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 195 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1940 IncrementalHoareTripleChecker+Invalid, 2135 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 195 mSolverCounterUnsat, 0 mSDtfsCounter, 1940 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 205 GetRequests, 107 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 438 ImplicationChecksByTransitivity, 192.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2001occurred in iteration=11, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 83.8s InterpolantComputationTime, 228 NumberOfCodeBlocks, 228 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 209 ConstructedInterpolants, 0 QuantifiedInterpolants, 33821 SizeOfPredicates, 85 NumberOfNonLiveVariables, 1174 ConjunctsInSsa, 109 ConjunctsInUnsatCore, 17 InterpolantComputations, 8 PerfectInterpolantSequences, 3/42 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown