/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.xml -s ../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --traceabstraction.automaton.type.used.in.concurrency.analysis FINITE_AUTOMATA -i ../../../trunk/examples/svcomp/ldv-races/race-2_2-container_of.i


--------------------------------------------------------------------------------


This is Ultimate 0.3.0-wip.dk.cfg-lbe-improvements-94356ea-m
[2025-04-13 17:24:32,687 INFO  L188        SettingsManager]: Resetting all preferences to default values...
[2025-04-13 17:24:32,741 INFO  L114        SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../benchexec/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf
[2025-04-13 17:24:32,745 WARN  L101        SettingsManager]: Preference file contains the following unknown settings:
[2025-04-13 17:24:32,745 WARN  L103        SettingsManager]:   * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2025-04-13 17:24:32,766 INFO  L130        SettingsManager]: Preferences different from defaults after loading the file:
[2025-04-13 17:24:32,767 INFO  L151        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2025-04-13 17:24:32,767 INFO  L153        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2025-04-13 17:24:32,767 INFO  L151        SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2025-04-13 17:24:32,767 INFO  L153        SettingsManager]:  * Use memory slicer=true
[2025-04-13 17:24:32,767 INFO  L151        SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2025-04-13 17:24:32,767 INFO  L153        SettingsManager]:  * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2025-04-13 17:24:32,767 INFO  L151        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2025-04-13 17:24:32,767 INFO  L153        SettingsManager]:  * Create parallel compositions if possible=false
[2025-04-13 17:24:32,767 INFO  L153        SettingsManager]:  * Use SBE=true
[2025-04-13 17:24:32,769 INFO  L151        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2025-04-13 17:24:32,769 INFO  L153        SettingsManager]:  * Pointer base address is valid at dereference=IGNORE
[2025-04-13 17:24:32,769 INFO  L153        SettingsManager]:  * sizeof long=4
[2025-04-13 17:24:32,769 INFO  L153        SettingsManager]:  * Overapproximate operations on floating types=true
[2025-04-13 17:24:32,769 INFO  L153        SettingsManager]:  * sizeof POINTER=4
[2025-04-13 17:24:32,770 INFO  L153        SettingsManager]:  * Check division by zero=IGNORE
[2025-04-13 17:24:32,770 INFO  L153        SettingsManager]:  * Pointer to allocated memory at dereference=IGNORE
[2025-04-13 17:24:32,770 INFO  L153        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=IGNORE
[2025-04-13 17:24:32,770 INFO  L153        SettingsManager]:  * Check array bounds for arrays that are off heap=IGNORE
[2025-04-13 17:24:32,770 INFO  L153        SettingsManager]:  * sizeof long double=12
[2025-04-13 17:24:32,770 INFO  L153        SettingsManager]:  * Check if freed pointer was valid=false
[2025-04-13 17:24:32,770 INFO  L153        SettingsManager]:  * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR
[2025-04-13 17:24:32,770 INFO  L153        SettingsManager]:  * Use constant arrays=true
[2025-04-13 17:24:32,770 INFO  L151        SettingsManager]: Preferences of IcfgBuilder differ from their defaults:
[2025-04-13 17:24:32,770 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-04-13 17:24:32,771 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-04-13 17:24:32,771 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-04-13 17:24:32,771 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-04-13 17:24:32,771 INFO  L151        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2025-04-13 17:24:32,771 INFO  L153        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2025-04-13 17:24:32,771 INFO  L153        SettingsManager]:  * Only consider context switches at boundaries of atomic blocks=true
[2025-04-13 17:24:32,771 INFO  L153        SettingsManager]:  * SMT solver=External_DefaultMode
[2025-04-13 17:24:32,771 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-04-13 17:24:32,771 INFO  L151        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2025-04-13 17:24:32,771 INFO  L153        SettingsManager]:  * Compute Interpolants along a Counterexample=FPandBP
[2025-04-13 17:24:32,771 INFO  L153        SettingsManager]:  * Compute procedure contracts=false
[2025-04-13 17:24:32,771 INFO  L153        SettingsManager]:  * Positions where we compute the Hoare Annotation=LoopHeads
[2025-04-13 17:24:32,771 INFO  L153        SettingsManager]:  * Trace refinement strategy=CAMEL
[2025-04-13 17:24:32,771 INFO  L153        SettingsManager]:  * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2025-04-13 17:24:32,772 INFO  L153        SettingsManager]:  * Automaton type used in concurrency analysis=PETRI_NET
[2025-04-13 17:24:32,772 INFO  L153        SettingsManager]:  * Order on configurations for Petri net unfoldings=DBO
[2025-04-13 17:24:32,772 INFO  L153        SettingsManager]:  * SMT solver=External_ModelsAndUnsatCoreMode
[2025-04-13 17:24:32,772 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 -> FINITE_AUTOMATA
[2025-04-13 17:24:33,017 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2025-04-13 17:24:33,026 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2025-04-13 17:24:33,027 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2025-04-13 17:24:33,028 INFO  L270        PluginConnector]: Initializing CDTParser...
[2025-04-13 17:24:33,029 INFO  L274        PluginConnector]: CDTParser initialized
[2025-04-13 17:24:33,030 INFO  L431   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-races/race-2_2-container_of.i
[2025-04-13 17:24:34,353 INFO  L538              CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/627ee7bbc/72568f1484b846eea1f9d16ce18f5c72/FLAG090630044
[2025-04-13 17:24:34,663 INFO  L389              CDTParser]: Found 1 translation units.
[2025-04-13 17:24:34,665 INFO  L178              CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-races/race-2_2-container_of.i
[2025-04-13 17:24:34,696 INFO  L432              CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/627ee7bbc/72568f1484b846eea1f9d16ce18f5c72/FLAG090630044
[2025-04-13 17:24:35,405 INFO  L440              CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/627ee7bbc/72568f1484b846eea1f9d16ce18f5c72
[2025-04-13 17:24:35,407 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2025-04-13 17:24:35,408 INFO  L133        ToolchainWalker]: Walking toolchain with 5 elements.
[2025-04-13 17:24:35,409 INFO  L112        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2025-04-13 17:24:35,409 INFO  L270        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2025-04-13 17:24:35,412 INFO  L274        PluginConnector]: CACSL2BoogieTranslator initialized
[2025-04-13 17:24:35,413 INFO  L184        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:24:35" (1/1) ...
[2025-04-13 17:24:35,413 INFO  L204        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1521976a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:24:35, skipping insertion in model container
[2025-04-13 17:24:35,413 INFO  L184        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.04 05:24:35" (1/1) ...
[2025-04-13 17:24:35,446 INFO  L175         MainTranslator]: Built tables and reachable declarations
[2025-04-13 17:24:35,785 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_2-container_of.i[186287,186300]
[2025-04-13 17:24:35,815 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-04-13 17:24:35,822 INFO  L200         MainTranslator]: Completed pre-run
[2025-04-13 17:24:35,881 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_2-container_of.i[186287,186300]
[2025-04-13 17:24:35,896 INFO  L210          PostProcessor]: Analyzing one entry point: main
[2025-04-13 17:24:35,930 INFO  L204         MainTranslator]: Completed translation
[2025-04-13 17:24:35,930 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:24:35 WrapperNode
[2025-04-13 17:24:35,930 INFO  L131        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2025-04-13 17:24:35,931 INFO  L112        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2025-04-13 17:24:35,931 INFO  L270        PluginConnector]: Initializing Boogie Procedure Inliner...
[2025-04-13 17:24:35,931 INFO  L274        PluginConnector]: Boogie Procedure Inliner initialized
[2025-04-13 17:24:35,935 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:24:35" (1/1) ...
[2025-04-13 17:24:35,949 INFO  L184        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:24:35" (1/1) ...
[2025-04-13 17:24:35,974 INFO  L138                Inliner]: procedures = 246, calls = 39, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 108
[2025-04-13 17:24:35,974 INFO  L131        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2025-04-13 17:24:35,975 INFO  L112        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2025-04-13 17:24:35,975 INFO  L270        PluginConnector]: Initializing Boogie Preprocessor...
[2025-04-13 17:24:35,975 INFO  L274        PluginConnector]: Boogie Preprocessor initialized
[2025-04-13 17:24:35,981 INFO  L184        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:24:35" (1/1) ...
[2025-04-13 17:24:35,981 INFO  L184        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:24:35" (1/1) ...
[2025-04-13 17:24:35,986 INFO  L184        PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:24:35" (1/1) ...
[2025-04-13 17:24:36,002 INFO  L175           MemorySlicer]: Split 15 memory accesses to 3 slices as follows [2, 2, 11]. 73 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 8 writes are split as follows [0, 2, 6].
[2025-04-13 17:24:36,002 INFO  L184        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:24:35" (1/1) ...
[2025-04-13 17:24:36,003 INFO  L184        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:24:35" (1/1) ...
[2025-04-13 17:24:36,010 INFO  L184        PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:24:35" (1/1) ...
[2025-04-13 17:24:36,012 INFO  L184        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:24:35" (1/1) ...
[2025-04-13 17:24:36,013 INFO  L184        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:24:35" (1/1) ...
[2025-04-13 17:24:36,015 INFO  L184        PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:24:35" (1/1) ...
[2025-04-13 17:24:36,016 INFO  L184        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:24:35" (1/1) ...
[2025-04-13 17:24:36,023 INFO  L131        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2025-04-13 17:24:36,023 INFO  L112        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2025-04-13 17:24:36,023 INFO  L270        PluginConnector]: Initializing RCFGBuilder...
[2025-04-13 17:24:36,023 INFO  L274        PluginConnector]: RCFGBuilder initialized
[2025-04-13 17:24:36,024 INFO  L184        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:24:35" (1/1) ...
[2025-04-13 17:24:36,027 INFO  L173          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2025-04-13 17:24:36,037 INFO  L189       MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2025-04-13 17:24:36,049 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2025-04-13 17:24:36,051 INFO  L327       MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2025-04-13 17:24:36,071 INFO  L130     BoogieDeclarations]: Found specification of procedure my_callback
[2025-04-13 17:24:36,071 INFO  L138     BoogieDeclarations]: Found implementation of procedure my_callback
[2025-04-13 17:24:36,071 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin
[2025-04-13 17:24:36,071 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2025-04-13 17:24:36,072 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2025-04-13 17:24:36,072 INFO  L130     BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end
[2025-04-13 17:24:36,072 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#0
[2025-04-13 17:24:36,072 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#1
[2025-04-13 17:24:36,072 INFO  L130     BoogieDeclarations]: Found specification of procedure read~int#2
[2025-04-13 17:24:36,072 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#0
[2025-04-13 17:24:36,072 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#1
[2025-04-13 17:24:36,072 INFO  L130     BoogieDeclarations]: Found specification of procedure write~int#2
[2025-04-13 17:24:36,072 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2025-04-13 17:24:36,072 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$#0
[2025-04-13 17:24:36,072 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$#1
[2025-04-13 17:24:36,072 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$#2
[2025-04-13 17:24:36,073 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#0
[2025-04-13 17:24:36,073 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#1
[2025-04-13 17:24:36,073 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int#2
[2025-04-13 17:24:36,073 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2025-04-13 17:24:36,073 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2025-04-13 17:24:36,074 WARN  L203             CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement.
[2025-04-13 17:24:36,280 INFO  L234             CfgBuilder]: Building ICFG
[2025-04-13 17:24:36,281 INFO  L260             CfgBuilder]: Building CFG for each procedure with an implementation
[2025-04-13 17:24:36,453 INFO  L279             CfgBuilder]: Omitted future-live optimization because the input is a concurrent program.
[2025-04-13 17:24:36,454 INFO  L289             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2025-04-13 17:24:36,454 INFO  L294             CfgBuilder]: Performing block encoding
[2025-04-13 17:24:36,612 WARN  L179     LargeBlockEncoding]: Complex 2:2 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs.
[2025-04-13 17:24:36,630 WARN  L179     LargeBlockEncoding]: Complex 3:3 sequential composition. Such compositions can cause exponential blowup and should not occur in structured programs.
[2025-04-13 17:24:36,659 INFO  L313             CfgBuilder]: Removed 0 assume(true) statements.
[2025-04-13 17:24:36,660 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:24:36 BoogieIcfgContainer
[2025-04-13 17:24:36,660 INFO  L131        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2025-04-13 17:24:36,661 INFO  L112        PluginConnector]: ------------------------TraceAbstraction----------------------------
[2025-04-13 17:24:36,661 INFO  L270        PluginConnector]: Initializing TraceAbstraction...
[2025-04-13 17:24:36,664 INFO  L274        PluginConnector]: TraceAbstraction initialized
[2025-04-13 17:24:36,664 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.04 05:24:35" (1/3) ...
[2025-04-13 17:24:36,665 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67983b4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:24:36, skipping insertion in model container
[2025-04-13 17:24:36,665 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.04 05:24:35" (2/3) ...
[2025-04-13 17:24:36,665 INFO  L204        PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@67983b4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.04 05:24:36, skipping insertion in model container
[2025-04-13 17:24:36,665 INFO  L184        PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.04 05:24:36" (3/3) ...
[2025-04-13 17:24:36,666 INFO  L128   eAbstractionObserver]: Analyzing ICFG race-2_2-container_of.i
[2025-04-13 17:24:36,676 INFO  L217   ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2025-04-13 17:24:36,677 INFO  L151   ceAbstractionStarter]: Applying trace abstraction to ICFG race-2_2-container_of.i that has 2 procedures, 20 locations, 25 edges, 1 initial locations, 0 loop locations, and 4 error locations.
[2025-04-13 17:24:36,678 INFO  L490   ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances.
[2025-04-13 17:24:36,730 INFO  L143    ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions.
[2025-04-13 17:24:36,755 INFO  L113   iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 32 places, 32 transitions, 78 flow
[2025-04-13 17:24:36,786 INFO  L135   iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result  has 212 states, 204 states have (on average 2.4411764705882355) internal successors, (498), 211 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-04-13 17:24:36,810 INFO  L339      AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2025-04-13 17:24:36,820 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=FINITE_AUTOMATA, 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;@5dd72713, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2025-04-13 17:24:36,823 INFO  L341      AbstractCegarLoop]: Starting to check reachability of 6 error locations.
[2025-04-13 17:24:36,825 INFO  L278                IsEmpty]: Start isEmpty. Operand  has 212 states, 204 states have (on average 2.4411764705882355) internal successors, (498), 211 states have internal predecessors, (498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-04-13 17:24:36,829 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 2
[2025-04-13 17:24:36,829 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-13 17:24:36,829 INFO  L218           NwaCegarLoop]: trace histogram [1]
[2025-04-13 17:24:36,830 INFO  L403      AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] ===
[2025-04-13 17:24:36,834 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-13 17:24:36,834 INFO  L85        PathProgramCache]: Analyzing trace with hash 393, now seen corresponding path program 1 times
[2025-04-13 17:24:36,840 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-13 17:24:36,841 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118730419]
[2025-04-13 17:24:36,841 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-13 17:24:36,842 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-13 17:24:36,973 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1 statements into 1 equivalence classes.
[2025-04-13 17:24:37,010 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1 of 1 statements.
[2025-04-13 17:24:37,011 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-13 17:24:37,011 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-13 17:24:37,257 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-13 17:24:37,258 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-13 17:24:37,258 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118730419]
[2025-04-13 17:24:37,258 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118730419] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-13 17:24:37,259 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-13 17:24:37,259 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0
[2025-04-13 17:24:37,260 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010791383]
[2025-04-13 17:24:37,260 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-13 17:24:37,265 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 2 states
[2025-04-13 17:24:37,266 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-13 17:24:37,279 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2025-04-13 17:24:37,280 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-04-13 17:24:37,282 INFO  L87              Difference]: Start difference. First operand  has 212 states, 204 states have (on average 2.4411764705882355) internal successors, (498), 211 states have internal predecessors, (498), 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) Second operand  has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-04-13 17:24:37,340 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-13 17:24:37,340 INFO  L93              Difference]: Finished difference Result 212 states and 498 transitions.
[2025-04-13 17:24:37,341 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2025-04-13 17:24:37,342 INFO  L79                 Accepts]: Start accepts. Automaton has  has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 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) Word has length 1
[2025-04-13 17:24:37,342 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-13 17:24:37,347 INFO  L225             Difference]: With dead ends: 212
[2025-04-13 17:24:37,347 INFO  L226             Difference]: Without dead ends: 101
[2025-04-13 17:24:37,349 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 0 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2025-04-13 17:24:37,352 INFO  L437           NwaCegarLoop]: 0 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time
[2025-04-13 17:24:37,352 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 0 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time]
[2025-04-13 17:24:37,363 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 101 states.
[2025-04-13 17:24:37,372 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101.
[2025-04-13 17:24:37,373 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 101 states, 99 states have (on average 2.0707070707070705) internal successors, (205), 100 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-04-13 17:24:37,379 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 205 transitions.
[2025-04-13 17:24:37,380 INFO  L79                 Accepts]: Start accepts. Automaton has 101 states and 205 transitions. Word has length 1
[2025-04-13 17:24:37,381 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-13 17:24:37,381 INFO  L485      AbstractCegarLoop]: Abstraction has 101 states and 205 transitions.
[2025-04-13 17:24:37,381 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 2 states, 1 states have (on average 1.0) internal successors, (1), 1 states have internal predecessors, (1), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-04-13 17:24:37,381 INFO  L278                IsEmpty]: Start isEmpty. Operand 101 states and 205 transitions.
[2025-04-13 17:24:37,383 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2025-04-13 17:24:37,383 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-13 17:24:37,383 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-13 17:24:37,383 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2025-04-13 17:24:37,384 INFO  L403      AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] ===
[2025-04-13 17:24:37,384 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-13 17:24:37,385 INFO  L85        PathProgramCache]: Analyzing trace with hash -823282293, now seen corresponding path program 1 times
[2025-04-13 17:24:37,385 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-13 17:24:37,385 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384170303]
[2025-04-13 17:24:37,385 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-13 17:24:37,385 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-13 17:24:37,418 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes.
[2025-04-13 17:24:37,456 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements.
[2025-04-13 17:24:37,456 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-13 17:24:37,456 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-13 17:24:38,026 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-13 17:24:38,026 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-13 17:24:38,026 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384170303]
[2025-04-13 17:24:38,026 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384170303] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-13 17:24:38,026 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-13 17:24:38,026 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2025-04-13 17:24:38,026 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050674421]
[2025-04-13 17:24:38,026 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-13 17:24:38,027 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2025-04-13 17:24:38,027 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-13 17:24:38,028 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2025-04-13 17:24:38,028 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42
[2025-04-13 17:24:38,028 INFO  L87              Difference]: Start difference. First operand 101 states and 205 transitions. Second operand  has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-04-13 17:24:38,275 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-13 17:24:38,275 INFO  L93              Difference]: Finished difference Result 127 states and 250 transitions.
[2025-04-13 17:24:38,276 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. 
[2025-04-13 17:24:38,276 INFO  L79                 Accepts]: Start accepts. Automaton has  has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 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) Word has length 19
[2025-04-13 17:24:38,276 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-13 17:24:38,277 INFO  L225             Difference]: With dead ends: 127
[2025-04-13 17:24:38,277 INFO  L226             Difference]: Without dead ends: 126
[2025-04-13 17:24:38,277 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132
[2025-04-13 17:24:38,278 INFO  L437           NwaCegarLoop]: 0 mSDtfsCounter, 82 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-13 17:24:38,278 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 0 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-13 17:24:38,279 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 126 states.
[2025-04-13 17:24:38,288 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126.
[2025-04-13 17:24:38,289 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 126 states, 124 states have (on average 2.0080645161290325) internal successors, (249), 125 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-04-13 17:24:38,291 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 249 transitions.
[2025-04-13 17:24:38,291 INFO  L79                 Accepts]: Start accepts. Automaton has 126 states and 249 transitions. Word has length 19
[2025-04-13 17:24:38,291 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-13 17:24:38,291 INFO  L485      AbstractCegarLoop]: Abstraction has 126 states and 249 transitions.
[2025-04-13 17:24:38,291 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 7 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-04-13 17:24:38,291 INFO  L278                IsEmpty]: Start isEmpty. Operand 126 states and 249 transitions.
[2025-04-13 17:24:38,292 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2025-04-13 17:24:38,292 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-13 17:24:38,292 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-13 17:24:38,292 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2025-04-13 17:24:38,295 INFO  L403      AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] ===
[2025-04-13 17:24:38,295 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-13 17:24:38,295 INFO  L85        PathProgramCache]: Analyzing trace with hash 1007366536, now seen corresponding path program 1 times
[2025-04-13 17:24:38,295 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-13 17:24:38,296 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150178308]
[2025-04-13 17:24:38,296 INFO  L97    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2025-04-13 17:24:38,296 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-13 17:24:38,323 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes.
[2025-04-13 17:24:38,352 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements.
[2025-04-13 17:24:38,352 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-13 17:24:38,352 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-13 17:24:39,579 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-13 17:24:39,580 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-13 17:24:39,580 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150178308]
[2025-04-13 17:24:39,580 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150178308] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-13 17:24:39,580 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-13 17:24:39,580 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11
[2025-04-13 17:24:39,580 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768730600]
[2025-04-13 17:24:39,580 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-13 17:24:39,580 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 13 states
[2025-04-13 17:24:39,580 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-13 17:24:39,581 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants.
[2025-04-13 17:24:39,581 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156
[2025-04-13 17:24:39,581 INFO  L87              Difference]: Start difference. First operand 126 states and 249 transitions. Second operand  has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-04-13 17:24:40,294 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-13 17:24:40,294 INFO  L93              Difference]: Finished difference Result 170 states and 333 transitions.
[2025-04-13 17:24:40,294 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. 
[2025-04-13 17:24:40,294 INFO  L79                 Accepts]: Start accepts. Automaton has  has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 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) Word has length 19
[2025-04-13 17:24:40,294 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-13 17:24:40,296 INFO  L225             Difference]: With dead ends: 170
[2025-04-13 17:24:40,296 INFO  L226             Difference]: Without dead ends: 128
[2025-04-13 17:24:40,297 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=115, Invalid=535, Unknown=0, NotChecked=0, Total=650
[2025-04-13 17:24:40,298 INFO  L437           NwaCegarLoop]: 0 mSDtfsCounter, 73 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2025-04-13 17:24:40,298 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 0 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2025-04-13 17:24:40,299 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 128 states.
[2025-04-13 17:24:40,303 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 122.
[2025-04-13 17:24:40,303 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 122 states, 120 states have (on average 2.0083333333333333) internal successors, (241), 121 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-04-13 17:24:40,306 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 241 transitions.
[2025-04-13 17:24:40,307 INFO  L79                 Accepts]: Start accepts. Automaton has 122 states and 241 transitions. Word has length 19
[2025-04-13 17:24:40,307 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-13 17:24:40,307 INFO  L485      AbstractCegarLoop]: Abstraction has 122 states and 241 transitions.
[2025-04-13 17:24:40,307 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 13 states, 12 states have (on average 1.5833333333333333) internal successors, (19), 12 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-04-13 17:24:40,307 INFO  L278                IsEmpty]: Start isEmpty. Operand 122 states and 241 transitions.
[2025-04-13 17:24:40,309 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2025-04-13 17:24:40,309 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-13 17:24:40,309 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-13 17:24:40,309 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2025-04-13 17:24:40,309 INFO  L403      AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] ===
[2025-04-13 17:24:40,309 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-13 17:24:40,309 INFO  L85        PathProgramCache]: Analyzing trace with hash 885935665, now seen corresponding path program 2 times
[2025-04-13 17:24:40,310 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-13 17:24:40,310 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558158739]
[2025-04-13 17:24:40,310 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-13 17:24:40,310 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-13 17:24:40,330 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes.
[2025-04-13 17:24:40,342 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements.
[2025-04-13 17:24:40,343 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-04-13 17:24:40,343 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2025-04-13 17:24:40,711 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2025-04-13 17:24:40,711 INFO  L136   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2025-04-13 17:24:40,711 INFO  L324   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558158739]
[2025-04-13 17:24:40,711 INFO  L158   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558158739] provided 1 perfect and 0 imperfect interpolant sequences
[2025-04-13 17:24:40,711 INFO  L185   FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2025-04-13 17:24:40,711 INFO  L198   FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2025-04-13 17:24:40,712 INFO  L121   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115007733]
[2025-04-13 17:24:40,712 INFO  L85    oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2025-04-13 17:24:40,712 INFO  L562      AbstractCegarLoop]: INTERPOLANT automaton has 10 states
[2025-04-13 17:24:40,712 INFO  L100   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2025-04-13 17:24:40,712 INFO  L144   InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants.
[2025-04-13 17:24:40,712 INFO  L146   InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90
[2025-04-13 17:24:40,712 INFO  L87              Difference]: Start difference. First operand 122 states and 241 transitions. Second operand  has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-04-13 17:24:41,070 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2025-04-13 17:24:41,070 INFO  L93              Difference]: Finished difference Result 222 states and 438 transitions.
[2025-04-13 17:24:41,071 INFO  L140   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. 
[2025-04-13 17:24:41,071 INFO  L79                 Accepts]: Start accepts. Automaton has  has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 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) Word has length 19
[2025-04-13 17:24:41,071 INFO  L85                 Accepts]: Finished accepts. some prefix is accepted.
[2025-04-13 17:24:41,072 INFO  L225             Difference]: With dead ends: 222
[2025-04-13 17:24:41,072 INFO  L226             Difference]: Without dead ends: 221
[2025-04-13 17:24:41,072 INFO  L436           NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240
[2025-04-13 17:24:41,073 INFO  L437           NwaCegarLoop]: 0 mSDtfsCounter, 73 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 324 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 0 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 324 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2025-04-13 17:24:41,073 INFO  L438           NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 0 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 324 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2025-04-13 17:24:41,074 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 221 states.
[2025-04-13 17:24:41,081 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 158.
[2025-04-13 17:24:41,082 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 158 states, 156 states have (on average 2.0833333333333335) internal successors, (325), 157 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-04-13 17:24:41,082 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 325 transitions.
[2025-04-13 17:24:41,083 INFO  L79                 Accepts]: Start accepts. Automaton has 158 states and 325 transitions. Word has length 19
[2025-04-13 17:24:41,083 INFO  L85                 Accepts]: Finished accepts. word is rejected.
[2025-04-13 17:24:41,083 INFO  L485      AbstractCegarLoop]: Abstraction has 158 states and 325 transitions.
[2025-04-13 17:24:41,083 INFO  L486      AbstractCegarLoop]: INTERPOLANT automaton has  has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2025-04-13 17:24:41,083 INFO  L278                IsEmpty]: Start isEmpty. Operand 158 states and 325 transitions.
[2025-04-13 17:24:41,083 INFO  L284                IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2025-04-13 17:24:41,083 INFO  L210           NwaCegarLoop]: Found error trace
[2025-04-13 17:24:41,084 INFO  L218           NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-04-13 17:24:41,084 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2025-04-13 17:24:41,084 INFO  L403      AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (and 3 more)] ===
[2025-04-13 17:24:41,084 INFO  L155       PredicateUnifier]: Initialized classic predicate unifier
[2025-04-13 17:24:41,084 INFO  L85        PathProgramCache]: Analyzing trace with hash 134161490, now seen corresponding path program 2 times
[2025-04-13 17:24:41,084 INFO  L118   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2025-04-13 17:24:41,084 INFO  L324   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [250353661]
[2025-04-13 17:24:41,084 INFO  L95    rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2025-04-13 17:24:41,088 INFO  L127          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2025-04-13 17:24:41,107 INFO  L108    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 19 statements into 1 equivalence classes.
[2025-04-13 17:24:41,122 INFO  L111    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 19 of 19 statements.
[2025-04-13 17:24:41,123 INFO  L114    AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s)
[2025-04-13 17:24:41,123 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-04-13 17:24:41,123 INFO  L348             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2025-04-13 17:24:41,127 INFO  L108    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes.
[2025-04-13 17:24:41,143 INFO  L111    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements.
[2025-04-13 17:24:41,144 INFO  L114    AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s)
[2025-04-13 17:24:41,144 INFO  L115    AnnotateAndAsserter]: Conjunction of SSA is sat
[2025-04-13 17:24:41,165 INFO  L130   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2025-04-13 17:24:41,165 INFO  L340         BasicCegarLoop]: Counterexample is feasible
[2025-04-13 17:24:41,166 INFO  L790   garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (5 of 6 remaining)
[2025-04-13 17:24:41,167 INFO  L790   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (4 of 6 remaining)
[2025-04-13 17:24:41,167 INFO  L790   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (3 of 6 remaining)
[2025-04-13 17:24:41,167 INFO  L790   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 6 remaining)
[2025-04-13 17:24:41,167 INFO  L790   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 6 remaining)
[2025-04-13 17:24:41,167 INFO  L790   garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 6 remaining)
[2025-04-13 17:24:41,167 WARN  L466      AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2025-04-13 17:24:41,170 INFO  L422         BasicCegarLoop]: Path program histogram: [2, 2, 1]
[2025-04-13 17:24:41,221 INFO  L242   ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances
[2025-04-13 17:24:41,221 INFO  L171   ceAbstractionStarter]: Computing trace abstraction results
[2025-04-13 17:24:41,227 INFO  L201        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.04 05:24:41 BasicIcfg
[2025-04-13 17:24:41,227 INFO  L131        PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2025-04-13 17:24:41,228 INFO  L158              Benchmark]: Toolchain (without parser) took 5819.61ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 96.0MB in the beginning and 241.1MB in the end (delta: -145.1MB). Peak memory consumption was 27.1MB. Max. memory is 8.0GB.
[2025-04-13 17:24:41,228 INFO  L158              Benchmark]: CDTParser took 0.18ms. Allocated memory is still 159.4MB. Free memory is still 87.5MB. There was no memory consumed. Max. memory is 8.0GB.
[2025-04-13 17:24:41,228 INFO  L158              Benchmark]: CACSL2BoogieTranslator took 521.31ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 61.9MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB.
[2025-04-13 17:24:41,228 INFO  L158              Benchmark]: Boogie Procedure Inliner took 43.06ms. Allocated memory is still 142.6MB. Free memory was 61.9MB in the beginning and 59.2MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB.
[2025-04-13 17:24:41,230 INFO  L158              Benchmark]: Boogie Preprocessor took 47.94ms. Allocated memory is still 142.6MB. Free memory was 59.2MB in the beginning and 55.9MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB.
[2025-04-13 17:24:41,230 INFO  L158              Benchmark]: RCFGBuilder took 636.46ms. Allocated memory is still 142.6MB. Free memory was 55.9MB in the beginning and 65.6MB in the end (delta: -9.6MB). Peak memory consumption was 42.0MB. Max. memory is 8.0GB.
[2025-04-13 17:24:41,230 INFO  L158              Benchmark]: TraceAbstraction took 4566.31ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 64.9MB in the beginning and 241.1MB in the end (delta: -176.2MB). There was no memory consumed. Max. memory is 8.0GB.
[2025-04-13 17:24:41,231 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.18ms. Allocated memory is still 159.4MB. Free memory is still 87.5MB. There was no memory consumed. Max. memory is 8.0GB.
 * CACSL2BoogieTranslator took 521.31ms. Allocated memory is still 142.6MB. Free memory was 95.4MB in the beginning and 61.9MB in the end (delta: 33.5MB). Peak memory consumption was 33.6MB. Max. memory is 8.0GB.
 * Boogie Procedure Inliner took 43.06ms. Allocated memory is still 142.6MB. Free memory was 61.9MB in the beginning and 59.2MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 8.0GB.
 * Boogie Preprocessor took 47.94ms. Allocated memory is still 142.6MB. Free memory was 59.2MB in the beginning and 55.9MB in the end (delta: 3.3MB). Peak memory consumption was 4.2MB. Max. memory is 8.0GB.
 * RCFGBuilder took 636.46ms. Allocated memory is still 142.6MB. Free memory was 55.9MB in the beginning and 65.6MB in the end (delta: -9.6MB). Peak memory consumption was 42.0MB. Max. memory is 8.0GB.
 * TraceAbstraction took 4566.31ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 64.9MB in the beginning and 241.1MB in the end (delta: -176.2MB). There was no memory consumed. Max. memory is 8.0GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: ErrorAutomatonStatistics
    NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
  - 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;
[L3950]  CALL, EXPR   0  my_drv_init()
[L3944]               0  return 0;
[L3950]  RET, EXPR    0  my_drv_init()
[L3950]               0  int ret = my_drv_init();
[L3951]  COND TRUE    0  ret==0
[L3952]               0  int probe_ret;
[L3953]               0  struct my_data data;
[L3954]  CALL, EXPR   0  my_drv_probe(&data)
[L3920]               0  struct device *d = &data->dev;
[L3924]               0  data->shared.a = 0
[L3925]               0  data->shared.b = 0
[L3926]               0  int res = __VERIFIER_nondet_int();
[L3927]  COND FALSE   0  !(\read(res))
[L3930]  FCALL, FORK  0  pthread_create(&t1, ((void *)0), my_callback, (void *)d)
         VAL             [\at(arg, Pre)={5:24}, \at(data, Pre)={5:0}, d={5:24}, data={5: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) );})
[L3908]               1  data->shared.a = 1
         VAL             [\at(arg, Pre)={5:24}, arg={5:24}, data={5:0}, dev={5:24}, t1=-1, t2=0]
[L3911]  EXPR         1  data->shared.b
[L3911]               1  int lb = data->shared.b;
[L3931]  FCALL, FORK  0  pthread_create(&t2, ((void *)0), my_callback, (void *)d)
         VAL             [\at(arg, Pre)={5:24}, \at(data, Pre)={5:0}, arg={5:24}, d={5:24}, data={5:0}, data={5:0}, dev={5:24}, lb=0, res=0, t1=-1, t2=0]
[L3932]               0  return 0;
[L3954]  RET, EXPR    0  my_drv_probe(&data)
[L3954]               0  probe_ret = my_drv_probe(&data)
[L3955]  COND TRUE    0  probe_ret==0
[L3956]  CALL         0  my_drv_disconnect(&data)
[L3938]               0  void *status;
         VAL             [\at(arg, Pre)={5:24}, \at(data, Pre)={5:0}, arg={5:24}, data={5:0}, data={5:0}, dev={5:24}, lb=0, status={3:0}, t1=-1, t2=0]
[L3902]               2  struct device *dev = (struct device*)arg;
[L3903]               2  struct my_data *data;
[L3904]               2  const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev);
[L3904]               2  { const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );}
[L3904]               2  data = ({ const typeof( ((struct my_data *)0)->dev ) *__mptr = (dev); (struct my_data *)( (char *)__mptr - __builtin_offsetof (struct my_data, dev) );})
[L3908]               2  data->shared.a = 1
         VAL             [\at(arg, Pre)={5:24}, arg={5:24}, data={5:0}, dev={5:24}, lb=0, t1=-1, t2=0]
[L3911]  EXPR         2  data->shared.b
[L3911]               2  int lb = data->shared.b;
[L3914]               2  data->shared.b = lb + 1
         VAL             [\at(arg, Pre)={5:24}, arg={5:24}, data={5:0}, dev={5:24}, lb=0, t1=-1, t2=0]
[L3917]               2  return 0;
[L3914]               1  data->shared.b = lb + 1
         VAL             [\at(arg, Pre)={5:24}, \result={0:0}, arg={5:24}, data={5:0}, dev={5:24}, lb=0, t1=-1, t2=0]
[L3917]               1  return 0;
[L3939]  FCALL, JOIN  1  pthread_join(t1, &status)
         VAL             [\at(arg, Pre)={5:24}, \at(data, Pre)={5:0}, \result={0:0}, arg={5:24}, data={5:0}, data={5:0}, dev={5:24}, lb=0, status={3:0}, t1=-1, t2=0]
[L3940]  FCALL, JOIN  2  pthread_join(t2, &status)
         VAL             [\at(arg, Pre)={5:24}, \at(data, Pre)={5:0}, \result={0:0}, arg={5:24}, data={5:0}, data={5:0}, dev={5:24}, lb=0, status={3:0}, t1=-1, t2=0]
[L3956]  RET          0  my_drv_disconnect(&data)
[L3957]  EXPR         0  data.shared.a
[L3957]  CALL         0  ldv_assert(data.shared.a==1)
[L3887]  COND FALSE   0  !(!expression)
[L3957]  RET          0  ldv_assert(data.shared.a==1)
[L3958]  EXPR         0  data.shared.b
[L3958]  CALL         0  ldv_assert(data.shared.b==2)
[L3887]  COND TRUE    0  !expression
[L3887]               0  reach_error()
         VAL             [\at(arg, Pre)={5:24}, \at(expression, Pre)=0, \result={0:0}, arg={5:24}, data={5:0}, dev={5:24}, expression=0, lb=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: 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: 3931]: 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, 34 locations, 41 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 4.4s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 1.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 228 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 228 mSDsluCounter, 0 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 992 IncrementalHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 0 mSDtfsCounter, 992 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=212occurred in iteration=0, InterpolantAutomatonStates: 41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 69 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.4s InterpolantComputationTime, 77 NumberOfCodeBlocks, 77 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 54 ConstructedInterpolants, 0 QuantifiedInterpolants, 894 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 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-13 17:24:41,248 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...