/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/ldv-races/race-2_4-container_of.i -------------------------------------------------------------------------------- This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m [2025-04-14 00:11:18,395 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-14 00:11:18,460 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:18,467 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-14 00:11:18,467 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-14 00:11:18,492 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-14 00:11:18,494 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-14 00:11:18,494 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-14 00:11:18,494 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-14 00:11:18,494 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-14 00:11:18,495 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-14 00:11:18,495 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-14 00:11:18,495 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-14 00:11:18,495 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-14 00:11:18,496 INFO L153 SettingsManager]: * Use SBE=true [2025-04-14 00:11:18,496 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-14 00:11:18,496 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-14 00:11:18,496 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-14 00:11:18,496 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-14 00:11:18,496 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-14 00:11:18,496 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-14 00:11:18,496 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-14 00:11:18,496 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-14 00:11:18,496 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-14 00:11:18,497 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-14 00:11:18,497 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-14 00:11:18,497 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-14 00:11:18,497 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-14 00:11:18,497 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-14 00:11:18,497 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:11:18,497 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:11:18,497 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:11:18,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:11:18,497 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-14 00:11:18,497 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-14 00:11:18,497 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-14 00:11:18,497 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-14 00:11:18,497 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:11:18,498 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-14 00:11:18,498 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-14 00:11:18,498 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-14 00:11:18,498 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-14 00:11:18,498 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-14 00:11:18,498 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-14 00:11:18,498 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-14 00:11:18,498 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-14 00:11:18,498 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-14 00:11:18,498 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:18,766 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-14 00:11:18,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-14 00:11:18,774 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-14 00:11:18,775 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-14 00:11:18,775 INFO L274 PluginConnector]: CDTParser initialized [2025-04-14 00:11:18,776 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_4-container_of.i [2025-04-14 00:11:20,293 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8c549821/53419092df5b4e6c9f43fecf8610033e/FLAGdb7d303e6 [2025-04-14 00:11:20,639 INFO L389 CDTParser]: Found 1 translation units. [2025-04-14 00:11:20,640 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_4-container_of.i [2025-04-14 00:11:20,665 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8c549821/53419092df5b4e6c9f43fecf8610033e/FLAGdb7d303e6 [2025-04-14 00:11:21,344 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8c549821/53419092df5b4e6c9f43fecf8610033e [2025-04-14 00:11:21,347 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-14 00:11:21,348 INFO L133 ToolchainWalker]: Walking toolchain with 5 elements. [2025-04-14 00:11:21,350 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-14 00:11:21,350 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-14 00:11:21,354 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-14 00:11:21,355 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:11:21" (1/1) ... [2025-04-14 00:11:21,355 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e7fa9f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:21, skipping insertion in model container [2025-04-14 00:11:21,356 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 12:11:21" (1/1) ... [2025-04-14 00:11:21,399 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-14 00:11:21,750 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_4-container_of.i[186287,186300] [2025-04-14 00:11:21,788 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:11:21,801 INFO L200 MainTranslator]: Completed pre-run [2025-04-14 00:11:21,860 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_4-container_of.i[186287,186300] [2025-04-14 00:11:21,885 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-14 00:11:21,920 INFO L204 MainTranslator]: Completed translation [2025-04-14 00:11:21,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:21 WrapperNode [2025-04-14 00:11:21,922 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-14 00:11:21,923 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-14 00:11:21,923 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-14 00:11:21,923 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-14 00:11:21,928 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:21" (1/1) ... [2025-04-14 00:11:21,944 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:21" (1/1) ... [2025-04-14 00:11:21,966 INFO L138 Inliner]: procedures = 248, calls = 55, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 136 [2025-04-14 00:11:21,967 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-14 00:11:21,967 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-14 00:11:21,967 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-14 00:11:21,967 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-14 00:11:21,974 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:21" (1/1) ... [2025-04-14 00:11:21,974 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:21" (1/1) ... [2025-04-14 00:11:21,979 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:21" (1/1) ... [2025-04-14 00:11:22,000 INFO L175 MemorySlicer]: Split 19 memory accesses to 3 slices as follows [2, 15, 2]. 79 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 10 writes are split as follows [0, 8, 2]. [2025-04-14 00:11:22,000 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:21" (1/1) ... [2025-04-14 00:11:22,001 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:21" (1/1) ... [2025-04-14 00:11:22,009 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:21" (1/1) ... [2025-04-14 00:11:22,010 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:21" (1/1) ... [2025-04-14 00:11:22,013 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:21" (1/1) ... [2025-04-14 00:11:22,014 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:21" (1/1) ... [2025-04-14 00:11:22,024 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-14 00:11:22,025 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-04-14 00:11:22,025 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-04-14 00:11:22,025 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-04-14 00:11:22,025 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:21" (1/1) ... [2025-04-14 00:11:22,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-14 00:11:22,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-14 00:11:22,068 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:22,071 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:22,092 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2025-04-14 00:11:22,092 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2025-04-14 00:11:22,092 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-04-14 00:11:22,092 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-14 00:11:22,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-14 00:11:22,093 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-04-14 00:11:22,093 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-14 00:11:22,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-14 00:11:22,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-14 00:11:22,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-04-14 00:11:22,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-14 00:11:22,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-14 00:11:22,093 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-04-14 00:11:22,094 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-14 00:11:22,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-14 00:11:22,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-14 00:11:22,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-14 00:11:22,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-04-14 00:11:22,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-04-14 00:11:22,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-04-14 00:11:22,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-04-14 00:11:22,094 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-14 00:11:22,094 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-14 00:11:22,096 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:22,343 INFO L256 CfgBuilder]: Building ICFG [2025-04-14 00:11:22,345 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-14 00:11:22,577 INFO L303 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-14 00:11:22,578 INFO L313 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-14 00:11:22,578 INFO L318 CfgBuilder]: Performing block encoding [2025-04-14 00:11:22,796 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:22,826 WARN L179 LargeBlockEncoding]: Complex 3:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs. [2025-04-14 00:11:22,868 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-14 00:11:22,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:11:22 BoogieIcfgContainer [2025-04-14 00:11:22,869 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-04-14 00:11:22,871 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-14 00:11:22,871 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-14 00:11:22,875 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-14 00:11:22,875 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 12:11:21" (1/3) ... [2025-04-14 00:11:22,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4af2aba9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:11:22, skipping insertion in model container [2025-04-14 00:11:22,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 12:11:21" (2/3) ... [2025-04-14 00:11:22,877 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4af2aba9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 12:11:22, skipping insertion in model container [2025-04-14 00:11:22,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 14.04 12:11:22" (3/3) ... [2025-04-14 00:11:22,878 INFO L128 eAbstractionObserver]: Analyzing ICFG race-2_4-container_of.i [2025-04-14 00:11:22,891 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-14 00:11:22,893 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG race-2_4-container_of.i that has 2 procedures, 29 locations, 34 edges, 1 initial locations, 0 loop locations, and 6 error locations. [2025-04-14 00:11:22,894 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-14 00:11:22,966 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-14 00:11:23,006 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 44 places, 44 transitions, 102 flow [2025-04-14 00:11:23,051 INFO L116 PetriNetUnfolderBase]: 3/48 cut-off events. [2025-04-14 00:11:23,053 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 00:11:23,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 48 events. 3/48 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 114 event pairs, 0 based on Foata normal form. 0/33 useless extension candidates. Maximal degree in co-relation 16. Up to 3 conditions per place. [2025-04-14 00:11:23,055 INFO L82 GeneralOperation]: Start removeDead. Operand has 44 places, 44 transitions, 102 flow [2025-04-14 00:11:23,057 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 41 places, 39 transitions, 90 flow [2025-04-14 00:11:23,071 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-14 00:11:23,088 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;@16317886, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-14 00:11:23,088 INFO L341 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-04-14 00:11:23,095 INFO L177 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2025-04-14 00:11:23,095 INFO L116 PetriNetUnfolderBase]: 0/2 cut-off events. [2025-04-14 00:11:23,095 INFO L117 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2025-04-14 00:11:23,095 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:23,096 INFO L206 CegarLoopForPetriNet]: trace histogram [1] [2025-04-14 00:11:23,096 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 00:11:23,100 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:23,101 INFO L85 PathProgramCache]: Analyzing trace with hash 436, now seen corresponding path program 1 times [2025-04-14 00:11:23,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:23,106 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041257239] [2025-04-14 00:11:23,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:11:23,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:23,249 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes. [2025-04-14 00:11:23,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements. [2025-04-14 00:11:23,318 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:11:23,318 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:23,674 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:23,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:23,675 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041257239] [2025-04-14 00:11:23,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041257239] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:23,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:23,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2025-04-14 00:11:23,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903830148] [2025-04-14 00:11:23,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:23,684 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-04-14 00:11:23,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:23,710 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-04-14 00:11:23,712 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-04-14 00:11:23,713 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 44 [2025-04-14 00:11:23,716 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 39 transitions, 90 flow. Second operand has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:11:23,716 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:23,717 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 44 [2025-04-14 00:11:23,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:24,066 INFO L116 PetriNetUnfolderBase]: 861/1424 cut-off events. [2025-04-14 00:11:24,066 INFO L117 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2025-04-14 00:11:24,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2864 conditions, 1424 events. 861/1424 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 6415 event pairs, 861 based on Foata normal form. 0/1289 useless extension candidates. Maximal degree in co-relation 2779. Up to 1410 conditions per place. [2025-04-14 00:11:24,086 INFO L140 encePairwiseOnDemand]: 37/44 looper letters, 30 selfloop transitions, 0 changer transitions 0/32 dead transitions. [2025-04-14 00:11:24,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 32 transitions, 136 flow [2025-04-14 00:11:24,087 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-14 00:11:24,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2025-04-14 00:11:24,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 45 transitions. [2025-04-14 00:11:24,099 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5113636363636364 [2025-04-14 00:11:24,101 INFO L175 Difference]: Start difference. First operand has 41 places, 39 transitions, 90 flow. Second operand 2 states and 45 transitions. [2025-04-14 00:11:24,101 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 32 transitions, 136 flow [2025-04-14 00:11:24,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 32 transitions, 128 flow, removed 0 selfloop flow, removed 4 redundant places. [2025-04-14 00:11:24,109 INFO L231 Difference]: Finished difference. Result has 36 places, 32 transitions, 68 flow [2025-04-14 00:11:24,112 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=68, PETRI_PLACES=36, PETRI_TRANSITIONS=32} [2025-04-14 00:11:24,117 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, -5 predicate places. [2025-04-14 00:11:24,117 INFO L485 AbstractCegarLoop]: Abstraction has has 36 places, 32 transitions, 68 flow [2025-04-14 00:11:24,117 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.5) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:11:24,117 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:24,118 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:11:24,118 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-14 00:11:24,118 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 00:11:24,118 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:24,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1197571138, now seen corresponding path program 1 times [2025-04-14 00:11:24,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:24,119 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [75993663] [2025-04-14 00:11:24,119 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:11:24,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:24,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-04-14 00:11:24,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-04-14 00:11:24,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:11:24,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:24,433 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:24,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:24,433 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [75993663] [2025-04-14 00:11:24,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [75993663] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:24,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:24,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:11:24,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936092974] [2025-04-14 00:11:24,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:24,435 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:11:24,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:24,435 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:11:24,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:11:24,436 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 44 [2025-04-14 00:11:24,436 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 32 transitions, 68 flow. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:11:24,436 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:24,436 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 44 [2025-04-14 00:11:24,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:24,798 INFO L116 PetriNetUnfolderBase]: 1274/2121 cut-off events. [2025-04-14 00:11:24,799 INFO L117 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2025-04-14 00:11:24,802 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4238 conditions, 2121 events. 1274/2121 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 99. Compared 11036 event pairs, 487 based on Foata normal form. 0/1943 useless extension candidates. Maximal degree in co-relation 4235. Up to 1304 conditions per place. [2025-04-14 00:11:24,814 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 45 selfloop transitions, 8 changer transitions 0/55 dead transitions. [2025-04-14 00:11:24,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 55 transitions, 222 flow [2025-04-14 00:11:24,815 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:11:24,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:11:24,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2025-04-14 00:11:24,816 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.5 [2025-04-14 00:11:24,816 INFO L175 Difference]: Start difference. First operand has 36 places, 32 transitions, 68 flow. Second operand 3 states and 66 transitions. [2025-04-14 00:11:24,816 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 55 transitions, 222 flow [2025-04-14 00:11:24,817 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 55 transitions, 222 flow, removed 0 selfloop flow, removed 0 redundant places. [2025-04-14 00:11:24,819 INFO L231 Difference]: Finished difference. Result has 40 places, 39 transitions, 130 flow [2025-04-14 00:11:24,819 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=40, PETRI_TRANSITIONS=39} [2025-04-14 00:11:24,820 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, -1 predicate places. [2025-04-14 00:11:24,820 INFO L485 AbstractCegarLoop]: Abstraction has has 40 places, 39 transitions, 130 flow [2025-04-14 00:11:24,820 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:11:24,820 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:24,820 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:11:24,820 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-14 00:11:24,820 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 00:11:24,821 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:24,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1529999957, now seen corresponding path program 1 times [2025-04-14 00:11:24,821 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:24,821 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057619701] [2025-04-14 00:11:24,821 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:11:24,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:24,852 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-04-14 00:11:24,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-04-14 00:11:24,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:11:24,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-14 00:11:25,053 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:25,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-14 00:11:25,054 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057619701] [2025-04-14 00:11:25,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1057619701] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-14 00:11:25,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-14 00:11:25,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-14 00:11:25,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658251089] [2025-04-14 00:11:25,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-14 00:11:25,054 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-14 00:11:25,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-14 00:11:25,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-14 00:11:25,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-14 00:11:25,056 INFO L464 CegarLoopForPetriNet]: Number of universal loopers: 4 out of 44 [2025-04-14 00:11:25,056 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 39 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:11:25,056 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2025-04-14 00:11:25,056 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 4 of 44 [2025-04-14 00:11:25,056 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2025-04-14 00:11:25,486 INFO L116 PetriNetUnfolderBase]: 1593/2667 cut-off events. [2025-04-14 00:11:25,486 INFO L117 PetriNetUnfolderBase]: For 914/914 co-relation queries the response was YES. [2025-04-14 00:11:25,493 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6541 conditions, 2667 events. 1593/2667 cut-off events. For 914/914 co-relation queries the response was YES. Maximal size of possible extension queue 127. Compared 14433 event pairs, 738 based on Foata normal form. 0/2552 useless extension candidates. Maximal degree in co-relation 6536. Up to 1688 conditions per place. [2025-04-14 00:11:25,504 INFO L140 encePairwiseOnDemand]: 35/44 looper letters, 49 selfloop transitions, 14 changer transitions 0/65 dead transitions. [2025-04-14 00:11:25,504 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 65 transitions, 344 flow [2025-04-14 00:11:25,505 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-14 00:11:25,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2025-04-14 00:11:25,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2025-04-14 00:11:25,505 INFO L509 CegarLoopForPetriNet]: DFA transition density 0.49242424242424243 [2025-04-14 00:11:25,506 INFO L175 Difference]: Start difference. First operand has 40 places, 39 transitions, 130 flow. Second operand 3 states and 65 transitions. [2025-04-14 00:11:25,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 65 transitions, 344 flow [2025-04-14 00:11:25,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 65 transitions, 318 flow, removed 0 selfloop flow, removed 2 redundant places. [2025-04-14 00:11:25,515 INFO L231 Difference]: Finished difference. Result has 42 places, 50 transitions, 236 flow [2025-04-14 00:11:25,515 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=44, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=42, PETRI_TRANSITIONS=50} [2025-04-14 00:11:25,516 INFO L279 CegarLoopForPetriNet]: 41 programPoint places, 1 predicate places. [2025-04-14 00:11:25,516 INFO L485 AbstractCegarLoop]: Abstraction has has 42 places, 50 transitions, 236 flow [2025-04-14 00:11:25,516 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-14 00:11:25,516 INFO L198 CegarLoopForPetriNet]: Found error trace [2025-04-14 00:11:25,516 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-14 00:11:25,516 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-14 00:11:25,516 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-04-14 00:11:25,517 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-14 00:11:25,517 INFO L85 PathProgramCache]: Analyzing trace with hash -1457269358, now seen corresponding path program 1 times [2025-04-14 00:11:25,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-14 00:11:25,517 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [373626247] [2025-04-14 00:11:25,517 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-14 00:11:25,517 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-14 00:11:25,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-14 00:11:25,567 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-14 00:11:25,568 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:11:25,568 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 00:11:25,568 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-14 00:11:25,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-04-14 00:11:25,599 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-04-14 00:11:25,599 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-14 00:11:25,599 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-14 00:11:25,630 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-14 00:11:25,630 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-14 00:11:25,631 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2025-04-14 00:11:25,633 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2025-04-14 00:11:25,633 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2025-04-14 00:11:25,633 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2025-04-14 00:11:25,633 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2025-04-14 00:11:25,633 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2025-04-14 00:11:25,633 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2025-04-14 00:11:25,633 INFO L790 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2025-04-14 00:11:25,633 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-14 00:11:25,634 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2025-04-14 00:11:25,682 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-14 00:11:25,682 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-14 00:11:25,686 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 12:11:25 BasicIcfg [2025-04-14 00:11:25,688 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-14 00:11:25,689 INFO L158 Benchmark]: Toolchain (without parser) took 4341.06ms. Allocated memory was 142.6MB in the beginning and 323.0MB in the end (delta: 180.4MB). Free memory was 96.3MB in the beginning and 206.9MB in the end (delta: -110.7MB). Peak memory consumption was 71.8MB. Max. memory is 8.0GB. [2025-04-14 00:11:25,689 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 163.6MB. Free memory is still 89.6MB. There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:11:25,689 INFO L158 Benchmark]: CACSL2BoogieTranslator took 573.26ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 62.1MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. [2025-04-14 00:11:25,690 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.42ms. Allocated memory is still 142.6MB. Free memory was 61.5MB in the beginning and 59.0MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 8.0GB. [2025-04-14 00:11:25,690 INFO L158 Benchmark]: Boogie Preprocessor took 56.80ms. Allocated memory is still 142.6MB. Free memory was 59.0MB in the beginning and 55.4MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. [2025-04-14 00:11:25,690 INFO L158 Benchmark]: IcfgBuilder took 844.28ms. Allocated memory is still 142.6MB. Free memory was 55.4MB in the beginning and 59.9MB in the end (delta: -4.5MB). Peak memory consumption was 42.2MB. Max. memory is 8.0GB. [2025-04-14 00:11:25,690 INFO L158 Benchmark]: TraceAbstraction took 2817.61ms. Allocated memory was 142.6MB in the beginning and 323.0MB in the end (delta: 180.4MB). Free memory was 59.3MB in the beginning and 206.9MB in the end (delta: -147.7MB). Peak memory consumption was 33.8MB. Max. memory is 8.0GB. [2025-04-14 00:11:25,691 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.23ms. Allocated memory is still 163.6MB. Free memory is still 89.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 573.26ms. Allocated memory is still 142.6MB. Free memory was 95.6MB in the beginning and 62.1MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 43.42ms. Allocated memory is still 142.6MB. Free memory was 61.5MB in the beginning and 59.0MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 8.0GB. * Boogie Preprocessor took 56.80ms. Allocated memory is still 142.6MB. Free memory was 59.0MB in the beginning and 55.4MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB. * IcfgBuilder took 844.28ms. Allocated memory is still 142.6MB. Free memory was 55.4MB in the beginning and 59.9MB in the end (delta: -4.5MB). Peak memory consumption was 42.2MB. Max. memory is 8.0GB. * TraceAbstraction took 2817.61ms. Allocated memory was 142.6MB in the beginning and 323.0MB in the end (delta: 180.4MB). Free memory was 59.3MB in the beginning and 206.9MB in the end (delta: -147.7MB). Peak memory consumption was 33.8MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3887]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L3888] 0 pthread_t t1,t2; [L3962] CALL, EXPR 0 my_drv_init() [L3956] 0 return 0; [L3962] RET, EXPR 0 my_drv_init() [L3962] 0 int ret = my_drv_init(); [L3963] COND TRUE 0 ret==0 [L3964] 0 int probe_ret; [L3965] 0 struct my_data data; [L3966] CALL, EXPR 0 my_drv_probe(&data) [L3919] 0 struct device *d = &data->dev; [L3923] 0 data->shared.a = 0 [L3924] 0 data->shared.b = 0 [L3925] 0 int res = __VERIFIER_nondet_int(); [L3926] COND FALSE 0 !(\read(res)) [L3929] FCALL, FORK 0 pthread_create(&t1, ((void *)0), my_callback, (void *)d) VAL [\at(arg, Pre)={6:24}, \at(data, Pre)={6:0}, d={6:24}, data={6:0}, res=0, t1=-1, t2=0] [L3902] 1 struct device *dev = (struct device*)arg; [L3903] 1 struct my_data *data; [L3904] 1 const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); [L3904] 1 { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );} [L3904] 1 data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}) [L3930] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [\at(arg, Pre)={6:24}, \at(data, Pre)={6:0}, arg={6:24}, d={6:24}, data={6:0}, data={6:0}, dev={6:24}, res=0, t1=-1, t2=0] [L3931] 0 return 0; [L3966] RET, EXPR 0 my_drv_probe(&data) [L3966] 0 probe_ret = my_drv_probe(&data) [L3967] COND TRUE 0 probe_ret==0 [L3968] CALL 0 my_drv_disconnect(&data) [L3937] 0 void *status; VAL [\at(arg, Pre)={6:24}, \at(data, Pre)={6:0}, arg={6:24}, data={6:0}, dev={6:24}, status={5:0}, t1=-1, t2=0] [L3940] 0 data->shared.a = 3 VAL [\at(arg, Pre)={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1=-1, t2=0] [L3907] 1 data->shared.a = 1 VAL [\at(arg, Pre)={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1=-1, t2=0] [L3943] 0 data->shared.b = 3 VAL [\at(arg, Pre)={6:24}, arg={6:24}, data={6:0}, dev={6:24}, t1=-1, t2=0] [L3946] EXPR 0 data->shared.a [L3946] CALL 0 ldv_assert(data->shared.a==3) [L3887] COND TRUE 0 !expression [L3887] 0 reach_error() VAL [\at(arg, Pre)={6:24}, \at(expression, Pre)=0, arg={6:24}, data={6:0}, dev={6:24}, expression=0, t1=-1, t2=0] - UnprovableResult [Line: 3887]: 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: 3887]: 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: 3887]: 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: 3887]: 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: 3887]: 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: 3930]: 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: 3929]: 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 4 procedures, 49 locations, 56 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: 2.6s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 31 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 31 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 182 IncrementalHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 0 mSDtfsCounter, 182 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 6 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=236occurred in iteration=3, InterpolantAutomatonStates: 8, 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.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 30 NumberOfCodeBlocks, 30 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 15 ConstructedInterpolants, 0 QuantifiedInterpolants, 47 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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 proved your program to be incorrect! [2025-04-14 00:11:25,711 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request...