/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-complex/bounded_buffer.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:11:29,983 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:11:30,042 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 00:11:30,046 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:11:30,047 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:11:30,069 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:11:30,070 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:11:30,070 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:11:30,070 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:11:30,070 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:11:30,071 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:11:30,071 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:11:30,072 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:11:30,072 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:11:30,072 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:11:30,072 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:11:30,072 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:11:30,072 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:11:30,072 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:11:30,072 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:11:30,072 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:11:30,073 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:11:30,073 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:11:30,073 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:11:30,073 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:11:30,073 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:11:30,073 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:11:30,073 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:11:30,073 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:11:30,073 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:11:30,073 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:11:30,073 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:11:30,073 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:11:30,073 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:11:30,073 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:11:30,073 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:11:30,073 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:11:30,073 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:11:30,073 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:11:30,074 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:11:30,074 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:11:30,074 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:11:30,074 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:11:30,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:11:30,074 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:11:30,074 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:11:30,074 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:11:30,074 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 00:11:30,316 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:11:30,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:11:30,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:11:30,325 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:11:30,326 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:11:30,327 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-complex/bounded_buffer.i [2025-04-14 00:11:31,622 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd239c8ee/c752f0af393b4ee38b6030ae9c8ec8a9/FLAG647b3b14e [2025-04-14 00:11:31,984 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:11:31,985 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-complex/bounded_buffer.i [2025-04-14 00:11:32,010 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd239c8ee/c752f0af393b4ee38b6030ae9c8ec8a9/FLAG647b3b14e [2025-04-14 00:11:32,670 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fd239c8ee/c752f0af393b4ee38b6030ae9c8ec8a9 [2025-04-14 00:11:32,672 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:11:32,673 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:11:32,678 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:11:32,678 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:11:32,685 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:11:32,686 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:11:32" (1/1) ... [2025-04-14 00:11:32,687 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2afd9519 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:32, skipping insertion in model container [2025-04-14 00:11:32,687 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:11:32" (1/1) ... [2025-04-14 00:11:32,725 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:11:33,175 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-complex/bounded_buffer.i[70002,70015] [2025-04-14 00:11:33,219 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:11:33,228 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:11:33,294 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-complex/bounded_buffer.i[70002,70015] [2025-04-14 00:11:33,313 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:11:33,383 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:11:33,384 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:33 WrapperNode [2025-04-14 00:11:33,384 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:11:33,384 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:11:33,385 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:11:33,385 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:11:33,389 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:33" (1/1) ... [2025-04-14 00:11:33,413 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:33" (1/1) ... [2025-04-14 00:11:33,442 INFO L138 Inliner]: procedures = 429, calls = 134, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 450 [2025-04-14 00:11:33,443 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:11:33,443 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:11:33,443 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:11:33,443 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:11:33,453 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:33" (1/1) ... [2025-04-14 00:11:33,453 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:33" (1/1) ... [2025-04-14 00:11:33,460 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:33" (1/1) ... [2025-04-14 00:11:33,491 INFO L175 MemorySlicer]: Split 78 memory accesses to 6 slices as follows [2, 2, 6, 5, 58, 5]. 74 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0, 0]. The 26 writes are split as follows [0, 1, 2, 3, 17, 3]. [2025-04-14 00:11:33,491 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:33" (1/1) ... [2025-04-14 00:11:33,492 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:33" (1/1) ... [2025-04-14 00:11:33,511 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:33" (1/1) ... [2025-04-14 00:11:33,514 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:33" (1/1) ... [2025-04-14 00:11:33,516 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:33" (1/1) ... [2025-04-14 00:11:33,517 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:33" (1/1) ... [2025-04-14 00:11:33,528 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:11:33,528 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:11:33,528 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:11:33,528 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:11:33,529 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:33" (1/1) ... [2025-04-14 00:11:33,534 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:11:33,544 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:11:33,556 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 00:11:33,558 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 00:11:33,577 INFO L130 BoogieDeclarations]: Found specification of procedure producer_routine [2025-04-14 00:11:33,577 INFO L138 BoogieDeclarations]: Found implementation of procedure producer_routine [2025-04-14 00:11:33,577 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-14 00:11:33,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 00:11:33,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 00:11:33,577 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-14 00:11:33,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-04-14 00:11:33,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-04-14 00:11:33,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-04-14 00:11:33,578 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-14 00:11:33,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-14 00:11:33,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:11:33,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-14 00:11:33,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-14 00:11:33,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-14 00:11:33,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-04-14 00:11:33,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-04-14 00:11:33,578 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-04-14 00:11:33,578 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:11:33,578 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:11:33,578 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-14 00:11:33,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-14 00:11:33,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-14 00:11:33,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-04-14 00:11:33,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-04-14 00:11:33,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-04-14 00:11:33,578 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-04-14 00:11:33,578 INFO L130 BoogieDeclarations]: Found specification of procedure consumer_routine [2025-04-14 00:11:33,578 INFO L138 BoogieDeclarations]: Found implementation of procedure consumer_routine [2025-04-14 00:11:33,579 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-14 00:11:33,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 00:11:33,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 00:11:33,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-14 00:11:33,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-04-14 00:11:33,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-04-14 00:11:33,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-04-14 00:11:33,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:11:33,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 00:11:33,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-14 00:11:33,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-04-14 00:11:33,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-04-14 00:11:33,579 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-04-14 00:11:33,582 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 00:11:33,759 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:11:33,761 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:11:34,137 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1646: havoc ~#temp~1#1.base, ~#temp~1#1.offset; [2025-04-14 00:11:34,137 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1646-1: SUMMARY for call ULTIMATE.dealloc(~#temp~1#1.base, ~#temp~1#1.offset); srcloc: null [2025-04-14 00:11:34,343 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1663: havoc main_~#producers~0#1.base, main_~#producers~0#1.offset; [2025-04-14 00:11:34,343 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1663-1: SUMMARY for call ULTIMATE.dealloc(main_~#producers~0#1.base, main_~#producers~0#1.offset); srcloc: null [2025-04-14 00:11:34,343 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1664: havoc main_~#consumers~0#1.base, main_~#consumers~0#1.offset; [2025-04-14 00:11:34,343 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1664-1: SUMMARY for call ULTIMATE.dealloc(main_~#consumers~0#1.base, main_~#consumers~0#1.offset); srcloc: null [2025-04-14 00:11:34,343 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1666: havoc main_~#buffer~0#1.base, main_~#buffer~0#1.offset; [2025-04-14 00:11:34,343 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L1666-1: SUMMARY for call ULTIMATE.dealloc(main_~#buffer~0#1.base, main_~#buffer~0#1.offset); srcloc: null [2025-04-14 00:11:34,344 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:11:34,345 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:11:34,345 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:11:34,880 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 00:11:34,883 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 00:11:34,890 WARN L179 LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 00:11:34,913 WARN L179 LargeBlockEncoding]: Complex 2:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 00:11:34,927 WARN L179 LargeBlockEncoding]: Complex 2:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 00:11:34,943 WARN L179 LargeBlockEncoding]: Complex 2:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 00:11:34,950 WARN L179 LargeBlockEncoding]: Complex 4:4 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 00:11:34,958 WARN L179 LargeBlockEncoding]: Complex 2:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 00:11:34,977 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:11:34,978 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:11:34 BoogieIcfgContainer [2025-04-14 00:11:34,978 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:11:34,980 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:11:34,980 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:11:34,984 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:11:34,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:11:32" (1/3) ... [2025-04-14 00:11:34,984 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c57fb61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:11:34, skipping insertion in model container [2025-04-14 00:11:34,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:33" (2/3) ... [2025-04-14 00:11:34,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c57fb61 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:11:34, skipping insertion in model container [2025-04-14 00:11:34,985 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:11:34" (3/3) ... [2025-04-14 00:11:34,986 INFO L128 eAbstractionObserver]: Analyzing ICFG bounded_buffer.i [2025-04-14 00:11:35,043 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:11:35,045 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG bounded_buffer.i that has 3 procedures, 44 locations, 80 edges, 1 initial locations, 13 loop locations, and 3 error locations. [2025-04-14 00:11:35,045 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:11:35,148 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2025-04-14 00:11:35,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 50 places, 84 transitions, 188 flow [2025-04-14 00:11:35,247 INFO L116 PetriNetUnfolderBase]: 72/170 cut-off events. [2025-04-14 00:11:35,248 INFO L117 PetriNetUnfolderBase]: For 8/8 co-relation queries the response was YES. [2025-04-14 00:11:35,252 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 170 events. 72/170 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 629 event pairs, 0 based on Foata normal form. 0/87 useless extension candidates. Maximal degree in co-relation 91. Up to 26 conditions per place. [2025-04-14 00:11:35,252 INFO L82 GeneralOperation]: Start removeDead. Operand has 50 places, 84 transitions, 188 flow [2025-04-14 00:11:35,255 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 50 places, 80 transitions, 180 flow [2025-04-14 00:11:35,266 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:11:35,280 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;@218a7ed6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:11:35,281 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-04-14 00:11:35,298 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:11:35,298 INFO L116 PetriNetUnfolderBase]: 9/31 cut-off events. [2025-04-14 00:11:35,298 INFO L117 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2025-04-14 00:11:35,299 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:35,299 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-14 00:11:35,300 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting producer_routineErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [consumer_routineErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, consumer_routineErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-04-14 00:11:35,305 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:35,305 INFO L85 PathProgramCache]: Analyzing trace with hash 34209450, now seen corresponding path program 1 times [2025-04-14 00:11:35,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:35,312 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473687511] [2025-04-14 00:11:35,312 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:11:35,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:35,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-14 00:11:35,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-14 00:11:35,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:11:35,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:36,849 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 00:11:36,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:36,850 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473687511] [2025-04-14 00:11:36,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473687511] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:36,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:36,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:11:36,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925653396] [2025-04-14 00:11:36,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:36,858 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:11:36,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:36,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:11:36,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:11:36,887 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 84 [2025-04-14 00:11:36,889 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 80 transitions, 180 flow. Second operand has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:11:36,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:36,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 84 [2025-04-14 00:11:36,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:38,092 INFO L116 PetriNetUnfolderBase]: 1005/1544 cut-off events. [2025-04-14 00:11:38,092 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-14 00:11:38,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3064 conditions, 1544 events. 1005/1544 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 63. Compared 6587 event pairs, 133 based on Foata normal form. 113/1133 useless extension candidates. Maximal degree in co-relation 3051. Up to 1218 conditions per place. [2025-04-14 00:11:38,105 INFO L140 encePairwiseOnDemand]: 59/84 looper letters, 52 selfloop transitions, 10 changer transitions 0/66 dead transitions. [2025-04-14 00:11:38,105 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 66 transitions, 267 flow [2025-04-14 00:11:38,106 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:11:38,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:11:38,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 119 transitions. [2025-04-14 00:11:38,116 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2833333333333333 [2025-04-14 00:11:38,117 INFO L175 Difference]: Start difference. First operand has 50 places, 80 transitions, 180 flow. Second operand 5 states and 119 transitions. [2025-04-14 00:11:38,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 66 transitions, 267 flow [2025-04-14 00:11:38,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 66 transitions, 267 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 00:11:38,125 INFO L231 Difference]: Finished difference. Result has 43 places, 48 transitions, 150 flow [2025-04-14 00:11:38,128 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=84, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=150, PETRI_PLACES=43, PETRI_TRANSITIONS=48} [2025-04-14 00:11:38,131 INFO L279 CegarLoopForPetriNet]: 50 programPoint places, -7 predicate places. [2025-04-14 00:11:38,131 INFO L485 AbstractCegarLoop]: Abstraction has has 43 places, 48 transitions, 150 flow [2025-04-14 00:11:38,131 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.75) internal successors, (19), 4 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:11:38,131 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:38,131 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-14 00:11:38,132 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:11:38,132 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [consumer_routineErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, consumer_routineErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 5 more)] === [2025-04-14 00:11:38,132 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:38,132 INFO L85 PathProgramCache]: Analyzing trace with hash 34208440, now seen corresponding path program 1 times [2025-04-14 00:11:38,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:38,132 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765331038] [2025-04-14 00:11:38,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:11:38,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:38,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-14 00:11:38,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-14 00:11:38,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:11:38,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 00:11:38,196 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 00:11:38,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-14 00:11:38,219 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-14 00:11:38,220 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:11:38,220 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 00:11:38,240 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 00:11:38,240 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 00:11:38,241 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 8 remaining) [2025-04-14 00:11:38,242 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location consumer_routineErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (6 of 8 remaining) [2025-04-14 00:11:38,243 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location consumer_routineErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2025-04-14 00:11:38,243 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 8 remaining) [2025-04-14 00:11:38,243 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location producer_routineErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (3 of 8 remaining) [2025-04-14 00:11:38,243 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location consumer_routineErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (2 of 8 remaining) [2025-04-14 00:11:38,243 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location consumer_routineErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 8 remaining) [2025-04-14 00:11:38,243 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location producer_routineErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (0 of 8 remaining) [2025-04-14 00:11:38,243 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:11:38,243 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1] [2025-04-14 00:11:38,246 WARN L247 ceAbstractionStarter]: 1 thread instances were not sufficient, I will increase this number and restart the analysis [2025-04-14 00:11:38,246 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 2 thread instances. [2025-04-14 00:11:38,381 INFO L143 ThreadInstanceAdder]: Constructed 8 joinOtherThreadTransitions. [2025-04-14 00:11:38,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 81 places, 129 transitions, 302 flow [2025-04-14 00:11:38,447 INFO L116 PetriNetUnfolderBase]: 279/603 cut-off events. [2025-04-14 00:11:38,447 INFO L117 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2025-04-14 00:11:38,453 INFO L83 FinitePrefix]: Finished finitePrefix Result has 692 conditions, 603 events. 279/603 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 42. Compared 2932 event pairs, 2 based on Foata normal form. 0/323 useless extension candidates. Maximal degree in co-relation 359. Up to 103 conditions per place. [2025-04-14 00:11:38,454 INFO L82 GeneralOperation]: Start removeDead. Operand has 81 places, 129 transitions, 302 flow [2025-04-14 00:11:38,459 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 81 places, 125 transitions, 294 flow [2025-04-14 00:11:38,460 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:11:38,460 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;@218a7ed6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:11:38,460 INFO L341 AbstractCegarLoop]: Starting to check reachability of 11 error locations. [2025-04-14 00:11:38,466 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:11:38,466 INFO L116 PetriNetUnfolderBase]: 9/31 cut-off events. [2025-04-14 00:11:38,466 INFO L117 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2025-04-14 00:11:38,466 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:38,466 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2025-04-14 00:11:38,467 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting producer_routineErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [consumer_routineErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, consumer_routineErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-04-14 00:11:38,467 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:38,467 INFO L85 PathProgramCache]: Analyzing trace with hash 38157201, now seen corresponding path program 1 times [2025-04-14 00:11:38,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:38,467 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894305909] [2025-04-14 00:11:38,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:11:38,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:38,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 4 statements into 1 equivalence classes. [2025-04-14 00:11:38,511 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 4 of 4 statements. [2025-04-14 00:11:38,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:11:38,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:39,013 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 00:11:39,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:39,013 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894305909] [2025-04-14 00:11:39,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [894305909] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:39,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:39,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:11:39,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831359818] [2025-04-14 00:11:39,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:39,014 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:11:39,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:39,014 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:11:39,014 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:11:39,014 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 129 [2025-04-14 00:11:39,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 125 transitions, 294 flow. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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 00:11:39,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:39,015 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 129 [2025-04-14 00:11:39,015 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:12:12,902 INFO L116 PetriNetUnfolderBase]: 262770/322821 cut-off events. [2025-04-14 00:12:12,902 INFO L117 PetriNetUnfolderBase]: For 3985/3985 co-relation queries the response was YES. [2025-04-14 00:12:13,380 INFO L83 FinitePrefix]: Finished finitePrefix Result has 647614 conditions, 322821 events. 262770/322821 cut-off events. For 3985/3985 co-relation queries the response was YES. Maximal size of possible extension queue 5262. Compared 1613831 event pairs, 159124 based on Foata normal form. 20357/235452 useless extension candidates. Maximal degree in co-relation 404177. Up to 317082 conditions per place. [2025-04-14 00:12:14,540 INFO L140 encePairwiseOnDemand]: 94/129 looper letters, 93 selfloop transitions, 12 changer transitions 0/111 dead transitions. [2025-04-14 00:12:14,540 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 111 transitions, 460 flow [2025-04-14 00:12:14,540 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-14 00:12:14,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2025-04-14 00:12:14,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 184 transitions. [2025-04-14 00:12:14,542 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.28527131782945736 [2025-04-14 00:12:14,542 INFO L175 Difference]: Start difference. First operand has 81 places, 125 transitions, 294 flow. Second operand 5 states and 184 transitions. [2025-04-14 00:12:14,542 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 111 transitions, 460 flow [2025-04-14 00:12:14,549 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 111 transitions, 460 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 00:12:14,550 INFO L231 Difference]: Finished difference. Result has 72 places, 83 transitions, 242 flow [2025-04-14 00:12:14,550 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=242, PETRI_PLACES=72, PETRI_TRANSITIONS=83} [2025-04-14 00:12:14,551 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, -9 predicate places. [2025-04-14 00:12:14,551 INFO L485 AbstractCegarLoop]: Abstraction has has 72 places, 83 transitions, 242 flow [2025-04-14 00:12:14,551 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 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 00:12:14,551 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:12:14,551 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2025-04-14 00:12:14,551 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:12:14,551 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting producer_routineErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [consumer_routineErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, consumer_routineErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-04-14 00:12:14,551 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:12:14,551 INFO L85 PathProgramCache]: Analyzing trace with hash 1182821599, now seen corresponding path program 1 times [2025-04-14 00:12:14,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:12:14,552 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257457992] [2025-04-14 00:12:14,552 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:12:14,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:12:14,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-04-14 00:12:14,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-04-14 00:12:14,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:12:14,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:12:15,209 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 00:12:15,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:12:15,210 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257457992] [2025-04-14 00:12:15,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257457992] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:12:15,210 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:12:15,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:12:15,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2015594723] [2025-04-14 00:12:15,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:12:15,210 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:12:15,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:12:15,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:12:15,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:12:15,211 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 129 [2025-04-14 00:12:15,211 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 83 transitions, 242 flow. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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 00:12:15,211 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:12:15,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 129 [2025-04-14 00:12:15,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:12:47,008 INFO L116 PetriNetUnfolderBase]: 281064/345626 cut-off events. [2025-04-14 00:12:47,008 INFO L117 PetriNetUnfolderBase]: For 43445/43445 co-relation queries the response was YES. [2025-04-14 00:12:47,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 739430 conditions, 345626 events. 281064/345626 cut-off events. For 43445/43445 co-relation queries the response was YES. Maximal size of possible extension queue 5956. Compared 1787237 event pairs, 46841 based on Foata normal form. 1089/261217 useless extension candidates. Maximal degree in co-relation 443670. Up to 320455 conditions per place. [2025-04-14 00:12:48,866 INFO L140 encePairwiseOnDemand]: 116/129 looper letters, 113 selfloop transitions, 30 changer transitions 0/149 dead transitions. [2025-04-14 00:12:48,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 149 transitions, 701 flow [2025-04-14 00:12:48,866 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:12:48,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:12:48,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 175 transitions. [2025-04-14 00:12:48,867 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.22609819121447028 [2025-04-14 00:12:48,867 INFO L175 Difference]: Start difference. First operand has 72 places, 83 transitions, 242 flow. Second operand 6 states and 175 transitions. [2025-04-14 00:12:48,868 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 149 transitions, 701 flow [2025-04-14 00:12:48,893 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 149 transitions, 700 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:12:48,894 INFO L231 Difference]: Finished difference. Result has 78 places, 101 transitions, 408 flow [2025-04-14 00:12:48,895 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=241, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=408, PETRI_PLACES=78, PETRI_TRANSITIONS=101} [2025-04-14 00:12:48,895 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, -3 predicate places. [2025-04-14 00:12:48,895 INFO L485 AbstractCegarLoop]: Abstraction has has 78 places, 101 transitions, 408 flow [2025-04-14 00:12:48,895 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 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 00:12:48,895 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:12:48,895 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-14 00:12:48,895 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:12:48,895 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting producer_routineErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [consumer_routineErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, consumer_routineErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-04-14 00:12:48,896 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:12:48,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1985625011, now seen corresponding path program 1 times [2025-04-14 00:12:48,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:12:48,896 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [634160783] [2025-04-14 00:12:48,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:12:48,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:12:48,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-14 00:12:48,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-14 00:12:48,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:12:48,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:12:48,942 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 00:12:48,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:12:48,942 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [634160783] [2025-04-14 00:12:48,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [634160783] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:12:48,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:12:48,942 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:12:48,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854346000] [2025-04-14 00:12:48,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:12:48,943 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:12:48,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:12:48,943 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:12:48,943 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:12:48,943 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 129 [2025-04-14 00:12:48,944 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 101 transitions, 408 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 00:12:48,944 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:12:48,944 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 129 [2025-04-14 00:12:48,944 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:13:23,529 INFO L116 PetriNetUnfolderBase]: 269158/331527 cut-off events. [2025-04-14 00:13:23,529 INFO L117 PetriNetUnfolderBase]: For 105205/105205 co-relation queries the response was YES. [2025-04-14 00:13:24,187 INFO L83 FinitePrefix]: Finished finitePrefix Result has 774848 conditions, 331527 events. 269158/331527 cut-off events. For 105205/105205 co-relation queries the response was YES. Maximal size of possible extension queue 5753. Compared 1705819 event pairs, 152058 based on Foata normal form. 7539/261820 useless extension candidates. Maximal degree in co-relation 543964. Up to 290590 conditions per place. [2025-04-14 00:13:25,378 INFO L140 encePairwiseOnDemand]: 125/129 looper letters, 152 selfloop transitions, 13 changer transitions 0/171 dead transitions. [2025-04-14 00:13:25,381 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 171 transitions, 1003 flow [2025-04-14 00:13:25,382 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:13:25,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:13:25,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2025-04-14 00:13:25,383 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.35658914728682173 [2025-04-14 00:13:25,383 INFO L175 Difference]: Start difference. First operand has 78 places, 101 transitions, 408 flow. Second operand 3 states and 138 transitions. [2025-04-14 00:13:25,383 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 171 transitions, 1003 flow [2025-04-14 00:13:31,230 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 171 transitions, 962 flow, removed 17 selfloop flow, removed 1 redundant places. [2025-04-14 00:13:31,232 INFO L231 Difference]: Finished difference. Result has 79 places, 100 transitions, 405 flow [2025-04-14 00:13:31,232 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=379, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=405, PETRI_PLACES=79, PETRI_TRANSITIONS=100} [2025-04-14 00:13:31,233 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, -2 predicate places. [2025-04-14 00:13:31,233 INFO L485 AbstractCegarLoop]: Abstraction has has 79 places, 100 transitions, 405 flow [2025-04-14 00:13:31,233 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 00:13:31,233 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:13:31,233 INFO L206 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2025-04-14 00:13:31,233 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-14 00:13:31,233 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES === [consumer_routineErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, consumer_routineErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-04-14 00:13:31,234 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:13:31,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1987203873, now seen corresponding path program 1 times [2025-04-14 00:13:31,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:13:31,234 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631178371] [2025-04-14 00:13:31,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:13:31,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:13:31,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-14 00:13:31,267 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-14 00:13:31,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:13:31,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:13:31,302 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 00:13:31,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:13:31,303 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631178371] [2025-04-14 00:13:31,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631178371] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:13:31,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:13:31,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-14 00:13:31,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10726446] [2025-04-14 00:13:31,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:13:31,303 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-14 00:13:31,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:13:31,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-14 00:13:31,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-14 00:13:31,304 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 129 [2025-04-14 00:13:31,305 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 100 transitions, 405 flow. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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 00:13:31,305 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:13:31,305 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 129 [2025-04-14 00:13:31,305 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:13:54,687 INFO L116 PetriNetUnfolderBase]: 178102/221480 cut-off events. [2025-04-14 00:13:54,688 INFO L117 PetriNetUnfolderBase]: For 61607/61607 co-relation queries the response was YES. [2025-04-14 00:13:55,134 INFO L83 FinitePrefix]: Finished finitePrefix Result has 512942 conditions, 221480 events. 178102/221480 cut-off events. For 61607/61607 co-relation queries the response was YES. Maximal size of possible extension queue 3962. Compared 1158315 event pairs, 49000 based on Foata normal form. 12/181082 useless extension candidates. Maximal degree in co-relation 468288. Up to 121170 conditions per place. [2025-04-14 00:13:55,786 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 155 selfloop transitions, 7 changer transitions 0/166 dead transitions. [2025-04-14 00:13:55,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 166 transitions, 950 flow [2025-04-14 00:13:55,787 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-14 00:13:55,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2025-04-14 00:13:55,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2025-04-14 00:13:55,788 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.2926356589147287 [2025-04-14 00:13:55,788 INFO L175 Difference]: Start difference. First operand has 79 places, 100 transitions, 405 flow. Second operand 4 states and 151 transitions. [2025-04-14 00:13:55,788 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 166 transitions, 950 flow [2025-04-14 00:13:55,914 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 166 transitions, 910 flow, removed 0 selfloop flow, removed 5 redundant places. [2025-04-14 00:13:55,916 INFO L231 Difference]: Finished difference. Result has 76 places, 95 transitions, 374 flow [2025-04-14 00:13:55,916 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=342, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=374, PETRI_PLACES=76, PETRI_TRANSITIONS=95} [2025-04-14 00:13:55,916 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, -5 predicate places. [2025-04-14 00:13:55,916 INFO L485 AbstractCegarLoop]: Abstraction has has 76 places, 95 transitions, 374 flow [2025-04-14 00:13:55,917 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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 00:13:55,917 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:13:55,917 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-14 00:13:55,917 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-14 00:13:55,917 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting producer_routineErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [consumer_routineErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, consumer_routineErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-04-14 00:13:55,917 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:13:55,917 INFO L85 PathProgramCache]: Analyzing trace with hash -1987201654, now seen corresponding path program 1 times [2025-04-14 00:13:55,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:13:55,917 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694617448] [2025-04-14 00:13:55,917 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:13:55,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:13:55,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-14 00:13:55,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-14 00:13:55,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:13:55,952 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:13:56,281 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 00:13:56,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:13:56,281 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694617448] [2025-04-14 00:13:56,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694617448] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:13:56,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:13:56,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-14 00:13:56,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031939261] [2025-04-14 00:13:56,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:13:56,282 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-14 00:13:56,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:13:56,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-14 00:13:56,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-14 00:13:56,282 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 129 [2025-04-14 00:13:56,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 95 transitions, 374 flow. Second operand has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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 00:13:56,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:13:56,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 129 [2025-04-14 00:13:56,283 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:14:21,085 INFO L116 PetriNetUnfolderBase]: 177529/222114 cut-off events. [2025-04-14 00:14:21,085 INFO L117 PetriNetUnfolderBase]: For 67045/67045 co-relation queries the response was YES. [2025-04-14 00:14:21,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 537797 conditions, 222114 events. 177529/222114 cut-off events. For 67045/67045 co-relation queries the response was YES. Maximal size of possible extension queue 4059. Compared 1179233 event pairs, 33430 based on Foata normal form. 0/183642 useless extension candidates. Maximal degree in co-relation 434167. Up to 208743 conditions per place. [2025-04-14 00:14:22,537 INFO L140 encePairwiseOnDemand]: 117/129 looper letters, 128 selfloop transitions, 26 changer transitions 0/158 dead transitions. [2025-04-14 00:14:22,537 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 158 transitions, 848 flow [2025-04-14 00:14:22,538 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:14:22,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:14:22,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 186 transitions. [2025-04-14 00:14:22,539 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.24031007751937986 [2025-04-14 00:14:22,539 INFO L175 Difference]: Start difference. First operand has 76 places, 95 transitions, 374 flow. Second operand 6 states and 186 transitions. [2025-04-14 00:14:22,540 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 158 transitions, 848 flow [2025-04-14 00:14:22,553 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 158 transitions, 847 flow, removed 0 selfloop flow, removed 1 redundant places. [2025-04-14 00:14:22,556 INFO L231 Difference]: Finished difference. Result has 83 places, 98 transitions, 469 flow [2025-04-14 00:14:22,556 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=373, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=469, PETRI_PLACES=83, PETRI_TRANSITIONS=98} [2025-04-14 00:14:22,558 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 2 predicate places. [2025-04-14 00:14:22,558 INFO L485 AbstractCegarLoop]: Abstraction has has 83 places, 98 transitions, 469 flow [2025-04-14 00:14:22,558 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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 00:14:22,559 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:14:22,559 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2025-04-14 00:14:22,559 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-04-14 00:14:22,559 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting consumer_routineErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [consumer_routineErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, consumer_routineErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-04-14 00:14:22,560 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:14:22,560 INFO L85 PathProgramCache]: Analyzing trace with hash -1987171189, now seen corresponding path program 1 times [2025-04-14 00:14:22,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:14:22,560 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795428707] [2025-04-14 00:14:22,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:14:22,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:14:22,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-04-14 00:14:22,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-04-14 00:14:22,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:14:22,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:14:22,679 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 00:14:22,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:14:22,679 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795428707] [2025-04-14 00:14:22,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795428707] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:14:22,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:14:22,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:14:22,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709835976] [2025-04-14 00:14:22,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:14:22,680 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:14:22,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:14:22,680 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:14:22,680 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:14:22,680 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 129 [2025-04-14 00:14:22,680 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 98 transitions, 469 flow. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 00:14:22,680 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:14:22,680 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 129 [2025-04-14 00:14:22,681 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:14:46,512 INFO L116 PetriNetUnfolderBase]: 159518/197172 cut-off events. [2025-04-14 00:14:46,512 INFO L117 PetriNetUnfolderBase]: For 75268/75268 co-relation queries the response was YES. [2025-04-14 00:14:47,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 490820 conditions, 197172 events. 159518/197172 cut-off events. For 75268/75268 co-relation queries the response was YES. Maximal size of possible extension queue 3619. Compared 1001759 event pairs, 42516 based on Foata normal form. 1224/167328 useless extension candidates. Maximal degree in co-relation 489761. Up to 105079 conditions per place. [2025-04-14 00:14:47,721 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 143 selfloop transitions, 7 changer transitions 0/154 dead transitions. [2025-04-14 00:14:47,721 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 154 transitions, 902 flow [2025-04-14 00:14:47,722 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:14:47,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:14:47,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2025-04-14 00:14:47,723 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.3695090439276486 [2025-04-14 00:14:47,723 INFO L175 Difference]: Start difference. First operand has 83 places, 98 transitions, 469 flow. Second operand 3 states and 143 transitions. [2025-04-14 00:14:47,723 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 154 transitions, 902 flow [2025-04-14 00:14:47,748 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 154 transitions, 826 flow, removed 12 selfloop flow, removed 5 redundant places. [2025-04-14 00:14:47,749 INFO L231 Difference]: Finished difference. Result has 78 places, 89 transitions, 352 flow [2025-04-14 00:14:47,749 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=82, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=352, PETRI_PLACES=78, PETRI_TRANSITIONS=89} [2025-04-14 00:14:47,750 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, -3 predicate places. [2025-04-14 00:14:47,750 INFO L485 AbstractCegarLoop]: Abstraction has has 78 places, 89 transitions, 352 flow [2025-04-14 00:14:47,750 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 00:14:47,750 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:14:47,750 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:14:47,750 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-04-14 00:14:47,750 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting consumer_routineErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [consumer_routineErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, consumer_routineErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-04-14 00:14:47,751 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:14:47,751 INFO L85 PathProgramCache]: Analyzing trace with hash 1557598756, now seen corresponding path program 1 times [2025-04-14 00:14:47,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:14:47,751 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774333111] [2025-04-14 00:14:47,751 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:14:47,751 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:14:47,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-14 00:14:47,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-14 00:14:47,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:14:47,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:14:48,504 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 00:14:48,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:14:48,504 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774333111] [2025-04-14 00:14:48,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774333111] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:14:48,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:14:48,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-14 00:14:48,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538294029] [2025-04-14 00:14:48,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:14:48,505 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-14 00:14:48,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:14:48,505 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-14 00:14:48,505 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-04-14 00:14:48,505 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 6 out of 129 [2025-04-14 00:14:48,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 89 transitions, 352 flow. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:14:48,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:14:48,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 6 of 129 [2025-04-14 00:14:48,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:15:10,798 INFO L116 PetriNetUnfolderBase]: 159506/197760 cut-off events. [2025-04-14 00:15:10,799 INFO L117 PetriNetUnfolderBase]: For 100793/100793 co-relation queries the response was YES. [2025-04-14 00:15:11,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 486777 conditions, 197760 events. 159506/197760 cut-off events. For 100793/100793 co-relation queries the response was YES. Maximal size of possible extension queue 3694. Compared 1003967 event pairs, 40655 based on Foata normal form. 0/166704 useless extension candidates. Maximal degree in co-relation 319125. Up to 187248 conditions per place. [2025-04-14 00:15:12,083 INFO L140 encePairwiseOnDemand]: 114/129 looper letters, 128 selfloop transitions, 36 changer transitions 0/168 dead transitions. [2025-04-14 00:15:12,084 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 168 transitions, 909 flow [2025-04-14 00:15:12,084 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-14 00:15:12,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2025-04-14 00:15:12,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 195 transitions. [2025-04-14 00:15:12,085 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.25193798449612403 [2025-04-14 00:15:12,085 INFO L175 Difference]: Start difference. First operand has 78 places, 89 transitions, 352 flow. Second operand 6 states and 195 transitions. [2025-04-14 00:15:12,085 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 168 transitions, 909 flow [2025-04-14 00:15:12,114 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 168 transitions, 891 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:15:12,116 INFO L231 Difference]: Finished difference. Result has 83 places, 106 transitions, 535 flow [2025-04-14 00:15:12,116 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=338, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=535, PETRI_PLACES=83, PETRI_TRANSITIONS=106} [2025-04-14 00:15:12,116 INFO L279 CegarLoopForPetriNet]: 81 programPoint places, 2 predicate places. [2025-04-14 00:15:12,117 INFO L485 AbstractCegarLoop]: Abstraction has has 83 places, 106 transitions, 535 flow [2025-04-14 00:15:12,117 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:15:12,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:15:12,117 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:15:12,117 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-14 00:15:12,117 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting producer_routineErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE === [consumer_routineErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE, consumer_routineErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 8 more)] === [2025-04-14 00:15:12,117 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:15:12,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1220047447, now seen corresponding path program 1 times [2025-04-14 00:15:12,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:15:12,118 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [233756961] [2025-04-14 00:15:12,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:15:12,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:15:12,148 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-14 00:15:12,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-14 00:15:12,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:15:12,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-04-14 00:15:12,201 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2017069271] [2025-04-14 00:15:12,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:15:12,201 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-14 00:15:12,201 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:15:12,203 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 00:15:12,205 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 00:15:12,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-14 00:15:13,746 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-14 00:15:13,747 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:15:13,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 00:15:13,747 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 00:15:13,777 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-14 00:15:15,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-14 00:15:15,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:15:15,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 00:15:15,971 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 00:15:15,971 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 00:15:15,971 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location producer_routineErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (10 of 11 remaining) [2025-04-14 00:15:15,971 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location consumer_routineErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (9 of 11 remaining) [2025-04-14 00:15:15,972 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location consumer_routineErr1ASSERT_VIOLATIONERROR_FUNCTION (8 of 11 remaining) [2025-04-14 00:15:15,972 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 11 remaining) [2025-04-14 00:15:15,972 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 11 remaining) [2025-04-14 00:15:15,972 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location producer_routineErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (5 of 11 remaining) [2025-04-14 00:15:15,972 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location consumer_routineErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (4 of 11 remaining) [2025-04-14 00:15:15,972 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location consumer_routineErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 11 remaining) [2025-04-14 00:15:15,972 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location consumer_routineErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (2 of 11 remaining) [2025-04-14 00:15:15,972 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location consumer_routineErr1ASSERT_VIOLATIONERROR_FUNCTION (1 of 11 remaining) [2025-04-14 00:15:15,972 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location producer_routineErr0ASSERT_VIOLATIONUNSUPPORTED_FEATURE (0 of 11 remaining) [2025-04-14 00:15:15,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-04-14 00:15:16,172 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-14 00:15:16,173 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:15:16,266 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 2 thread instances [2025-04-14 00:15:16,267 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:15:16,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:15:16 BasicIcfg [2025-04-14 00:15:16,273 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:15:16,273 INFO L158 Benchmark]: Toolchain (without parser) took 223600.35ms. Allocated memory was 167.8MB in the beginning and 4.0GB in the end (delta: 3.9GB). Free memory was 115.9MB in the beginning and 2.4GB in the end (delta: -2.3GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2025-04-14 00:15:16,274 INFO L158 Benchmark]: CDTParser took 0.84ms. Allocated memory is still 159.4MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:15:16,274 INFO L158 Benchmark]: CACSL2BoogieTranslator took 706.16ms. Allocated memory is still 167.8MB. Free memory was 115.3MB in the beginning and 61.0MB in the end (delta: 54.3MB). Peak memory consumption was 54.5MB. Max. memory is 8.0GB. [2025-04-14 00:15:16,274 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.30ms. Allocated memory is still 167.8MB. Free memory was 61.0MB in the beginning and 56.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:15:16,274 INFO L158 Benchmark]: Boogie Preprocessor took 84.60ms. Allocated memory is still 167.8MB. Free memory was 56.8MB in the beginning and 52.0MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:15:16,274 INFO L158 Benchmark]: IcfgBuilder took 1449.56ms. Allocated memory is still 167.8MB. Free memory was 52.0MB in the beginning and 38.5MB in the end (delta: 13.5MB). Peak memory consumption was 35.1MB. Max. memory is 8.0GB. [2025-04-14 00:15:16,275 INFO L158 Benchmark]: TraceAbstraction took 221292.97ms. Allocated memory was 167.8MB in the beginning and 4.0GB in the end (delta: 3.9GB). Free memory was 38.5MB in the beginning and 2.4GB in the end (delta: -2.4GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. [2025-04-14 00:15:16,276 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.84ms. Allocated memory is still 159.4MB. Free memory is still 86.7MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 706.16ms. Allocated memory is still 167.8MB. Free memory was 115.3MB in the beginning and 61.0MB in the end (delta: 54.3MB). Peak memory consumption was 54.5MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 58.30ms. Allocated memory is still 167.8MB. Free memory was 61.0MB in the beginning and 56.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * Boogie Preprocessor took 84.60ms. Allocated memory is still 167.8MB. Free memory was 56.8MB in the beginning and 52.0MB in the end (delta: 4.9MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 1449.56ms. Allocated memory is still 167.8MB. Free memory was 52.0MB in the beginning and 38.5MB in the end (delta: 13.5MB). Peak memory consumption was 35.1MB. Max. memory is 8.0GB. * TraceAbstraction took 221292.97ms. Allocated memory was 167.8MB in the beginning and 4.0GB in the end (delta: 3.9GB). Free memory was 38.5MB in the beginning and 2.4GB in the end (delta: -2.4GB). Peak memory consumption was 1.5GB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1636]: Unable to prove that there are no unsupported features in the program Unable to prove that there are no unsupported features in the program Reason: overapproximation of fflush at line 1636. Possible FailurePath: [L1663] 0 thread_t producers[2]; [L1664] 0 thread_t consumers[2]; [L1665] 0 int i; [L1666] 0 bounded_buf_t buffer; [L1667] CALL 0 bounded_buf_init(&buffer, 3) [L1452] 0 int status = 0; [L1453] COND FALSE 0 !(bbuf == ((void *)0)) [L1454] 0 bbuf->valid = 0xACDEFA [L1455] 0 status = pthread_mutex_init(&bbuf->mutex, ((void *)0)) [L1456] COND FALSE 0 !(status != 0) [L1457] 0 status = pthread_cond_init(&bbuf->not_full, ((void *)0)) [L1458] COND FALSE 0 !(status != 0) [L1463] 0 status = pthread_cond_init(&bbuf->not_empty, ((void *)0)) [L1464] COND FALSE 0 !(status != 0) [L1470] 0 bbuf->item_num = 0 [L1471] 0 bbuf->max_size = sz [L1472] 0 bbuf->head = 0 [L1473] 0 bbuf->rear = 0 [L1474] EXPR, FCALL 0 calloc( sz, sizeof(void*) ) [L1474] 0 bbuf->buf = calloc( sz, sizeof(void*) ) [L1475] EXPR 0 bbuf->buf [L1475] COND FALSE 0 !(bbuf->buf == ((void *)0)) [L1482] 0 bbuf->head = 0 [L1483] 0 bbuf->rear = 0 [L1484] 0 bbuf->p_wait = 0 [L1485] 0 bbuf->c_wait = 0 [L1486] 0 return 0; [L1667] RET 0 bounded_buf_init(&buffer, 3) [L1668] 0 i = 0 [L1668] COND TRUE 0 i < 2 [L1670] 0 producers[i].id = i [L1671] 0 producers[i].bbuf = &buffer [L1672] FCALL, FORK 0 pthread_create(&producers[i].pid, ((void *)0), producer_routine, (void*)&producers[i]) VAL [buffer={4:0}, consumers={6:0}, i=0, producers={5:0}] [L1623] 1 thread_t * thread = (thread_t*) arg; [L1624] 1 int i, temp; [L1625] 1 int ch; [L1626] 1 int status = 0; [L1627] 1 i = 0 [L1627] COND TRUE 1 i < 4 [L1629] 1 ch = __VERIFIER_nondet_int() [L1630] 1 temp = ch [L1631] EXPR 1 thread->bbuf [L1631] CALL, EXPR 1 bounded_buf_put(thread->bbuf, (void*)((int)temp)) [L1526] 1 int status = 0, status1 = 0, status2 = 0; [L1527] 1 bbuf == ((void *)0) || bbuf->valid != 0xACDEFA [L1527] 1 bbuf == ((void *)0) || bbuf->valid != 0xACDEFA [L1527] EXPR 1 bbuf->valid [L1527] 1 bbuf == ((void *)0) || bbuf->valid != 0xACDEFA [L1527] COND FALSE 1 !(bbuf == ((void *)0) || bbuf->valid != 0xACDEFA) [L1529] 1 status = pthread_mutex_lock(&bbuf->mutex) [L1531] COND FALSE 1 !(status != 0) [L1532] EXPR 1 bbuf->rear [L1532] EXPR 1 bbuf->max_size [L1532] EXPR 1 bbuf->head [L1532] COND FALSE 1 !((bbuf->rear + 1)% bbuf->max_size == bbuf->head) [L1542] COND TRUE 1 status == 0 [L1543] EXPR 1 bbuf->buf [L1543] EXPR 1 bbuf->rear [L1543] 1 bbuf->buf[bbuf->rear]= item [L1544] EXPR 1 bbuf->rear [L1544] EXPR 1 bbuf->max_size [L1544] 1 bbuf->rear = (bbuf->rear+1)% (bbuf->max_size) [L1545] EXPR 1 bbuf->c_wait [L1545] COND FALSE 1 !(bbuf->c_wait > 0) [L1551] 1 status2 = pthread_mutex_unlock(&bbuf->mutex) [L1552] 1 return (status == 0)? status2 : status; [L1631] RET, EXPR 1 bounded_buf_put(thread->bbuf, (void*)((int)temp)) [L1631] 1 status = bounded_buf_put(thread->bbuf, (void*)((int)temp)) [L1632] COND FALSE 1 !(status != 0) VAL [\at(arg, Pre)={5:0}, arg={5:0}, ch=-2147483648, i=0, status=0, temp=-2147483648, thread={5:0}] [L1636] 1 fflush(stdout) VAL [\at(arg, Pre)={5:0}, arg={5:0}, ch=-2147483648, i=0, status=0, temp=-2147483648, thread={5:0}] - UnprovableResult [Line: 1657]: Unable to prove that there are no unsupported features in the program Unable to prove that there are no unsupported features in the program Reason: Not analyzed. - UnprovableResult [Line: 1581]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: Not analyzed. - UnprovableResult [Line: 1672]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 1678]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 73 locations, 127 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: 3.1s, OverallIterations: 2, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 22 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 22 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 108 IncrementalHoareTripleChecker+Invalid, 116 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 0 mSDtfsCounter, 108 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=180occurred in iteration=0, InterpolantAutomatonStates: 5, 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.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 8 NumberOfCodeBlocks, 8 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 3 ConstructedInterpolants, 0 QuantifiedInterpolants, 77 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 0/0 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 - StatisticsResult: Ultimate Automizer benchmark data with 2 thread instances CFG has 7 procedures, 100 locations, 172 edges, 11 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: 217.8s, OverallIterations: 8, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 211.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 512 SdHoareTripleChecker+Valid, 8.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 512 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 7.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 42 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1665 IncrementalHoareTripleChecker+Invalid, 1707 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 42 mSolverCounterUnsat, 0 mSDtfsCounter, 1665 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=535occurred in iteration=7, InterpolantAutomatonStates: 33, 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.0s SsaConstructionTime, 1.4s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 57 NumberOfCodeBlocks, 57 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 34 ConstructedInterpolants, 0 QuantifiedInterpolants, 450 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 0/0 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: unable to determine feasibility of some traces [2025-04-14 00:15:16,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...