./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/unreach-call.prp --file ../../../trunk/examples/svcomp/ldv-races/race-2_4-container_of.i --traceabstraction.use.conditional.por.in.concurrent.analysis true --traceabstraction.commutativity.condition.synthesis NECESSARY_AND_SUFFICIENT --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version ebd41074 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../../../trunk/examples/svcomp/ldv-races/race-2_4-container_of.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2872c384167f2e3876e0fc6c6cdca366b47c7b8757c341fcf44d3890af023ea5 --traceabstraction.use.conditional.por.in.concurrent.analysis true --traceabstraction.commutativity.condition.synthesis NECESSARY_AND_SUFFICIENT --- Real Ultimate output --- This is Ultimate 0.3.0-dev-ebd4107-m [2025-01-23 23:53:13,626 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-23 23:53:13,700 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-01-23 23:53:13,703 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-23 23:53:13,705 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-23 23:53:13,746 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-23 23:53:13,747 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-23 23:53:13,747 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-23 23:53:13,752 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-23 23:53:13,752 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-23 23:53:13,752 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-23 23:53:13,752 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-23 23:53:13,752 INFO L153 SettingsManager]: * Use SBE=true [2025-01-23 23:53:13,752 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-23 23:53:13,752 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-23 23:53:13,752 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-23 23:53:13,752 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-23 23:53:13,752 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-23 23:53:13,752 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-23 23:53:13,752 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-23 23:53:13,752 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-23 23:53:13,752 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-23 23:53:13,753 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-23 23:53:13,753 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-23 23:53:13,753 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-23 23:53:13,753 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-23 23:53:13,753 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-23 23:53:13,753 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-23 23:53:13,753 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-23 23:53:13,753 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-23 23:53:13,753 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-23 23:53:13,753 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-23 23:53:13,753 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-23 23:53:13,753 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-23 23:53:13,753 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-01-23 23:53:13,753 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-23 23:53:13,753 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-23 23:53:13,753 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-01-23 23:53:13,753 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-23 23:53:13,753 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-23 23:53:13,753 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-01-23 23:53:13,753 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-01-23 23:53:13,753 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-01-23 23:53:13,753 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> GemCutter Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2872c384167f2e3876e0fc6c6cdca366b47c7b8757c341fcf44d3890af023ea5 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use conditional POR in concurrent analysis -> true Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NECESSARY_AND_SUFFICIENT [2025-01-23 23:53:14,022 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-23 23:53:14,030 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-23 23:53:14,032 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-23 23:53:14,033 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-23 23:53:14,033 INFO L274 PluginConnector]: CDTParser initialized [2025-01-23 23:53:14,034 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/../../../trunk/examples/svcomp/ldv-races/race-2_4-container_of.i [2025-01-23 23:53:15,153 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/a8acc3973/53280c10d0d143efb2c5f2f6734c4951/FLAG52dca1edd [2025-01-23 23:53:15,474 INFO L384 CDTParser]: Found 1 translation units. [2025-01-23 23:53:15,474 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/trunk/examples/svcomp/ldv-races/race-2_4-container_of.i [2025-01-23 23:53:15,500 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/a8acc3973/53280c10d0d143efb2c5f2f6734c4951/FLAG52dca1edd [2025-01-23 23:53:15,732 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/data/a8acc3973/53280c10d0d143efb2c5f2f6734c4951 [2025-01-23 23:53:15,734 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-23 23:53:15,735 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-23 23:53:15,736 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-23 23:53:15,737 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-23 23:53:15,740 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-23 23:53:15,740 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 11:53:15" (1/1) ... [2025-01-23 23:53:15,741 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ea29670 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 11:53:15, skipping insertion in model container [2025-01-23 23:53:15,741 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.01 11:53:15" (1/1) ... [2025-01-23 23:53:15,790 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-23 23:53:15,988 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/ldv-races/race-2_4-container_of.i[186287,186300] [2025-01-23 23:53:16,019 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-23 23:53:16,026 INFO L200 MainTranslator]: Completed pre-run [2025-01-23 23:53:16,109 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/trunk/examples/svcomp/ldv-races/race-2_4-container_of.i[186287,186300] [2025-01-23 23:53:16,121 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-23 23:53:16,161 INFO L204 MainTranslator]: Completed translation [2025-01-23 23:53:16,162 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 11:53:16 WrapperNode [2025-01-23 23:53:16,162 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-23 23:53:16,163 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-23 23:53:16,163 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-23 23:53:16,163 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-23 23:53:16,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 11:53:16" (1/1) ... [2025-01-23 23:53:16,185 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 11:53:16" (1/1) ... [2025-01-23 23:53:16,206 INFO L138 Inliner]: procedures = 248, calls = 55, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 136 [2025-01-23 23:53:16,206 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-23 23:53:16,207 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-23 23:53:16,207 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-23 23:53:16,207 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-23 23:53:16,211 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 11:53:16" (1/1) ... [2025-01-23 23:53:16,211 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 11:53:16" (1/1) ... [2025-01-23 23:53:16,213 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 11:53:16" (1/1) ... [2025-01-23 23:53:16,213 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 11:53:16" (1/1) ... [2025-01-23 23:53:16,220 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 11:53:16" (1/1) ... [2025-01-23 23:53:16,221 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 11:53:16" (1/1) ... [2025-01-23 23:53:16,222 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 11:53:16" (1/1) ... [2025-01-23 23:53:16,223 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 11:53:16" (1/1) ... [2025-01-23 23:53:16,224 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 11:53:16" (1/1) ... [2025-01-23 23:53:16,226 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-23 23:53:16,227 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-23 23:53:16,227 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-23 23:53:16,227 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-23 23:53:16,228 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 11:53:16" (1/1) ... [2025-01-23 23:53:16,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2025-01-23 23:53:16,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 23:53:16,263 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2025-01-23 23:53:16,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2025-01-23 23:53:16,282 INFO L130 BoogieDeclarations]: Found specification of procedure my_callback [2025-01-23 23:53:16,282 INFO L138 BoogieDeclarations]: Found implementation of procedure my_callback [2025-01-23 23:53:16,282 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2025-01-23 23:53:16,282 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-23 23:53:16,282 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-23 23:53:16,282 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2025-01-23 23:53:16,283 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-01-23 23:53:16,283 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-01-23 23:53:16,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-01-23 23:53:16,283 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-01-23 23:53:16,283 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-23 23:53:16,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2025-01-23 23:53:16,283 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-01-23 23:53:16,283 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-23 23:53:16,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-23 23:53:16,284 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-01-23 23:53:16,518 INFO L234 CfgBuilder]: Building ICFG [2025-01-23 23:53:16,520 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-23 23:53:16,741 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-01-23 23:53:16,741 INFO L283 CfgBuilder]: Performing block encoding [2025-01-23 23:53:16,820 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-23 23:53:16,821 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-23 23:53:16,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 11:53:16 BoogieIcfgContainer [2025-01-23 23:53:16,821 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-23 23:53:16,826 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-23 23:53:16,828 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-23 23:53:16,834 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-23 23:53:16,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.01 11:53:15" (1/3) ... [2025-01-23 23:53:16,834 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d88ae8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 11:53:16, skipping insertion in model container [2025-01-23 23:53:16,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.01 11:53:16" (2/3) ... [2025-01-23 23:53:16,834 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58d88ae8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.01 11:53:16, skipping insertion in model container [2025-01-23 23:53:16,834 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 11:53:16" (3/3) ... [2025-01-23 23:53:16,835 INFO L128 eAbstractionObserver]: Analyzing ICFG race-2_4-container_of.i [2025-01-23 23:53:16,853 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-23 23:53:16,854 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG race-2_4-container_of.i that has 2 procedures, 47 locations, 1 initial locations, 0 loop locations, and 6 error locations. [2025-01-23 23:53:16,854 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-01-23 23:53:16,895 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-01-23 23:53:16,928 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=true, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 23:53:16,928 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-01-23 23:53:16,929 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 [2025-01-23 23:53:16,930 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-01-23 23:53:16,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-01-23 23:53:17,002 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-01-23 23:53:17,013 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-01-23 23:53:17,017 INFO L333 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=PARTIAL_ORDER_FA, 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;@76ce124a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-23 23:53:17,018 INFO L334 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2025-01-23 23:53:17,047 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-01-23 23:53:17,047 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 23:53:17,047 INFO L139 ounterexampleChecker]: Examining path program with hash 1270555238, occurence #1 [2025-01-23 23:53:17,047 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 23:53:17,048 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 23:53:17,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 23:53:17,051 INFO L85 PathProgramCache]: Analyzing trace with hash -514444511, now seen corresponding path program 1 times [2025-01-23 23:53:17,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 23:53:17,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [15842593] [2025-01-23 23:53:17,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 23:53:17,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 23:53:17,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-23 23:53:17,206 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-23 23:53:17,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 23:53:17,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 23:53:17,497 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 23:53:17,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 23:53:17,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [15842593] [2025-01-23 23:53:17,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [15842593] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 23:53:17,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 23:53:17,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-23 23:53:17,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1967474119] [2025-01-23 23:53:17,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 23:53:17,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 23:53:17,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 23:53:17,517 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 23:53:17,517 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 23:53:17,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 23:53:17,519 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 23:53:17,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 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-01-23 23:53:17,520 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 23:53:17,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 23:53:17,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-23 23:53:17,555 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-01-23 23:53:17,555 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 23:53:17,555 INFO L139 ounterexampleChecker]: Examining path program with hash 835450427, occurence #1 [2025-01-23 23:53:17,555 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 23:53:17,555 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 23:53:17,555 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 23:53:17,555 INFO L85 PathProgramCache]: Analyzing trace with hash -459888639, now seen corresponding path program 1 times [2025-01-23 23:53:17,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 23:53:17,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471563257] [2025-01-23 23:53:17,556 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 23:53:17,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 23:53:17,575 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-01-23 23:53:17,590 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-01-23 23:53:17,590 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 23:53:17,590 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 23:53:17,792 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 23:53:17,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 23:53:17,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471563257] [2025-01-23 23:53:17,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471563257] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 23:53:17,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 23:53:17,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-23 23:53:17,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945813582] [2025-01-23 23:53:17,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 23:53:17,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-23 23:53:17,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 23:53:17,794 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-23 23:53:17,794 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-23 23:53:17,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 23:53:17,794 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 23:53:17,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 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-01-23 23:53:17,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 23:53:17,794 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 23:53:17,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 23:53:17,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 23:53:17,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-23 23:53:17,849 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-01-23 23:53:17,849 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 23:53:17,849 INFO L139 ounterexampleChecker]: Examining path program with hash -1417328581, occurence #1 [2025-01-23 23:53:17,849 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 23:53:17,849 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 23:53:17,850 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 23:53:17,850 INFO L85 PathProgramCache]: Analyzing trace with hash -514381129, now seen corresponding path program 1 times [2025-01-23 23:53:17,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 23:53:17,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239504394] [2025-01-23 23:53:17,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 23:53:17,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 23:53:17,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-01-23 23:53:17,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-01-23 23:53:17,873 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 23:53:17,873 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 23:53:17,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 23:53:17,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 23:53:17,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239504394] [2025-01-23 23:53:17,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239504394] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 23:53:17,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 23:53:17,920 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-23 23:53:17,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081792467] [2025-01-23 23:53:17,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 23:53:17,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-23 23:53:17,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 23:53:17,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-23 23:53:17,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-23 23:53:17,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 23:53:17,921 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 23:53:17,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-01-23 23:53:17,921 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 23:53:17,921 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 23:53:17,922 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 23:53:18,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 23:53:18,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 23:53:18,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 23:53:18,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-23 23:53:18,615 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-01-23 23:53:18,615 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 23:53:18,615 INFO L139 ounterexampleChecker]: Examining path program with hash 1242520008, occurence #1 [2025-01-23 23:53:18,615 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 23:53:18,615 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 23:53:18,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 23:53:18,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1210485966, now seen corresponding path program 1 times [2025-01-23 23:53:18,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 23:53:18,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984349383] [2025-01-23 23:53:18,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 23:53:18,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 23:53:18,635 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-23 23:53:18,647 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-23 23:53:18,647 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 23:53:18,647 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 23:53:18,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 23:53:18,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 23:53:18,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984349383] [2025-01-23 23:53:18,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984349383] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 23:53:18,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 23:53:18,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 23:53:18,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586958207] [2025-01-23 23:53:18,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 23:53:18,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 23:53:18,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 23:53:18,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 23:53:18,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 23:53:18,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 23:53:18,821 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 23:53:18,821 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.0) internal successors, (28), 3 states have internal predecessors, (28), 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-01-23 23:53:18,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 23:53:18,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 23:53:18,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-23 23:53:18,821 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 23:53:18,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 23:53:18,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 23:53:18,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 23:53:18,905 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 23:53:18,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-23 23:53:18,905 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-01-23 23:53:18,905 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 23:53:18,905 INFO L139 ounterexampleChecker]: Examining path program with hash -1043803544, occurence #1 [2025-01-23 23:53:18,905 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 23:53:18,905 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 23:53:18,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 23:53:18,905 INFO L85 PathProgramCache]: Analyzing trace with hash 1129641173, now seen corresponding path program 1 times [2025-01-23 23:53:18,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 23:53:18,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412132171] [2025-01-23 23:53:18,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 23:53:18,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 23:53:18,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-23 23:53:18,928 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-23 23:53:18,928 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 23:53:18,928 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-23 23:53:19,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-23 23:53:19,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-23 23:53:19,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412132171] [2025-01-23 23:53:19,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412132171] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-23 23:53:19,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-23 23:53:19,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-23 23:53:19,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2143775839] [2025-01-23 23:53:19,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-23 23:53:19,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-23 23:53:19,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-23 23:53:19,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-23 23:53:19,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-23 23:53:19,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-23 23:53:19,025 INFO L471 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-01-23 23:53:19,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 14.5) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-23 23:53:19,025 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 23:53:19,025 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 23:53:19,025 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-01-23 23:53:19,025 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-01-23 23:53:19,025 INFO L154 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-01-23 23:53:19,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 23:53:19,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 23:53:19,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-23 23:53:19,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 23:53:19,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-23 23:53:19,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-23 23:53:19,119 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (and 5 more)] === [2025-01-23 23:53:19,119 INFO L305 artialOrderCegarLoop]: Trying commutativity condition synthesis. [2025-01-23 23:53:19,119 INFO L139 ounterexampleChecker]: Examining path program with hash -2098695331, occurence #1 [2025-01-23 23:53:19,120 INFO L141 ounterexampleChecker]: Commutativity condition synthesis is only active after more than 2 occurrences. Skipping... [2025-01-23 23:53:19,120 INFO L316 artialOrderCegarLoop]: No commutativity proof found, falling back to feasibility check. [2025-01-23 23:53:19,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-23 23:53:19,120 INFO L85 PathProgramCache]: Analyzing trace with hash 1076684049, now seen corresponding path program 1 times [2025-01-23 23:53:19,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-23 23:53:19,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476364767] [2025-01-23 23:53:19,120 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-23 23:53:19,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-23 23:53:19,142 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-23 23:53:19,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-23 23:53:19,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 23:53:19,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 23:53:19,164 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-23 23:53:19,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-23 23:53:19,186 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-23 23:53:19,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-23 23:53:19,187 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-23 23:53:19,210 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-23 23:53:19,210 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-23 23:53:19,211 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION (7 of 8 remaining) [2025-01-23 23:53:19,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION (6 of 8 remaining) [2025-01-23 23:53:19,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 8 remaining) [2025-01-23 23:53:19,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (4 of 8 remaining) [2025-01-23 23:53:19,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION (3 of 8 remaining) [2025-01-23 23:53:19,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (2 of 8 remaining) [2025-01-23 23:53:19,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 8 remaining) [2025-01-23 23:53:19,212 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 8 remaining) [2025-01-23 23:53:19,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-23 23:53:19,221 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2025-01-23 23:53:19,270 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-01-23 23:53:19,270 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-23 23:53:19,279 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Ended with exit code 0 [2025-01-23 23:53:19,279 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.01 11:53:19 BasicIcfg [2025-01-23 23:53:19,280 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-23 23:53:19,281 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-23 23:53:19,281 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-23 23:53:19,281 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-23 23:53:19,281 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.01 11:53:16" (3/4) ... [2025-01-23 23:53:19,282 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-01-23 23:53:19,323 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 18. [2025-01-23 23:53:19,362 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/witness.graphml [2025-01-23 23:53:19,363 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/witness.yml [2025-01-23 23:53:19,363 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-23 23:53:19,363 INFO L158 Benchmark]: Toolchain (without parser) took 3628.03ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 87.9MB in the beginning and 70.8MB in the end (delta: 17.1MB). Peak memory consumption was 132.7MB. Max. memory is 16.1GB. [2025-01-23 23:53:19,364 INFO L158 Benchmark]: CDTParser took 0.84ms. Allocated memory is still 117.4MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-23 23:53:19,364 INFO L158 Benchmark]: CACSL2BoogieTranslator took 425.67ms. Allocated memory is still 117.4MB. Free memory was 87.8MB in the beginning and 55.1MB in the end (delta: 32.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-23 23:53:19,364 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.90ms. Allocated memory is still 117.4MB. Free memory was 55.1MB in the beginning and 52.8MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-23 23:53:19,365 INFO L158 Benchmark]: Boogie Preprocessor took 19.78ms. Allocated memory is still 117.4MB. Free memory was 52.8MB in the beginning and 50.3MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-23 23:53:19,365 INFO L158 Benchmark]: RCFGBuilder took 594.17ms. Allocated memory is still 117.4MB. Free memory was 50.3MB in the beginning and 53.8MB in the end (delta: -3.5MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2025-01-23 23:53:19,365 INFO L158 Benchmark]: TraceAbstraction took 2453.92ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 53.3MB in the beginning and 84.9MB in the end (delta: -31.6MB). Peak memory consumption was 84.1MB. Max. memory is 16.1GB. [2025-01-23 23:53:19,366 INFO L158 Benchmark]: Witness Printer took 82.04ms. Allocated memory is still 234.9MB. Free memory was 84.9MB in the beginning and 70.8MB in the end (delta: 14.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-23 23:53:19,367 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.84ms. Allocated memory is still 117.4MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 425.67ms. Allocated memory is still 117.4MB. Free memory was 87.8MB in the beginning and 55.1MB in the end (delta: 32.7MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.90ms. Allocated memory is still 117.4MB. Free memory was 55.1MB in the beginning and 52.8MB in the end (delta: 2.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 19.78ms. Allocated memory is still 117.4MB. Free memory was 52.8MB in the beginning and 50.3MB in the end (delta: 2.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 594.17ms. Allocated memory is still 117.4MB. Free memory was 50.3MB in the beginning and 53.8MB in the end (delta: -3.5MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. * TraceAbstraction took 2453.92ms. Allocated memory was 117.4MB in the beginning and 234.9MB in the end (delta: 117.4MB). Free memory was 53.3MB in the beginning and 84.9MB in the end (delta: -31.6MB). Peak memory consumption was 84.1MB. Max. memory is 16.1GB. * Witness Printer took 82.04ms. Allocated memory is still 234.9MB. Free memory was 84.9MB in the beginning and 70.8MB in the end (delta: 14.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 511, independent: 467, independent conditional: 48, independent unconditional: 419, dependent: 44, dependent conditional: 32, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 479, independent: 467, independent conditional: 48, independent unconditional: 419, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 479, independent: 467, independent conditional: 48, independent unconditional: 419, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 479, independent: 467, independent conditional: 48, independent unconditional: 419, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 479, independent: 467, independent conditional: 0, independent unconditional: 467, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 479, independent: 467, independent conditional: 0, independent unconditional: 467, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 431, independent: 419, independent conditional: 0, independent unconditional: 419, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 431, independent: 415, independent conditional: 0, independent unconditional: 415, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 16, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 16, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 508, independent: 128, independent conditional: 0, independent unconditional: 128, dependent: 380, dependent conditional: 0, dependent unconditional: 380, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 479, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 431, unknown conditional: 0, unknown unconditional: 431] , Statistics on independence cache: Total cache size (in pairs): 431, Positive cache size: 419, Positive conditional cache size: 0, Positive unconditional cache size: 419, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 48, Maximal queried relation: 0, Independence queries for same thread: 32, Persistent sets #1 benchmarks: Persistent set computation time: 0.5s, Number of persistent set computation: 53, Number of trivial persistent sets: 53, Underlying independence relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 431, independent: 419, independent conditional: 0, independent unconditional: 419, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 511, independent: 467, independent conditional: 48, independent unconditional: 419, dependent: 44, dependent conditional: 32, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 479, independent: 467, independent conditional: 48, independent unconditional: 419, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: DisjunctiveConditionalIndependenceRelation.Independence Queries: [ total: 479, independent: 467, independent conditional: 48, independent unconditional: 419, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , DisjunctiveConditionalIndependenceRelation.Statistics on underlying relation: ConditionTransformingIndependenceRelation.Independence Queries: [ total: 479, independent: 467, independent conditional: 48, independent unconditional: 419, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ConditionTransformingIndependenceRelation.Statistics on underlying relation: SemanticConditionEliminator.Independence Queries: [ total: 479, independent: 467, independent conditional: 0, independent unconditional: 467, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticConditionEliminator.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 479, independent: 467, independent conditional: 0, independent unconditional: 467, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 431, independent: 419, independent conditional: 0, independent unconditional: 419, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 431, independent: 415, independent conditional: 0, independent unconditional: 415, dependent: 16, dependent conditional: 0, dependent unconditional: 16, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 16, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 16, independent: 4, independent conditional: 0, independent unconditional: 4, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 508, independent: 128, independent conditional: 0, independent unconditional: 128, dependent: 380, dependent conditional: 0, dependent unconditional: 380, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 479, independent: 48, independent conditional: 0, independent unconditional: 48, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 431, unknown conditional: 0, unknown unconditional: 431] , Statistics on independence cache: Total cache size (in pairs): 431, Positive cache size: 419, Positive conditional cache size: 0, Positive unconditional cache size: 419, Negative cache size: 12, Negative conditional cache size: 0, Negative unconditional cache size: 12, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Eliminated conditions: 48, Maximal queried relation: 0, Independence queries for same thread: 32 - 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) );}) [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] [L3910] EXPR 1 data->shared.b [L3910] 1 int lb = data->shared.b; [L3913] 1 data->shared.b = lb + 1 VAL [\at(arg, Pre)={6:24}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1=-1, t2=0] [L3916] 1 return 0; [L3930] FCALL, FORK 0 pthread_create(&t2, ((void *)0), my_callback, (void *)d) VAL [\at(arg, Pre)={6:24}, \at(data, Pre)={6:0}, \result={0:0}, arg={6:24}, d={6:24}, data={6:0}, data={6:0}, dev={6:24}, lb=0, res=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) );}) [L3907] 2 data->shared.a = 1 VAL [\at(arg, Pre)={6:24}, \result={0:0}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1=-1, t2=0] [L3910] EXPR 2 data->shared.b [L3910] 2 int lb = data->shared.b; [L3913] 2 data->shared.b = lb + 1 VAL [\at(arg, Pre)={6:24}, \result={0:0}, arg={6:24}, data={6:0}, dev={6:24}, lb=0, t1=-1, t2=0] [L3916] 2 return 0; [L3931] 0 return 0; VAL [\at(arg, Pre)={6:24}, \at(data, Pre)={6:0}, \result=0, \result={0:0}, arg={6:24}, d={6:24}, data={6:0}, data={6:0}, dev={6:24}, lb=0, res=0, t1=-1, t2=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}, \result={0:0}, arg={6:24}, data={6:0}, data={6:0}, dev={6:24}, lb=0, status={5:0}, t1=-1, t2=0] [L3940] 0 data->shared.a = 3 VAL [\at(arg, Pre)={6:24}, \at(data, Pre)={6:0}, \result={0:0}, arg={6:24}, data={6:0}, data={6:0}, dev={6:24}, lb=0, status={5:0}, t1=-1, t2=0] [L3943] 0 data->shared.b = 3 VAL [\at(arg, Pre)={6:24}, \at(data, Pre)={6:0}, \result={0:0}, arg={6:24}, data={6:0}, data={6:0}, dev={6:24}, lb=0, status={5:0}, t1=-1, t2=0] [L3946] EXPR 0 data->shared.a [L3946] CALL 0 ldv_assert(data->shared.a==3) [L3887] COND FALSE 0 !(!expression) [L3946] RET 0 ldv_assert(data->shared.a==3) [L3949] EXPR 0 data->shared.b [L3949] CALL 0 ldv_assert(data->shared.b==3) [L3887] COND FALSE 0 !(!expression) [L3949] RET 0 ldv_assert(data->shared.b==3) [L3951] FCALL, JOIN 1 pthread_join(t1, &status) VAL [\at(arg, Pre)={6:24}, \at(data, Pre)={6:0}, \result={0:0}, arg={6:24}, data={6:0}, data={6:0}, dev={6:24}, lb=0, status={5:0}, t1=-1, t2=0] [L3952] FCALL, JOIN 2 pthread_join(t2, &status) VAL [\at(arg, Pre)={6:24}, \at(data, Pre)={6:0}, \result={0:0}, arg={6:24}, data={6:0}, data={6:0}, dev={6:24}, lb=0, status={5:0}, t1=-1, t2=0] [L3968] RET 0 my_drv_disconnect(&data) [L3969] EXPR 0 data.shared.a [L3969] CALL 0 ldv_assert(data.shared.a==1) [L3887] COND TRUE 0 !expression VAL [\at(arg, Pre)={6:24}, \at(expression, Pre)=0, \result={0:0}, arg={6:24}, data={6:0}, dev={6:24}, expression=0, lb=0, t1=-1, t2=0] [L3887] 0 reach_error() VAL [\at(arg, Pre)={6:24}, \at(expression, Pre)=0, \result={0:0}, arg={6:24}, data={6:0}, dev={6: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: 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 for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 4 procedures, 67 locations, 8 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 6, TraceHistogramMax: 0, PathProgramHistogramMax: 1, EmptinessCheckTime: 1.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 17, 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, 118 NumberOfCodeBlocks, 118 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 78 ConstructedInterpolants, 0 QuantifiedInterpolants, 144 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 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: SuccessfulCommutativityProofs: 0, ConComChecker Statistics: CheckTime [ms]: 0, ConditionCalculationTime [ms]: 0, ConditionCalculations: 0, QuantifiedConditions: 0, TraceChecks: 0, UnknownTraceChecks: 0, UnsatisfiedConditions: 0, ImperfectProofs: 0 RESULT: Ultimate proved your program to be incorrect! [2025-01-23 23:53:19,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE